%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO172+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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 : Sun Sep 27 07:17:15 AM UTC 2026
% Result : Theorem 0.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 14 unt; 0 def)
% Number of atoms : 80 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 30 ~; 26 |; 11 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn 22 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart3,axiom,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',apart3) ).
fof(ci3,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),X) ),
file('theBenchmark.p',ci3) ).
fof(ci4,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),Y) ),
file('theBenchmark.p',ci4) ).
fof(cu1,axiom,
! [X,Y,U,V] :
( ( distinct_lines(U,V)
& distinct_points(X,Y) )
=> ( apart_point_and_line(Y,V)
| apart_point_and_line(Y,U)
| apart_point_and_line(X,V)
| apart_point_and_line(X,U) ) ),
file('theBenchmark.p',cu1) ).
fof(ceq3,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| distinct_lines(Y,Z) ) ),
file('theBenchmark.p',ceq3) ).
fof(ax1,axiom,
! [X,Y] :
( equal_points(X,Y)
<=> ~ distinct_points(X,Y) ),
file('theBenchmark.p',ax1) ).
fof(a4,axiom,
! [X,Y] :
( incident_point_and_line(X,Y)
<=> ~ apart_point_and_line(X,Y) ),
file('theBenchmark.p',a4) ).
fof(con,conjecture,
! [X,Y,Z] :
( ( incident_point_and_line(Z,Y)
& incident_point_and_line(Z,X)
& convergent_lines(X,Y) )
=> equal_points(Z,intersection_point(X,Y)) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( ( incident_point_and_line(Z,Y)
& incident_point_and_line(Z,X)
& convergent_lines(X,Y) )
=> equal_points(Z,intersection_point(X,Y)) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_37,plain,
( distinct_points(A,B)
| equal_points(A,B) ),
inference(clausify,[status(thm)],[ax1]) ).
fof(nnf_36,plain,
? [X,Y,Z] :
( ~ equal_points(Z,intersection_point(X,Y))
& incident_point_and_line(Z,Y)
& incident_point_and_line(Z,X)
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ equal_points(sK0,intersection_point(sK1,sK2))
& incident_point_and_line(sK0,sK2)
& incident_point_and_line(sK0,sK1)
& convergent_lines(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK0]),skolemize(X,sK1),skolemize(Y,sK2),skolemize(Z,sK0)],[nnf_36]) ).
cnf(c_39,negated_conjecture,
~ equal_points(sK0,intersection_point(sK1,sK2)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_44,plain,
( ~ apart_point_and_line(A,B)
| ~ incident_point_and_line(A,B) ),
inference(clausify,[status(thm)],[a4]) ).
cnf(c_46,negated_conjecture,
incident_point_and_line(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_47,negated_conjecture,
incident_point_and_line(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_50,negated_conjecture,
distinct_points(sK0,intersection_point(sK1,sK2)),
inference(resolve,[status(thm)],[c_39,c_37]) ).
cnf(c_51,negated_conjecture,
convergent_lines(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_72,plain,
( convergent_lines(A,C)
| distinct_lines(B,C)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ceq3]) ).
cnf(c_75,plain,
( apart_point_and_line(B,D)
| apart_point_and_line(B,C)
| apart_point_and_line(A,D)
| apart_point_and_line(A,C)
| ~ distinct_lines(C,D)
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[cu1]) ).
cnf(c_76,plain,
( ~ apart_point_and_line(intersection_point(A,B),B)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ci4]) ).
cnf(c_77,plain,
( ~ apart_point_and_line(intersection_point(A,B),A)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ci3]) ).
cnf(c_83,plain,
~ convergent_lines(A,A),
inference(clausify,[status(thm)],[apart3]) ).
cnf(c_86,negated_conjecture,
~ apart_point_and_line(sK0,sK1),
inference(resolve,[status(thm)],[c_44,c_46]) ).
cnf(c_87,negated_conjecture,
~ apart_point_and_line(sK0,sK2),
inference(resolve,[status(thm)],[c_44,c_47]) ).
cnf(c_95,negated_conjecture,
~ apart_point_and_line(intersection_point(sK1,sK2),sK2),
inference(resolve,[status(thm)],[c_76,c_51]) ).
cnf(c_96,negated_conjecture,
~ apart_point_and_line(intersection_point(sK1,sK2),sK1),
inference(resolve,[status(thm)],[c_77,c_51]) ).
cnf(c_116,negated_conjecture,
( apart_point_and_line(intersection_point(sK1,sK2),B)
| apart_point_and_line(intersection_point(sK1,sK2),A)
| apart_point_and_line(sK0,B)
| apart_point_and_line(sK0,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_75,c_50]) ).
cnf(c_117,negated_conjecture,
( apart_point_and_line(intersection_point(sK1,sK2),A)
| apart_point_and_line(intersection_point(sK1,sK2),sK2)
| apart_point_and_line(sK0,A)
| ~ distinct_lines(sK2,A) ),
inference(resolve,[status(thm)],[c_116,c_87]) ).
cnf(c_118,negated_conjecture,
( apart_point_and_line(intersection_point(sK1,sK2),sK1)
| apart_point_and_line(intersection_point(sK1,sK2),sK2)
| ~ distinct_lines(sK2,sK1) ),
inference(resolve,[status(thm)],[c_117,c_86]) ).
cnf(c_119,negated_conjecture,
( apart_point_and_line(intersection_point(sK1,sK2),sK1)
| ~ distinct_lines(sK2,sK1) ),
inference(resolve,[status(thm)],[c_118,c_95]) ).
cnf(c_110,negated_conjecture,
~ distinct_lines(sK2,sK1),
inference(resolve,[status(thm)],[c_119,c_96]) ).
cnf(c_120,plain,
( convergent_lines(A,sK1)
| ~ convergent_lines(A,sK2) ),
inference(resolve,[status(thm)],[c_72,c_110]) ).
cnf(c_121,plain,
~ convergent_lines(sK1,sK2),
inference(resolve,[status(thm)],[c_120,c_83]) ).
cnf(c_115,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_51,c_121]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO172+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 13:00:59 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 2070798 was started by sandbox on n011,
% 0.09/0.36 % Fri Sep 25 13:00:59 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.09/0.39
% 0.09/0.39 % SZS status Theorem for theBenchmark
% 0.09/0.39
% 0.09/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.39 % Length of proof is 26.
% 0.09/0.39 % Level of proof is 4.
% 0.09/0.39 % Maximum clause weight is 18.000.
% 0.09/0.39 % Given clauses 41.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------