TSTP Solution File: SWC333+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC333+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -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 : Tue May 21 04:38:13 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 7 unt; 0 def)
% Number of atoms : 390 ( 30 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 511 ( 173 ~; 154 |; 157 &)
% ( 7 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 65 ( 27 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f370,plain,
$false,
inference(avatar_sat_refutation,[],[f323,f328,f333,f338,f343,f344,f345,f369]) ).
fof(f369,plain,
( ~ spl18_1
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6
| ~ spl18_7 ),
inference(avatar_contradiction_clause,[],[f368]) ).
fof(f368,plain,
( $false
| ~ spl18_1
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6
| ~ spl18_7 ),
inference(subsumption_resolution,[],[f367,f342]) ).
fof(f342,plain,
( ssList(sK4)
| ~ spl18_7 ),
inference(avatar_component_clause,[],[f340]) ).
fof(f340,plain,
( spl18_7
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_7])]) ).
fof(f367,plain,
( ~ ssList(sK4)
| ~ spl18_1
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6 ),
inference(subsumption_resolution,[],[f366,f314]) ).
fof(f314,plain,
( totalorderedP(sK4)
| ~ spl18_1 ),
inference(avatar_component_clause,[],[f312]) ).
fof(f312,plain,
( spl18_1
<=> totalorderedP(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_1])]) ).
fof(f366,plain,
( ~ totalorderedP(sK4)
| ~ ssList(sK4)
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6 ),
inference(subsumption_resolution,[],[f365,f332]) ).
fof(f332,plain,
( segmentP(sK3,sK4)
| ~ spl18_5 ),
inference(avatar_component_clause,[],[f330]) ).
fof(f330,plain,
( spl18_5
<=> segmentP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_5])]) ).
fof(f365,plain,
( ~ segmentP(sK3,sK4)
| ~ totalorderedP(sK4)
| ~ ssList(sK4)
| ~ spl18_4
| ~ spl18_6 ),
inference(subsumption_resolution,[],[f364,f327]) ).
fof(f327,plain,
( segmentP(sK4,sK2)
| ~ spl18_4 ),
inference(avatar_component_clause,[],[f325]) ).
fof(f325,plain,
( spl18_4
<=> segmentP(sK4,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_4])]) ).
fof(f364,plain,
( ~ segmentP(sK4,sK2)
| ~ segmentP(sK3,sK4)
| ~ totalorderedP(sK4)
| ~ ssList(sK4)
| ~ spl18_6 ),
inference(resolution,[],[f189,f337]) ).
fof(f337,plain,
( neq(sK2,sK4)
| ~ spl18_6 ),
inference(avatar_component_clause,[],[f335]) ).
fof(f335,plain,
( spl18_6
<=> neq(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_6])]) ).
fof(f189,plain,
! [X5] :
( ~ neq(sK2,X5)
| ~ segmentP(X5,sK2)
| ~ segmentP(sK3,X5)
| ~ totalorderedP(X5)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ( totalorderedP(sK4)
& segmentP(sK4,sK0)
& segmentP(sK1,sK4)
& neq(sK0,sK4)
& ssList(sK4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,sK2)
| ~ segmentP(sK3,X5)
| ~ neq(sK2,X5)
| ~ ssList(X5) )
& totalorderedP(sK2)
& segmentP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f151,f150,f149,f148,f147]) ).
fof(f147,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) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(X1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(X1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(X1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(X1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(sK1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X2] :
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(sK1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,X2)
| ~ segmentP(X3,X5)
| ~ neq(X2,X5)
| ~ ssList(X5) )
& totalorderedP(X2)
& segmentP(X3,X2)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(sK1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,sK2)
| ~ segmentP(X3,X5)
| ~ neq(sK2,X5)
| ~ ssList(X5) )
& totalorderedP(sK2)
& segmentP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f150,plain,
( ? [X3] :
( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(sK1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,sK2)
| ~ segmentP(X3,X5)
| ~ neq(sK2,X5)
| ~ ssList(X5) )
& totalorderedP(sK2)
& segmentP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(sK1,X4)
& neq(sK0,X4)
& ssList(X4) ) )
& ! [X5] :
( ~ totalorderedP(X5)
| ~ segmentP(X5,sK2)
| ~ segmentP(sK3,X5)
| ~ neq(sK2,X5)
| ~ ssList(X5) )
& totalorderedP(sK2)
& segmentP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
( ? [X4] :
( totalorderedP(X4)
& segmentP(X4,sK0)
& segmentP(sK1,X4)
& neq(sK0,X4)
& ssList(X4) )
=> ( totalorderedP(sK4)
& segmentP(sK4,sK0)
& segmentP(sK1,sK4)
& neq(sK0,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
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/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f345,plain,
spl18_2,
inference(avatar_split_clause,[],[f187,f316]) ).
fof(f316,plain,
( spl18_2
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_2])]) ).
fof(f187,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f152]) ).
fof(f344,plain,
spl18_3,
inference(avatar_split_clause,[],[f188,f320]) ).
fof(f320,plain,
( spl18_3
<=> totalorderedP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_3])]) ).
fof(f188,plain,
totalorderedP(sK2),
inference(cnf_transformation,[],[f152]) ).
fof(f343,plain,
( spl18_7
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f260,f320,f316,f340]) ).
fof(f260,plain,
( ~ totalorderedP(sK2)
| ~ segmentP(sK3,sK2)
| ssList(sK4) ),
inference(definition_unfolding,[],[f190,f186,f185,f186]) ).
fof(f185,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f152]) ).
fof(f186,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f152]) ).
fof(f190,plain,
( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| ssList(sK4) ),
inference(cnf_transformation,[],[f152]) ).
fof(f338,plain,
( spl18_6
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f259,f320,f316,f335]) ).
fof(f259,plain,
( ~ totalorderedP(sK2)
| ~ segmentP(sK3,sK2)
| neq(sK2,sK4) ),
inference(definition_unfolding,[],[f191,f186,f185,f186,f186]) ).
fof(f191,plain,
( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| neq(sK0,sK4) ),
inference(cnf_transformation,[],[f152]) ).
fof(f333,plain,
( spl18_5
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f258,f320,f316,f330]) ).
fof(f258,plain,
( ~ totalorderedP(sK2)
| ~ segmentP(sK3,sK2)
| segmentP(sK3,sK4) ),
inference(definition_unfolding,[],[f192,f186,f185,f186,f185]) ).
fof(f192,plain,
( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| segmentP(sK1,sK4) ),
inference(cnf_transformation,[],[f152]) ).
fof(f328,plain,
( spl18_4
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f257,f320,f316,f325]) ).
fof(f257,plain,
( ~ totalorderedP(sK2)
| ~ segmentP(sK3,sK2)
| segmentP(sK4,sK2) ),
inference(definition_unfolding,[],[f193,f186,f185,f186,f186]) ).
fof(f193,plain,
( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| segmentP(sK4,sK0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f323,plain,
( spl18_1
| ~ spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f256,f320,f316,f312]) ).
fof(f256,plain,
( ~ totalorderedP(sK2)
| ~ segmentP(sK3,sK2)
| totalorderedP(sK4) ),
inference(definition_unfolding,[],[f194,f186,f185,f186]) ).
fof(f194,plain,
( ~ totalorderedP(sK0)
| ~ segmentP(sK1,sK0)
| totalorderedP(sK4) ),
inference(cnf_transformation,[],[f152]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC333+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 02:47:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.72 % (31685)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.72 % (31683)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.72 % (31678)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.72 % (31679)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.55/0.72 % (31680)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73 % (31681)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.73 % (31684)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.55/0.73 % (31685)First to succeed.
% 0.55/0.73 % (31678)Also succeeded, but the first one will report.
% 0.55/0.73 % (31685)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31677"
% 0.55/0.73 % (31681)Also succeeded, but the first one will report.
% 0.55/0.73 % (31685)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (31685)------------------------------
% 0.55/0.73 % (31685)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (31685)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (31685)Memory used [KB]: 1182
% 0.55/0.73 % (31685)Time elapsed: 0.007 s
% 0.55/0.73 % (31685)Instructions burned: 9 (million)
% 0.55/0.73 % (31677)Success in time 0.377 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------