TSTP Solution File: SWC082+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC082+1 : TPTP v8.1.2. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n002.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 : Wed May 1 03:59:39 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 42 ( 6 unt; 1 typ; 0 def)
% Number of atoms : 531 ( 58 equ)
% Maximal formula atoms : 36 ( 12 avg)
% Number of connectives : 405 ( 129 ~; 110 |; 141 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 214 ( 214 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 67 ( 28 !; 38 ?; 3 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ11_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f298,plain,
$false,
inference(avatar_sat_refutation,[],[f252,f257,f262,f267,f277,f297]) ).
tff(f297,plain,
( ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5 ),
inference(avatar_contradiction_clause,[],[f296]) ).
tff(f296,plain,
( $false
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4
| ~ spl12_5 ),
inference(subsumption_resolution,[],[f295,f266]) ).
tff(f266,plain,
( ssList(sK4)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f264]) ).
tff(f264,plain,
( spl12_5
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
tff(f295,plain,
( ~ ssList(sK4)
| ~ spl12_1
| ~ spl12_3
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f294,f261]) ).
tff(f261,plain,
( neq(sK4,nil)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f259]) ).
tff(f259,plain,
( spl12_4
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
tff(f294,plain,
( ~ neq(sK4,nil)
| ~ ssList(sK4)
| ~ spl12_1
| ~ spl12_3 ),
inference(subsumption_resolution,[],[f293,f247]) ).
tff(f247,plain,
( segmentP(sK2,sK4)
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f245]) ).
tff(f245,plain,
( spl12_1
<=> segmentP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
tff(f293,plain,
( ~ segmentP(sK2,sK4)
| ~ neq(sK4,nil)
| ~ ssList(sK4)
| ~ spl12_3 ),
inference(resolution,[],[f204,f256]) ).
tff(f256,plain,
( segmentP(sK3,sK4)
| ~ spl12_3 ),
inference(avatar_component_clause,[],[f254]) ).
tff(f254,plain,
( spl12_3
<=> segmentP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
tff(f204,plain,
! [X5: $i] :
( ~ segmentP(sK3,X5)
| ~ segmentP(sK2,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f160,f158,f157]) ).
tff(f157,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f136]) ).
tff(f136,plain,
( ( ~ neq(sK3,nil)
| ( segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& ( 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,f135,f134,f133,f132,f131]) ).
tff(f131,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f132,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f133,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f134,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(sK3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil)
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f135,plain,
( ? [X4] :
( segmentP(sK2,X4)
& segmentP(sK3,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil)
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
tff(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ segmentP(X3,X5)
| ~ neq(X5,nil) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| ( X0 != X2 )
| ( X1 != X3 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6vPleSFhu7/Vampire---4.8_25167',co1) ).
tff(f158,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f136]) ).
tff(f160,plain,
! [X5: $i] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f136]) ).
tff(f277,plain,
spl12_2,
inference(avatar_split_clause,[],[f205,f249]) ).
tff(f249,plain,
( spl12_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
tff(f205,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f159,f157]) ).
tff(f159,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f136]) ).
tff(f267,plain,
( spl12_5
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f162,f249,f264]) ).
tff(f162,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f136]) ).
tff(f262,plain,
( spl12_4
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f163,f249,f259]) ).
tff(f163,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f136]) ).
tff(f257,plain,
( spl12_3
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f164,f249,f254]) ).
tff(f164,plain,
( ~ neq(sK3,nil)
| segmentP(sK3,sK4) ),
inference(cnf_transformation,[],[f136]) ).
tff(f252,plain,
( spl12_1
| ~ spl12_2 ),
inference(avatar_split_clause,[],[f165,f249,f245]) ).
tff(f165,plain,
( ~ neq(sK3,nil)
| segmentP(sK2,sK4) ),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC082+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n002.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:36:25 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.6vPleSFhu7/Vampire---4.8_25167
% 0.56/0.75 % (25431)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 Vampire---4 for (2996ds/83Mi)
% 0.56/0.75 % (25425)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 Vampire---4 for (2996ds/34Mi)
% 0.56/0.75 % (25427)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.75 % (25426)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 Vampire---4 for (2996ds/51Mi)
% 0.56/0.75 % (25430)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.75 % (25428)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.75 % (25432)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.56/0.75 % (25429)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.56/0.75 % (25425)First to succeed.
% 0.56/0.76 % (25428)Also succeeded, but the first one will report.
% 0.56/0.76 % (25427)Also succeeded, but the first one will report.
% 0.56/0.76 % (25425)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for Vampire---4
% 0.56/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.76 % (25425)------------------------------
% 0.56/0.76 % (25425)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.76 % (25425)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (25425)Memory used [KB]: 1150
% 0.56/0.76 % (25425)Time elapsed: 0.005 s
% 0.56/0.76 % (25425)Instructions burned: 7 (million)
% 0.56/0.76 % (25425)------------------------------
% 0.56/0.76 % (25425)------------------------------
% 0.56/0.76 % (25421)Success in time 0.382 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------