## TSTP Solution File: SEU163+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SEU163+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:32:15 EDT 2022

% Result   : Theorem 0.20s 0.56s
% Output   : Refutation 0.20s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   24 (  11   ~;   2   |;   5   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   20 (  14   !;   6   ?)

%------------------------------------------------------------------------------
fof(f24,plain,
\$false,
inference(subsumption_resolution,[],[f23,f17]) ).

fof(f17,plain,
in(sK0,sK1),
inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
( ~ subset(sK0,union(sK1))
& in(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f13,f14]) ).

fof(f14,plain,
( ? [X0,X1] :
( ~ subset(X0,union(X1))
& in(X0,X1) )
=> ( ~ subset(sK0,union(sK1))
& in(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).

fof(f13,plain,
? [X0,X1] :
( ~ subset(X0,union(X1))
& in(X0,X1) ),
inference(rectify,[],[f11]) ).

fof(f11,plain,
? [X1,X0] :
( ~ subset(X1,union(X0))
& in(X1,X0) ),
inference(ennf_transformation,[],[f7]) ).

fof(f7,plain,
~ ! [X0,X1] :
( in(X1,X0)
=> subset(X1,union(X0)) ),
inference(rectify,[],[f5]) ).

fof(f5,negated_conjecture,
~ ! [X1,X0] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
inference(negated_conjecture,[],[f4]) ).

fof(f4,conjecture,
! [X1,X0] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t92_zfmisc_1) ).

fof(f23,plain,
~ in(sK0,sK1),
inference(resolution,[],[f19,f18]) ).

fof(f18,plain,
~ subset(sK0,union(sK1)),
inference(cnf_transformation,[],[f15]) ).

fof(f19,plain,
! [X0,X1] :
( subset(X1,union(X0))
| ~ in(X1,X0) ),
inference(cnf_transformation,[],[f12]) ).

fof(f12,plain,
! [X0,X1] :
( subset(X1,union(X0))
| ~ in(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).

fof(f9,plain,
! [X1,X0] :
( in(X1,X0)
=> subset(X1,union(X0)) ),
inference(rectify,[],[f6]) ).

fof(f6,axiom,
! [X1,X0] :
( in(X0,X1)
=> subset(X0,union(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l50_zfmisc_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SEU163+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 14:46:34 EDT 2022
% 0.13/0.35  % CPUTime    :
% 0.20/0.55  % (4459)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.20/0.55  % (4483)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.55  % (4485)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/439Mi)
% 0.20/0.55  % (4459)First to succeed.
% 0.20/0.56  % (4475)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.56  % (4459)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Theorem for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (4459)------------------------------
% 0.20/0.56  % (4459)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (4459)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (4459)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56  % (4459)Memory used [KB]: 895
% 0.20/0.56  % (4459)Time elapsed: 0.141 s
% 0.20/0.56  % (4459)Instructions burned: 1 (million)
% 0.20/0.56  % (4459)------------------------------
% 0.20/0.56  % (4459)------------------------------
% 0.20/0.56  % (4456)Success in time 0.202 s
%------------------------------------------------------------------------------
```