%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n002.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.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 92 ( 27 ~; 26 |; 33 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 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 : 65 ( 53 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
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/Axioms/GEO009+0.ax',a7_defns) ).
fof(f16,axiom,
! [X0,X1,X2] :
( unequally_directed_lines(X0,X1)
=> ( unequally_directed_lines(X0,X2)
| unequally_directed_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',ax6_basics) ).
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/Axioms/GEO009+0.ax',ax9_basics) ).
fof(f21,axiom,
! [X0,X1] :
~ ( left_convergent_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO009+0.ax',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(f46,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f39]) ).
fof(f51,plain,
! [X0,X1,X2] :
( unequally_directed_lines(X0,X2)
| unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X0,X1) ),
inference(ennf_transformation,[],[f16]) ).
fof(f52,plain,
! [X0,X1,X2] :
( unequally_directed_lines(X0,X2)
| unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X0,X1) ),
inference(flattening,[],[f51]) ).
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(f95,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f46]) ).
fof(f112,plain,
! [X2,X0,X1] :
( ~ unequally_directed_lines(X0,X1)
| unequally_directed_lines(X1,X2)
| unequally_directed_lines(X0,X2) ),
inference(cnf_transformation,[],[f52]) ).
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(f141,plain,
convergent_lines(sK1,sK2),
inference(cnf_transformation,[],[f87]) ).
fof(f142,plain,
convergent_lines(sK0,sK2),
inference(cnf_transformation,[],[f87]) ).
fof(f144,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f87]) ).
fof(f153,plain,
unequally_directed_lines(sK1,sK2),
inference(resolution,[],[f95,f141]) ).
fof(f154,plain,
unequally_directed_lines(sK0,sK2),
inference(resolution,[],[f95,f142]) ).
fof(f155,plain,
unequally_directed_lines(sK0,sK1),
inference(resolution,[],[f95,f144]) ).
fof(f166,plain,
! [X0] :
( unequally_directed_lines(sK1,X0)
| unequally_directed_lines(sK0,X0) ),
inference(resolution,[],[f112,f155]) ).
fof(f270,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(f271,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(forward_subsumption_resolution,[],[f270,f122]) ).
fof(f278,plain,
! [X0] :
( unequally_directed_lines(sK0,reverse_line(X0))
| ~ unequally_directed_lines(sK1,X0) ),
inference(resolution,[],[f271,f166]) ).
fof(f284,plain,
! [X0] :
( ~ unequally_directed_lines(sK1,X0)
| ~ unequally_directed_lines(sK0,X0) ),
inference(resolution,[],[f278,f271]) ).
fof(f288,plain,
~ unequally_directed_lines(sK0,sK2),
inference(resolution,[],[f284,f153]) ).
fof(f293,plain,
$false,
inference(forward_subsumption_resolution,[],[f288,f154]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO262+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39 % Computer : n002.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 07:58:38 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.47 % (3218642)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (3218650)dis+10_1_sil=32000:sp=arity:random_seed=2582331648:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47 % (3218650) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3218642-3218650"...
% 0.17/0.47 % (3218648)% WARNING: option uhcvi not known.
% 0.17/0.47 % (3218650)...printing done.
% 0.17/0.47 % (3218650)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (3218650)------------------------------
% 0.17/0.47 % (3218650)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (3218650)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (3218650)CaDiCaL version: 2.1.3
% 0.17/0.47 % (3218650)Termination reason: Refutation
% 0.17/0.47 % (3218650)Time elapsed: 0.003 s
% 0.17/0.47 % (3218650)Peak memory usage: 11 MB
% 0.17/0.47 % (3218650)Instructions burned: 6 (million)
% 0.17/0.47 % (3218642)Success in time 0.037 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------