TSTP Solution File: SWC257+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC257+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n023.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 : Sat Sep 2 12:47:14 EDT 2023
% Result : Theorem 0.22s 0.44s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 213 ( 81 equ)
% Maximal formula atoms : 20 ( 6 avg)
% Number of connectives : 245 ( 65 ~; 63 |; 105 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 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 : 65 (; 34 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f730,plain,
$false,
inference(resolution,[],[f720,f399]) ).
fof(f399,plain,
totalorderedP(nil),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/tmp/tmp.J1Cm4TeCkT/Vampire---4.8_19551',ax66) ).
fof(f720,plain,
~ totalorderedP(nil),
inference(backward_demodulation,[],[f609,f716]) ).
fof(f716,plain,
nil = sK22,
inference(duplicate_literal_removal,[],[f714]) ).
fof(f714,plain,
( nil = sK22
| nil = sK22 ),
inference(resolution,[],[f713,f391]) ).
fof(f391,plain,
( sP0(sK23,sK22)
| nil = sK22 ),
inference(cnf_transformation,[],[f259]) ).
fof(f259,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])],[f223,f258,f257,f256,f255]) ).
fof(f255,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(f256,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(f257,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(f258,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(f223,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,[],[f98,f222]) ).
fof(f222,plain,
! [X3,X2] :
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ 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(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ 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] :
( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| totalorderedP(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] :
( ? [X5] :
( leq(X4,X5)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| totalorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.J1Cm4TeCkT/Vampire---4.8_19551',co1) ).
fof(f713,plain,
( ~ sP0(sK23,sK22)
| nil = sK22 ),
inference(resolution,[],[f710,f379]) ).
fof(f379,plain,
! [X0,X1] :
( ssItem(sK19(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
! [X0,X1] :
( ( ! [X3] :
( ~ leq(sK19(X0,X1),X3)
| ~ 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])],[f252,f253]) ).
fof(f253,plain,
! [X0,X1] :
( ? [X2] :
( ! [X3] :
( ~ leq(X2,X3)
| ~ memberP(X0,X3)
| X2 = X3
| ~ ssItem(X3) )
& memberP(X0,X2)
& cons(X2,nil) = X1
& ssItem(X2) )
=> ( ! [X3] :
( ~ leq(sK19(X0,X1),X3)
| ~ 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(f252,plain,
! [X0,X1] :
( ? [X2] :
( ! [X3] :
( ~ leq(X2,X3)
| ~ memberP(X0,X3)
| X2 = X3
| ~ ssItem(X3) )
& memberP(X0,X2)
& cons(X2,nil) = X1
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f251]) ).
fof(f251,plain,
! [X3,X2] :
( ? [X4] :
( ! [X5] :
( ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f222]) ).
fof(f710,plain,
( ~ ssItem(sK19(sK23,sK22))
| nil = sK22 ),
inference(resolution,[],[f706,f609]) ).
fof(f706,plain,
( totalorderedP(sK22)
| ~ ssItem(sK19(sK23,sK22))
| nil = sK22 ),
inference(superposition,[],[f411,f698]) ).
fof(f698,plain,
( sK22 = cons(sK19(sK23,sK22),nil)
| nil = sK22 ),
inference(resolution,[],[f380,f391]) ).
fof(f380,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| cons(sK19(X0,X1),nil) = X1 ),
inference(cnf_transformation,[],[f254]) ).
fof(f411,plain,
! [X0] :
( totalorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,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/tmp/tmp.J1Cm4TeCkT/Vampire---4.8_19551',ax65) ).
fof(f609,plain,
~ totalorderedP(sK22),
inference(backward_demodulation,[],[f389,f388]) ).
fof(f388,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f259]) ).
fof(f389,plain,
~ totalorderedP(sK20),
inference(cnf_transformation,[],[f259]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC257+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.35 % Computer : n023.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Aug 30 17:33:54 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.41 % (19805)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.42 % (19806)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.22/0.42 % (19807)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.22/0.42 % (19809)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.22/0.42 % (19808)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 Vampire---4 for (569ds/0Mi)
% 0.22/0.42 % (19810)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 Vampire---4 for (531ds/0Mi)
% 0.22/0.42 % (19811)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 Vampire---4 for (522ds/0Mi)
% 0.22/0.42 % (19812)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 Vampire---4 for (497ds/0Mi)
% 0.22/0.43 TRYING [1]
% 0.22/0.43 TRYING [1]
% 0.22/0.43 TRYING [2]
% 0.22/0.43 TRYING [2]
% 0.22/0.44 % (19811)First to succeed.
% 0.22/0.44 % (19811)Refutation found. Thanks to Tanya!
% 0.22/0.44 % SZS status Theorem for Vampire---4
% 0.22/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.44 % (19811)------------------------------
% 0.22/0.44 % (19811)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.22/0.44 % (19811)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.22/0.44 % (19811)Termination reason: Refutation
% 0.22/0.44
% 0.22/0.44 % (19811)Memory used [KB]: 1663
% 0.22/0.44 % (19811)Time elapsed: 0.015 s
% 0.22/0.44 % (19811)------------------------------
% 0.22/0.44 % (19811)------------------------------
% 0.22/0.44 % (19805)Success in time 0.077 s
% 0.22/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------