TSTP Solution File: LCL682+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL682+1.001 : TPTP v8.1.2. 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 : n023.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 : Sun May 5 07:41:14 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 28 ( 5 unt; 0 def)
% Number of atoms : 279 ( 0 equ)
% Maximal formula atoms : 28 ( 9 avg)
% Number of connectives : 458 ( 207 ~; 180 |; 62 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 192 ( 132 !; 60 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f63,plain,
$false,
inference(subsumption_resolution,[],[f60,f34]) ).
fof(f34,plain,
~ p12(sK4),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
( r1(sK1,sK2)
& r1(sK0,sK1)
& ~ p12(sK4)
& r1(sK3,sK4)
& r1(sK0,sK3)
& r1(sK5,sK6)
& r1(sK0,sK5)
& r1(sK7,sK8)
& r1(sK0,sK7)
& ! [X9] :
( ( ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
& ! [X11] :
( p12(X11)
| ~ r1(X9,X11) ) )
| ~ r1(sK0,X9) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f15,f24,f23,f22,f21,f20,f19,f18,f17,f16]) ).
fof(f16,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(X0,X1) )
& ? [X3] :
( ? [X4] :
( ~ p12(X4)
& r1(X3,X4) )
& r1(X0,X3) )
& ? [X5] :
( ? [X6] : r1(X5,X6)
& r1(X0,X5) )
& ? [X7] :
( ? [X8] : r1(X7,X8)
& r1(X0,X7) )
& ! [X9] :
( ( ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
& ! [X11] :
( p12(X11)
| ~ r1(X9,X11) ) )
| ~ r1(X0,X9) ) )
=> ( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(sK0,X1) )
& ? [X3] :
( ? [X4] :
( ~ p12(X4)
& r1(X3,X4) )
& r1(sK0,X3) )
& ? [X5] :
( ? [X6] : r1(X5,X6)
& r1(sK0,X5) )
& ? [X7] :
( ? [X8] : r1(X7,X8)
& r1(sK0,X7) )
& ! [X9] :
( ( ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
& ! [X11] :
( p12(X11)
| ~ r1(X9,X11) ) )
| ~ r1(sK0,X9) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(sK0,X1) )
=> ( ? [X2] : r1(sK1,X2)
& r1(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
( ? [X2] : r1(sK1,X2)
=> r1(sK1,sK2) ),
introduced(choice_axiom,[]) ).
fof(f19,plain,
( ? [X3] :
( ? [X4] :
( ~ p12(X4)
& r1(X3,X4) )
& r1(sK0,X3) )
=> ( ? [X4] :
( ~ p12(X4)
& r1(sK3,X4) )
& r1(sK0,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
( ? [X4] :
( ~ p12(X4)
& r1(sK3,X4) )
=> ( ~ p12(sK4)
& r1(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
( ? [X5] :
( ? [X6] : r1(X5,X6)
& r1(sK0,X5) )
=> ( ? [X6] : r1(sK5,X6)
& r1(sK0,sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
( ? [X6] : r1(sK5,X6)
=> r1(sK5,sK6) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
( ? [X7] :
( ? [X8] : r1(X7,X8)
& r1(sK0,X7) )
=> ( ? [X8] : r1(sK7,X8)
& r1(sK0,sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
( ? [X8] : r1(sK7,X8)
=> r1(sK7,sK8) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0] :
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(X0,X1) )
& ? [X3] :
( ? [X4] :
( ~ p12(X4)
& r1(X3,X4) )
& r1(X0,X3) )
& ? [X5] :
( ? [X6] : r1(X5,X6)
& r1(X0,X5) )
& ? [X7] :
( ? [X8] : r1(X7,X8)
& r1(X0,X7) )
& ! [X9] :
( ( ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
& ! [X11] :
( p12(X11)
| ~ r1(X9,X11) ) )
| ~ r1(X0,X9) ) ),
inference(rectify,[],[f12]) ).
fof(f12,plain,
? [X0] :
( ? [X1] :
( ? [X2] : r1(X1,X2)
& r1(X0,X1) )
& ? [X3] :
( ? [X4] :
( ~ p12(X4)
& r1(X3,X4) )
& r1(X0,X3) )
& ? [X5] :
( ? [X6] : r1(X5,X6)
& r1(X0,X5) )
& ? [X7] :
( ? [X8] : r1(X7,X8)
& r1(X0,X7) )
& ! [X9] :
( ( ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
& ! [X12] :
( p12(X12)
| ~ r1(X9,X12) ) )
| ~ r1(X0,X9) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,plain,
? [X0] :
~ ( ! [X1] :
( ! [X2] : ~ r1(X1,X2)
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] : ~ r1(X5,X6)
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] : ~ r1(X7,X8)
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) ) )
| ~ r1(X0,X9) ) ),
inference(pure_predicate_removal,[],[f10]) ).
fof(f10,plain,
? [X0] :
~ ( ! [X1] :
( ! [X2] : ~ r1(X1,X2)
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] : ~ r1(X5,X6)
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] : ~ r1(X7,X8)
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) )
| ~ ! [X13] :
( p16(X13)
| ~ r1(X9,X13) ) )
| ~ r1(X0,X9) ) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X1] :
( ! [X2] : ~ r1(X1,X2)
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] : ~ r1(X5,X6)
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] : ~ r1(X7,X8)
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X9,X11) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) )
| ~ ! [X13] :
( p16(X13)
| ~ r1(X9,X13) ) )
| ~ r1(X0,X9) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X1] :
( ! [X2] : ~ r1(X1,X2)
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] : ~ r1(X5,X6)
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] :
( p15(X8)
| ~ r1(X7,X8) )
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X9,X11) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) )
| ~ ! [X13] :
( p16(X13)
| ~ r1(X9,X13) ) )
| ~ r1(X0,X9) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X1] :
( ! [X2] : ~ r1(X1,X2)
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] :
( p13(X6)
| ~ r1(X5,X6) )
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] :
( p15(X8)
| ~ r1(X7,X8) )
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X9,X11) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) )
| ~ ! [X13] :
( p16(X13)
| ~ r1(X9,X13) ) )
| ~ r1(X0,X9) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] :
( ! [X2] :
( p11(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] :
( p13(X6)
| ~ r1(X5,X6) )
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] :
( p15(X8)
| ~ r1(X7,X8) )
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X9,X11) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) )
| ~ ! [X13] :
( p16(X13)
| ~ r1(X9,X13) ) )
| ~ r1(X0,X9) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ! [X2] :
( p11(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) )
| ! [X3] :
( ! [X4] :
( p12(X4)
| ~ r1(X3,X4) )
| ~ r1(X0,X3) )
| ! [X5] :
( ! [X6] :
( p13(X6)
| ~ r1(X5,X6) )
| ~ r1(X0,X5) )
| ! [X7] :
( ! [X8] :
( p15(X8)
| ~ r1(X7,X8) )
| ~ r1(X0,X7) )
| ~ ! [X9] :
( ~ ( ~ ! [X10] :
( p12(X10)
| ~ r1(X9,X10) )
| ~ ! [X11] :
( p14(X11)
| ~ r1(X9,X11) )
| ~ ! [X12] :
( p12(X12)
| ~ r1(X9,X12) )
| ~ ! [X13] :
( p16(X13)
| ~ r1(X9,X13) ) )
| ~ r1(X0,X9) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( ! [X0] :
( p11(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( p13(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( p15(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ ( ~ ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( p14(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( p16(X0)
| ~ r1(X1,X0) ) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( ! [X0] :
( p11(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( p13(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ! [X1] :
( ! [X0] :
( p15(X0)
| ~ r1(X1,X0) )
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ ( ~ ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( p14(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( p12(X0)
| ~ r1(X1,X0) )
| ~ ! [X0] :
( p16(X0)
| ~ r1(X1,X0) ) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.JE4b4YvYAE/Vampire---4.8_13646',main) ).
fof(f60,plain,
p12(sK4),
inference(resolution,[],[f40,f33]) ).
fof(f33,plain,
r1(sK3,sK4),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X0] :
( ~ r1(sK3,X0)
| p12(X0) ),
inference(resolution,[],[f26,f32]) ).
fof(f32,plain,
r1(sK0,sK3),
inference(cnf_transformation,[],[f25]) ).
fof(f26,plain,
! [X11,X9] :
( ~ r1(sK0,X9)
| ~ r1(X9,X11)
| p12(X11) ),
inference(cnf_transformation,[],[f25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL682+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.12/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 : n023.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.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 13:38:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_EPR_NEQ 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.JE4b4YvYAE/Vampire---4.8_13646
% 0.59/0.76 % (13903)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.59/0.76 % (13905)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.59/0.76 % (13906)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.59/0.76 % (13907)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.59/0.76 % (13904)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.59/0.76 % (13908)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.59/0.76 % (13909)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.59/0.76 % (13910)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.59/0.76 % (13903)First to succeed.
% 0.59/0.76 % (13905)Also succeeded, but the first one will report.
% 0.59/0.76 % (13906)Also succeeded, but the first one will report.
% 0.59/0.76 % (13904)Also succeeded, but the first one will report.
% 0.59/0.76 % (13908)Also succeeded, but the first one will report.
% 0.59/0.76 % (13910)Also succeeded, but the first one will report.
% 0.59/0.76 % (13907)Also succeeded, but the first one will report.
% 0.59/0.76 % (13903)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13893"
% 0.59/0.76 % (13903)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (13903)------------------------------
% 0.59/0.76 % (13903)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.76 % (13903)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (13903)Memory used [KB]: 988
% 0.59/0.76 % (13903)Time elapsed: 0.003 s
% 0.59/0.76 % (13903)Instructions burned: 5 (million)
% 0.59/0.76 % (13893)Success in time 0.386 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------