TSTP Solution File: SWC322+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC322+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_uns --cores 0 -t %d %s
% Computer : n019.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:40:25 EDT 2022
% Result : Theorem 0.16s 0.51s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 52 ( 10 unt; 0 def)
% Number of atoms : 354 ( 216 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 435 ( 133 ~; 121 |; 157 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 110 ( 50 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f337,plain,
$false,
inference(unit_resulting_resolution,[],[f300,f298,f301,f299,f336]) ).
fof(f336,plain,
! [X4,X5] :
( nil != app(X5,cons(X4,nil))
| nil = app(cons(X4,nil),X5)
| ~ ssItem(X4)
| ~ ssList(X5) ),
inference(forward_demodulation,[],[f284,f289]) ).
fof(f289,plain,
nil = sK4,
inference(trivial_inequality_removal,[],[f288]) ).
fof(f288,plain,
( nil = sK4
| nil != nil ),
inference(superposition,[],[f174,f282]) ).
fof(f282,plain,
nil = sK7,
inference(subsumption_resolution,[],[f281,f179]) ).
fof(f179,plain,
( app(cons(sK8,nil),sK9) != sK4
| nil = sK7 ),
inference(definition_unfolding,[],[f157,f165]) ).
fof(f165,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK4)
& sK6 = sK4
& ( nil != sK7
| nil = sK6 )
& sK5 = sK7
& ssList(sK7)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != sK7
| app(cons(X4,nil),X5) = sK6
| ~ ssList(X5) ) )
& ( ( ssList(sK9)
& app(sK9,cons(sK8,nil)) = sK5
& app(cons(sK8,nil),sK9) != sK4
& ssItem(sK8) )
| ( nil != sK4
& nil = sK5 ) )
& ssList(sK6)
& ssList(sK5) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9])],[f127,f133,f132,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( nil != X3
| nil = X2 )
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = X2
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != X0 )
& ssItem(X6) )
| ( nil != X0
& nil = X1 ) ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK4)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( sK4 = X2
& ( nil != X3
| nil = X2 )
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = X2
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = X1 ) ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK4 = X2
& ( nil != X3
| nil = X2 )
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = X2
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = X1 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK4 = X2
& ( nil != X3
| nil = X2 )
& sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = X2
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = sK5 ) ) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( sK4 = X2
& ( nil != X3
| nil = X2 )
& sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = X2
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = sK5 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK6 = sK4
& ( nil != X3
| nil = sK6 )
& sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = sK6
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = sK5 ) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( sK6 = sK4
& ( nil != X3
| nil = sK6 )
& sK5 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = sK6
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = sK5 ) ) )
=> ( sK6 = sK4
& ( nil != sK7
| nil = sK6 )
& sK5 = sK7
& ssList(sK7)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != sK7
| app(cons(X4,nil),X5) = sK6
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
| ( nil != sK4
& nil = sK5 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = sK5
& app(cons(X6,nil),X7) != sK4 )
& ssItem(X6) )
=> ( ? [X7] :
( ssList(X7)
& app(X7,cons(sK8,nil)) = sK5
& app(cons(sK8,nil),X7) != sK4 )
& ssItem(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X7] :
( ssList(X7)
& app(X7,cons(sK8,nil)) = sK5
& app(cons(sK8,nil),X7) != sK4 )
=> ( ssList(sK9)
& app(sK9,cons(sK8,nil)) = sK5
& app(cons(sK8,nil),sK9) != sK4 ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( nil != X3
| nil = X2 )
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) = X2
| ~ ssList(X5) ) )
& ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) != X0 )
& ssItem(X6) )
| ( nil != X0
& nil = X1 ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(rectify,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ( nil != X3
| nil = X2 )
& X1 = X3
& ssList(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) ) )
& ( ? [X4] :
( ? [X5] :
( ssList(X5)
& app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) != X0 )
& ssItem(X4) )
| ( nil != X0
& nil = X1 ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f103]) ).
fof(f103,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( nil != X0
& nil = X1 )
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) != X0
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) = X2
| ~ ssList(X7) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( nil != X1
| nil = X0 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) = X0 ) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| ? [X6] :
( ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) != X2
& app(X7,cons(X6,nil)) = X3 )
& ssItem(X6) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X1
| nil = X0 )
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) = X0
| app(X7,cons(X6,nil)) != X1 ) ) ) )
| ( nil = X3
& nil != X2 )
| X1 != X3
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != X2
& ssList(X5)
& app(X5,cons(X4,nil)) = X3 )
& ssItem(X4) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X1
| nil = X0 )
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) = X0
| app(X7,cons(X6,nil)) != X1 ) ) ) )
| ( nil = X3
& nil != X2 )
| X1 != X3
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) != X2
& ssList(X5)
& app(X5,cons(X4,nil)) = X3 )
& ssItem(X4) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f157,plain,
( app(cons(sK8,nil),sK9) != sK4
| nil = sK5 ),
inference(cnf_transformation,[],[f134]) ).
fof(f281,plain,
( app(cons(sK8,nil),sK9) = sK4
| nil = sK7 ),
inference(subsumption_resolution,[],[f280,f180]) ).
fof(f180,plain,
( ssItem(sK8)
| nil = sK7 ),
inference(definition_unfolding,[],[f155,f165]) ).
fof(f155,plain,
( ssItem(sK8)
| nil = sK5 ),
inference(cnf_transformation,[],[f134]) ).
fof(f280,plain,
( nil = sK7
| ~ ssItem(sK8)
| app(cons(sK8,nil),sK9) = sK4 ),
inference(subsumption_resolution,[],[f279,f176]) ).
fof(f176,plain,
( ssList(sK9)
| nil = sK7 ),
inference(definition_unfolding,[],[f161,f165]) ).
fof(f161,plain,
( ssList(sK9)
| nil = sK5 ),
inference(cnf_transformation,[],[f134]) ).
fof(f279,plain,
( app(cons(sK8,nil),sK9) = sK4
| ~ ssItem(sK8)
| ~ ssList(sK9)
| nil = sK7 ),
inference(trivial_inequality_removal,[],[f278]) ).
fof(f278,plain,
( app(cons(sK8,nil),sK9) = sK4
| ~ ssList(sK9)
| nil = sK7
| ~ ssItem(sK8)
| sK7 != sK7 ),
inference(superposition,[],[f175,f178]) ).
fof(f178,plain,
( app(sK9,cons(sK8,nil)) = sK7
| nil = sK7 ),
inference(definition_unfolding,[],[f159,f165,f165]) ).
fof(f159,plain,
( app(sK9,cons(sK8,nil)) = sK5
| nil = sK5 ),
inference(cnf_transformation,[],[f134]) ).
fof(f175,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) != sK7
| ~ ssList(X5)
| app(cons(X4,nil),X5) = sK4
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f163,f167]) ).
fof(f167,plain,
sK6 = sK4,
inference(cnf_transformation,[],[f134]) ).
fof(f163,plain,
! [X4,X5] :
( ~ ssItem(X4)
| app(X5,cons(X4,nil)) != sK7
| app(cons(X4,nil),X5) = sK6
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f134]) ).
fof(f174,plain,
( nil != sK7
| nil = sK4 ),
inference(definition_unfolding,[],[f166,f167]) ).
fof(f166,plain,
( nil != sK7
| nil = sK6 ),
inference(cnf_transformation,[],[f134]) ).
fof(f284,plain,
! [X4,X5] :
( nil != app(X5,cons(X4,nil))
| ~ ssItem(X4)
| ~ ssList(X5)
| app(cons(X4,nil),X5) = sK4 ),
inference(backward_demodulation,[],[f175,f282]) ).
fof(f299,plain,
nil = app(sK9,cons(sK8,nil)),
inference(trivial_inequality_removal,[],[f296]) ).
fof(f296,plain,
( nil = app(sK9,cons(sK8,nil))
| nil != nil ),
inference(backward_demodulation,[],[f285,f289]) ).
fof(f285,plain,
( nil != sK4
| nil = app(sK9,cons(sK8,nil)) ),
inference(backward_demodulation,[],[f177,f282]) ).
fof(f177,plain,
( nil != sK4
| app(sK9,cons(sK8,nil)) = sK7 ),
inference(definition_unfolding,[],[f160,f165]) ).
fof(f160,plain,
( app(sK9,cons(sK8,nil)) = sK5
| nil != sK4 ),
inference(cnf_transformation,[],[f134]) ).
fof(f301,plain,
nil != app(cons(sK8,nil),sK9),
inference(forward_demodulation,[],[f297,f289]) ).
fof(f297,plain,
app(cons(sK8,nil),sK9) != sK4,
inference(trivial_inequality_removal,[],[f291]) ).
fof(f291,plain,
( app(cons(sK8,nil),sK9) != sK4
| nil != nil ),
inference(backward_demodulation,[],[f158,f289]) ).
fof(f158,plain,
( app(cons(sK8,nil),sK9) != sK4
| nil != sK4 ),
inference(cnf_transformation,[],[f134]) ).
fof(f298,plain,
ssItem(sK8),
inference(trivial_inequality_removal,[],[f290]) ).
fof(f290,plain,
( nil != nil
| ssItem(sK8) ),
inference(backward_demodulation,[],[f156,f289]) ).
fof(f156,plain,
( nil != sK4
| ssItem(sK8) ),
inference(cnf_transformation,[],[f134]) ).
fof(f300,plain,
ssList(sK9),
inference(trivial_inequality_removal,[],[f292]) ).
fof(f292,plain,
( nil != nil
| ssList(sK9) ),
inference(backward_demodulation,[],[f162,f289]) ).
fof(f162,plain,
( nil != sK4
| ssList(sK9) ),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC322+1 : TPTP v8.1.0. Released v2.4.0.
% 0.05/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Aug 30 18:50:05 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.16/0.46 % (17635)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.16/0.47 % (17650)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.16/0.47 % (17651)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.48 % (17634)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.16/0.49 % (17642)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.50 % (17642)Instruction limit reached!
% 0.16/0.50 % (17642)------------------------------
% 0.16/0.50 % (17642)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.50 % (17643)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.50 % (17632)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.16/0.51 % (17650)First to succeed.
% 0.16/0.51 % (17642)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.51 % (17642)Termination reason: Unknown
% 0.16/0.51 % (17642)Termination phase: Function definition elimination
% 0.16/0.51
% 0.16/0.51 % (17642)Memory used [KB]: 1791
% 0.16/0.51 % (17642)Time elapsed: 0.008 s
% 0.16/0.51 % (17642)Instructions burned: 8 (million)
% 0.16/0.51 % (17642)------------------------------
% 0.16/0.51 % (17642)------------------------------
% 0.16/0.51 % (17650)Refutation found. Thanks to Tanya!
% 0.16/0.51 % SZS status Theorem for theBenchmark
% 0.16/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.51 % (17650)------------------------------
% 0.16/0.51 % (17650)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.51 % (17650)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.51 % (17650)Termination reason: Refutation
% 0.16/0.51
% 0.16/0.51 % (17650)Memory used [KB]: 1791
% 0.16/0.51 % (17650)Time elapsed: 0.146 s
% 0.16/0.51 % (17650)Instructions burned: 12 (million)
% 0.16/0.51 % (17650)------------------------------
% 0.16/0.51 % (17650)------------------------------
% 0.16/0.51 % (17626)Success in time 0.194 s
%------------------------------------------------------------------------------