TSTP Solution File: LCL664+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL664+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 : n007.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:39:31 EDT 2024
% Result : Theorem 0.61s 0.84s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 300 ( 135 ~; 128 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 112 ( 80 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f31,plain,
$false,
inference(subsumption_resolution,[],[f28,f24]) ).
fof(f24,plain,
~ p12(sK2),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( r1(sK0,sK1)
& ~ p12(sK2)
& r1(sK0,sK2)
& r1(sK0,sK3)
& r1(sK0,sK4)
& ! [X5] :
( p12(X5)
| ~ r1(sK0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(sK0,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f12,f17,f16,f15,f14,f13]) ).
fof(f13,plain,
( ? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(X0,X6) ) )
=> ( ? [X1] : r1(sK0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(sK0,X2) )
& ? [X3] : r1(sK0,X3)
& ? [X4] : r1(sK0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(sK0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(sK0,X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ? [X1] : r1(sK0,X1)
=> r1(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X2] :
( ~ p12(X2)
& r1(sK0,X2) )
=> ( ~ p12(sK2)
& r1(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X3] : r1(sK0,X3)
=> r1(sK0,sK3) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X4] : r1(sK0,X4)
=> r1(sK0,sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(X0,X6) ) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
& ! [X7] :
( p12(X7)
| ~ r1(X0,X7) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) ) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p13(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f5,plain,
? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p13(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p13(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p15(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p14(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p15(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p14(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.KJMHBXbrXV/Vampire---4.8_2809',main) ).
fof(f28,plain,
p12(sK2),
inference(resolution,[],[f19,f23]) ).
fof(f23,plain,
r1(sK0,sK2),
inference(cnf_transformation,[],[f18]) ).
fof(f19,plain,
! [X6] :
( ~ r1(sK0,X6)
| p12(X6) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL664+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.15/0.36 % Computer : n007.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 : Fri May 3 13:38:35 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_EPR_NEQ problem
% 0.15/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.KJMHBXbrXV/Vampire---4.8_2809
% 0.61/0.83 % (3162)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 (2995ds/34Mi)
% 0.61/0.83 % (3163)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 (2995ds/51Mi)
% 0.61/0.83 % (3166)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 (2995ds/34Mi)
% 0.61/0.83 % (3167)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.83 % (3168)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 (2995ds/83Mi)
% 0.61/0.83 % (3164)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.83 % (3165)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.83 % (3169)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 (2995ds/56Mi)
% 0.61/0.83 % (3163)Also succeeded, but the first one will report.
% 0.61/0.83 % (3166)Also succeeded, but the first one will report.
% 0.61/0.83 % (3167)Also succeeded, but the first one will report.
% 0.61/0.83 % (3162)First to succeed.
% 0.61/0.83 % (3164)Also succeeded, but the first one will report.
% 0.61/0.83 % (3169)Also succeeded, but the first one will report.
% 0.61/0.83 % (3168)Also succeeded, but the first one will report.
% 0.61/0.83 % (3165)Also succeeded, but the first one will report.
% 0.61/0.84 % (3162)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3063"
% 0.61/0.84 % (3162)Refutation found. Thanks to Tanya!
% 0.61/0.84 % SZS status Theorem for Vampire---4
% 0.61/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.84 % (3162)------------------------------
% 0.61/0.84 % (3162)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.84 % (3162)Termination reason: Refutation
% 0.61/0.84
% 0.61/0.84 % (3162)Memory used [KB]: 961
% 0.61/0.84 % (3162)Time elapsed: 0.003 s
% 0.61/0.84 % (3162)Instructions burned: 3 (million)
% 0.61/0.84 % (3063)Success in time 0.464 s
% 0.61/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------