TSTP Solution File: SWC032+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC032+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 : n014.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:38:19 EDT 2022
% Result : Theorem 1.54s 0.59s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 358 ( 193 equ)
% Maximal formula atoms : 44 ( 9 avg)
% Number of connectives : 493 ( 171 ~; 144 |; 159 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 9 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 : 115 ( 72 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f383,plain,
$false,
inference(subsumption_resolution,[],[f382,f190]) ).
fof(f190,plain,
ssList(sK1),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
( ssList(sK3)
& sK3 = sK1
& ssList(sK4)
& ( ( nil = sK1
& nil != sK2 )
| ( nil = sK2
& nil != sK1 ) )
& ( nil = sK4
| nil != sK3 )
& sK2 = sK4
& strictorderedP(sK3)
& app(sK3,sK5) = sK4
& ssList(sK5)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK5
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3 ) ) )
| ~ ssItem(X5) )
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f112,f152,f151,f150,f149,f148]) ).
fof(f148,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& ( ( nil = X0
& nil != X1 )
| ( nil = X1
& nil != X0 ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ? [X4] :
( strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK1 = X2
& ssList(X3)
& ( ( nil = sK1
& nil != X1 )
| ( nil = X1
& nil != sK1 ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ? [X4] :
( strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK1 = X2
& ssList(X3)
& ( ( nil = sK1
& nil != X1 )
| ( nil = X1
& nil != sK1 ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ? [X4] :
( strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK1 = X2
& ssList(X3)
& ( ( nil = sK1
& nil != sK2 )
| ( nil = sK2
& nil != sK1 ) )
& ( nil = X3
| nil != X2 )
& sK2 = X3
& ? [X4] :
( strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK1 = X2
& ssList(X3)
& ( ( nil = sK1
& nil != sK2 )
| ( nil = sK2
& nil != sK1 ) )
& ( nil = X3
| nil != X2 )
& sK2 = X3
& ? [X4] :
( strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) ) ) ) )
=> ( ssList(sK3)
& ? [X3] :
( sK3 = sK1
& ssList(X3)
& ( ( nil = sK1
& nil != sK2 )
| ( nil = sK2
& nil != sK1 ) )
& ( nil = X3
| nil != sK3 )
& sK2 = X3
& ? [X4] :
( strictorderedP(sK3)
& app(sK3,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3 ) ) )
| ~ ssItem(X5) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X3] :
( sK3 = sK1
& ssList(X3)
& ( ( nil = sK1
& nil != sK2 )
| ( nil = sK2
& nil != sK1 ) )
& ( nil = X3
| nil != sK3 )
& sK2 = X3
& ? [X4] :
( strictorderedP(sK3)
& app(sK3,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3 ) ) )
| ~ ssItem(X5) ) ) )
=> ( sK3 = sK1
& ssList(sK4)
& ( ( nil = sK1
& nil != sK2 )
| ( nil = sK2
& nil != sK1 ) )
& ( nil = sK4
| nil != sK3 )
& sK2 = sK4
& ? [X4] :
( strictorderedP(sK3)
& app(sK3,X4) = sK4
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3 ) ) )
| ~ ssItem(X5) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X4] :
( strictorderedP(sK3)
& app(sK3,X4) = sK4
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3 ) ) )
| ~ ssItem(X5) ) )
=> ( strictorderedP(sK3)
& app(sK3,sK5) = sK4
& ssList(sK5)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK5
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3 ) ) )
| ~ ssItem(X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f112,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ssList(X3)
& ( ( nil = X0
& nil != X1 )
| ( nil = X1
& nil != X0 ) )
& ( nil = X3
| nil != X2 )
& X1 = X3
& ? [X4] :
( strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ( ( nil = X0
& nil != X1 )
| ( nil = X1
& nil != X0 ) )
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 ) ) )
| ~ ssItem(X5) )
& ssList(X4) )
& X0 = X2
& 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
| ( ( nil = X0
| nil != X1 )
& ( nil != X0
| nil = X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& lt(X7,X5) ) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 ) ) ) )
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| ( ( nil = X0
| nil != X1 )
& ( nil != X0
| nil = X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ strictorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& app(X8,cons(X7,nil)) = X2
& lt(X7,X5) ) )
& ssList(X6)
& app(cons(X5,nil),X6) = X4 ) ) ) )
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f382,plain,
~ ssList(sK1),
inference(subsumption_resolution,[],[f381,f193]) ).
fof(f193,plain,
ssList(sK5),
inference(cnf_transformation,[],[f153]) ).
fof(f381,plain,
( ~ ssList(sK5)
| ~ ssList(sK1) ),
inference(subsumption_resolution,[],[f369,f361]) ).
fof(f361,plain,
nil != sK1,
inference(trivial_inequality_removal,[],[f360]) ).
fof(f360,plain,
( nil != nil
| nil != sK1 ),
inference(superposition,[],[f244,f357]) ).
fof(f357,plain,
nil = sK4,
inference(subsumption_resolution,[],[f245,f242]) ).
fof(f242,plain,
( nil = sK4
| nil = sK1 ),
inference(definition_unfolding,[],[f201,f196]) ).
fof(f196,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f153]) ).
fof(f201,plain,
( nil = sK1
| nil = sK2 ),
inference(cnf_transformation,[],[f153]) ).
fof(f245,plain,
( nil = sK4
| nil != sK1 ),
inference(definition_unfolding,[],[f197,f203]) ).
fof(f203,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f153]) ).
fof(f197,plain,
( nil = sK4
| nil != sK3 ),
inference(cnf_transformation,[],[f153]) ).
fof(f244,plain,
( nil != sK4
| nil != sK1 ),
inference(definition_unfolding,[],[f198,f196]) ).
fof(f198,plain,
( nil != sK2
| nil != sK1 ),
inference(cnf_transformation,[],[f153]) ).
fof(f369,plain,
( nil = sK1
| ~ ssList(sK5)
| ~ ssList(sK1) ),
inference(trivial_inequality_removal,[],[f363]) ).
fof(f363,plain,
( nil != nil
| ~ ssList(sK5)
| ~ ssList(sK1)
| nil = sK1 ),
inference(superposition,[],[f178,f358]) ).
fof(f358,plain,
nil = app(sK1,sK5),
inference(backward_demodulation,[],[f247,f357]) ).
fof(f247,plain,
sK4 = app(sK1,sK5),
inference(definition_unfolding,[],[f194,f203]) ).
fof(f194,plain,
app(sK3,sK5) = sK4,
inference(cnf_transformation,[],[f153]) ).
fof(f178,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X0
| nil != X1 ) ) ) ),
inference(flattening,[],[f144]) ).
fof(f144,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X0
| nil != X1 ) ) ) ),
inference(nnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( nil = X0
& nil = X1 )
<=> nil = app(X0,X1) ) ) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( nil = X0
& nil = X1 )
<=> nil = app(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC032+1 : TPTP v8.1.0. Released v2.4.0.
% 0.14/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:01:48 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.56 % (32456)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.21/0.57 % (32451)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.57 % (32472)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.58 % (32456)First to succeed.
% 1.54/0.58 % (32461)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 1.54/0.59 % (32456)Refutation found. Thanks to Tanya!
% 1.54/0.59 % SZS status Theorem for theBenchmark
% 1.54/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 1.54/0.59 % (32456)------------------------------
% 1.54/0.59 % (32456)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.54/0.59 % (32456)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.54/0.59 % (32456)Termination reason: Refutation
% 1.54/0.59
% 1.54/0.59 % (32456)Memory used [KB]: 1663
% 1.54/0.59 % (32456)Time elapsed: 0.140 s
% 1.54/0.59 % (32456)Instructions burned: 9 (million)
% 1.54/0.59 % (32456)------------------------------
% 1.54/0.59 % (32456)------------------------------
% 1.54/0.59 % (32449)Success in time 0.227 s
%------------------------------------------------------------------------------