TSTP Solution File: GEO247+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : GEO247+3 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n009.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 : Wed May 1 02:23:15 EDT 2024
% Result : Theorem 0.54s 0.75s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 80 ( 12 ~; 2 |; 62 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 44 ( 26 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f124,plain,
$false,
inference(subsumption_resolution,[],[f95,f102]) ).
fof(f102,plain,
! [X0,X1] : ~ left_apart_point(X0,X1),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( ~ left_apart_point(X0,reverse_line(X1))
& ~ left_apart_point(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,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/tmp/tmp.29pUqol2xn/Vampire---4.8_21383',ax10_basics) ).
fof(f95,plain,
left_apart_point(sK3,sK5),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
( ~ convergent_lines(sK4,sK5)
& left_apart_point(sK3,sK5)
& right_apart_point(sK3,sK4)
& right_apart_point(sK2,sK5)
& left_apart_point(sK2,sK4)
& right_apart_point(sK1,sK5)
& right_apart_point(sK1,sK4)
& left_apart_point(sK0,sK5)
& left_apart_point(sK0,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f61,f85]) ).
fof(f85,plain,
( ? [X0,X1,X2,X3,X4,X5] :
( ~ convergent_lines(X4,X5)
& left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) )
=> ( ~ convergent_lines(sK4,sK5)
& left_apart_point(sK3,sK5)
& right_apart_point(sK3,sK4)
& right_apart_point(sK2,sK5)
& left_apart_point(sK2,sK4)
& right_apart_point(sK1,sK5)
& right_apart_point(sK1,sK4)
& left_apart_point(sK0,sK5)
& left_apart_point(sK0,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f61,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ convergent_lines(X4,X5)
& left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) ),
inference(flattening,[],[f60]) ).
fof(f60,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ convergent_lines(X4,X5)
& left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,plain,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( left_apart_point(X3,X5)
& right_apart_point(X3,X4)
& right_apart_point(X2,X5)
& left_apart_point(X2,X4)
& right_apart_point(X1,X5)
& right_apart_point(X1,X4)
& left_apart_point(X0,X5)
& left_apart_point(X0,X4) )
=> convergent_lines(X4,X5) ),
inference(rectify,[],[f38]) ).
fof(f38,negated_conjecture,
~ ! [X2,X5,X6,X8,X3,X4] :
( ( left_apart_point(X8,X4)
& right_apart_point(X8,X3)
& right_apart_point(X6,X4)
& left_apart_point(X6,X3)
& right_apart_point(X5,X4)
& right_apart_point(X5,X3)
& left_apart_point(X2,X4)
& left_apart_point(X2,X3) )
=> convergent_lines(X3,X4) ),
inference(negated_conjecture,[],[f37]) ).
fof(f37,conjecture,
! [X2,X5,X6,X8,X3,X4] :
( ( left_apart_point(X8,X4)
& right_apart_point(X8,X3)
& right_apart_point(X6,X4)
& left_apart_point(X6,X3)
& right_apart_point(X5,X4)
& right_apart_point(X5,X3)
& left_apart_point(X2,X4)
& left_apart_point(X2,X3) )
=> convergent_lines(X3,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.29pUqol2xn/Vampire---4.8_21383',con) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO247+3 : TPTP v8.1.2. Released v4.0.0.
% 0.11/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.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 30 18:49:41 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/tmp/tmp.29pUqol2xn/Vampire---4.8_21383
% 0.54/0.74 % (21600)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.54/0.74 % (21602)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.54/0.74 % (21600)First to succeed.
% 0.54/0.74 % (21595)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.54/0.74 % (21602)Also succeeded, but the first one will report.
% 0.54/0.74 % (21597)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.54/0.74 % (21596)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.54/0.74 % (21598)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.54/0.74 % (21599)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.54/0.75 % (21601)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.54/0.75 % (21600)Refutation found. Thanks to Tanya!
% 0.54/0.75 % SZS status Theorem for Vampire---4
% 0.54/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.75 % (21600)------------------------------
% 0.54/0.75 % (21600)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.75 % (21600)Termination reason: Refutation
% 0.54/0.75
% 0.54/0.75 % (21600)Memory used [KB]: 1045
% 0.54/0.75 % (21600)Time elapsed: 0.002 s
% 0.54/0.75 % (21600)Instructions burned: 3 (million)
% 0.54/0.75 % (21600)------------------------------
% 0.54/0.75 % (21600)------------------------------
% 0.54/0.75 % (21571)Success in time 0.385 s
% 0.54/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------