TSTP Solution File: SWC288+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC288+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n005.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 May 21 05:10:00 EDT 2024
% Result : Theorem 0.14s 0.42s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 287 ( 88 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 344 ( 99 ~; 87 |; 135 &)
% ( 0 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-4 aty)
% Number of variables : 127 ( 80 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1478,plain,
$false,
inference(resolution,[],[f1328,f410]) ).
fof(f410,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax69) ).
fof(f1328,plain,
~ strictorderedP(nil),
inference(backward_demodulation,[],[f654,f1324]) ).
fof(f1324,plain,
nil = sK25,
inference(duplicate_literal_removal,[],[f1322]) ).
fof(f1322,plain,
( nil = sK25
| nil = sK25 ),
inference(resolution,[],[f1321,f402]) ).
fof(f402,plain,
( sP1(sK25,sK26)
| nil = sK25 ),
inference(cnf_transformation,[],[f266]) ).
fof(f266,plain,
( ( ( nil = sK25
& nil = sK26 )
| sP1(sK25,sK26) )
& ~ strictorderedP(sK23)
& sK23 = sK25
& sK24 = sK26
& ssList(sK26)
& ssList(sK25)
& ssList(sK24)
& ssList(sK23) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK23,sK24,sK25,sK26])],[f225,f265,f264,f263,f262]) ).
fof(f262,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP1(X2,X3) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP1(X2,X3) )
& ~ strictorderedP(sK23)
& sK23 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f263,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP1(X2,X3) )
& ~ strictorderedP(sK23)
& sK23 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP1(X2,X3) )
& ~ strictorderedP(sK23)
& sK23 = X2
& sK24 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK24) ) ),
introduced(choice_axiom,[]) ).
fof(f264,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP1(X2,X3) )
& ~ strictorderedP(sK23)
& sK23 = X2
& sK24 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK25
& nil = X3 )
| sP1(sK25,X3) )
& ~ strictorderedP(sK23)
& sK23 = sK25
& sK24 = X3
& ssList(X3) )
& ssList(sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f265,plain,
( ? [X3] :
( ( ( nil = sK25
& nil = X3 )
| sP1(sK25,X3) )
& ~ strictorderedP(sK23)
& sK23 = sK25
& sK24 = X3
& ssList(X3) )
=> ( ( ( nil = sK25
& nil = sK26 )
| sP1(sK25,sK26) )
& ~ strictorderedP(sK23)
& sK23 = sK25
& sK24 = sK26
& ssList(sK26) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP1(X2,X3) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f224,f223]) ).
fof(f223,plain,
! [X4,X5,X3,X2] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
| ~ sP0(X4,X5,X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f224,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( sP0(X4,X5,X3,X2)
& ssList(X5) )
& ssItem(X4) )
| ~ sP1(X2,X3) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) ) )
& ~ strictorderedP(X0)
& 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] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2
| ~ ssList(X6) ) ) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1321,plain,
( ~ sP1(sK25,sK26)
| nil = sK25 ),
inference(resolution,[],[f1320,f386]) ).
fof(f386,plain,
! [X0,X1] :
( ssItem(sK20(X0,X1))
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f257]) ).
fof(f257,plain,
! [X0,X1] :
( ( sP0(sK20(X0,X1),sK21(X0,X1),X1,X0)
& ssList(sK21(X0,X1))
& ssItem(sK20(X0,X1)) )
| ~ sP1(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21])],[f254,f256,f255]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( sP0(X2,X3,X1,X0)
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( sP0(sK20(X0,X1),X3,X1,X0)
& ssList(X3) )
& ssItem(sK20(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
! [X0,X1] :
( ? [X3] :
( sP0(sK20(X0,X1),X3,X1,X0)
& ssList(X3) )
=> ( sP0(sK20(X0,X1),sK21(X0,X1),X1,X0)
& ssList(sK21(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( sP0(X2,X3,X1,X0)
& ssList(X3) )
& ssItem(X2) )
| ~ sP1(X0,X1) ),
inference(rectify,[],[f253]) ).
fof(f253,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( sP0(X4,X5,X3,X2)
& ssList(X5) )
& ssItem(X4) )
| ~ sP1(X2,X3) ),
inference(nnf_transformation,[],[f224]) ).
fof(f1320,plain,
( ~ ssItem(sK20(sK25,sK26))
| nil = sK25 ),
inference(resolution,[],[f1276,f654]) ).
fof(f1276,plain,
( strictorderedP(sK25)
| ~ ssItem(sK20(sK25,sK26))
| nil = sK25 ),
inference(superposition,[],[f422,f1268]) ).
fof(f1268,plain,
( sK25 = cons(sK20(sK25,sK26),nil)
| nil = sK25 ),
inference(resolution,[],[f1139,f402]) ).
fof(f1139,plain,
! [X0,X1] :
( ~ sP1(X0,X1)
| cons(sK20(X0,X1),nil) = X0 ),
inference(resolution,[],[f388,f390]) ).
fof(f390,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| cons(X0,nil) = X3 ),
inference(cnf_transformation,[],[f261]) ).
fof(f261,plain,
! [X0,X1,X2,X3] :
( ( ! [X5] :
( ~ lt(X5,X0)
| ~ memberP(sK22(X0,X1,X2,X3),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X0,X6)
| ~ memberP(X1,X6)
| ~ ssItem(X6) )
& app(app(X1,X3),sK22(X0,X1,X2,X3)) = X2
& cons(X0,nil) = X3
& ssList(sK22(X0,X1,X2,X3)) )
| ~ sP0(X0,X1,X2,X3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f259,f260]) ).
fof(f260,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X0)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X0,X6)
| ~ memberP(X1,X6)
| ~ ssItem(X6) )
& app(app(X1,X3),X4) = X2
& cons(X0,nil) = X3
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,X0)
| ~ memberP(sK22(X0,X1,X2,X3),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X0,X6)
| ~ memberP(X1,X6)
| ~ ssItem(X6) )
& app(app(X1,X3),sK22(X0,X1,X2,X3)) = X2
& cons(X0,nil) = X3
& ssList(sK22(X0,X1,X2,X3)) ) ),
introduced(choice_axiom,[]) ).
fof(f259,plain,
! [X0,X1,X2,X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X0)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X0,X6)
| ~ memberP(X1,X6)
| ~ ssItem(X6) )
& app(app(X1,X3),X4) = X2
& cons(X0,nil) = X3
& ssList(X4) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f258]) ).
fof(f258,plain,
! [X4,X5,X3,X2] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
| ~ sP0(X4,X5,X3,X2) ),
inference(nnf_transformation,[],[f223]) ).
fof(f388,plain,
! [X0,X1] :
( sP0(sK20(X0,X1),sK21(X0,X1),X1,X0)
| ~ sP1(X0,X1) ),
inference(cnf_transformation,[],[f257]) ).
fof(f422,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax68) ).
fof(f654,plain,
~ strictorderedP(sK25),
inference(forward_demodulation,[],[f400,f399]) ).
fof(f399,plain,
sK23 = sK25,
inference(cnf_transformation,[],[f266]) ).
fof(f400,plain,
~ strictorderedP(sK23),
inference(cnf_transformation,[],[f266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC288+1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n005.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 : Sun May 19 02:57:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (27171)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (27174)WARNING: value z3 for option sas not known
% 0.14/0.38 % (27175)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (27172)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (27174)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.38 % (27176)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.38 % (27173)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (27177)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.38 % (27178)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.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [1]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [1]
% 0.14/0.41 TRYING [2]
% 0.14/0.41 TRYING [3]
% 0.14/0.42 % (27177)First to succeed.
% 0.14/0.42 % (27177)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-27171"
% 0.14/0.42 % (27177)Refutation found. Thanks to Tanya!
% 0.14/0.42 % SZS status Theorem for theBenchmark
% 0.14/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.42 % (27177)------------------------------
% 0.14/0.42 % (27177)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.42 % (27177)Termination reason: Refutation
% 0.14/0.42
% 0.14/0.42 % (27177)Memory used [KB]: 1931
% 0.14/0.42 % (27177)Time elapsed: 0.045 s
% 0.14/0.42 % (27177)Instructions burned: 78 (million)
% 0.14/0.42 % (27171)Success in time 0.065 s
%------------------------------------------------------------------------------