TSTP Solution File: SET083+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SET083+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:35 EDT 2022
% Result : Theorem 1.80s 0.59s
% Output : Refutation 1.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 12 unt; 3 typ; 0 def)
% Number of atoms : 82 ( 46 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 81 ( 29 ~; 24 |; 23 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 36 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_7,type,
sQ9_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_8,type,
sQ10_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_9,type,
sQ11_eqProxy: ( $real * $real ) > $o ).
fof(f671,plain,
$false,
inference(subsumption_resolution,[],[f669,f342]) ).
fof(f342,plain,
sK3 != sK2,
inference(literal_reordering,[],[f158]) ).
fof(f158,plain,
sK3 != sK2,
inference(cnf_transformation,[],[f97]) ).
fof(f97,plain,
( member(sK3,universal_class)
& sK3 != sK2
& singleton(sK2) = singleton(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f85,f96]) ).
fof(f96,plain,
( ? [X0,X1] :
( member(X1,universal_class)
& X0 != X1
& singleton(X0) = singleton(X1) )
=> ( member(sK3,universal_class)
& sK3 != sK2
& singleton(sK2) = singleton(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
? [X0,X1] :
( member(X1,universal_class)
& X0 != X1
& singleton(X0) = singleton(X1) ),
inference(flattening,[],[f84]) ).
fof(f84,plain,
? [X0,X1] :
( X0 != X1
& singleton(X0) = singleton(X1)
& member(X1,universal_class) ),
inference(ennf_transformation,[],[f73]) ).
fof(f73,plain,
~ ! [X0,X1] :
( ( singleton(X0) = singleton(X1)
& member(X1,universal_class) )
=> X0 = X1 ),
inference(rectify,[],[f45]) ).
fof(f45,negated_conjecture,
~ ! [X1,X0] :
( ( singleton(X0) = singleton(X1)
& member(X0,universal_class) )
=> X0 = X1 ),
inference(negated_conjecture,[],[f44]) ).
fof(f44,conjecture,
! [X1,X0] :
( ( singleton(X0) = singleton(X1)
& member(X0,universal_class) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_identified_by_element1) ).
fof(f669,plain,
sK3 = sK2,
inference(resolution,[],[f554,f463]) ).
fof(f463,plain,
! [X7] : member(sK3,unordered_pair(X7,sK3)),
inference(resolution,[],[f344,f296]) ).
fof(f296,plain,
member(sK3,universal_class),
inference(literal_reordering,[],[f159]) ).
fof(f159,plain,
member(sK3,universal_class),
inference(cnf_transformation,[],[f97]) ).
fof(f344,plain,
! [X2,X1] :
( ~ member(X2,universal_class)
| member(X2,unordered_pair(X1,X2)) ),
inference(literal_reordering,[],[f282]) ).
fof(f282,plain,
! [X2,X1] :
( member(X2,unordered_pair(X1,X2))
| ~ member(X2,universal_class) ),
inference(equality_resolution,[],[f225]) ).
fof(f225,plain,
! [X2,X0,X1] :
( member(X2,unordered_pair(X1,X0))
| X0 != X2
| ~ member(X2,universal_class) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0,X1,X2] :
( ( member(X2,unordered_pair(X1,X0))
| ( X1 != X2
& X0 != X2 )
| ~ member(X2,universal_class) )
& ( ( ( X1 = X2
| X0 = X2 )
& member(X2,universal_class) )
| ~ member(X2,unordered_pair(X1,X0)) ) ),
inference(rectify,[],[f136]) ).
fof(f136,plain,
! [X1,X0,X2] :
( ( member(X2,unordered_pair(X0,X1))
| ( X0 != X2
& X1 != X2 )
| ~ member(X2,universal_class) )
& ( ( ( X0 = X2
| X1 = X2 )
& member(X2,universal_class) )
| ~ member(X2,unordered_pair(X0,X1)) ) ),
inference(flattening,[],[f135]) ).
fof(f135,plain,
! [X1,X0,X2] :
( ( member(X2,unordered_pair(X0,X1))
| ( X0 != X2
& X1 != X2 )
| ~ member(X2,universal_class) )
& ( ( ( X0 = X2
| X1 = X2 )
& member(X2,universal_class) )
| ~ member(X2,unordered_pair(X0,X1)) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X1,X0,X2] :
( member(X2,unordered_pair(X0,X1))
<=> ( ( X0 = X2
| X1 = X2 )
& member(X2,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unordered_pair_defn) ).
fof(f554,plain,
! [X0] :
( ~ member(X0,unordered_pair(sK3,sK3))
| sK2 = X0 ),
inference(duplicate_literal_removal,[],[f553]) ).
fof(f553,plain,
! [X0] :
( sK2 = X0
| ~ member(X0,unordered_pair(sK3,sK3))
| sK2 = X0 ),
inference(superposition,[],[f333,f359]) ).
fof(f359,plain,
unordered_pair(sK3,sK3) = unordered_pair(sK2,sK2),
inference(literal_reordering,[],[f248]) ).
fof(f248,plain,
unordered_pair(sK3,sK3) = unordered_pair(sK2,sK2),
inference(definition_unfolding,[],[f157,f161,f161]) ).
fof(f161,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/sandbox/benchmark/theBenchmark.p',singleton_set_defn) ).
fof(f157,plain,
singleton(sK2) = singleton(sK3),
inference(cnf_transformation,[],[f97]) ).
fof(f333,plain,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X1,X0))
| X0 = X2
| X1 = X2 ),
inference(literal_reordering,[],[f224]) ).
fof(f224,plain,
! [X2,X0,X1] :
( ~ member(X2,unordered_pair(X1,X0))
| X0 = X2
| X1 = X2 ),
inference(cnf_transformation,[],[f137]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET083+1 : TPTP v8.1.0. Bugfixed v5.4.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.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 13:34:01 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.53 % (1336)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 (2999ds/68Mi)
% 0.19/0.54 % (1349)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.54 % (1328)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.55 % (1337)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.56 % (1329)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.46/0.56 % (1348)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 (2999ds/68Mi)
% 1.46/0.57 % (1335)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.46/0.57 % (1329)Instruction limit reached!
% 1.46/0.57 % (1329)------------------------------
% 1.46/0.57 % (1329)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.46/0.57 % (1329)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.46/0.57 % (1329)Termination reason: Unknown
% 1.46/0.57 % (1329)Termination phase: Saturation
% 1.46/0.57
% 1.46/0.57 % (1329)Memory used [KB]: 5628
% 1.46/0.57 % (1329)Time elapsed: 0.096 s
% 1.46/0.57 % (1329)Instructions burned: 7 (million)
% 1.46/0.57 % (1329)------------------------------
% 1.46/0.57 % (1329)------------------------------
% 1.46/0.57 % (1333)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.46/0.58 % (1336)First to succeed.
% 1.80/0.58 % (1323)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 (2999ds/37Mi)
% 1.80/0.59 % (1321)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 1.80/0.59 % (1336)Refutation found. Thanks to Tanya!
% 1.80/0.59 % SZS status Theorem for theBenchmark
% 1.80/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.80/0.59 % (1336)------------------------------
% 1.80/0.59 % (1336)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.80/0.59 % (1336)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.80/0.59 % (1336)Termination reason: Refutation
% 1.80/0.59
% 1.80/0.59 % (1336)Memory used [KB]: 6268
% 1.80/0.59 % (1336)Time elapsed: 0.022 s
% 1.80/0.59 % (1336)Instructions burned: 22 (million)
% 1.80/0.59 % (1336)------------------------------
% 1.80/0.59 % (1336)------------------------------
% 1.80/0.59 % (1320)Success in time 0.236 s
%------------------------------------------------------------------------------