TSTP Solution File: SET073+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SET073+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n012.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:18:56 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 59 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 61 ( 22 ~; 18 |; 16 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 26 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f145,plain,
$false,
inference(subsumption_resolution,[],[f144,f103]) ).
fof(f103,plain,
member(sK2,universal_class),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
( member(sK2,universal_class)
& null_class = unordered_pair(sK2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f73,f74]) ).
fof(f74,plain,
( ? [X0,X1] :
( member(X1,universal_class)
& null_class = unordered_pair(X1,X0) )
=> ( member(sK2,universal_class)
& null_class = unordered_pair(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
? [X0,X1] :
( member(X1,universal_class)
& null_class = unordered_pair(X1,X0) ),
inference(rectify,[],[f55]) ).
fof(f55,plain,
? [X1,X0] :
( member(X0,universal_class)
& unordered_pair(X0,X1) = null_class ),
inference(ennf_transformation,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X1,X0] :
( member(X0,universal_class)
=> unordered_pair(X0,X1) != null_class ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X1,X0] :
( member(X0,universal_class)
=> unordered_pair(X0,X1) != null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',corollary1_1) ).
fof(f144,plain,
~ member(sK2,universal_class),
inference(subsumption_resolution,[],[f143,f85]) ).
fof(f85,plain,
! [X0] : ~ member(X0,null_class),
inference(cnf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] : ~ member(X0,null_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',null_class_defn) ).
fof(f143,plain,
( member(sK2,null_class)
| ~ member(sK2,universal_class) ),
inference(superposition,[],[f124,f102]) ).
fof(f102,plain,
null_class = unordered_pair(sK2,sK1),
inference(cnf_transformation,[],[f75]) ).
fof(f124,plain,
! [X2,X1] :
( member(X2,unordered_pair(X2,X1))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f98]) ).
fof(f98,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X2,X1))
| ~ member(X0,universal_class)
| X0 != X2 ),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( ( member(X0,universal_class)
& ( X0 = X1
| X0 = X2 ) )
| ~ member(X0,unordered_pair(X2,X1)) )
& ( member(X0,unordered_pair(X2,X1))
| ~ member(X0,universal_class)
| ( X0 != X1
& X0 != X2 ) ) ),
inference(rectify,[],[f71]) ).
fof(f71,plain,
! [X2,X0,X1] :
( ( ( member(X2,universal_class)
& ( X0 = X2
| X1 = X2 ) )
| ~ member(X2,unordered_pair(X1,X0)) )
& ( member(X2,unordered_pair(X1,X0))
| ~ member(X2,universal_class)
| ( X0 != X2
& X1 != X2 ) ) ),
inference(flattening,[],[f70]) ).
fof(f70,plain,
! [X2,X0,X1] :
( ( ( member(X2,universal_class)
& ( X0 = X2
| X1 = X2 ) )
| ~ member(X2,unordered_pair(X1,X0)) )
& ( member(X2,unordered_pair(X1,X0))
| ~ member(X2,universal_class)
| ( X0 != X2
& X1 != X2 ) ) ),
inference(nnf_transformation,[],[f48]) ).
fof(f48,plain,
! [X2,X0,X1] :
( ( member(X2,universal_class)
& ( X0 = X2
| X1 = X2 ) )
<=> member(X2,unordered_pair(X1,X0)) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2] :
( ( member(X2,universal_class)
& ( X1 = X2
| X0 = X2 ) )
<=> member(X2,unordered_pair(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET073+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 13:07:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.47 % (29849)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.48 % (29858)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.48 % (29858)First to succeed.
% 0.19/0.49 % (29858)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (29858)------------------------------
% 0.19/0.49 % (29858)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (29858)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (29858)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (29858)Memory used [KB]: 6012
% 0.19/0.49 % (29858)Time elapsed: 0.091 s
% 0.19/0.49 % (29858)Instructions burned: 3 (million)
% 0.19/0.49 % (29858)------------------------------
% 0.19/0.49 % (29858)------------------------------
% 0.19/0.49 % (29836)Success in time 0.153 s
%------------------------------------------------------------------------------