TSTP Solution File: SWC333+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC333+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 : 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 : Thu Aug 31 20:58:31 EDT 2023
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 9 unt; 0 def)
% Number of atoms : 357 ( 34 equ)
% Maximal formula atoms : 32 ( 7 avg)
% Number of connectives : 469 ( 157 ~; 134 |; 155 &)
% ( 3 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 94 (; 53 !; 41 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f875,plain,
$false,
inference(avatar_sat_refutation,[],[f663,f664,f665,f874]) ).
fof(f874,plain,
~ spl71_1,
inference(avatar_contradiction_clause,[],[f873]) ).
fof(f873,plain,
( $false
| ~ spl71_1 ),
inference(subsumption_resolution,[],[f872,f654]) ).
fof(f654,plain,
( sP0(sK22,sK23)
| ~ spl71_1 ),
inference(avatar_component_clause,[],[f652]) ).
fof(f652,plain,
( spl71_1
<=> sP0(sK22,sK23) ),
introduced(avatar_definition,[new_symbols(naming,[spl71_1])]) ).
fof(f872,plain,
~ sP0(sK22,sK23),
inference(duplicate_literal_removal,[],[f871]) ).
fof(f871,plain,
( ~ sP0(sK22,sK23)
| ~ sP0(sK22,sK23) ),
inference(resolution,[],[f792,f384]) ).
fof(f384,plain,
! [X0,X1] :
( segmentP(X1,sK19(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
! [X0,X1] :
( ( totalorderedP(sK19(X0,X1))
& segmentP(sK19(X0,X1),X0)
& segmentP(X1,sK19(X0,X1))
& neq(X0,sK19(X0,X1))
& ssList(sK19(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f254,f255]) ).
fof(f255,plain,
! [X0,X1] :
( ? [X2] :
( totalorderedP(X2)
& segmentP(X2,X0)
& segmentP(X1,X2)
& neq(X0,X2)
& ssList(X2) )
=> ( totalorderedP(sK19(X0,X1))
& segmentP(sK19(X0,X1),X0)
& segmentP(X1,sK19(X0,X1))
& neq(X0,sK19(X0,X1))
& ssList(sK19(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
! [X0,X1] :
( ? [X2] :
( totalorderedP(X2)
& segmentP(X2,X0)
& segmentP(X1,X2)
& neq(X0,X2)
& ssList(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f253]) ).
fof(f253,plain,
! [X0,X1] :
( ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X0)
& segmentP(X1,X4)
& neq(X0,X4)
& ssList(X4) )
| ~ sP0(X0,X1) ),
inference(nnf_transformation,[],[f224]) ).
fof(f224,plain,
! [X0,X1] :
( ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X0)
& segmentP(X1,X4)
& neq(X0,X4)
& ssList(X4) )
| ~ sP0(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f792,plain,
! [X0] :
( ~ segmentP(sK23,sK19(sK22,X0))
| ~ sP0(sK22,X0) ),
inference(subsumption_resolution,[],[f791,f382]) ).
fof(f382,plain,
! [X0,X1] :
( ssList(sK19(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f256]) ).
fof(f791,plain,
! [X0] :
( ~ segmentP(sK23,sK19(sK22,X0))
| ~ ssList(sK19(sK22,X0))
| ~ sP0(sK22,X0) ),
inference(subsumption_resolution,[],[f790,f383]) ).
fof(f383,plain,
! [X0,X1] :
( neq(X0,sK19(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f256]) ).
fof(f790,plain,
! [X0] :
( ~ segmentP(sK23,sK19(sK22,X0))
| ~ neq(sK22,sK19(sK22,X0))
| ~ ssList(sK19(sK22,X0))
| ~ sP0(sK22,X0) ),
inference(subsumption_resolution,[],[f774,f386]) ).
fof(f386,plain,
! [X0,X1] :
( totalorderedP(sK19(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f256]) ).
fof(f774,plain,
! [X0] :
( ~ totalorderedP(sK19(sK22,X0))
| ~ segmentP(sK23,sK19(sK22,X0))
| ~ neq(sK22,sK19(sK22,X0))
| ~ ssList(sK19(sK22,X0))
| ~ sP0(sK22,X0) ),
inference(resolution,[],[f395,f385]) ).
fof(f385,plain,
! [X0,X1] :
( segmentP(sK19(X0,X1),X0)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f256]) ).
fof(f395,plain,
! [X4] :
( ~ segmentP(X4,sK22)
| ~ totalorderedP(X4)
| ~ segmentP(sK23,X4)
| ~ neq(sK22,X4)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f262]) ).
fof(f262,plain,
( ( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK22)
| ~ segmentP(sK23,X4)
| ~ neq(sK22,X4)
| ~ ssList(X4) )
& totalorderedP(sK22)
& segmentP(sK23,sK22)
& sK20 = sK22
& sK21 = sK23
& ssList(sK23)
& ssList(sK22)
& ssList(sK21)
& ssList(sK20) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23])],[f257,f261,f260,f259,f258]) ).
fof(f258,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| sP0(X0,X1) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK20)
| ~ segmentP(X1,sK20)
| sP0(sK20,X1) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK20 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f259,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK20)
| ~ segmentP(X1,sK20)
| sP0(sK20,X1) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK20 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK20 = X2
& sK21 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f260,plain,
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK20 = X2
& sK21 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK22)
| ~ segmentP(X3,X4)
| ~ neq(sK22,X4)
| ~ ssList(X4) )
& totalorderedP(sK22)
& segmentP(X3,sK22)
& sK20 = sK22
& sK21 = X3
& ssList(X3) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f261,plain,
( ? [X3] :
( ( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK22)
| ~ segmentP(X3,X4)
| ~ neq(sK22,X4)
| ~ ssList(X4) )
& totalorderedP(sK22)
& segmentP(X3,sK22)
& sK20 = sK22
& sK21 = X3
& ssList(X3) )
=> ( ( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK22)
| ~ segmentP(sK23,X4)
| ~ neq(sK22,X4)
| ~ ssList(X4) )
& totalorderedP(sK22)
& segmentP(sK23,sK22)
& sK20 = sK22
& sK21 = sK23
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| sP0(X0,X1) )
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(rectify,[],[f225]) ).
fof(f225,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| sP0(X0,X1) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f100,f224]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X0)
& segmentP(X1,X4)
& neq(X0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(X0)
| ~ segmentP(X1,X0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X0)
& segmentP(X1,X4)
& neq(X0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& 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] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0)
& ! [X4] :
( ssList(X4)
=> ( ~ totalorderedP(X4)
| ~ segmentP(X4,X0)
| ~ segmentP(X1,X4)
| ~ neq(X0,X4) ) ) )
| ? [X5] :
( totalorderedP(X5)
& segmentP(X5,X2)
& segmentP(X3,X5)
& neq(X2,X5)
& ssList(X5) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0)
& ! [X5] :
( ssList(X5)
=> ( ~ totalorderedP(X5)
| ~ segmentP(X5,X0)
| ~ segmentP(X1,X5)
| ~ neq(X0,X5) ) ) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( totalorderedP(X0)
& segmentP(X1,X0)
& ! [X5] :
( ssList(X5)
=> ( ~ totalorderedP(X5)
| ~ segmentP(X5,X0)
| ~ segmentP(X1,X5)
| ~ neq(X0,X5) ) ) )
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.TM68rNUVg5/Vampire---4.8_20119',co1) ).
fof(f665,plain,
spl71_2,
inference(avatar_split_clause,[],[f393,f656]) ).
fof(f656,plain,
( spl71_2
<=> segmentP(sK23,sK22) ),
introduced(avatar_definition,[new_symbols(naming,[spl71_2])]) ).
fof(f393,plain,
segmentP(sK23,sK22),
inference(cnf_transformation,[],[f262]) ).
fof(f664,plain,
spl71_3,
inference(avatar_split_clause,[],[f394,f660]) ).
fof(f660,plain,
( spl71_3
<=> totalorderedP(sK22) ),
introduced(avatar_definition,[new_symbols(naming,[spl71_3])]) ).
fof(f394,plain,
totalorderedP(sK22),
inference(cnf_transformation,[],[f262]) ).
fof(f663,plain,
( spl71_1
| ~ spl71_2
| ~ spl71_3 ),
inference(avatar_split_clause,[],[f614,f660,f656,f652]) ).
fof(f614,plain,
( ~ totalorderedP(sK22)
| ~ segmentP(sK23,sK22)
| sP0(sK22,sK23) ),
inference(definition_unfolding,[],[f396,f392,f391,f392,f392,f391]) ).
fof(f391,plain,
sK21 = sK23,
inference(cnf_transformation,[],[f262]) ).
fof(f392,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f262]) ).
fof(f396,plain,
( ~ totalorderedP(sK20)
| ~ segmentP(sK21,sK20)
| sP0(sK20,sK21) ),
inference(cnf_transformation,[],[f262]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SWC333+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/0.14 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -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 : Mon Aug 28 14:59:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.TM68rNUVg5/Vampire---4.8_20119
% 0.14/0.36 % (20239)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.42 % (20242)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.20/0.42 % (20243)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.20/0.42 % (20240)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.20/0.42 % (20241)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.20/0.42 % (20244)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.20/0.42 % (20245)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.20/0.44 % (20243)First to succeed.
% 0.20/0.44 % (20243)Refutation found. Thanks to Tanya!
% 0.20/0.44 % SZS status Theorem for Vampire---4
% 0.20/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.20/0.44 % (20243)------------------------------
% 0.20/0.44 % (20243)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.20/0.44 % (20243)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.20/0.44 % (20243)Termination reason: Refutation
% 0.20/0.44
% 0.20/0.44 % (20243)Memory used [KB]: 6140
% 0.20/0.44 % (20243)Time elapsed: 0.018 s
% 0.20/0.44 % (20243)------------------------------
% 0.20/0.44 % (20243)------------------------------
% 0.20/0.44 % (20239)Success in time 0.081 s
% 0.20/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------