%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO261+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n020.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.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 68 ( 26 ~; 20 |; 14 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 65 ( 55 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
<=> unequally_directed_lines(X0,reverse_line(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO009+0.ax',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/sandbox2/benchmark/Axioms/GEO009+0.ax',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/sandbox2/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/sandbox2/benchmark/Axioms/GEO009+0.ax',ax11_basics) ).
fof(f37,conjecture,
! [X0,X1,X2,X3,X4] :
( ( between_on_line(X0,X2,X3,X4)
& convergent_lines(X0,X1)
& incident_point_and_line(X3,X1) )
=> divides_points(X1,X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f38,negated_conjecture,
~ ! [X0,X1,X2,X3,X4] :
( ( between_on_line(X0,X2,X3,X4)
& convergent_lines(X0,X1)
& incident_point_and_line(X3,X1) )
=> divides_points(X1,X2,X4) ),
inference(negated_conjecture,[status(cth)],[f37]) ).
fof(f43,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_opposite_lines(X0,X1)
=> unequally_directed_lines(X0,reverse_line(X1)) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f47,plain,
~ ! [X0,X1,X2,X3,X4] :
( ( between_on_line(X0,X2,X3,X4)
& convergent_lines(X0,X1) )
=> divides_points(X1,X2,X4) ),
inference(pure_predicate_removal,[],[f38]) ).
fof(f49,plain,
! [X0,X1] :
( unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_opposite_lines(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f53,plain,
! [X0,X1] :
( ( unequally_directed_lines(X0,X1)
& unequally_directed_opposite_lines(X0,X1) )
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f43]) ).
fof(f66,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(f67,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,[],[f66]) ).
fof(f69,plain,
! [X0,X1] :
( ~ left_convergent_lines(X0,X1)
& ~ left_convergent_lines(X0,reverse_line(X1)) ),
inference(ennf_transformation,[],[f21]) ).
fof(f91,plain,
? [X0,X1,X2,X3,X4] :
( ~ divides_points(X1,X2,X4)
& between_on_line(X0,X2,X3,X4)
& convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f92,plain,
? [X0,X1,X2,X3,X4] :
( ~ divides_points(X1,X2,X4)
& between_on_line(X0,X2,X3,X4)
& convergent_lines(X0,X1) ),
inference(flattening,[],[f91]) ).
fof(f93,plain,
! [X0,X1] :
( ~ unequally_directed_opposite_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(cnf_transformation,[],[f49]) ).
fof(f98,plain,
! [X0,X1] :
( unequally_directed_opposite_lines(X0,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f99,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
fof(f119,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,reverse_line(X1))
| left_convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
fof(f122,plain,
! [X0,X1] : ~ left_convergent_lines(X0,reverse_line(X1)),
inference(cnf_transformation,[],[f69]) ).
fof(f123,plain,
! [X0,X1] : ~ left_convergent_lines(X0,X1),
inference(cnf_transformation,[],[f69]) ).
fof(f141,plain,
convergent_lines(sK0,sK1),
inference(cnf_transformation,[],[f92]) ).
fof(f145,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1)
| left_convergent_lines(X0,X1) ),
inference(forward_subsumption_resolution,[],[f119,f122]) ).
fof(f146,plain,
! [X0,X1] :
( ~ unequally_directed_lines(X0,reverse_line(X1))
| ~ unequally_directed_lines(X0,X1) ),
inference(forward_subsumption_resolution,[],[f145,f123]) ).
fof(f149,plain,
unequally_directed_lines(sK0,sK1),
inference(resolution,[],[f99,f141]) ).
fof(f150,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| unequally_directed_lines(X0,reverse_line(X1)) ),
inference(resolution,[],[f93,f98]) ).
fof(f158,plain,
unequally_directed_lines(sK0,reverse_line(sK1)),
inference(resolution,[],[f150,f141]) ).
fof(f160,plain,
~ unequally_directed_lines(sK0,sK1),
inference(resolution,[],[f158,f146]) ).
fof(f161,plain,
$false,
inference(forward_subsumption_resolution,[],[f160,f149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO261+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n020.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 27 07:55:34 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.11/0.46 % (3076963)Will run a generic schedule for satisfiability detection.
% 0.11/0.46 % (3076972)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3644970679:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.46 % (3076972) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3076963-3076972"...
% 0.11/0.46 % (3076972)...printing done.
% 0.11/0.46 % (3076969)% WARNING: option uhcvi not known.
% 0.11/0.46 % (3076972)Refutation found. Thanks to Tanya!
% 0.11/0.46 % SZS status Theorem for theBenchmark
% 0.11/0.46 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.46 % (3076972)------------------------------
% 0.11/0.46 % (3076972)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.46 % (3076972)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.46 % (3076972)CaDiCaL version: 2.1.3
% 0.11/0.46 % (3076972)Termination reason: Refutation
% 0.11/0.46 % (3076972)Time elapsed: 0.002 s
% 0.11/0.46 % (3076972)Peak memory usage: 12 MB
% 0.11/0.46 % (3076972)Instructions burned: 5 (million)
% 0.11/0.46 % (3076963)Success in time 0.033 s
% 0.11/0.46 % Vampire exiting
%------------------------------------------------------------------------------