TSTP Solution File: SWC043+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC043+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 : n016.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:37:54 EDT 2023
% Result : Theorem 0.21s 0.46s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 329 ( 163 equ)
% Maximal formula atoms : 40 ( 8 avg)
% Number of connectives : 443 ( 151 ~; 126 |; 146 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 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 : 118 (; 75 !; 43 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1299,plain,
$false,
inference(trivial_inequality_removal,[],[f1298]) ).
fof(f1298,plain,
nil != nil,
inference(superposition,[],[f382,f1241]) ).
fof(f1241,plain,
nil = sK18,
inference(backward_demodulation,[],[f381,f1239]) ).
fof(f1239,plain,
nil = sK20,
inference(backward_demodulation,[],[f614,f1220]) ).
fof(f1220,plain,
nil = app(sK20,nil),
inference(backward_demodulation,[],[f606,f1217]) ).
fof(f1217,plain,
nil = sK22,
inference(resolution,[],[f1216,f377]) ).
fof(f377,plain,
ssList(sK20),
inference(cnf_transformation,[],[f255]) ).
fof(f255,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)
& nil != sK18
& sK18 = sK20
& sK19 = sK21
& nil = sK19
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f99,f254,f253,f252,f251,f250]) ).
fof(f250,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) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& 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) )
& nil != sK18
& sK18 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,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) )
& nil != sK18
& sK18 = X2
& X1 = X3
& nil = X1
& 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) )
& nil != sK18
& sK18 = X2
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,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) )
& nil != sK18
& sK18 = X2
& sK19 = X3
& nil = sK19
& 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) )
& nil != sK18
& sK18 = sK20
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,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) )
& nil != sK18
& sK18 = sK20
& sK19 = X3
& nil = sK19
& 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) )
& nil != sK18
& sK18 = sK20
& sK19 = sK21
& nil = sK19
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,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(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) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,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) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& 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] :
( 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 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [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 ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zys9luYBAt/Vampire---4.8_25168',co1) ).
fof(f1216,plain,
( ~ ssList(sK20)
| nil = sK22 ),
inference(resolution,[],[f1215,f383]) ).
fof(f383,plain,
ssList(sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f1215,plain,
( ~ ssList(sK22)
| nil = sK22
| ~ ssList(sK20) ),
inference(trivial_inequality_removal,[],[f1209]) ).
fof(f1209,plain,
( nil != nil
| nil = sK22
| ~ ssList(sK22)
| ~ ssList(sK20) ),
inference(superposition,[],[f587,f606]) ).
fof(f587,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f371]) ).
fof(f371,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f370]) ).
fof(f370,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.zys9luYBAt/Vampire---4.8_25168',ax83) ).
fof(f606,plain,
nil = app(sK20,sK22),
inference(backward_demodulation,[],[f384,f605]) ).
fof(f605,plain,
nil = sK21,
inference(backward_demodulation,[],[f380,f379]) ).
fof(f379,plain,
nil = sK19,
inference(cnf_transformation,[],[f255]) ).
fof(f380,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f255]) ).
fof(f384,plain,
sK21 = app(sK20,sK22),
inference(cnf_transformation,[],[f255]) ).
fof(f614,plain,
sK20 = app(sK20,nil),
inference(resolution,[],[f458,f377]) ).
fof(f458,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,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/sandbox/tmp/tmp.zys9luYBAt/Vampire---4.8_25168',ax84) ).
fof(f381,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f255]) ).
fof(f382,plain,
nil != sK18,
inference(cnf_transformation,[],[f255]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC043+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.36 % Computer : n016.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 : Wed Aug 30 17:50:47 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.42 % (25403)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.42 % (25406)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on Vampire---4 for (846ds/0Mi)
% 0.21/0.42 % (25407)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on Vampire---4 for (793ds/0Mi)
% 0.21/0.42 % (25408)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.21/0.42 % (25409)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on Vampire---4 for (533ds/0Mi)
% 0.21/0.42 % (25410)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.21/0.42 % (25411)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.21/0.42 % (25412)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.21/0.43 TRYING [1]
% 0.21/0.43 TRYING [1]
% 0.21/0.44 TRYING [2]
% 0.21/0.44 TRYING [2]
% 0.21/0.44 TRYING [3]
% 0.21/0.44 TRYING [3]
% 0.21/0.46 TRYING [1]
% 0.21/0.46 % (25411)First to succeed.
% 0.21/0.46 TRYING [2]
% 0.21/0.46 % (25411)Refutation found. Thanks to Tanya!
% 0.21/0.46 % SZS status Theorem for Vampire---4
% 0.21/0.46 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.46 % (25411)------------------------------
% 0.21/0.46 % (25411)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.46 % (25411)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.46 % (25411)Termination reason: Refutation
% 0.21/0.46
% 0.21/0.46 % (25411)Memory used [KB]: 2430
% 0.21/0.46 % (25411)Time elapsed: 0.039 s
% 0.21/0.46 % (25411)------------------------------
% 0.21/0.46 % (25411)------------------------------
% 0.21/0.46 % (25403)Success in time 0.101 s
% 0.21/0.47 % Vampire---4.8 exiting
%------------------------------------------------------------------------------