TSTP Solution File: SWC134+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC134+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 : n032.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:28 EDT 2024
% Result : Theorem 0.61s 0.79s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 136 ( 37 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 152 ( 48 ~; 21 |; 66 &)
% ( 3 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f241,plain,
$false,
inference(avatar_sat_refutation,[],[f235,f240]) ).
fof(f240,plain,
~ spl15_3,
inference(avatar_contradiction_clause,[],[f239]) ).
fof(f239,plain,
( $false
| ~ spl15_3 ),
inference(subsumption_resolution,[],[f237,f168]) ).
fof(f168,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax60) ).
fof(f237,plain,
( ~ cyclefreeP(nil)
| ~ spl15_3 ),
inference(superposition,[],[f207,f231]) ).
fof(f231,plain,
( nil = sK5
| ~ spl15_3 ),
inference(avatar_component_clause,[],[f229]) ).
fof(f229,plain,
( spl15_3
<=> nil = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl15_3])]) ).
fof(f207,plain,
~ cyclefreeP(sK5),
inference(definition_unfolding,[],[f162,f159]) ).
fof(f159,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ~ cyclefreeP(sK3)
& ~ neq(sK5,nil)
& sK2 = sK4
& sK3 = sK5
& ssList(sK5)
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f99,f134,f133,f132,f131]) ).
fof(f131,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& sK2 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& sK2 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = X2
& sK3 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = X2
& sK3 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = sK4
& sK3 = X3
& ssList(X3) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = sK4
& sK3 = X3
& ssList(X3) )
=> ( ~ cyclefreeP(sK3)
& ~ neq(sK5,nil)
& sK2 = sK4
& sK3 = sK5
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,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)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f162,plain,
~ cyclefreeP(sK3),
inference(cnf_transformation,[],[f135]) ).
fof(f235,plain,
spl15_3,
inference(avatar_split_clause,[],[f234,f229]) ).
fof(f234,plain,
nil = sK5,
inference(subsumption_resolution,[],[f233,f158]) ).
fof(f158,plain,
ssList(sK5),
inference(cnf_transformation,[],[f135]) ).
fof(f233,plain,
( nil = sK5
| ~ ssList(sK5) ),
inference(subsumption_resolution,[],[f219,f167]) ).
fof(f167,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f219,plain,
( nil = sK5
| ~ ssList(nil)
| ~ ssList(sK5) ),
inference(resolution,[],[f161,f164]) ).
fof(f164,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,[],[f100]) ).
fof(f100,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(f161,plain,
~ neq(sK5,nil),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC134+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.12 % 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.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 03:51:07 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.61/0.78 % (600)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.61/0.78 % (602)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.61/0.78 % (601)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.61/0.78 % (598)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.61/0.78 % (603)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.61/0.78 % (604)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.61/0.78 % (605)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.61/0.78 % (599)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.61/0.79 % (605)Refutation not found, incomplete strategy% (605)------------------------------
% 0.61/0.79 % (605)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (605)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.79
% 0.61/0.79 % (605)Memory used [KB]: 1138
% 0.61/0.79 % (605)Time elapsed: 0.003 s
% 0.61/0.79 % (605)Instructions burned: 5 (million)
% 0.61/0.79 % (605)------------------------------
% 0.61/0.79 % (605)------------------------------
% 0.61/0.79 % (603)First to succeed.
% 0.61/0.79 % (601)Also succeeded, but the first one will report.
% 0.61/0.79 % (603)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-597"
% 0.61/0.79 % (600)Also succeeded, but the first one will report.
% 0.61/0.79 % (603)Refutation found. Thanks to Tanya!
% 0.61/0.79 % SZS status Theorem for theBenchmark
% 0.61/0.79 % SZS output start Proof for theBenchmark
% See solution above
% 0.61/0.79 % (603)------------------------------
% 0.61/0.79 % (603)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.79 % (603)Termination reason: Refutation
% 0.61/0.79
% 0.61/0.79 % (603)Memory used [KB]: 1151
% 0.61/0.79 % (603)Time elapsed: 0.004 s
% 0.61/0.79 % (603)Instructions burned: 6 (million)
% 0.61/0.79 % (597)Success in time 0.458 s
% 0.61/0.79 % Vampire---4.8 exiting
%------------------------------------------------------------------------------