%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : GEO185+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% Computer : n007.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 : Fri Sep 25 01:17:20 PM UTC 2026
% Result : Theorem 5.53s 11.18s
% Output : Proof 5.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 55 ( 22 ~; 15 |; 14 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn 17 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( ( apart_point_and_line(Z,Y)
| apart_point_and_line(Z,X) )
=> distinct_points(Z,intersection_point(X,Y)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con2) ).
fof(f7_nnf,plain,
! [X,Y,Z] :
( distinct_points(Z,intersection_point(X,Y))
| ( ~ apart_point_and_line(Z,Y)
& ~ apart_point_and_line(Z,X) )
| ~ convergent_lines(X,Y) ),
inference(nnf_transformation,[status(thm)],[f7]) ).
fof(f7_sk,plain,
! [X,Y,Z] :
( distinct_points(Z,intersection_point(X,Y))
| ( ~ apart_point_and_line(Z,Y)
& ~ apart_point_and_line(Z,X) )
| ~ convergent_lines(X,Y) ),
inference(skolemisation,[status(esa)],[f7_nnf]) ).
cnf(c9,plain,
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X1)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
fof(f12,conjecture,
! [X,Y,U,V] :
( ( ~ distinct_points(X,intersection_point(U,V))
& convergent_lines(U,V)
& distinct_points(X,Y) )
=> ( ~ apart_point_and_line(X,V)
& ~ apart_point_and_line(X,U) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(f12_neg,negated_conjecture,
~ ! [X,Y,U,V] :
( ( ~ distinct_points(X,intersection_point(U,V))
& convergent_lines(U,V)
& distinct_points(X,Y) )
=> ( ~ apart_point_and_line(X,V)
& ~ apart_point_and_line(X,U) ) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f12_nnf,plain,
? [X,Y,U,V] :
( ( apart_point_and_line(X,V)
| apart_point_and_line(X,U) )
& ~ distinct_points(X,intersection_point(U,V))
& convergent_lines(U,V)
& distinct_points(X,Y) ),
inference(nnf_transformation,[status(thm)],[f12_neg]) ).
fof(f12_sk,plain,
( ( apart_point_and_line(sk0,sk3)
| apart_point_and_line(sk0,sk2) )
& ~ distinct_points(sk0,intersection_point(sk2,sk3))
& convergent_lines(sk2,sk3)
& distinct_points(sk0,sk1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2,sk3])],[f12_nnf]) ).
cnf(c15,plain,
convergent_lines(sk2,sk3),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p109,plain,
( distinct_points(X0,intersection_point(sk2,sk3))
| ~ apart_point_and_line(X0,sk3) ),
inference(resolution,[status(thm)],[c9,c15]) ).
cnf(c17,plain,
( apart_point_and_line(sk0,sk3)
| apart_point_and_line(sk0,sk2) ),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p127,plain,
( apart_point_and_line(sk0,sk2)
| distinct_points(sk0,intersection_point(sk2,sk3)) ),
inference(resolution,[status(thm)],[p109,c17]) ).
cnf(c16,plain,
~ distinct_points(sk0,intersection_point(sk2,sk3)),
inference(cnf_transformation,[status(esa)],[f12_sk]) ).
cnf(p144,plain,
apart_point_and_line(sk0,sk2),
inference(resolution,[status(thm)],[p127,c16]) ).
cnf(c8,plain,
( distinct_points(X2,intersection_point(X0,X1))
| ~ apart_point_and_line(X2,X0)
| ~ convergent_lines(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f7_sk]) ).
cnf(p82,plain,
( distinct_points(X0,intersection_point(sk2,sk3))
| ~ apart_point_and_line(X0,sk2) ),
inference(resolution,[status(thm)],[c8,c15]) ).
cnf(p145,plain,
distinct_points(sk0,intersection_point(sk2,sk3)),
inference(resolution,[status(thm)],[p144,p82]) ).
cnf(p146,plain,
$false,
inference(resolution,[status(thm)],[p145,c16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO185+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/10.36 % Computer : n007.cluster.edu
% 0.09/10.36 % Model : x86_64 x86_64
% 0.09/10.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.36 % Memory : 8046.5625MB
% 0.09/10.36 % OS : Linux 6.8.0-71-generic
% 0.09/10.36 % CPULimit : 300
% 0.09/10.36 % WCLimit : 300
% 0.09/10.36 % DateTime : Wed Sep 23 11:18:32 UTC 2026
% 0.09/10.36 % CPUTime :
% 0.09/10.37 Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.53/11.18 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.53/11.18 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------