TSTP Solution File: SWC287+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC287+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 : n032.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 : Thu Aug 31 20:58:08 EDT 2023
% Result : Theorem 0.16s 0.36s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 9 unt; 0 def)
% Number of atoms : 295 ( 106 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 355 ( 106 ~; 107 |; 124 &)
% ( 5 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 65 (; 33 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f821,plain,
$false,
inference(avatar_sat_refutation,[],[f620,f626,f776,f820]) ).
fof(f820,plain,
~ spl59_1,
inference(avatar_contradiction_clause,[],[f819]) ).
fof(f819,plain,
( $false
| ~ spl59_1 ),
inference(subsumption_resolution,[],[f809,f370]) ).
fof(f370,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/tmp/tmp.JcyEcnxqlI/Vampire---4.8_2782',ax69) ).
fof(f809,plain,
( ~ strictorderedP(nil)
| ~ spl59_1 ),
inference(backward_demodulation,[],[f354,f602]) ).
fof(f602,plain,
( nil = sK6
| ~ spl59_1 ),
inference(avatar_component_clause,[],[f600]) ).
fof(f600,plain,
( spl59_1
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl59_1])]) ).
fof(f354,plain,
~ strictorderedP(sK6),
inference(cnf_transformation,[],[f236]) ).
fof(f236,plain,
( ( ( nil = sK8
& nil = sK9 )
| ( ! [X5] :
( ~ leq(X5,sK10)
| ~ memberP(sK9,X5)
| sK10 = X5
| ~ ssItem(X5) )
& memberP(sK9,sK10)
& sK8 = cons(sK10,nil)
& ssItem(sK10) ) )
& ~ strictorderedP(sK6)
& sK6 = sK8
& sK7 = sK9
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10])],[f98,f235,f234,f233,f232,f231]) ).
fof(f231,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) ) )
& ~ strictorderedP(X0)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(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) ) )
& ~ strictorderedP(sK6)
& sK6 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f232,plain,
( ? [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) ) )
& ~ strictorderedP(sK6)
& sK6 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(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) ) )
& ~ strictorderedP(sK6)
& sK6 = X2
& sK7 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f233,plain,
( ? [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) ) )
& ~ strictorderedP(sK6)
& sK6 = X2
& sK7 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK8
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK8
& ssItem(X4) ) )
& ~ strictorderedP(sK6)
& sK6 = sK8
& sK7 = X3
& ssList(X3) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f234,plain,
( ? [X3] :
( ( ( nil = sK8
& nil = X3 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(X3,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(X3,X4)
& cons(X4,nil) = sK8
& ssItem(X4) ) )
& ~ strictorderedP(sK6)
& sK6 = sK8
& sK7 = X3
& ssList(X3) )
=> ( ( ( nil = sK8
& nil = sK9 )
| ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK9,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK9,X4)
& cons(X4,nil) = sK8
& ssItem(X4) ) )
& ~ strictorderedP(sK6)
& sK6 = sK8
& sK7 = sK9
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f235,plain,
( ? [X4] :
( ! [X5] :
( ~ leq(X5,X4)
| ~ memberP(sK9,X5)
| X4 = X5
| ~ ssItem(X5) )
& memberP(sK9,X4)
& cons(X4,nil) = sK8
& ssItem(X4) )
=> ( ! [X5] :
( ~ leq(X5,sK10)
| ~ memberP(sK9,X5)
| sK10 = X5
| ~ ssItem(X5) )
& memberP(sK9,sK10)
& sK8 = cons(sK10,nil)
& ssItem(sK10) ) ),
introduced(choice_axiom,[]) ).
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) ) )
& ~ strictorderedP(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(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| 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] :
( ? [X5] :
( leq(X5,X4)
& memberP(X3,X5)
& X4 != X5
& ssItem(X5) )
| ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ~ ssItem(X4) ) )
| strictorderedP(X0)
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JcyEcnxqlI/Vampire---4.8_2782',co1) ).
fof(f776,plain,
( ~ spl59_4
| ~ spl59_5 ),
inference(avatar_contradiction_clause,[],[f775]) ).
fof(f775,plain,
( $false
| ~ spl59_4
| ~ spl59_5 ),
inference(subsumption_resolution,[],[f774,f354]) ).
fof(f774,plain,
( strictorderedP(sK6)
| ~ spl59_4
| ~ spl59_5 ),
inference(forward_demodulation,[],[f773,f644]) ).
fof(f644,plain,
( sK6 = cons(sK10,nil)
| ~ spl59_4 ),
inference(backward_demodulation,[],[f589,f619]) ).
fof(f619,plain,
( sK6 = sF58
| ~ spl59_4 ),
inference(avatar_component_clause,[],[f617]) ).
fof(f617,plain,
( spl59_4
<=> sK6 = sF58 ),
introduced(avatar_definition,[new_symbols(naming,[spl59_4])]) ).
fof(f589,plain,
cons(sK10,nil) = sF58,
introduced(function_definition,[]) ).
fof(f773,plain,
( strictorderedP(cons(sK10,nil))
| ~ spl59_5 ),
inference(subsumption_resolution,[],[f742,f371]) ).
fof(f371,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.JcyEcnxqlI/Vampire---4.8_2782',ax17) ).
fof(f742,plain,
( strictorderedP(cons(sK10,nil))
| ~ ssList(nil)
| ~ spl59_5 ),
inference(resolution,[],[f625,f568]) ).
fof(f568,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssList(nil)
| ~ ssItem(X0) ),
inference(equality_resolution,[],[f416]) ).
fof(f416,plain,
! [X0,X1] :
( strictorderedP(cons(X0,X1))
| nil != X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f249]) ).
fof(f249,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f248]) ).
fof(f248,plain,
! [X0] :
( ! [X1] :
( ( ( strictorderedP(cons(X0,X1))
| ( ( ~ lt(X0,hd(X1))
| ~ strictorderedP(X1)
| nil = X1 )
& nil != X1 ) )
& ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1
| ~ strictorderedP(cons(X0,X1)) ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f70]) ).
fof(f70,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ( strictorderedP(cons(X0,X1))
<=> ( ( lt(X0,hd(X1))
& strictorderedP(X1)
& nil != X1 )
| nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JcyEcnxqlI/Vampire---4.8_2782',ax70) ).
fof(f625,plain,
( ssItem(sK10)
| ~ spl59_5 ),
inference(avatar_component_clause,[],[f623]) ).
fof(f623,plain,
( spl59_5
<=> ssItem(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl59_5])]) ).
fof(f626,plain,
( spl59_5
| spl59_1 ),
inference(avatar_split_clause,[],[f621,f600,f623]) ).
fof(f621,plain,
( nil = sK6
| ssItem(sK10) ),
inference(forward_demodulation,[],[f359,f353]) ).
fof(f353,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f236]) ).
fof(f359,plain,
( nil = sK8
| ssItem(sK10) ),
inference(cnf_transformation,[],[f236]) ).
fof(f620,plain,
( spl59_1
| spl59_4 ),
inference(avatar_split_clause,[],[f615,f617,f600]) ).
fof(f615,plain,
( sK6 = sF58
| nil = sK6 ),
inference(forward_demodulation,[],[f614,f353]) ).
fof(f614,plain,
( nil = sK6
| sK8 = sF58 ),
inference(forward_demodulation,[],[f590,f353]) ).
fof(f590,plain,
( nil = sK8
| sK8 = sF58 ),
inference(definition_folding,[],[f360,f589]) ).
fof(f360,plain,
( nil = sK8
| sK8 = cons(sK10,nil) ),
inference(cnf_transformation,[],[f236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SWC287+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.11 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Aug 28 17:31:15 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.11/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.31 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.JcyEcnxqlI/Vampire---4.8_2782
% 0.16/0.31 % (2891)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.35 % (2894)lrs+10_4:5_amm=off:bsr=on:bce=on:flr=on:fsd=off:fde=unused:gs=on:gsem=on:lcm=predicate:sos=all:tgt=ground:stl=62_514 on Vampire---4 for (514ds/0Mi)
% 0.16/0.35 % (2896)ott+11_8:1_aac=none:amm=sco:anc=none:er=known:flr=on:fde=unused:irw=on:nm=0:nwc=1.2:nicw=on:sims=off:sos=all:sac=on_470 on Vampire---4 for (470ds/0Mi)
% 0.16/0.35 % (2897)lrs+10_1024_av=off:bsr=on:br=off:ep=RSTC:fsd=off:irw=on:nm=4:nwc=1.1:sims=off:urr=on:stl=125_440 on Vampire---4 for (440ds/0Mi)
% 0.16/0.36 % (2898)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.16/0.36 % (2894)First to succeed.
% 0.16/0.36 % (2892)lrs+1011_1_bd=preordered:flr=on:fsd=off:fsr=off:irw=on:lcm=reverse:msp=off:nm=2:nwc=10.0:sos=on:sp=reverse_weighted_frequency:tgt=full:stl=62_562 on Vampire---4 for (562ds/0Mi)
% 0.16/0.36 % (2895)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.16/0.36 % (2894)Refutation found. Thanks to Tanya!
% 0.16/0.36 % SZS status Theorem for Vampire---4
% 0.16/0.36 % SZS output start Proof for Vampire---4
% See solution above
% 0.16/0.36 % (2894)------------------------------
% 0.16/0.36 % (2894)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.16/0.36 % (2894)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.16/0.36 % (2894)Termination reason: Refutation
% 0.16/0.36
% 0.16/0.36 % (2894)Memory used [KB]: 10874
% 0.16/0.36 % (2894)Time elapsed: 0.013 s
% 0.16/0.36 % (2894)------------------------------
% 0.16/0.36 % (2894)------------------------------
% 0.16/0.36 % (2891)Success in time 0.05 s
% 0.16/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------