TSTP Solution File: SWC009+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC009+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.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 : Tue Apr 30 15:46:26 EDT 2024
% Result : Theorem 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 12 unt; 0 def)
% Number of atoms : 386 ( 152 equ)
% Maximal formula atoms : 46 ( 11 avg)
% Number of connectives : 566 ( 215 ~; 182 |; 148 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 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 : 169 ( 113 !; 56 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1109,plain,
$false,
inference(resolution,[],[f1108,f396]) ).
fof(f396,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1108,plain,
~ ssList(nil),
inference(resolution,[],[f1107,f378]) ).
fof(f378,plain,
ssList(sK20),
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ( nil != sK20
| nil = sK21 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f100,f255,f254,f253,f252,f251]) ).
fof(f251,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK20
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X3] :
( ( nil != sK20
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( nil != sK20
| nil = sK21 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& app(sK20,X4) = sK21
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK20
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK22
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK20)
& sK21 = app(sK20,sK22)
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& 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)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X9,X11) = X0
& app(app(X9,X10),X11) = X1
& ssList(X11) )
& ssList(X10) )
& ssList(X9) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f1107,plain,
( ~ ssList(sK20)
| ~ ssList(nil) ),
inference(resolution,[],[f1106,f383]) ).
fof(f383,plain,
ssList(sK22),
inference(cnf_transformation,[],[f256]) ).
fof(f1106,plain,
( ~ ssList(sK22)
| ~ ssList(nil)
| ~ ssList(sK20) ),
inference(trivial_inequality_removal,[],[f1105]) ).
fof(f1105,plain,
( sK20 != sK20
| ~ ssList(nil)
| ~ ssList(sK22)
| ~ ssList(sK20) ),
inference(forward_demodulation,[],[f1104,f644]) ).
fof(f644,plain,
sK20 = app(sK20,nil),
inference(resolution,[],[f458,f378]) ).
fof(f458,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f1104,plain,
( sK20 != app(sK20,nil)
| ~ ssList(nil)
| ~ ssList(sK22)
| ~ ssList(sK20) ),
inference(trivial_inequality_removal,[],[f1103]) ).
fof(f1103,plain,
( sK21 != sK21
| sK20 != app(sK20,nil)
| ~ ssList(nil)
| ~ ssList(sK22)
| ~ ssList(sK20) ),
inference(superposition,[],[f1017,f645]) ).
fof(f645,plain,
sK21 = app(sK21,nil),
inference(resolution,[],[f458,f379]) ).
fof(f379,plain,
ssList(sK21),
inference(cnf_transformation,[],[f256]) ).
fof(f1017,plain,
! [X0] :
( sK21 != app(sK21,X0)
| sK20 != app(sK20,X0)
| ~ ssList(X0)
| ~ ssList(sK22)
| ~ ssList(sK20) ),
inference(superposition,[],[f640,f384]) ).
fof(f384,plain,
sK21 = app(sK20,sK22),
inference(cnf_transformation,[],[f256]) ).
fof(f640,plain,
! [X10,X11,X9] :
( app(app(X9,X10),X11) != sK21
| app(X9,X11) != sK20
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(forward_demodulation,[],[f639,f380]) ).
fof(f380,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f639,plain,
! [X10,X11,X9] :
( app(X9,X11) != sK20
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(forward_demodulation,[],[f382,f381]) ).
fof(f381,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f382,plain,
! [X10,X11,X9] :
( app(X9,X11) != sK18
| app(app(X9,X10),X11) != sK19
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC009+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n004.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 04:05:18 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % (5483)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.39 % (5486)WARNING: value z3 for option sas not known
% 0.14/0.39 % (5487)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.39 % (5485)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.39 % (5484)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.39 % (5486)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.39 % (5488)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.39 % (5489)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.39 % (5490)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [1]
% 0.14/0.41 TRYING [2]
% 0.14/0.41 TRYING [2]
% 0.21/0.41 TRYING [3]
% 0.21/0.42 % (5489)First to succeed.
% 0.21/0.42 TRYING [3]
% 0.21/0.42 % (5489)Refutation found. Thanks to Tanya!
% 0.21/0.42 % SZS status Theorem for theBenchmark
% 0.21/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.42 % (5489)------------------------------
% 0.21/0.42 % (5489)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.42 % (5489)Termination reason: Refutation
% 0.21/0.42
% 0.21/0.42 % (5489)Memory used [KB]: 1732
% 0.21/0.42 % (5489)Time elapsed: 0.032 s
% 0.21/0.42 % (5489)Instructions burned: 54 (million)
% 0.21/0.42 % (5489)------------------------------
% 0.21/0.42 % (5489)------------------------------
% 0.21/0.42 % (5483)Success in time 0.039 s
%------------------------------------------------------------------------------