TSTP Solution File: SWC293+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC293+1 : TPTP v8.1.0. Released v2.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 : n001.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:42:56 EDT 2022
% Result : Theorem 1.44s 0.53s
% Output : Refutation 1.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 171 ( 77 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 176 ( 34 ~; 36 |; 94 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 43 ( 13 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f652,plain,
$false,
inference(subsumption_resolution,[],[f645,f376]) ).
fof(f376,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f645,plain,
~ strictorderedP(nil),
inference(backward_demodulation,[],[f536,f643]) ).
fof(f643,plain,
nil = sK50,
inference(subsumption_resolution,[],[f642,f604]) ).
fof(f604,plain,
( ssItem(sK54)
| nil = sK50 ),
inference(forward_demodulation,[],[f529,f534]) ).
fof(f534,plain,
sK52 = sK50,
inference(cnf_transformation,[],[f332]) ).
fof(f332,plain,
( ssList(sK50)
& ~ strictorderedP(sK50)
& ssList(sK53)
& sK52 = sK50
& sK51 = sK53
& ( ( memberP(sK53,sK54)
& ssItem(sK54)
& sK52 = cons(sK54,nil) )
| ( nil = sK53
& nil = sK52 ) )
& ssList(sK52)
& ssList(sK51) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK50,sK51,sK52,sK53,sK54])],[f215,f331,f330,f329,f328,f327]) ).
fof(f327,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(X0)
& ssList(X3)
& X0 = X2
& X1 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK50)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK50)
& ssList(X3)
& sK50 = X2
& X1 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f328,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK50)
& ssList(X3)
& sK50 = X2
& X1 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK50)
& ssList(X3)
& sK50 = X2
& sK51 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(sK51) ) ),
introduced(choice_axiom,[]) ).
fof(f329,plain,
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(sK50)
& ssList(X3)
& sK50 = X2
& sK51 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( ~ strictorderedP(sK50)
& ssList(X3)
& sK52 = sK50
& sK51 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = sK52 )
| ( nil = X3
& nil = sK52 ) ) )
& ssList(sK52) ) ),
introduced(choice_axiom,[]) ).
fof(f330,plain,
( ? [X3] :
( ~ strictorderedP(sK50)
& ssList(X3)
& sK52 = sK50
& sK51 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = sK52 )
| ( nil = X3
& nil = sK52 ) ) )
=> ( ~ strictorderedP(sK50)
& ssList(sK53)
& sK52 = sK50
& sK51 = sK53
& ( ? [X4] :
( memberP(sK53,X4)
& ssItem(X4)
& cons(X4,nil) = sK52 )
| ( nil = sK53
& nil = sK52 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f331,plain,
( ? [X4] :
( memberP(sK53,X4)
& ssItem(X4)
& cons(X4,nil) = sK52 )
=> ( memberP(sK53,sK54)
& ssItem(sK54)
& sK52 = cons(sK54,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f215,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(X0)
& ssList(X3)
& X0 = X2
& X1 = X3
& ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| ( ! [X4] :
( ~ ssItem(X4)
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 )
& ( nil != X3
| nil != X2 ) )
| strictorderedP(X0)
| X0 != X2 ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| ( ! [X4] :
( ~ ssItem(X4)
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 )
& ( nil != X3
| nil != X2 ) )
| strictorderedP(X0)
| X0 != X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f529,plain,
( ssItem(sK54)
| nil = sK52 ),
inference(cnf_transformation,[],[f332]) ).
fof(f642,plain,
( ~ ssItem(sK54)
| nil = sK50 ),
inference(subsumption_resolution,[],[f635,f536]) ).
fof(f635,plain,
( nil = sK50
| strictorderedP(sK50)
| ~ ssItem(sK54) ),
inference(superposition,[],[f634,f610]) ).
fof(f610,plain,
( sK50 = sF58
| nil = sK50 ),
inference(forward_demodulation,[],[f609,f534]) ).
fof(f609,plain,
( nil = sK50
| sK52 = sF58 ),
inference(forward_demodulation,[],[f589,f534]) ).
fof(f589,plain,
( nil = sK52
| sK52 = sF58 ),
inference(definition_folding,[],[f527,f587]) ).
fof(f587,plain,
sF58 = cons(sK54,nil),
introduced(function_definition,[]) ).
fof(f527,plain,
( sK52 = cons(sK54,nil)
| nil = sK52 ),
inference(cnf_transformation,[],[f332]) ).
fof(f634,plain,
( strictorderedP(sF58)
| ~ ssItem(sK54) ),
inference(superposition,[],[f500,f587]) ).
fof(f500,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f536,plain,
~ strictorderedP(sK50),
inference(cnf_transformation,[],[f332]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC293+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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.14/0.33 % Computer : n001.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue Aug 30 19:05:47 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (15279)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.20/0.49 % (15268)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.20/0.49 % (15263)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.49 % (15260)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (15271)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50 % (15276)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.51 % (15260)Instruction limit reached!
% 0.20/0.51 % (15260)------------------------------
% 0.20/0.51 % (15260)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (15260)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (15260)Termination reason: Unknown
% 0.20/0.51 % (15260)Termination phase: shuffling
% 0.20/0.51
% 0.20/0.51 % (15260)Memory used [KB]: 1279
% 0.20/0.51 % (15260)Time elapsed: 0.008 s
% 0.20/0.51 % (15260)Instructions burned: 8 (million)
% 0.20/0.51 % (15260)------------------------------
% 0.20/0.51 % (15260)------------------------------
% 0.20/0.51 % (15254)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.52 % (15281)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.52 % (15255)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)
% 0.20/0.52 % (15277)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.52 % (15257)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (15282)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.52 % (15253)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)
% 0.20/0.52 % (15256)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (15275)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.52 % (15278)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.52 % (15268)First to succeed.
% 0.20/0.53 % (15258)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.53 % (15270)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.53 % (15273)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.44/0.53 % (15275)Also succeeded, but the first one will report.
% 1.44/0.53 % (15268)Refutation found. Thanks to Tanya!
% 1.44/0.53 % SZS status Theorem for theBenchmark
% 1.44/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.44/0.53 % (15268)------------------------------
% 1.44/0.53 % (15268)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.44/0.53 % (15268)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.44/0.53 % (15268)Termination reason: Refutation
% 1.44/0.53
% 1.44/0.53 % (15268)Memory used [KB]: 1535
% 1.44/0.53 % (15268)Time elapsed: 0.128 s
% 1.44/0.53 % (15268)Instructions burned: 19 (million)
% 1.44/0.53 % (15268)------------------------------
% 1.44/0.53 % (15268)------------------------------
% 1.44/0.53 % (15252)Success in time 0.186 s
%------------------------------------------------------------------------------