TSTP Solution File: SET102+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET102+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_sat --cores 0 -t %d %s
% Computer : n016.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:23:43 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 20 unt; 0 def)
% Number of atoms : 61 ( 24 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 57 ( 25 ~; 18 |; 11 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 46 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f352,plain,
$false,
inference(subsumption_resolution,[],[f351,f332]) ).
fof(f332,plain,
! [X0,X1] : ~ member(unordered_pair(X0,X1),universal_class),
inference(consistent_polarity_flipping,[],[f199]) ).
fof(f199,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair) ).
fof(f351,plain,
member(unordered_pair(sK2,unordered_pair(sK1,sK1)),universal_class),
inference(resolution,[],[f317,f341]) ).
fof(f341,plain,
member(unordered_pair(sK2,unordered_pair(sK1,sK1)),unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,unordered_pair(sK1,sK1)))),
inference(consistent_polarity_flipping,[],[f250]) ).
fof(f250,plain,
~ member(unordered_pair(sK2,unordered_pair(sK1,sK1)),unordered_pair(unordered_pair(sK2,sK2),unordered_pair(sK2,unordered_pair(sK1,sK1)))),
inference(definition_unfolding,[],[f169,f179,f242]) ).
fof(f242,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X0),unordered_pair(X0,unordered_pair(X1,X1))),
inference(definition_unfolding,[],[f163,f179,f179]) ).
fof(f163,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[],[f94]) ).
fof(f94,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(rectify,[],[f70]) ).
fof(f70,plain,
! [X1,X0] : unordered_pair(singleton(X1),unordered_pair(X1,singleton(X0))) = ordered_pair(X1,X0),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordered_pair_defn) ).
fof(f179,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f169,plain,
~ member(unordered_pair(sK2,singleton(sK1)),ordered_pair(sK2,sK1)),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
~ member(unordered_pair(sK2,singleton(sK1)),ordered_pair(sK2,sK1)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f82,f97]) ).
fof(f97,plain,
( ? [X0,X1] : ~ member(unordered_pair(X1,singleton(X0)),ordered_pair(X1,X0))
=> ~ member(unordered_pair(sK2,singleton(sK1)),ordered_pair(sK2,sK1)) ),
introduced(choice_axiom,[]) ).
fof(f82,plain,
? [X0,X1] : ~ member(unordered_pair(X1,singleton(X0)),ordered_pair(X1,X0)),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
~ ! [X1,X0] : member(unordered_pair(X1,singleton(X0)),ordered_pair(X1,X0)),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X1,X0] : member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X1,X0] : member(unordered_pair(X0,singleton(X1)),ordered_pair(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_member_of_ordered_pair) ).
fof(f317,plain,
! [X2,X1] :
( ~ member(X1,unordered_pair(X2,X1))
| member(X1,universal_class) ),
inference(consistent_polarity_flipping,[],[f284]) ).
fof(f284,plain,
! [X2,X1] :
( ~ member(X1,universal_class)
| member(X1,unordered_pair(X2,X1)) ),
inference(equality_resolution,[],[f225]) ).
fof(f225,plain,
! [X2,X0,X1] :
( member(X0,unordered_pair(X2,X1))
| X0 != X1
| ~ member(X0,universal_class) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0,X1,X2] :
( ( member(X0,unordered_pair(X2,X1))
| ( X0 != X1
& X0 != X2 )
| ~ member(X0,universal_class) )
& ( ( ( X0 = X1
| X0 = X2 )
& member(X0,universal_class) )
| ~ member(X0,unordered_pair(X2,X1)) ) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
! [X1,X2,X0] :
( ( member(X1,unordered_pair(X0,X2))
| ( X1 != X2
& X0 != X1 )
| ~ member(X1,universal_class) )
& ( ( ( X1 = X2
| X0 = X1 )
& member(X1,universal_class) )
| ~ member(X1,unordered_pair(X0,X2)) ) ),
inference(flattening,[],[f141]) ).
fof(f141,plain,
! [X1,X2,X0] :
( ( member(X1,unordered_pair(X0,X2))
| ( X1 != X2
& X0 != X1 )
| ~ member(X1,universal_class) )
& ( ( ( X1 = X2
| X0 = X1 )
& member(X1,universal_class) )
| ~ member(X1,unordered_pair(X0,X2)) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X1,X2,X0] :
( member(X1,unordered_pair(X0,X2))
<=> ( ( X1 = X2
| X0 = X1 )
& member(X1,universal_class) ) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X0,X2,X1] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unordered_pair_defn) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET102+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n016.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 16:00:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 % (13513)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.46 % (13525)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.46 % (13525)First to succeed.
% 0.19/0.47 % (13513)Instruction limit reached!
% 0.19/0.47 % (13513)------------------------------
% 0.19/0.47 % (13513)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (13525)Refutation found. Thanks to Tanya!
% 0.19/0.47 % SZS status Theorem for theBenchmark
% 0.19/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47 % (13525)------------------------------
% 0.19/0.47 % (13525)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47 % (13525)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47 % (13525)Termination reason: Refutation
% 0.19/0.47
% 0.19/0.47 % (13525)Memory used [KB]: 1151
% 0.19/0.47 % (13525)Time elapsed: 0.074 s
% 0.19/0.47 % (13525)Instructions burned: 7 (million)
% 0.19/0.47 % (13525)------------------------------
% 0.19/0.47 % (13525)------------------------------
% 0.19/0.47 % (13505)Success in time 0.128 s
%------------------------------------------------------------------------------