TSTP Solution File: LCL648+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL648+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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:51 EDT 2024
% Result : Theorem 0.55s 0.72s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 5 unt; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 104 ( 50 ~; 25 |; 27 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 26 ( 14 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f16,plain,
$false,
inference(subsumption_resolution,[],[f15,f11]) ).
fof(f11,plain,
r1(sK0,sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
( p101(sK1)
& p201(sK1)
& r1(sK0,sK1)
& ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(sK0,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
( ? [X1] :
( p101(X1)
& p201(X1)
& r1(X0,X1) )
& ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X0,X2) ) )
=> ( ? [X1] :
( p101(X1)
& p201(X1)
& r1(sK0,X1) )
& ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(sK0,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X1] :
( p101(X1)
& p201(X1)
& r1(sK0,X1) )
=> ( p101(sK1)
& p201(sK1)
& r1(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
? [X0] :
( ? [X1] :
( p101(X1)
& p201(X1)
& r1(X0,X1) )
& ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X0,X2) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
? [X0] :
( ? [X1] :
( p101(X1)
& p201(X1)
& r1(X0,X1) )
& ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X0,X2) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,plain,
? [X0] :
~ ( ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) )
| ~ ! [X2] :
( ~ ( p101(X2)
& p201(X2) )
| ~ r1(X0,X2) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) )
| ~ ! [X2] :
( ~ ( p101(X2)
& p201(X2) )
| ~ r1(X0,X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) )
| ~ ! [X1] :
( ~ ( p101(X1)
& p201(X1) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f15,plain,
~ r1(sK0,sK1),
inference(subsumption_resolution,[],[f14,f12]) ).
fof(f12,plain,
p201(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f14,plain,
( ~ p201(sK1)
| ~ r1(sK0,sK1) ),
inference(resolution,[],[f10,f13]) ).
fof(f13,plain,
p101(sK1),
inference(cnf_transformation,[],[f9]) ).
fof(f10,plain,
! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(sK0,X2) ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL648+1.001 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 02:20:08 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_EPR_NEQ problem
% 0.12/0.34 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.72 % (380)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 (2996ds/56Mi)
% 0.55/0.72 % (380)First to succeed.
% 0.55/0.72 % (380)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32685"
% 0.55/0.72 % (375)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.72 % (373)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.55/0.72 % (374)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.55/0.72 % (377)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.55/0.72 % (376)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.55/0.72 % (378)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.55/0.72 % (379)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.55/0.72 % (380)Refutation found. Thanks to Tanya!
% 0.55/0.72 % SZS status Theorem for theBenchmark
% 0.55/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.72 % (380)------------------------------
% 0.55/0.72 % (380)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.72 % (380)Termination reason: Refutation
% 0.55/0.72
% 0.55/0.72 % (380)Memory used [KB]: 957
% 0.55/0.72 % (380)Time elapsed: 0.002 s
% 0.55/0.72 % (380)Instructions burned: 2 (million)
% 0.55/0.72 % (32685)Success in time 0.382 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------