TSTP Solution File: LCL636+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL636+1.001 : TPTP v8.2.0. Released v4.0.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 : n005.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 00:16:17 EDT 2024
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 476 ( 0 equ)
% Maximal formula atoms : 69 ( 28 avg)
% Number of connectives : 841 ( 382 ~; 282 |; 177 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 12 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 106 ( 91 !; 15 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f62,plain,
$false,
inference(unit_resulting_resolution,[],[f36,f38,f29]) ).
fof(f29,plain,
! [X14] :
( ~ r1(sK0,X14)
| p2(X14) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X2] :
( ~ p100(X2)
| ~ p1(X2)
| ~ r1(X0,X2) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X3] :
( ~ p101(X3)
| p2(X3)
| ~ r1(X0,X3) ) )
& ( p2(X0)
| ! [X4] :
( ~ p101(X4)
| ~ p2(X4)
| ~ r1(X0,X4) ) ) ) )
& ( ~ p100(X0)
| p101(X0)
| ( ? [X5] :
( p101(X5)
& p2(X5)
& r1(X0,X5) )
& ? [X6] :
( p101(X6)
& ~ p2(X6)
& r1(X0,X6) ) ) )
& ! [X7] :
( ( ( ~ p101(X7)
| p100(X7) )
& ( ~ p100(X7)
| ( ( ~ p1(X7)
| ! [X8] :
( ~ p100(X8)
| p1(X8)
| ~ r1(X7,X8) ) )
& ( p1(X7)
| ! [X9] :
( ~ p100(X9)
| ~ p1(X9)
| ~ r1(X7,X9) ) ) ) )
& ( ~ p101(X7)
| ( ( ~ p2(X7)
| ! [X10] :
( ~ p101(X10)
| p2(X10)
| ~ r1(X7,X10) ) )
& ( p2(X7)
| ! [X11] :
( ~ p101(X11)
| ~ p2(X11)
| ~ r1(X7,X11) ) ) ) )
& ( ~ p100(X7)
| p101(X7)
| ( ? [X12] :
( p101(X12)
& p2(X12)
& r1(X7,X12) )
& ? [X13] :
( p101(X13)
& ~ p2(X13)
& r1(X7,X13) ) ) ) )
| ~ r1(X0,X7) )
& ! [X14] :
( p2(X14)
| ~ r1(X0,X14) ) ),
inference(flattening,[],[f6]) ).
fof(f6,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X2] :
( ~ p100(X2)
| ~ p1(X2)
| ~ r1(X0,X2) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X3] :
( ~ p101(X3)
| p2(X3)
| ~ r1(X0,X3) ) )
& ( p2(X0)
| ! [X4] :
( ~ p101(X4)
| ~ p2(X4)
| ~ r1(X0,X4) ) ) ) )
& ( ~ p100(X0)
| p101(X0)
| ( ? [X5] :
( p101(X5)
& p2(X5)
& r1(X0,X5) )
& ? [X6] :
( p101(X6)
& ~ p2(X6)
& r1(X0,X6) ) ) )
& ! [X7] :
( ( ( ~ p101(X7)
| p100(X7) )
& ( ~ p100(X7)
| ( ( ~ p1(X7)
| ! [X8] :
( ~ p100(X8)
| p1(X8)
| ~ r1(X7,X8) ) )
& ( p1(X7)
| ! [X9] :
( ~ p100(X9)
| ~ p1(X9)
| ~ r1(X7,X9) ) ) ) )
& ( ~ p101(X7)
| ( ( ~ p2(X7)
| ! [X10] :
( ~ p101(X10)
| p2(X10)
| ~ r1(X7,X10) ) )
& ( p2(X7)
| ! [X11] :
( ~ p101(X11)
| ~ p2(X11)
| ~ r1(X7,X11) ) ) ) )
& ( ~ p100(X7)
| p101(X7)
| ( ? [X12] :
( p101(X12)
& p2(X12)
& r1(X7,X12) )
& ? [X13] :
( p101(X13)
& ~ p2(X13)
& r1(X7,X13) ) ) ) )
| ~ r1(X0,X7) )
& ! [X14] :
( p2(X14)
| ~ r1(X0,X14) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X2] :
( ~ p100(X2)
| ~ p1(X2)
| ~ r1(X0,X2) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X3] :
( ~ p101(X3)
| p2(X3)
| ~ r1(X0,X3) ) )
& ( p2(X0)
| ! [X4] :
( ~ p101(X4)
| ~ p2(X4)
| ~ r1(X0,X4) ) ) ) )
& ( ~ ( p100(X0)
& ~ p101(X0) )
| ( ~ ! [X5] :
( ~ ( p101(X5)
& p2(X5) )
| ~ r1(X0,X5) )
& ~ ! [X6] :
( ~ ( p101(X6)
& ~ p2(X6) )
| ~ r1(X0,X6) ) ) )
& ! [X7] :
( ( ( ~ p101(X7)
| p100(X7) )
& ( ~ p100(X7)
| ( ( ~ p1(X7)
| ! [X8] :
( ~ p100(X8)
| p1(X8)
| ~ r1(X7,X8) ) )
& ( p1(X7)
| ! [X9] :
( ~ p100(X9)
| ~ p1(X9)
| ~ r1(X7,X9) ) ) ) )
& ( ~ p101(X7)
| ( ( ~ p2(X7)
| ! [X10] :
( ~ p101(X10)
| p2(X10)
| ~ r1(X7,X10) ) )
& ( p2(X7)
| ! [X11] :
( ~ p101(X11)
| ~ p2(X11)
| ~ r1(X7,X11) ) ) ) )
& ( ~ ( p100(X7)
& ~ p101(X7) )
| ( ~ ! [X12] :
( ~ ( p101(X12)
& p2(X12) )
| ~ r1(X7,X12) )
& ~ ! [X13] :
( ~ ( p101(X13)
& ~ p2(X13) )
| ~ r1(X7,X13) ) ) ) )
| ~ r1(X0,X7) ) )
| ~ ! [X14] :
( p2(X14)
| ~ r1(X0,X14) ) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f4,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p102(X0)
| p101(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X2] :
( ~ p100(X2)
| ~ p1(X2)
| ~ r1(X0,X2) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X3] :
( ~ p101(X3)
| p2(X3)
| ~ r1(X0,X3) ) )
& ( p2(X0)
| ! [X4] :
( ~ p101(X4)
| ~ p2(X4)
| ~ r1(X0,X4) ) ) ) )
& ( ~ ( p100(X0)
& ~ p101(X0) )
| ( ~ ! [X5] :
( ~ ( p101(X5)
& ~ p102(X5)
& p2(X5) )
| ~ r1(X0,X5) )
& ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& ~ p2(X6) )
| ~ r1(X0,X6) ) ) )
& ! [X7] :
( ( ( ~ p101(X7)
| p100(X7) )
& ( ~ p102(X7)
| p101(X7) )
& ( ~ p100(X7)
| ( ( ~ p1(X7)
| ! [X8] :
( ~ p100(X8)
| p1(X8)
| ~ r1(X7,X8) ) )
& ( p1(X7)
| ! [X9] :
( ~ p100(X9)
| ~ p1(X9)
| ~ r1(X7,X9) ) ) ) )
& ( ~ p101(X7)
| ( ( ~ p2(X7)
| ! [X10] :
( ~ p101(X10)
| p2(X10)
| ~ r1(X7,X10) ) )
& ( p2(X7)
| ! [X11] :
( ~ p101(X11)
| ~ p2(X11)
| ~ r1(X7,X11) ) ) ) )
& ( ~ ( p100(X7)
& ~ p101(X7) )
| ( ~ ! [X12] :
( ~ ( p101(X12)
& ~ p102(X12)
& p2(X12) )
| ~ r1(X7,X12) )
& ~ ! [X13] :
( ~ ( p101(X13)
& ~ p102(X13)
& ~ p2(X13) )
| ~ r1(X7,X13) ) ) ) )
| ~ r1(X0,X7) ) )
| ~ ! [X14] :
( p2(X14)
| ~ r1(X0,X14) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p102(X0)
| p101(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X2] :
( ~ p100(X2)
| ~ p1(X2)
| ~ r1(X0,X2) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X3] :
( ~ p101(X3)
| p2(X3)
| ~ r1(X0,X3) ) )
& ( p2(X0)
| ! [X4] :
( ~ p101(X4)
| ~ p2(X4)
| ~ r1(X0,X4) ) ) ) )
& ( ~ ( p100(X0)
& ~ p101(X0) )
| ( ~ ! [X5] :
( ~ ( p101(X5)
& ~ p102(X5)
& p2(X5) )
| ~ r1(X0,X5) )
& ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& ~ p2(X6) )
| ~ r1(X0,X6) ) ) )
& ! [X7] :
( ( ( ~ p101(X7)
| p100(X7) )
& ( ~ p102(X7)
| p101(X7) )
& ( ~ p100(X7)
| ( ( ~ p1(X7)
| ! [X8] :
( ~ p100(X8)
| p1(X8)
| ~ r1(X7,X8) ) )
& ( p1(X7)
| ! [X9] :
( ~ p100(X9)
| ~ p1(X9)
| ~ r1(X7,X9) ) ) ) )
& ( ~ p101(X7)
| ( ( ~ p2(X7)
| ! [X10] :
( ~ p101(X10)
| p2(X10)
| ~ r1(X7,X10) ) )
& ( p2(X7)
| ! [X11] :
( ~ p101(X11)
| ~ p2(X11)
| ~ r1(X7,X11) ) ) ) )
& ( ~ ( p100(X7)
& ~ p101(X7) )
| ( ~ ! [X12] :
( ~ ( p101(X12)
& ~ p102(X12)
& p2(X12) )
| ~ r1(X7,X12) )
& ~ ! [X13] :
( ~ ( p101(X13)
& ~ p102(X13)
& ~ p2(X13) )
| ~ r1(X7,X13) ) ) ) )
| ~ r1(X0,X7) ) )
| ~ ! [X14] :
( p2(X14)
| ~ r1(X0,X14) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p102(X0)
| p101(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X0,X1) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X0,X1) ) )
& ( p2(X0)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X0,X1) ) ) ) )
& ( ~ ( p100(X0)
& ~ p101(X0) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X0,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X0,X1) ) ) )
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ( ~ p101(X0)
| p100(X0) )
& ( ~ p102(X0)
| p101(X0) )
& ( ~ p100(X0)
| ( ( ~ p1(X0)
| ! [X1] :
( ~ p100(X1)
| p1(X1)
| ~ r1(X0,X1) ) )
& ( p1(X0)
| ! [X1] :
( ~ p100(X1)
| ~ p1(X1)
| ~ r1(X0,X1) ) ) ) )
& ( ~ p101(X0)
| ( ( ~ p2(X0)
| ! [X1] :
( ~ p101(X1)
| p2(X1)
| ~ r1(X0,X1) ) )
& ( p2(X0)
| ! [X1] :
( ~ p101(X1)
| ~ p2(X1)
| ~ r1(X0,X1) ) ) ) )
& ( ~ ( p100(X0)
& ~ p101(X0) )
| ( ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& p2(X1) )
| ~ r1(X0,X1) )
& ~ ! [X1] :
( ~ ( p101(X1)
& ~ p102(X1)
& ~ p2(X1) )
| ~ r1(X0,X1) ) ) )
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f38,plain,
r1(sK0,sK1),
inference(subsumption_resolution,[],[f37,f32]) ).
fof(f32,plain,
p100(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f37,plain,
( r1(sK0,sK1)
| ~ p100(sK0) ),
inference(subsumption_resolution,[],[f25,f31]) ).
fof(f31,plain,
~ p101(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f25,plain,
( r1(sK0,sK1)
| p101(sK0)
| ~ p100(sK0) ),
inference(cnf_transformation,[],[f7]) ).
fof(f36,plain,
~ p2(sK1),
inference(subsumption_resolution,[],[f35,f32]) ).
fof(f35,plain,
( ~ p2(sK1)
| ~ p100(sK0) ),
inference(subsumption_resolution,[],[f26,f31]) ).
fof(f26,plain,
( ~ p2(sK1)
| p101(sK0)
| ~ p100(sK0) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL636+1.001 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.14 % 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.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % 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 : Mon May 20 03:31:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_NEQ 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.57/0.73 % (25162)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.57/0.73 % (25156)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.57/0.73 % (25158)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.57/0.73 % (25157)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.57/0.73 % (25160)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.57/0.73 % (25161)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.57/0.73 % (25159)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.57/0.73 % (25162)First to succeed.
% 0.57/0.74 % (25162)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-25155"
% 0.57/0.74 % (25162)Refutation found. Thanks to Tanya!
% 0.57/0.74 % SZS status Theorem for theBenchmark
% 0.57/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.57/0.74 % (25162)------------------------------
% 0.57/0.74 % (25162)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.74 % (25162)Termination reason: Refutation
% 0.57/0.74
% 0.57/0.74 % (25162)Memory used [KB]: 983
% 0.57/0.74 % (25162)Time elapsed: 0.003 s
% 0.57/0.74 % (25162)Instructions burned: 5 (million)
% 0.57/0.74 % (25155)Success in time 0.364 s
% 0.57/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------