TSTP Solution File: GEO250+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO250+3 : 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 : n025.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 : Mon May 20 20:09:48 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 22 ( 11 ~; 2 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 17 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f81,plain,
$false,
inference(subsumption_resolution,[],[f68,f75]) ).
fof(f75,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( ~ left_apart_point(X0,reverse_line(X1))
& ~ left_apart_point(X0,X1) ),
inference(ennf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
~ ( left_apart_point(X0,reverse_line(X1))
| left_apart_point(X0,X1) ),
inference(rectify,[],[f20]) ).
fof(f20,axiom,
! [X2,X3] :
~ ( left_apart_point(X2,reverse_line(X3))
| left_apart_point(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax10_basics) ).
fof(f68,plain,
left_apart_point(sK1,parallel_through_point(sK2,sK0)),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
( ~ right_apart_point(sK0,parallel_through_point(sK2,sK1))
& left_apart_point(sK1,parallel_through_point(sK2,sK0)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f57,f66]) ).
fof(f66,plain,
( ? [X0,X1,X2] :
( ~ right_apart_point(X0,parallel_through_point(X2,X1))
& left_apart_point(X1,parallel_through_point(X2,X0)) )
=> ( ~ right_apart_point(sK0,parallel_through_point(sK2,sK1))
& left_apart_point(sK1,parallel_through_point(sK2,sK0)) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
? [X0,X1,X2] :
( ~ right_apart_point(X0,parallel_through_point(X2,X1))
& left_apart_point(X1,parallel_through_point(X2,X0)) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,plain,
~ ! [X0,X1,X2] :
( left_apart_point(X1,parallel_through_point(X2,X0))
=> right_apart_point(X0,parallel_through_point(X2,X1)) ),
inference(rectify,[],[f38]) ).
fof(f38,negated_conjecture,
~ ! [X2,X5,X3] :
( left_apart_point(X5,parallel_through_point(X3,X2))
=> right_apart_point(X2,parallel_through_point(X3,X5)) ),
inference(negated_conjecture,[],[f37]) ).
fof(f37,conjecture,
! [X2,X5,X3] :
( left_apart_point(X5,parallel_through_point(X3,X2))
=> right_apart_point(X2,parallel_through_point(X3,X5)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO250+3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % 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.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 14:39:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_NEQ problem
% 0.14/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.55/0.73 % (21365)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.73 % (21367)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.73 % (21366)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.73 % (21372)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.73 % (21372)First to succeed.
% 0.55/0.73 % (21372)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21364"
% 0.55/0.73 % (21372)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (21372)------------------------------
% 0.55/0.73 % (21372)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (21372)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (21372)Memory used [KB]: 1048
% 0.55/0.73 % (21372)Time elapsed: 0.002 s
% 0.55/0.73 % (21372)Instructions burned: 2 (million)
% 0.55/0.73 % (21364)Success in time 0.376 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------