TSTP Solution File: SWC043+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC043+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 : n002.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:41:21 EDT 2022
% Result : Theorem 1.34s 0.54s
% Output : Refutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 333 ( 163 equ)
% Maximal formula atoms : 40 ( 9 avg)
% Number of connectives : 456 ( 158 ~; 133 |; 146 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 10 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 121 ( 78 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f673,plain,
$false,
inference(unit_resulting_resolution,[],[f529,f530,f603,f669,f613]) ).
fof(f613,plain,
! [X0,X1] :
( app(X0,X1) != sK55
| ~ ssList(X1)
| ~ ssList(X0)
| sK55 = X0 ),
inference(definition_unfolding,[],[f541,f561,f561]) ).
fof(f561,plain,
nil = sK55,
inference(definition_unfolding,[],[f524,f527]) ).
fof(f527,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f340]) ).
fof(f340,plain,
( ssList(sK52)
& ssList(sK55)
& ( nil != sK54
| nil = sK55 )
& sK53 = sK55
& nil != sK52
& sK54 = sK52
& nil = sK53
& ssList(sK56)
& sK55 = app(sK54,sK56)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK56
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK54 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(sK54)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK52,sK53,sK54,sK55,sK56])],[f140,f339,f338,f337,f336,f335]) ).
fof(f335,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& X1 = X3
& nil != X0
& X0 = X2
& nil = X1
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(X2) ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK52)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& X1 = X3
& nil != sK52
& sK52 = X2
& nil = X1
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(X2) ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f336,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& X1 = X3
& nil != sK52
& sK52 = X2
& nil = X1
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(X2) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& sK53 = X3
& nil != sK52
& sK52 = X2
& nil = sK53
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(X2) ) )
& ssList(X2) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f337,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& sK53 = X3
& nil != sK52
& sK52 = X2
& nil = sK53
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(X2) ) )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& ( nil != sK54
| nil = X3 )
& sK53 = X3
& nil != sK52
& sK54 = sK52
& nil = sK53
& ? [X4] :
( ssList(X4)
& app(sK54,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK54 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(sK54) ) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f338,plain,
( ? [X3] :
( ssList(X3)
& ( nil != sK54
| nil = X3 )
& sK53 = X3
& nil != sK52
& sK54 = sK52
& nil = sK53
& ? [X4] :
( ssList(X4)
& app(sK54,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK54 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(sK54) ) )
=> ( ssList(sK55)
& ( nil != sK54
| nil = sK55 )
& sK53 = sK55
& nil != sK52
& sK54 = sK52
& nil = sK53
& ? [X4] :
( ssList(X4)
& sK55 = app(sK54,X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK54 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(sK54) ) ) ),
introduced(choice_axiom,[]) ).
fof(f339,plain,
( ? [X4] :
( ssList(X4)
& sK55 = app(sK54,X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK54 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(sK54) )
=> ( ssList(sK56)
& sK55 = app(sK54,sK56)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK56
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK54 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& ( nil != X2
| nil = X3 )
& X1 = X3
& nil != X0
& X0 = X2
& nil = X1
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& strictorderedP(X2) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f139]) ).
fof(f139,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& nil = X1
& nil != X0
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ~ ssList(X6)
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& ssList(X4) )
& ( nil != X2
| nil = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| nil != X1
| nil = X0
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& lt(X7,X5)
& app(X8,cons(X7,nil)) = X2 ) )
& app(cons(X5,nil),X6) = X4 ) ) ) )
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| nil != X1
| nil = X0
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& lt(X7,X5)
& app(X8,cons(X7,nil)) = X2 ) )
& app(cons(X5,nil),X6) = X4 ) ) ) )
| ( nil = X2
& nil != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f524,plain,
nil = sK53,
inference(cnf_transformation,[],[f340]) ).
fof(f541,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X0
| nil != app(X0,X1) ),
inference(cnf_transformation,[],[f342]) ).
fof(f342,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X1
| nil != X0 ) ) ) ),
inference(flattening,[],[f341]) ).
fof(f341,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X1
| nil != X0 ) ) ) ),
inference(nnf_transformation,[],[f190]) ).
fof(f190,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = X1
& nil = X0 )
<=> nil = app(X0,X1) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( nil = X1
& nil = X0 )
<=> nil = app(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f669,plain,
sK55 = app(sK52,sK55),
inference(backward_demodulation,[],[f604,f667]) ).
fof(f667,plain,
sK55 = sK56,
inference(subsumption_resolution,[],[f666,f530]) ).
fof(f666,plain,
( ~ ssList(sK52)
| sK55 = sK56 ),
inference(subsumption_resolution,[],[f665,f523]) ).
fof(f523,plain,
ssList(sK56),
inference(cnf_transformation,[],[f340]) ).
fof(f665,plain,
( ~ ssList(sK56)
| ~ ssList(sK52)
| sK55 = sK56 ),
inference(trivial_inequality_removal,[],[f664]) ).
fof(f664,plain,
( ~ ssList(sK56)
| sK55 != sK55
| ~ ssList(sK52)
| sK55 = sK56 ),
inference(superposition,[],[f612,f604]) ).
fof(f612,plain,
! [X0,X1] :
( app(X0,X1) != sK55
| ~ ssList(X1)
| sK55 = X1
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f542,f561,f561]) ).
fof(f542,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil = X1
| nil != app(X0,X1) ),
inference(cnf_transformation,[],[f342]) ).
fof(f604,plain,
app(sK52,sK56) = sK55,
inference(definition_unfolding,[],[f522,f525]) ).
fof(f525,plain,
sK54 = sK52,
inference(cnf_transformation,[],[f340]) ).
fof(f522,plain,
sK55 = app(sK54,sK56),
inference(cnf_transformation,[],[f340]) ).
fof(f603,plain,
sK55 != sK52,
inference(definition_unfolding,[],[f526,f561]) ).
fof(f526,plain,
nil != sK52,
inference(cnf_transformation,[],[f340]) ).
fof(f530,plain,
ssList(sK52),
inference(cnf_transformation,[],[f340]) ).
fof(f529,plain,
ssList(sK55),
inference(cnf_transformation,[],[f340]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC043+1 : TPTP v8.1.0. Released v2.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 : n002.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 18:24:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (18265)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.50 % (18266)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.50 % (18260)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (18269)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.19/0.50 % (18261)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.51 % (18257)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.51 % (18248)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.19/0.51 % (18256)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51 % (18247)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.19/0.51 % (18254)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.52 % (18268)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.19/0.52 % (18248)First to succeed.
% 0.19/0.52 % (18253)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.52 % (18254)Instruction limit reached!
% 0.19/0.52 % (18254)------------------------------
% 0.19/0.52 % (18254)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (18254)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (18254)Termination reason: Unknown
% 0.19/0.52 % (18254)Termination phase: Function definition elimination
% 0.19/0.52
% 0.19/0.52 % (18254)Memory used [KB]: 1279
% 0.19/0.52 % (18254)Time elapsed: 0.009 s
% 0.19/0.52 % (18254)Instructions burned: 8 (million)
% 0.19/0.52 % (18254)------------------------------
% 0.19/0.52 % (18254)------------------------------
% 0.19/0.52 % (18258)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)
% 0.19/0.53 % (18249)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.34/0.53 % (18261)Also succeeded, but the first one will report.
% 1.34/0.53 % (18271)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.34/0.54 % (18248)Refutation found. Thanks to Tanya!
% 1.34/0.54 % SZS status Theorem for theBenchmark
% 1.34/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.34/0.54 % (18248)------------------------------
% 1.34/0.54 % (18248)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.34/0.54 % (18248)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.34/0.54 % (18248)Termination reason: Refutation
% 1.34/0.54
% 1.34/0.54 % (18248)Memory used [KB]: 6012
% 1.34/0.54 % (18248)Time elapsed: 0.113 s
% 1.34/0.54 % (18248)Instructions burned: 17 (million)
% 1.34/0.54 % (18248)------------------------------
% 1.34/0.54 % (18248)------------------------------
% 1.34/0.54 % (18244)Success in time 0.185 s
%------------------------------------------------------------------------------