%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : GEO262+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:16 AM UTC 2026
% Result : Theorem 2.53s 1.33s
% Output : Refutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 4 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 90 ( 34 ~; 18 |; 33 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 44 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
<=> ( unequally_directed_lines(X0,X1)
& unequally_directed_lines(X0,reverse_line(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con_def) ).
fof(f14,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/sandbox2/benchmark/theBenchmark.p',oag9) ).
fof(f16,axiom,
! [X0,X1] :
~ ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oag11) ).
fof(f32,conjecture,
! [X0,X1,X2,X3,X4,X5] :
( ( between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& ~ apart_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& ~ apart_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/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f33,negated_conjecture,
~ ! [X0,X1,X2,X3,X4,X5] :
( ( between_on_line(X0,X3,X4,X5)
& convergent_lines(X0,X1)
& ~ apart_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& ~ apart_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)],[f32]) ).
fof(f34,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ( unequally_directed_lines(X0,X1)
& unequally_directed_lines(X0,reverse_line(X1)) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f37,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_lines(X0,reverse_line(X1)) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f34]) ).
fof(f50,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,[],[f14]) ).
fof(f51,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,[],[f50]) ).
fof(f53,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,X1)
& ~ left_convergent_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f16]) ).
fof(f74,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)
& ~ apart_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& ~ apart_point_and_line(X4,X2) ),
inference(ennf_transformation,[],[f33]) ).
fof(f75,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)
& ~ apart_point_and_line(X4,X1)
& convergent_lines(X0,X2)
& convergent_lines(X1,X2)
& ~ apart_point_and_line(X4,X2) ),
inference(flattening,[],[f74]) ).
fof(f80,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)
& ~ apart_point_and_line(sK4,sK1)
& convergent_lines(sK0,sK2)
& convergent_lines(sK1,sK2)
& ~ apart_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)],[f75]) ).
fof(f83,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f84,plain,
! [X0,X1] :
( unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f109,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,[],[f51]) ).
fof(f113,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f53]) ).
fof(f135,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f80]) ).
fof(f241,plain,
! [X0,X1] :
( left_convergent_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| ~ unequally_directed_lines(X0,reverse_line(X1)) ),
inference(forward_subsumption_resolution,[],[f109,f113]) ).
fof(f242,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(forward_subsumption_resolution,[],[f241,f113]) ).
fof(f243,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(resolution,[],[f242,f83]) ).
fof(f246,plain,
! [X0,X1] : ~ convergent_lines(X0,X1),
inference(forward_subsumption_resolution,[],[f243,f84]) ).
fof(f249,plain,
$false,
inference(resolution,[],[f246,f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO262+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 % Computer : n009.cluster.edu
% 0.13/0.40 % Model : x86_64 x86_64
% 0.13/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40 % Memory : 8046.5625MB
% 0.13/0.40 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sun Sep 27 07:54:45 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/1.33 % (1703235)Detected formulas, will run a generic FOF schedule.
% 2.53/1.33 % (1703245)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=921955390:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.53/1.33 % (1703245)First to succeed.
% 2.53/1.33 % (1703245)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1703235"
% 2.53/1.33 % (1703241)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=430456377:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.53/1.33 % (1703242)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=2599415051:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.53/1.33 % (1703243)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2163218912:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.53/1.33 % (1703240)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=154674388:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.53/1.33 % (1703243)Refutation not found, incomplete strategy
% 2.53/1.33 % (1703243)------------------------------
% 2.53/1.33 % (1703243)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.33 % (1703243)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.33 % (1703243)CaDiCaL version: 2.1.3
% 2.53/1.33 % (1703243)Termination reason: Refutation not found, incomplete strategy
% 2.53/1.33 % (1703243)Time elapsed: 0.002 s
% 2.53/1.33 % (1703243)Peak memory usage: 88 MB
% 2.53/1.33 % (1703243)Instructions burned: 1 (million)
% 2.53/1.33 % (1703246)dis-21_1_sil=8000:lcm=predicate:random_seed=2203013538: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)
% 2.53/1.33 % (1703244)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1883153373:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.53/1.33 % (1703246)Also succeeded, but the first one will report.
% 2.53/1.33 % (1703244)Instruction limit reached!
% 2.53/1.33 % (1703244)------------------------------
% 2.53/1.33 % (1703244)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.33 % (1703244)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.33 % (1703244)CaDiCaL version: 2.1.3
% 2.53/1.33 % (1703244)Termination reason: Instruction limit
% 2.53/1.33 % (1703244)Termination phase: Saturation
% 2.53/1.33 % (1703244)Time elapsed: 0.074 s
% 2.53/1.33 % (1703244)Peak memory usage: 88 MB
% 2.53/1.33 % (1703244)Instructions burned: 120 (million)
% 2.53/1.33 % (1703245)Refutation found. Thanks to Tanya!
% 2.53/1.33 % SZS status Theorem for theBenchmark
% 2.53/1.33 % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.33 % (1703245)------------------------------
% 2.53/1.33 % (1703245)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.33 % (1703245)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.33 % (1703245)CaDiCaL version: 2.1.3
% 2.53/1.33 % (1703245)Termination reason: Refutation
% 2.53/1.33 % (1703245)Time elapsed: 0.003 s
% 2.53/1.33 % (1703245)Peak memory usage: 89 MB
% 2.53/1.33 % (1703245)Instructions burned: 5 (million)
% 2.53/1.33 % (1703245)------------------------------
% 2.53/1.33 % (1703245)------------------------------
% 2.53/1.33 % (1703235)Success in time 0.269 s
% 2.53/1.33 % Vampire exiting
%------------------------------------------------------------------------------