%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GEO262+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 09:52:17 AM UTC 2026
% Result : Theorem 3.57s 1.58s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 4 unt; 0 def)
% Number of atoms : 89 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 89 ( 28 ~; 21 |; 33 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 66 ( 54 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
<=> unequally_directed_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1_defns) ).
fof(f7,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a7_defns) ).
fof(f19,axiom,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_lines(X0,reverse_line(X1)) )
=> ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax9_basics) ).
fof(f21,axiom,
! [X0,X1] :
~ ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11_basics) ).
fof(f37,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& incident_point_and_line(X4,X2) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& incident_point_and_line(X4,X2) )
=> between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5))) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f39,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f7]) ).
fof(f42,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
=> unequally_directed_lines(X0,reverse_line(X1)) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f43,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(ennf_transformation,[],[f42]) ).
fof(f46,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f55,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f19]) ).
fof(f56,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(flattening,[],[f55]) ).
fof(f58,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,X1)
& ~ left_convergent_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f21]) ).
fof(f80,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5)))
& between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& incident_point_and_line(X4,X2) ),
inference(ennf_transformation,[],[f38]) ).
fof(f81,plain,
? [X0,X1,X2,X3,X4,X5] :
( ~ between_on_line(X1,intersection_point(X1,parallel_through_point(X2,X3)),X4,intersection_point(X1,parallel_through_point(X2,X5)))
& between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& incident_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& incident_point_and_line(X4,X2) ),
inference(flattening,[],[f80]) ).
fof(f87,plain,
( ~ between_on_line(sK1,intersection_point(sK1,parallel_through_point(sK2,sK3)),sK4,intersection_point(sK1,parallel_through_point(sK2,sK5)))
& between_on_line(sK0,sK3,sK4,sK5)
& convergent_lines(sK0,sK1)
& incident_point_and_line(sK4,sK1)
& convergent_lines(sK0,sK2)
& convergent_lines(sK1,sK2)
& incident_point_and_line(sK4,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f81]) ).
fof(f88,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
fof(f94,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f95,plain,
! [X0,X1] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f118,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f56]) ).
fof(f122,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f58]) ).
fof(f144,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f87]) ).
fof(f277,plain,
! [X0,X1] :
( left_convergent_lines(X0,X1)
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(forward_subsumption_resolution,[],[f118,f122]) ).
fof(f278,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(forward_subsumption_resolution,[],[f277,f122]) ).
fof(f285,plain,
! [X0,X1] :
( ~ unequally_directed_opposite_lines(X0,X1)
| ~ unequally_directed_lines(X0,X1) ),
inference(resolution,[],[f278,f88]) ).
fof(f311,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(resolution,[],[f285,f94]) ).
fof(f312,plain,
! [X0,X1] : ~ convergent_lines(X0,X1),
inference(forward_subsumption_resolution,[],[f311,f95]) ).
fof(f456,plain,
$false,
inference(resolution,[],[f312,f144]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO262+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 07:56:01 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.57/1.58 % (2080504)Detected formulas, will run a generic FOF schedule.
% 3.57/1.58 % (2080529)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=1301427060:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.57/1.58 % (2080527)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=638921373:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.57/1.58 % (2080533)dis-21_1_sil=8000:lcm=predicate:random_seed=1507826549:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.57/1.58 % (2080530)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=4038485239:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.57/1.58 % (2080528)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2817285449:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.57/1.58 % (2080532)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1888373645:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.57/1.58 % (2080530)Refutation not found, incomplete strategy
% 3.57/1.58 % (2080530)------------------------------
% 3.57/1.58 % (2080530)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.58 % (2080530)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.58 % (2080530)CaDiCaL version: 2.1.3
% 3.57/1.58 % (2080530)Termination reason: Refutation not found, incomplete strategy
% 3.57/1.58 % (2080530)Time elapsed: 0.002 s
% 3.57/1.58 % (2080530)Peak memory usage: 88 MB
% 3.57/1.58 % (2080530)Instructions burned: 1 (million)
% 3.57/1.58 % (2080531)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2770392692:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.57/1.58 % (2080532)First to succeed.
% 3.57/1.58 % (2080532)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2080504"
% 3.57/1.58 % (2080531)Also succeeded, but the first one will report.
% 3.57/1.58 % (2080533)Also succeeded, but the first one will report.
% 3.57/1.58 % (2080530)------------------------------
% 3.57/1.58 % (2080530)------------------------------
% 3.57/1.58 % (2080532)Refutation found. Thanks to Tanya!
% 3.57/1.58 % SZS status Theorem for theBenchmark
% 3.57/1.58 % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.58 % (2080532)------------------------------
% 3.57/1.58 % (2080532)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.58 % (2080532)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.58 % (2080532)CaDiCaL version: 2.1.3
% 3.57/1.58 % (2080532)Termination reason: Refutation
% 3.57/1.58 % (2080532)Time elapsed: 0.011 s
% 3.57/1.58 % (2080532)Peak memory usage: 88 MB
% 3.57/1.58 % (2080532)Instructions burned: 15 (million)
% 3.57/1.58 % (2080532)------------------------------
% 3.57/1.58 % (2080532)------------------------------
% 3.57/1.58 % (2080504)Success in time 0.397 s
% 3.57/1.58 % Vampire exiting
%------------------------------------------------------------------------------