TSTP Solution File: SWC069+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC069+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 : n004.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:36:00 EDT 2024
% Result : Theorem 0.70s 0.90s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 55 ( 6 unt; 0 def)
% Number of atoms : 369 ( 100 equ)
% Maximal formula atoms : 38 ( 6 avg)
% Number of connectives : 481 ( 167 ~; 138 |; 145 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 74 ( 36 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f249,plain,
$false,
inference(avatar_sat_refutation,[],[f169,f174,f179,f184,f193,f194,f222,f248]) ).
fof(f248,plain,
( ~ spl7_1
| ~ spl7_3
| ~ spl7_4
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f247]) ).
fof(f247,plain,
( $false
| ~ spl7_1
| ~ spl7_3
| ~ spl7_4
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f246,f183]) ).
fof(f183,plain,
( ssList(sK4)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f181]) ).
fof(f181,plain,
( spl7_5
<=> ssList(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f246,plain,
( ~ ssList(sK4)
| ~ spl7_1
| ~ spl7_3
| ~ spl7_4 ),
inference(subsumption_resolution,[],[f245,f164]) ).
fof(f164,plain,
( segmentP(sK2,sK4)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f162,plain,
( spl7_1
<=> segmentP(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f245,plain,
( ~ segmentP(sK2,sK4)
| ~ ssList(sK4)
| ~ spl7_3
| ~ spl7_4 ),
inference(subsumption_resolution,[],[f233,f173]) ).
fof(f173,plain,
( segmentP(sK3,sK4)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f171]) ).
fof(f171,plain,
( spl7_3
<=> segmentP(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f233,plain,
( ~ segmentP(sK3,sK4)
| ~ segmentP(sK2,sK4)
| ~ ssList(sK4)
| ~ spl7_4 ),
inference(resolution,[],[f154,f178]) ).
fof(f178,plain,
( neq(sK4,nil)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f176]) ).
fof(f176,plain,
( spl7_4
<=> neq(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f154,plain,
! [X5] :
( ~ neq(X5,nil)
| ~ segmentP(sK3,X5)
| ~ segmentP(sK2,X5)
| ~ ssList(X5) ),
inference(definition_unfolding,[],[f132,f131,f130]) ).
fof(f130,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
( ( ~ neq(sK3,nil)
| ( segmentP(sK2,sK4)
& segmentP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f101,f117,f116,f115,f114,f113]) ).
fof(f113,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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 != sK0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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 != sK0
| nil != sK1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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 != sK0
| nil != sK1 )
& ( nil != X3
| nil = sK2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != X3
| nil = sK2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( segmentP(sK2,X4)
& segmentP(sK3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != sK0
| nil != sK1 )
& ( nil != sK3
| nil = sK2 )
& ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f117,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,[]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(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 = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(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 = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f131,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f118]) ).
fof(f132,plain,
! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f118]) ).
fof(f222,plain,
( spl7_2
| spl7_6 ),
inference(avatar_split_clause,[],[f209,f186,f166]) ).
fof(f166,plain,
( spl7_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f186,plain,
( spl7_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f209,plain,
( neq(sK3,nil)
| spl7_6 ),
inference(unit_resulting_resolution,[],[f129,f141,f188,f140]) ).
fof(f140,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f188,plain,
( nil != sK3
| spl7_6 ),
inference(avatar_component_clause,[],[f186]) ).
fof(f141,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f129,plain,
ssList(sK3),
inference(cnf_transformation,[],[f118]) ).
fof(f194,plain,
( spl7_7
| ~ spl7_6 ),
inference(avatar_split_clause,[],[f133,f186,f190]) ).
fof(f190,plain,
( spl7_7
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f133,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f118]) ).
fof(f193,plain,
( ~ spl7_6
| ~ spl7_7 ),
inference(avatar_split_clause,[],[f153,f190,f186]) ).
fof(f153,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f134,f131,f130]) ).
fof(f134,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f118]) ).
fof(f184,plain,
( spl7_5
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f135,f166,f181]) ).
fof(f135,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f118]) ).
fof(f179,plain,
( spl7_4
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f136,f166,f176]) ).
fof(f136,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f118]) ).
fof(f174,plain,
( spl7_3
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f137,f166,f171]) ).
fof(f137,plain,
( ~ neq(sK3,nil)
| segmentP(sK3,sK4) ),
inference(cnf_transformation,[],[f118]) ).
fof(f169,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f138,f166,f162]) ).
fof(f138,plain,
( ~ neq(sK3,nil)
| segmentP(sK2,sK4) ),
inference(cnf_transformation,[],[f118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SWC069+1 : TPTP v8.2.0. Released v2.4.0.
% 0.16/0.16 % 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.17/0.40 % Computer : n004.cluster.edu
% 0.17/0.40 % Model : x86_64 x86_64
% 0.17/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.40 % Memory : 8042.1875MB
% 0.17/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.40 % CPULimit : 300
% 0.17/0.40 % WCLimit : 300
% 0.17/0.40 % DateTime : Sun May 19 03:42:38 EDT 2024
% 0.17/0.40 % CPUTime :
% 0.17/0.40 This is a FOF_THM_RFO_SEQ problem
% 0.17/0.40 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.70/0.89 % (21201)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 (2995ds/34Mi)
% 0.70/0.89 % (21203)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.70/0.89 % (21202)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 (2995ds/51Mi)
% 0.70/0.89 % (21204)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.70/0.89 % (21205)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 theBenchmark for (2995ds/34Mi)
% 0.70/0.89 % (21206)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.70/0.90 % (21207)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 (2995ds/83Mi)
% 0.70/0.90 % (21208)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 (2995ds/56Mi)
% 0.70/0.90 % (21204)First to succeed.
% 0.70/0.90 % (21203)Also succeeded, but the first one will report.
% 0.70/0.90 % (21206)Also succeeded, but the first one will report.
% 0.70/0.90 % (21204)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21200"
% 0.70/0.90 % (21204)Refutation found. Thanks to Tanya!
% 0.70/0.90 % SZS status Theorem for theBenchmark
% 0.70/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.70/0.90 % (21204)------------------------------
% 0.70/0.90 % (21204)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.70/0.90 % (21204)Termination reason: Refutation
% 0.70/0.90
% 0.70/0.90 % (21204)Memory used [KB]: 1176
% 0.70/0.90 % (21204)Time elapsed: 0.006 s
% 0.70/0.90 % (21204)Instructions burned: 7 (million)
% 0.70/0.90 % (21200)Success in time 0.489 s
% 0.70/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------