TSTP Solution File: SWC258+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC258+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 : n029.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 : Sun May 5 10:19:28 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 229 ( 87 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 260 ( 65 ~; 63 |; 116 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 71 ( 35 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f761,plain,
$false,
inference(resolution,[],[f751,f400]) ).
fof(f400,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax66) ).
fof(f751,plain,
~ totalorderedP(nil),
inference(backward_demodulation,[],[f644,f747]) ).
fof(f747,plain,
nil = sK22,
inference(duplicate_literal_removal,[],[f745]) ).
fof(f745,plain,
( nil = sK22
| nil = sK22 ),
inference(resolution,[],[f744,f392]) ).
fof(f392,plain,
( sP0(sK23,sK22)
| nil = sK22 ),
inference(cnf_transformation,[],[f260]) ).
fof(f260,plain,
( ( ( nil = sK22
& nil = sK23 )
| sP0(sK23,sK22) )
& ~ totalorderedP(sK20)
& sK20 = sK22
& sK21 = sK23
& ssList(sK23)
& ssList(sK22)
& ssList(sK21)
& ssList(sK20) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23])],[f224,f259,f258,f257,f256]) ).
fof(f256,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ totalorderedP(sK20)
& sK20 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ totalorderedP(sK20)
& sK20 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ totalorderedP(sK20)
& sK20 = X2
& sK21 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f258,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ totalorderedP(sK20)
& sK20 = X2
& sK21 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK22
& nil = X3 )
| sP0(X3,sK22) )
& ~ totalorderedP(sK20)
& sK20 = sK22
& sK21 = X3
& ssList(X3) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f259,plain,
( ? [X3] :
( ( ( nil = sK22
& nil = X3 )
| sP0(X3,sK22) )
& ~ totalorderedP(sK20)
& sK20 = sK22
& sK21 = X3
& ssList(X3) )
=> ( ( ( nil = sK22
& nil = sK23 )
| sP0(sK23,sK22) )
& ~ totalorderedP(sK20)
& sK20 = sK22
& sK21 = sK23
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f99,f223]) ).
fof(f223,plain,
! [X3,X2] :
( ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ sP0(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ~ totalorderedP(X0)
& X0 = X2
& X1 = X3
& 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 != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| 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 )
& ! [X4] :
( ssItem(X4)
=> ( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f744,plain,
( ~ sP0(sK23,sK22)
| nil = sK22 ),
inference(resolution,[],[f741,f380]) ).
fof(f380,plain,
! [X0,X1] :
( ssItem(sK19(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f255]) ).
fof(f255,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ leq(X3,sK19(X0,X1))
| ~ memberP(X0,X3)
| sK19(X0,X1) = X3
| ~ ssItem(X3) )
& memberP(X0,sK19(X0,X1))
& cons(sK19(X0,X1),nil) = X1
& ssItem(sK19(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f253,f254]) ).
fof(f254,plain,
! [X0,X1] :
( ? [X2] :
( ! [X3] :
( ~ leq(X3,X2)
| ~ memberP(X0,X3)
| X2 = X3
| ~ ssItem(X3) )
& memberP(X0,X2)
& cons(X2,nil) = X1
& ssItem(X2) )
=> ( ! [X3] :
( ~ leq(X3,sK19(X0,X1))
| ~ memberP(X0,X3)
| sK19(X0,X1) = X3
| ~ ssItem(X3) )
& memberP(X0,sK19(X0,X1))
& cons(sK19(X0,X1),nil) = X1
& ssItem(sK19(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
! [X0,X1] :
( ? [X2] :
( ! [X3] :
( ~ leq(X3,X2)
| ~ memberP(X0,X3)
| X2 = X3
| ~ ssItem(X3) )
& memberP(X0,X2)
& cons(X2,nil) = X1
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f252]) ).
fof(f252,plain,
! [X3,X2] :
( ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f223]) ).
fof(f741,plain,
( ~ ssItem(sK19(sK23,sK22))
| nil = sK22 ),
inference(resolution,[],[f736,f644]) ).
fof(f736,plain,
( totalorderedP(sK22)
| ~ ssItem(sK19(sK23,sK22))
| nil = sK22 ),
inference(superposition,[],[f412,f728]) ).
fof(f728,plain,
( sK22 = cons(sK19(sK23,sK22),nil)
| nil = sK22 ),
inference(resolution,[],[f381,f392]) ).
fof(f381,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK19(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f255]) ).
fof(f412,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,axiom,
! [X0] :
( ssItem(X0)
=> totalorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax65) ).
fof(f644,plain,
~ totalorderedP(sK22),
inference(forward_demodulation,[],[f390,f389]) ).
fof(f389,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f260]) ).
fof(f390,plain,
~ totalorderedP(sK20),
inference(cnf_transformation,[],[f260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC258+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 : n029.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 : Fri May 3 20:30:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (641)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (644)WARNING: value z3 for option sas not known
% 0.14/0.38 % (643)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 % (642)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (645)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (644)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 % (662)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 % (663)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 % (664)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 % (663)First to succeed.
% 0.14/0.40 % (663)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-641"
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 % (663)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (663)------------------------------
% 0.14/0.40 % (663)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.40 % (663)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (663)Memory used [KB]: 1394
% 0.14/0.40 % (663)Time elapsed: 0.017 s
% 0.14/0.40 % (663)Instructions burned: 27 (million)
% 0.14/0.40 % (641)Success in time 0.036 s
%------------------------------------------------------------------------------