%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : GEO224+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 : n019.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:08 AM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 10 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 113 ( 52 ~; 41 |; 12 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 74 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] : ~ convergent_lines(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(f6,axiom,
! [X0,X1,X2] :
( convergent_lines(X0,X1)
=> ( convergent_lines(X0,X2)
| convergent_lines(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(f9,axiom,
! [X0,X1] :
( convergent_lines(X0,X1)
=> ~ apart_point_and_line(intersection_point(X0,X1),X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(f21,axiom,
! [X0,X1] : ~ unorthogonal_lines(orthogonal_through_point(X1,X0),X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+3.ax',ooc1) ).
fof(f24,axiom,
! [X0,X1] :
~ ( ~ convergent_lines(X0,X1)
& ~ unorthogonal_lines(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+4.ax',coipo1) ).
fof(f28,axiom,
! [X0,X1] :
( ( line(X0)
& line(X1)
& convergent_lines(X0,X1) )
=> point(intersection_point(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+5.ax',int1) ).
fof(f30,axiom,
! [X0,X1] :
( ( line(X0)
& point(X1) )
=> line(orthogonal_through_point(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+5.ax',orth1) ).
fof(f34,axiom,
! [X0,X1] :
( incident_point_and_line(X0,X1)
<=> ~ apart_point_and_line(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',a4) ).
fof(f36,conjecture,
! [X0,X1] :
( ( point(X0)
& line(X1) )
=> ? [X2] :
( point(X2)
& incident_point_and_line(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(f37,negated_conjecture,
~ ! [X0,X1] :
( ( point(X0)
& line(X1) )
=> ? [X2] :
( point(X2)
& incident_point_and_line(X2,X1) ) ),
inference(negated_conjecture,[status(cth)],[f36]) ).
fof(f38,plain,
! [X0,X1] :
( ~ apart_point_and_line(X0,X1)
=> incident_point_and_line(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f34]) ).
fof(f43,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f6]) ).
fof(f44,plain,
! [X0,X1,X2] :
( convergent_lines(X0,X2)
| convergent_lines(X1,X2)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f43]) ).
fof(f47,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f64,plain,
! [X0,X1] :
( convergent_lines(X0,X1)
| unorthogonal_lines(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f71,plain,
! [X0,X1] :
( point(intersection_point(X0,X1))
| ~ line(X0)
| ~ line(X1)
| ~ convergent_lines(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f72,plain,
! [X0,X1] :
( point(intersection_point(X0,X1))
| ~ line(X0)
| ~ line(X1)
| ~ convergent_lines(X0,X1) ),
inference(flattening,[],[f71]) ).
fof(f75,plain,
! [X0,X1] :
( line(orthogonal_through_point(X0,X1))
| ~ line(X0)
| ~ point(X1) ),
inference(ennf_transformation,[],[f30]) ).
fof(f76,plain,
! [X0,X1] :
( line(orthogonal_through_point(X0,X1))
| ~ line(X0)
| ~ point(X1) ),
inference(flattening,[],[f75]) ).
fof(f77,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(ennf_transformation,[],[f38]) ).
fof(f78,plain,
? [X0,X1] :
( ! [X2] :
( ~ point(X2)
| ~ incident_point_and_line(X2,X1) )
& point(X0)
& line(X1) ),
inference(ennf_transformation,[],[f37]) ).
fof(f79,plain,
? [X0,X1] :
( ! [X2] :
( ~ point(X2)
| ~ incident_point_and_line(X2,X1) )
& point(X0)
& line(X1) ),
inference(flattening,[],[f78]) ).
fof(f82,plain,
! [X0] : ~ convergent_lines(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f85,plain,
! [X2,X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X2)
| convergent_lines(X0,X2) ),
inference(cnf_transformation,[],[f44]) ).
fof(f88,plain,
! [X0,X1] :
( ~ apart_point_and_line(intersection_point(X0,X1),X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f103,plain,
! [X0,X1] : ~ unorthogonal_lines(orthogonal_through_point(X1,X0),X1),
inference(cnf_transformation,[],[f21]) ).
fof(f106,plain,
! [X0,X1] :
( unorthogonal_lines(X0,X1)
| convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f113,plain,
! [X0,X1] :
( point(intersection_point(X0,X1))
| ~ line(X1)
| ~ line(X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[],[f72]) ).
fof(f115,plain,
! [X0,X1] :
( ~ point(X1)
| ~ line(X0)
| line(orthogonal_through_point(X0,X1)) ),
inference(cnf_transformation,[],[f76]) ).
fof(f116,plain,
! [X0,X1] :
( incident_point_and_line(X0,X1)
| apart_point_and_line(X0,X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f117,plain,
! [X2] :
( ~ incident_point_and_line(X2,sK1)
| ~ point(X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f118,plain,
line(sK1),
inference(cnf_transformation,[],[f79]) ).
fof(f119,plain,
point(sK0),
inference(cnf_transformation,[],[f79]) ).
fof(f120,plain,
! [X0,X1] : convergent_lines(orthogonal_through_point(X0,X1),X0),
inference(resolution,[],[f106,f103]) ).
fof(f121,plain,
! [X0] :
( ~ point(X0)
| apart_point_and_line(X0,sK1) ),
inference(resolution,[],[f116,f117]) ).
fof(f124,plain,
! [X0] :
( line(orthogonal_through_point(X0,sK0))
| ~ line(X0) ),
inference(resolution,[],[f115,f119]) ).
fof(f159,plain,
! [X0,X1] :
( ~ convergent_lines(X0,X1)
| convergent_lines(X1,X0) ),
inference(resolution,[],[f85,f82]) ).
fof(f175,plain,
! [X0,X1] : convergent_lines(X0,orthogonal_through_point(X0,X1)),
inference(resolution,[],[f159,f120]) ).
fof(f210,plain,
! [X0,X1] :
( ~ line(X0)
| ~ line(X1)
| ~ convergent_lines(X1,X0)
| apart_point_and_line(intersection_point(X1,X0),sK1) ),
inference(resolution,[],[f113,f121]) ).
fof(f225,plain,
! [X0] :
( ~ line(X0)
| ~ convergent_lines(sK1,X0)
| apart_point_and_line(intersection_point(sK1,X0),sK1) ),
inference(resolution,[],[f210,f118]) ).
fof(f228,plain,
! [X0] :
( ~ line(X0)
| ~ convergent_lines(sK1,X0) ),
inference(forward_subsumption_resolution,[],[f225,f88]) ).
fof(f240,plain,
! [X0] :
( ~ line(X0)
| ~ convergent_lines(sK1,orthogonal_through_point(X0,sK0)) ),
inference(resolution,[],[f228,f124]) ).
fof(f295,plain,
~ convergent_lines(sK1,orthogonal_through_point(sK1,sK0)),
inference(resolution,[],[f240,f118]) ).
fof(f298,plain,
$false,
inference(forward_subsumption_resolution,[],[f295,f175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO224+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n019.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 07:44:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40 Running first-order model finding
% 0.11/0.40 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.11/0.44 % (2773801)Will run a generic schedule for satisfiability detection.
% 0.11/0.44 % (2773810)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2382631471:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.44 % (2773810) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2773801-2773810"...
% 0.11/0.44 % (2773810)...printing done.
% 0.11/0.44 % (2773810)Refutation found. Thanks to Tanya!
% 0.11/0.44 % SZS status Theorem for theBenchmark
% 0.11/0.44 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44 % (2773810)------------------------------
% 0.11/0.44 % (2773810)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44 % (2773810)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44 % (2773810)CaDiCaL version: 2.1.3
% 0.11/0.44 % (2773810)Termination reason: Refutation
% 0.11/0.44 % (2773810)Time elapsed: 0.004 s
% 0.11/0.44 % (2773810)Peak memory usage: 11 MB
% 0.11/0.44 % (2773810)Instructions burned: 12 (million)
% 0.11/0.44 % (2773801)Success in time 0.029 s
% 0.11/0.44 % Vampire exiting
%------------------------------------------------------------------------------