TSTP Solution File: SWC287+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC287+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 : n010.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:55 EDT 2022
% Result : Theorem 0.16s 0.52s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 219 ( 86 equ)
% Maximal formula atoms : 32 ( 8 avg)
% Number of connectives : 265 ( 71 ~; 70 |; 112 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 57 ( 25 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f630,plain,
$false,
inference(subsumption_resolution,[],[f625,f454]) ).
fof(f454,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f625,plain,
~ strictorderedP(nil),
inference(backward_demodulation,[],[f386,f623]) ).
fof(f623,plain,
nil = sK18,
inference(subsumption_resolution,[],[f621,f564]) ).
fof(f564,plain,
( ssItem(sK22)
| nil = sK18 ),
inference(definition_unfolding,[],[f392,f387]) ).
fof(f387,plain,
sK20 = sK18,
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ssList(sK18)
& ssList(sK19)
& ( ( memberP(sK21,sK22)
& ssItem(sK22)
& ! [X5] :
( sK22 = X5
| ~ leq(X5,sK22)
| ~ memberP(sK21,X5)
| ~ ssItem(X5) )
& cons(sK22,nil) = sK20 )
| ( nil = sK21
& nil = sK20 ) )
& sK20 = sK18
& ~ strictorderedP(sK18)
& sK19 = sK21
& ssList(sK21)
& ssList(sK20) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f118,f255,f254,f253,f252,f251]) ).
fof(f251,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& X0 = X2
& ~ strictorderedP(X0)
& X1 = X3
& ssList(X3) )
& ssList(X2) ) ) )
=> ( ssList(sK18)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& sK18 = X2
& ~ strictorderedP(sK18)
& X1 = X3
& ssList(X3) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& sK18 = X2
& ~ strictorderedP(sK18)
& X1 = X3
& ssList(X3) )
& ssList(X2) ) )
=> ( ssList(sK19)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& sK18 = X2
& ~ strictorderedP(sK18)
& sK19 = X3
& ssList(X3) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& sK18 = X2
& ~ strictorderedP(sK18)
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = sK20 )
| ( nil = X3
& nil = sK20 ) )
& sK20 = sK18
& ~ strictorderedP(sK18)
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = sK20 )
| ( nil = X3
& nil = sK20 ) )
& sK20 = sK18
& ~ strictorderedP(sK18)
& sK19 = X3
& ssList(X3) )
=> ( ( ? [X4] :
( memberP(sK21,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(sK21,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = sK20 )
| ( nil = sK21
& nil = sK20 ) )
& sK20 = sK18
& ~ strictorderedP(sK18)
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X4] :
( memberP(sK21,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(sK21,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = sK20 )
=> ( memberP(sK21,sK22)
& ssItem(sK22)
& ! [X5] :
( sK22 = X5
| ~ leq(X5,sK22)
| ~ memberP(sK21,X5)
| ~ ssItem(X5) )
& cons(sK22,nil) = sK20 ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ( ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( X4 = X5
| ~ leq(X5,X4)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& cons(X4,nil) = X2 )
| ( nil = X3
& nil = X2 ) )
& X0 = X2
& ~ strictorderedP(X0)
& X1 = X3
& ssList(X3) )
& ssList(X2) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X0 != X2
| X1 != X3
| ( ! [X4] :
( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X5,X4)
& memberP(X3,X5) )
| ~ ssItem(X4)
| cons(X4,nil) != X2 )
& ( nil != X3
| nil != X2 ) )
| strictorderedP(X0) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X0 != X2
| X1 != X3
| ( ! [X4] :
( ~ memberP(X3,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X5,X4)
& memberP(X3,X5) )
| ~ ssItem(X4)
| cons(X4,nil) != X2 )
& ( nil != X3
| nil != X2 ) )
| strictorderedP(X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f392,plain,
( ssItem(sK22)
| nil = sK20 ),
inference(cnf_transformation,[],[f256]) ).
fof(f621,plain,
( ~ ssItem(sK22)
| nil = sK18 ),
inference(resolution,[],[f348,f606]) ).
fof(f606,plain,
( ~ strictorderedP(cons(sK22,nil))
| nil = sK18 ),
inference(superposition,[],[f386,f567]) ).
fof(f567,plain,
( cons(sK22,nil) = sK18
| nil = sK18 ),
inference(definition_unfolding,[],[f388,f387,f387]) ).
fof(f388,plain,
( cons(sK22,nil) = sK20
| nil = sK20 ),
inference(cnf_transformation,[],[f256]) ).
fof(f348,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f386,plain,
~ strictorderedP(sK18),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SWC287+1 : TPTP v8.1.0. Released v2.4.0.
% 0.09/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.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 18:35:59 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.16/0.47 % (2277)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.16/0.48 % (2278)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.49 % (2285)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.16/0.49 % (2286)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.16/0.49 % (2287)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.16/0.49 % (2293)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.16/0.49 % (2279)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.49 % (2278)Instruction limit reached!
% 0.16/0.49 % (2278)------------------------------
% 0.16/0.49 % (2278)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (2279)Instruction limit reached!
% 0.16/0.49 % (2279)------------------------------
% 0.16/0.49 % (2279)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (2279)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.49 % (2279)Termination reason: Unknown
% 0.16/0.49 % (2279)Termination phase: Preprocessing 2
% 0.16/0.49
% 0.16/0.49 % (2279)Memory used [KB]: 1023
% 0.16/0.49 % (2279)Time elapsed: 0.003 s
% 0.16/0.49 % (2279)Instructions burned: 3 (million)
% 0.16/0.49 % (2279)------------------------------
% 0.16/0.49 % (2279)------------------------------
% 0.16/0.50 % (2294)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.16/0.50 % (2295)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.16/0.50 % (2275)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.16/0.50 % (2278)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.50 % (2278)Termination reason: Unknown
% 0.16/0.50 % (2278)Termination phase: Equality resolution with deletion
% 0.16/0.50
% 0.16/0.50 % (2278)Memory used [KB]: 1279
% 0.16/0.50 % (2278)Time elapsed: 0.008 s
% 0.16/0.50 % (2278)Instructions burned: 8 (million)
% 0.16/0.50 % (2278)------------------------------
% 0.16/0.50 % (2278)------------------------------
% 0.16/0.51 % (2274)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.16/0.52 % (2293)First to succeed.
% 0.16/0.52 % (2293)Refutation found. Thanks to Tanya!
% 0.16/0.52 % SZS status Theorem for theBenchmark
% 0.16/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.52 % (2293)------------------------------
% 0.16/0.52 % (2293)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.52 % (2293)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.52 % (2293)Termination reason: Refutation
% 0.16/0.52
% 0.16/0.52 % (2293)Memory used [KB]: 1407
% 0.16/0.52 % (2293)Time elapsed: 0.126 s
% 0.16/0.52 % (2293)Instructions burned: 13 (million)
% 0.16/0.52 % (2293)------------------------------
% 0.16/0.52 % (2293)------------------------------
% 0.16/0.52 % (2270)Success in time 0.189 s
%------------------------------------------------------------------------------