TSTP Solution File: SWC041+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC041+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 : n022.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 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 331 ( 147 equ)
% Maximal formula atoms : 36 ( 8 avg)
% Number of connectives : 433 ( 143 ~; 118 |; 147 &)
% ( 4 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 128 ( 82 !; 46 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f664,plain,
$false,
inference(unit_resulting_resolution,[],[f583,f587,f663,f570]) ).
fof(f570,plain,
! [X0] :
( ~ frontsegP(sK34,X0)
| sK34 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f370,f561,f561]) ).
fof(f561,plain,
nil = sK34,
inference(definition_unfolding,[],[f450,f448]) ).
fof(f448,plain,
sK32 = sK34,
inference(cnf_transformation,[],[f294]) ).
fof(f294,plain,
( ssList(sK31)
& ssList(sK32)
& ssList(sK33)
& ssList(sK34)
& sK31 = sK33
& ( nil = sK34
| nil != sK33 )
& sK34 = app(sK33,sK35)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK35
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK33 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK33)
& ssList(sK35)
& nil = sK32
& nil != sK31
& sK32 = sK34 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK31,sK32,sK33,sK34,sK35])],[f110,f293,f292,f291,f290,f289]) ).
fof(f289,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X0 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil = X1
& nil != X0
& X1 = X3 ) ) ) )
=> ( ssList(sK31)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK31 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil = X1
& nil != sK31
& X1 = X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f290,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK31 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil = X1
& nil != sK31
& X1 = X3 ) ) )
=> ( ssList(sK32)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK31 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil = sK32
& nil != sK31
& sK32 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f291,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& sK31 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil = sK32
& nil != sK31
& sK32 = X3 ) )
=> ( ssList(sK33)
& ? [X3] :
( ssList(X3)
& sK31 = sK33
& ( nil = X3
| nil != sK33 )
& ? [X4] :
( app(sK33,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK33 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK33)
& ssList(X4) )
& nil = sK32
& nil != sK31
& sK32 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f292,plain,
( ? [X3] :
( ssList(X3)
& sK31 = sK33
& ( nil = X3
| nil != sK33 )
& ? [X4] :
( app(sK33,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK33 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK33)
& ssList(X4) )
& nil = sK32
& nil != sK31
& sK32 = X3 )
=> ( ssList(sK34)
& sK31 = sK33
& ( nil = sK34
| nil != sK33 )
& ? [X4] :
( sK34 = app(sK33,X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK33 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK33)
& ssList(X4) )
& nil = sK32
& nil != sK31
& sK32 = sK34 ) ),
introduced(choice_axiom,[]) ).
fof(f293,plain,
( ? [X4] :
( sK34 = app(sK33,X4)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK33 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK33)
& ssList(X4) )
=> ( sK34 = app(sK33,sK35)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != sK35
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != sK33 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(sK33)
& ssList(sK35) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& X0 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& ssList(X4) )
& nil = X1
& nil != X0
& X1 = X3 ) ) ) ),
inference(flattening,[],[f109]) ).
fof(f109,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil = X1
& ( nil = X3
| nil != X2 )
& X0 = X2
& X1 = X3
& nil != X0
& ? [X4] :
( app(X2,X4) = X3
& equalelemsP(X2)
& ! [X5] :
( ! [X6] :
( app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X5,nil)) != X2 )
| ~ ssList(X6) )
| ~ ssItem(X5) )
& ssList(X4) )
& 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)
=> ( nil != X1
| ( nil != X3
& nil = X2 )
| X0 != X2
| X1 != X3
| nil = X0
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ equalelemsP(X2)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 )
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil != X1
| ( nil != X3
& nil = X2 )
| X0 != X2
| X1 != X3
| nil = X0
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ equalelemsP(X2)
| ? [X5] :
( ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 )
& app(cons(X5,nil),X6) = X4 )
& ssItem(X5) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f450,plain,
nil = sK32,
inference(cnf_transformation,[],[f294]) ).
fof(f370,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f241]) ).
fof(f241,plain,
! [X0] :
( ~ ssList(X0)
| ( ( nil = X0
| ~ frontsegP(nil,X0) )
& ( frontsegP(nil,X0)
| nil != X0 ) ) ),
inference(nnf_transformation,[],[f217]) ).
fof(f217,plain,
! [X0] :
( ~ ssList(X0)
| ( nil = X0
<=> frontsegP(nil,X0) ) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
<=> frontsegP(nil,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax46) ).
fof(f663,plain,
frontsegP(sK34,sK33),
inference(subsumption_resolution,[],[f662,f451]) ).
fof(f451,plain,
ssList(sK35),
inference(cnf_transformation,[],[f294]) ).
fof(f662,plain,
( ~ ssList(sK35)
| frontsegP(sK34,sK33) ),
inference(subsumption_resolution,[],[f661,f583]) ).
fof(f661,plain,
( ~ ssList(sK33)
| frontsegP(sK34,sK33)
| ~ ssList(sK35) ),
inference(superposition,[],[f659,f454]) ).
fof(f454,plain,
sK34 = app(sK33,sK35),
inference(cnf_transformation,[],[f294]) ).
fof(f659,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f631,f394]) ).
fof(f394,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f206]) ).
fof(f206,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f631,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(app(X1,X3))
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(equality_resolution,[],[f399]) ).
fof(f399,plain,
! [X3,X0,X1] :
( ~ ssList(X1)
| frontsegP(X0,X1)
| ~ ssList(X3)
| app(X1,X3) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f260]) ).
fof(f260,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ( ssList(sK16(X0,X1))
& app(X1,sK16(X0,X1)) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( ~ ssList(X3)
| app(X1,X3) != X0 ) ) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK16])],[f258,f259]) ).
fof(f259,plain,
! [X0,X1] :
( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
=> ( ssList(sK16(X0,X1))
& app(X1,sK16(X0,X1)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f258,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( ~ ssList(X3)
| app(X1,X3) != X0 ) ) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f257]) ).
fof(f257,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| app(X1,X2) != X0 ) ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f222]) ).
fof(f222,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
<=> frontsegP(X0,X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).
fof(f587,plain,
sK34 != sK33,
inference(definition_unfolding,[],[f449,f561,f456]) ).
fof(f456,plain,
sK31 = sK33,
inference(cnf_transformation,[],[f294]) ).
fof(f449,plain,
nil != sK31,
inference(cnf_transformation,[],[f294]) ).
fof(f583,plain,
ssList(sK33),
inference(definition_unfolding,[],[f460,f456]) ).
fof(f460,plain,
ssList(sK31),
inference(cnf_transformation,[],[f294]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC041+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:06:41 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (18324)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.50 % (18330)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.51 % (18338)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.51 % (18330)Instruction limit reached!
% 0.19/0.51 % (18330)------------------------------
% 0.19/0.51 % (18330)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (18330)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (18330)Termination reason: Unknown
% 0.19/0.52 % (18330)Termination phase: Property scanning
% 0.19/0.52
% 0.19/0.52 % (18330)Memory used [KB]: 1279
% 0.19/0.52 % (18330)Time elapsed: 0.006 s
% 0.19/0.52 % (18330)Instructions burned: 7 (million)
% 0.19/0.52 % (18330)------------------------------
% 0.19/0.52 % (18330)------------------------------
% 0.19/0.52 % (18328)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.19/0.52 % (18337)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.53 % (18324)First to succeed.
% 0.19/0.53 % (18342)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.53 % (18326)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.19/0.53 % (18332)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.53 % (18331)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.19/0.53 % (18327)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.53 % (18331)Instruction limit reached!
% 0.19/0.53 % (18331)------------------------------
% 0.19/0.53 % (18331)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (18331)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (18331)Termination reason: Unknown
% 0.19/0.53 % (18331)Termination phase: Preprocessing 3
% 0.19/0.53
% 0.19/0.53 % (18331)Memory used [KB]: 1151
% 0.19/0.53 % (18331)Time elapsed: 0.003 s
% 0.19/0.53 % (18331)Instructions burned: 4 (million)
% 0.19/0.53 % (18331)------------------------------
% 0.19/0.53 % (18331)------------------------------
% 0.19/0.53 % (18324)Refutation found. Thanks to Tanya!
% 0.19/0.53 % SZS status Theorem for theBenchmark
% 0.19/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.53 % (18324)------------------------------
% 0.19/0.53 % (18324)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.53 % (18324)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.53 % (18324)Termination reason: Refutation
% 0.19/0.53
% 0.19/0.53 % (18324)Memory used [KB]: 6012
% 0.19/0.53 % (18324)Time elapsed: 0.122 s
% 0.19/0.53 % (18324)Instructions burned: 18 (million)
% 0.19/0.53 % (18324)------------------------------
% 0.19/0.53 % (18324)------------------------------
% 0.19/0.53 % (18318)Success in time 0.184 s
%------------------------------------------------------------------------------