TSTP Solution File: SWC043+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n017.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:23 EDT 2022
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 334 ( 163 equ)
% Maximal formula atoms : 40 ( 9 avg)
% Number of connectives : 454 ( 157 ~; 131 |; 146 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 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 : 121 ( 78 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f308,plain,
$false,
inference(subsumption_resolution,[],[f307,f195]) ).
fof(f195,plain,
ssList(sK3),
inference(cnf_transformation,[],[f153]) ).
fof(f153,plain,
( sK1 = sK3
& sK4 = sK2
& ssList(sK4)
& strictorderedP(sK3)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK5
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(sK5)
& sK4 = app(sK3,sK5)
& nil != sK1
& nil = sK2
& ( nil = sK4
| nil != sK3 )
& ssList(sK3)
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f138,f152,f151,f150,f149,f148]) ).
fof(f148,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(X2,X4) = X3 )
& nil != X0
& nil = X1
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK1 = X2
& X1 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(X2,X4) = X3 )
& nil != sK1
& nil = X1
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK1 = X2
& X1 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(X2,X4) = X3 )
& nil != sK1
& nil = X1
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK1 = X2
& sK2 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(X2,X4) = X3 )
& nil != sK1
& nil = sK2
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X2] :
( ? [X3] :
( sK1 = X2
& sK2 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(X2,X4) = X3 )
& nil != sK1
& nil = sK2
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
=> ( ? [X3] :
( sK1 = sK3
& sK2 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(sK3)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(sK3,X4) = X3 )
& nil != sK1
& nil = sK2
& ( nil = X3
| nil != sK3 ) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X3] :
( sK1 = sK3
& sK2 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(sK3)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(sK3,X4) = X3 )
& nil != sK1
& nil = sK2
& ( nil = X3
| nil != sK3 ) )
=> ( sK1 = sK3
& sK4 = sK2
& ssList(sK4)
& ? [X4] :
( strictorderedP(sK3)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(sK3,X4) = sK4 )
& nil != sK1
& nil = sK2
& ( nil = sK4
| nil != sK3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f152,plain,
( ? [X4] :
( strictorderedP(sK3)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(sK3,X4) = sK4 )
=> ( strictorderedP(sK3)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK5
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK3
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(sK5)
& sK4 = app(sK3,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& X1 = X3
& ssList(X3)
& ? [X4] :
( strictorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& ssList(X4)
& app(X2,X4) = X3 )
& nil != X0
& nil = X1
& ( nil = X3
| nil != X2 ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f137]) ).
fof(f137,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != X0
& X0 = X2
& ( nil = X3
| nil != X2 )
& X1 = X3
& nil = X1
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ~ ssItem(X7)
| ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) ) ) )
| ~ ssItem(X5) )
& app(X2,X4) = X3
& strictorderedP(X2)
& 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 = X0
| X0 != X2
| ( nil != X3
& nil = X2 )
| X1 != X3
| nil != X1
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& ssList(X6) ) )
| app(X2,X4) != X3
| ~ strictorderedP(X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil = X0
| X0 != X2
| ( nil != X3
& nil = X2 )
| X1 != X3
| nil != X1
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ssItem(X5)
& ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& ssList(X6) ) )
| app(X2,X4) != X3
| ~ strictorderedP(X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f307,plain,
~ ssList(sK3),
inference(subsumption_resolution,[],[f305,f250]) ).
fof(f250,plain,
sK3 != sK2,
inference(definition_unfolding,[],[f198,f197,f205]) ).
fof(f205,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f153]) ).
fof(f197,plain,
nil = sK2,
inference(cnf_transformation,[],[f153]) ).
fof(f198,plain,
nil != sK1,
inference(cnf_transformation,[],[f153]) ).
fof(f305,plain,
( sK3 = sK2
| ~ ssList(sK3) ),
inference(superposition,[],[f240,f302]) ).
fof(f302,plain,
app(sK3,sK2) = sK2,
inference(backward_demodulation,[],[f249,f301]) ).
fof(f301,plain,
sK2 = sK5,
inference(subsumption_resolution,[],[f300,f195]) ).
fof(f300,plain,
( ~ ssList(sK3)
| sK2 = sK5 ),
inference(subsumption_resolution,[],[f299,f200]) ).
fof(f200,plain,
ssList(sK5),
inference(cnf_transformation,[],[f153]) ).
fof(f299,plain,
( ~ ssList(sK5)
| sK2 = sK5
| ~ ssList(sK3) ),
inference(trivial_inequality_removal,[],[f294]) ).
fof(f294,plain,
( ~ ssList(sK5)
| ~ ssList(sK3)
| sK2 = sK5
| sK2 != sK2 ),
inference(superposition,[],[f254,f249]) ).
fof(f254,plain,
! [X0,X1] :
( app(X0,X1) != sK2
| ~ ssList(X0)
| ~ ssList(X1)
| sK2 = X1 ),
inference(definition_unfolding,[],[f218,f197,f197]) ).
fof(f218,plain,
! [X0,X1] :
( ~ ssList(X1)
| nil = X1
| nil != app(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X1
| nil != X0 ) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f162]) ).
fof(f162,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( ( nil = X1
& nil = X0 )
| nil != app(X0,X1) )
& ( nil = app(X0,X1)
| nil != X1
| nil != X0 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( nil = X1
& nil = X0 )
<=> nil = app(X0,X1) ) )
| ~ ssList(X0) ),
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(f249,plain,
app(sK3,sK5) = sK2,
inference(definition_unfolding,[],[f199,f204]) ).
fof(f204,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f153]) ).
fof(f199,plain,
sK4 = app(sK3,sK5),
inference(cnf_transformation,[],[f153]) ).
fof(f240,plain,
! [X0] :
( app(X0,sK2) = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f174,f197]) ).
fof(f174,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC043+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n017.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 17:37:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (25701)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.48 % (25697)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.49 % (25694)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.19/0.50 % (25701)First to succeed.
% 0.19/0.50 % (25701)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (25701)------------------------------
% 0.19/0.50 % (25701)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (25701)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (25701)Termination reason: Refutation
% 0.19/0.50
% 0.19/0.50 % (25701)Memory used [KB]: 6140
% 0.19/0.50 % (25701)Time elapsed: 0.108 s
% 0.19/0.50 % (25701)Instructions burned: 6 (million)
% 0.19/0.50 % (25701)------------------------------
% 0.19/0.50 % (25701)------------------------------
% 0.19/0.50 % (25686)Success in time 0.15 s
%------------------------------------------------------------------------------