%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n001.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:54:18 AM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 81 ( 29 ~; 14 |; 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 : 52 ( 40 !; 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/Axioms/GEO007+0.ax',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/Axioms/GEO007+0.ax',oag9) ).
fof(f16,axiom,
! [X0,X1] :
~ ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',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(f112,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f53]) ).
fof(f113,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f53]) ).
fof(f132,plain,
convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f80]) ).
fof(f148,plain,
! [X0,X1] : ~ convergent_lines(X0,X1),
inference(global_subsumption,[],[f84,f83,f109,f113,f112]) ).
fof(f164,plain,
$false,
inference(forward_subsumption_resolution,[],[f132,f148]) ).
%------------------------------------------------------------------------------
%----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 SAT
% 0.12/0.40 % Computer : n001.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sun Sep 27 08:00:30 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44 Running first-order model finding
% 0.12/0.44 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.50 % (3229894)Will run a generic schedule for satisfiability detection.
% 0.19/0.50 % (3229899)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1257479433_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.50 % TRYING [1]
% 0.19/0.50 % TRYING [2]
% 0.19/0.50 % TRYING [3]
% 0.19/0.50 % (3229900)% WARNING: option uhcvi not known.
% 0.19/0.50 % TRYING [4]
% 0.19/0.50 % (3229900)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3152994344:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.50 % (3229901)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1405335762:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.50 % (3229902)dis+10_1_sil=32000:sp=arity:random_seed=3710090156:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.50 % (3229903)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=862121636:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.50 % (3229904)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=381987551:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.50 % (3229905)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2842078443:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.50 % TRYING [5]
% 0.19/0.50 % (3229901) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3229894-3229901"...
% 0.19/0.50 % (3229904) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3229894-3229904"...
% 0.19/0.50 % (3229903) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3229894-3229903"...
% 0.19/0.50 % (3229901)...printing done.
% 0.19/0.50 % (3229904)...printing done.
% 0.19/0.50 % (3229902) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3229894-3229902"...
% 0.19/0.50 % (3229900) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3229894-3229900"...
% 0.19/0.50 % (3229901)Refutation found. Thanks to Tanya!
% 0.19/0.50 % SZS status Theorem for theBenchmark
% 0.19/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50 % (3229901)------------------------------
% 0.19/0.50 % (3229901)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.50 % (3229901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.50 % (3229901)CaDiCaL version: 2.1.3
% 0.19/0.50 % (3229901)Termination reason: Refutation
% 0.19/0.50 % (3229901)Time elapsed: 0.003 s
% 0.19/0.50 % (3229901)Peak memory usage: 11 MB
% 0.19/0.50 % (3229901)Instructions burned: 3 (million)
% 0.19/0.50 % (3229894)Success in time 0.05 s
% 0.19/0.50 % Vampire exiting
%------------------------------------------------------------------------------