TSTP Solution File: SWC217+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC217+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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:37:13 EDT 2024
% Result : Theorem 0.54s 0.75s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 261 ( 86 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 304 ( 91 ~; 70 |; 118 &)
% ( 6 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 24 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f264,plain,
$false,
inference(avatar_sat_refutation,[],[f226,f231,f241,f250,f263]) ).
fof(f263,plain,
spl11_5,
inference(avatar_contradiction_clause,[],[f262]) ).
fof(f262,plain,
( $false
| spl11_5 ),
inference(subsumption_resolution,[],[f261,f151]) ).
fof(f151,plain,
ssList(sK2),
inference(cnf_transformation,[],[f129]) ).
fof(f129,plain,
( ( ~ neq(sK3,nil)
| ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ neq(sK0,nil)
& 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])],[f99,f128,f127,f126,f125,f124]) ).
fof(f124,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X4] :
( memberP(sK3,X4)
& cons(X4,nil) = sK2
& ssItem(X4) )
=> ( memberP(sK3,sK4)
& sK2 = cons(sK4,nil)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& neq(X1,nil)
& 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] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ~ neq(X1,nil)
| 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)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f261,plain,
( ~ ssList(sK2)
| spl11_5 ),
inference(subsumption_resolution,[],[f260,f176]) ).
fof(f176,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f260,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| spl11_5 ),
inference(subsumption_resolution,[],[f255,f234]) ).
fof(f234,plain,
( nil != sK2
| spl11_5 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f233,plain,
( spl11_5
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f255,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f173,f199]) ).
fof(f199,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f156,f154]) ).
fof(f154,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f129]) ).
fof(f156,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f129]) ).
fof(f173,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,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/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f250,plain,
( ~ spl11_5
| ~ spl11_3
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f249,f228,f223,f233]) ).
fof(f223,plain,
( spl11_3
<=> sK2 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f228,plain,
( spl11_4
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f249,plain,
( nil != sK2
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f248,f176]) ).
fof(f248,plain,
( nil != sK2
| ~ ssList(nil)
| ~ spl11_3
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f247,f230]) ).
fof(f230,plain,
( ssItem(sK4)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f228]) ).
fof(f247,plain,
( nil != sK2
| ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl11_3 ),
inference(superposition,[],[f164,f225]) ).
fof(f225,plain,
( sK2 = cons(sK4,nil)
| ~ spl11_3 ),
inference(avatar_component_clause,[],[f223]) ).
fof(f164,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax21) ).
fof(f241,plain,
spl11_2,
inference(avatar_split_clause,[],[f200,f218]) ).
fof(f218,plain,
( spl11_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f200,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f155,f153]) ).
fof(f153,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f155,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f129]) ).
fof(f231,plain,
( spl11_4
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f158,f218,f228]) ).
fof(f158,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f226,plain,
( spl11_3
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f159,f218,f223]) ).
fof(f159,plain,
( ~ neq(sK3,nil)
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f129]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC217+1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/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.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 02:47:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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/benchmark/theBenchmark.p
% 0.54/0.74 % (31218)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.54/0.74 % (31212)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.54/0.74 % (31214)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.74 % (31213)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.54/0.74 % (31215)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.54/0.74 % (31216)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 (2996ds/34Mi)
% 0.54/0.74 % (31217)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.54/0.74 % (31217)Also succeeded, but the first one will report.
% 0.54/0.74 % (31214)First to succeed.
% 0.54/0.75 % (31218)Also succeeded, but the first one will report.
% 0.54/0.75 % (31215)Also succeeded, but the first one will report.
% 0.54/0.75 % (31214)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31208"
% 0.54/0.75 % (31214)Refutation found. Thanks to Tanya!
% 0.54/0.75 % SZS status Theorem for theBenchmark
% 0.54/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.75 % (31214)------------------------------
% 0.54/0.75 % (31214)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75 % (31214)Termination reason: Refutation
% 0.54/0.75
% 0.54/0.75 % (31214)Memory used [KB]: 1167
% 0.54/0.75 % (31214)Time elapsed: 0.007 s
% 0.54/0.75 % (31214)Instructions burned: 8 (million)
% 0.54/0.75 % (31208)Success in time 0.375 s
% 0.54/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------