TSTP Solution File: LCL684+1.001 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL684+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 : n002.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:22:00 EDT 2024
% Result : Theorem 0.50s 0.69s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 6 unt; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 111 ( 59 ~; 33 |; 18 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 29 ( 22 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,plain,
$false,
inference(subsumption_resolution,[],[f20,f17]) ).
fof(f17,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f20,plain,
~ r1(sK0,sK0),
inference(subsumption_resolution,[],[f19,f15]) ).
fof(f15,plain,
p101(sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( p101(sK0)
& p201(sK0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(sK0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f11]) ).
fof(f11,plain,
( ? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) )
=> ( p101(sK0)
& p201(sK0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(sK0,X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
? [X0] :
( p101(X0)
& p201(X0)
& ! [X1] :
( ! [X2] :
( ~ p101(X2)
| ~ p201(X2)
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X2] :
( ~ ( p101(X2)
& p201(X2) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X2] :
( ~ ( p101(X2)
& p201(X2) )
| ~ r1(X1,X2) )
| ~ r1(X0,X1) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X0] :
( ~ ( p101(X0)
& p201(X0) )
| ~ r1(X1,X0) )
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ( p101(X0)
& p201(X0) )
| ~ ! [X1] :
( ! [X0] :
( ~ ( p101(X0)
& p201(X0) )
| ~ r1(X1,X0) )
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f19,plain,
( ~ r1(sK0,sK0)
| ~ p101(sK0) ),
inference(subsumption_resolution,[],[f18,f14]) ).
fof(f14,plain,
p201(sK0),
inference(cnf_transformation,[],[f12]) ).
fof(f18,plain,
( ~ r1(sK0,sK0)
| ~ p201(sK0)
| ~ p101(sK0) ),
inference(factoring,[],[f13]) ).
fof(f13,plain,
! [X2,X1] :
( ~ r1(sK0,X1)
| ~ p201(X2)
| ~ r1(X1,X2)
| ~ p101(X2) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL684+1.001 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % 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.34 % Computer : n002.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 01:19:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a FOF_THM_EPR_NEQ problem
% 0.12/0.35 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.50/0.68 % (8993)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.50/0.69 % (8993)First to succeed.
% 0.50/0.69 % (8996)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.50/0.69 % (8998)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.50/0.69 % (8993)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8992"
% 0.50/0.69 % (9000)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.50/0.69 % (8996)Also succeeded, but the first one will report.
% 0.50/0.69 % (9000)Also succeeded, but the first one will report.
% 0.50/0.69 % (8993)Refutation found. Thanks to Tanya!
% 0.50/0.69 % SZS status Theorem for theBenchmark
% 0.50/0.69 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.69 % (8993)------------------------------
% 0.50/0.69 % (8993)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.69 % (8993)Termination reason: Refutation
% 0.50/0.69
% 0.50/0.69 % (8993)Memory used [KB]: 970
% 0.50/0.69 % (8993)Time elapsed: 0.002 s
% 0.50/0.69 % (8993)Instructions burned: 2 (million)
% 0.50/0.69 % (8992)Success in time 0.337 s
% 0.50/0.69 % Vampire---4.8 exiting
%------------------------------------------------------------------------------