%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO203+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n003.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:27 AM UTC 2026
% Result : Theorem 0.09s 5.56s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 12 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 70 ( 22 ~; 29 |; 12 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 0 sgn 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart1,axiom,
! [X] : ~ distinct_points(X,X),
file('theBenchmark.p',apart1) ).
fof(con1,axiom,
! [X,Y,Z] :
( distinct_points(X,Y)
=> ( apart_point_and_line(Z,line_connecting(X,Y))
=> ( distinct_points(Z,Y)
& distinct_points(Z,X) ) ) ),
file('theBenchmark.p',con1) ).
fof(con2,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('theBenchmark.p',con2) ).
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(con,conjecture,
! [X,Y,Z] :
( ( distinct_points(intersection_point(X,Y),intersection_point(X,Z))
& convergent_lines(X,Z)
& convergent_lines(X,Y) )
=> ~ distinct_lines(line_connecting(intersection_point(X,Y),intersection_point(X,Z)),X) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( ( distinct_points(intersection_point(X,Y),intersection_point(X,Z))
& convergent_lines(X,Z)
& convergent_lines(X,Y) )
=> ~ distinct_lines(line_connecting(intersection_point(X,Y),intersection_point(X,Z)),X) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_14,plain,
~ distinct_points(A,A),
inference(clausify,[status(thm)],[apart1]) ).
cnf(c_20,plain,
( distinct_points(C,A)
| ~ apart_point_and_line(C,line_connecting(A,B))
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[con1]) ).
cnf(c_21,plain,
( distinct_points(C,B)
| ~ apart_point_and_line(C,line_connecting(A,B))
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[con1]) ).
cnf(c_22,plain,
( distinct_points(C,intersection_point(A,B))
| ~ apart_point_and_line(C,A)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[con2]) ).
cnf(c_24,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]) ).
fof(nnf_13,plain,
? [X,Y,Z] :
( distinct_lines(line_connecting(intersection_point(X,Y),intersection_point(X,Z)),X)
& distinct_points(intersection_point(X,Y),intersection_point(X,Z))
& convergent_lines(X,Z)
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0)
& distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2))
& convergent_lines(sK0,sK2)
& convergent_lines(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2)],[nnf_13]) ).
cnf(c_28,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_29,negated_conjecture,
convergent_lines(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_30,negated_conjecture,
distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_31,negated_conjecture,
distinct_lines(line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),sK0),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_79,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,sK0) ),
inference(resolve,[status(thm)],[c_22,c_28]) ).
cnf(c_37,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_79,c_14]) ).
cnf(c_80,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK2))
| ~ apart_point_and_line(A,sK0) ),
inference(resolve,[status(thm)],[c_22,c_29]) ).
cnf(c_43,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK2),sK0),
inference(resolve,[status(thm)],[c_80,c_14]) ).
cnf(c_44,plain,
( apart_point_and_line(intersection_point(sK0,sK2),B)
| apart_point_and_line(intersection_point(sK0,sK2),A)
| apart_point_and_line(intersection_point(sK0,sK1),B)
| apart_point_and_line(intersection_point(sK0,sK1),A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_30,c_24]) ).
cnf(c_81,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK2))
| ~ apart_point_and_line(A,line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(resolve,[status(thm)],[c_21,c_30]) ).
cnf(c_48,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(resolve,[status(thm)],[c_81,c_14]) ).
cnf(c_82,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(resolve,[status(thm)],[c_20,c_30]) ).
cnf(c_49,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(resolve,[status(thm)],[c_82,c_14]) ).
cnf(c_83,negated_conjecture,
( apart_point_and_line(intersection_point(sK0,sK2),sK0)
| apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
| apart_point_and_line(intersection_point(sK0,sK1),sK0)
| apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(resolve,[status(thm)],[c_44,c_31]) ).
cnf(c_84,negated_conjecture,
( apart_point_and_line(intersection_point(sK0,sK2),sK0)
| apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2)))
| apart_point_and_line(intersection_point(sK0,sK1),sK0) ),
inference(resolve,[status(thm)],[c_49,c_83]) ).
cnf(c_85,negated_conjecture,
( apart_point_and_line(intersection_point(sK0,sK2),sK0)
| apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))) ),
inference(resolve,[status(thm)],[c_37,c_84]) ).
cnf(c_86,negated_conjecture,
apart_point_and_line(intersection_point(sK0,sK2),sK0),
inference(resolve,[status(thm)],[c_48,c_85]) ).
cnf(c_78,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_43,c_86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO203+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.53 % Computer : n003.cluster.edu
% 0.09/5.53 % Model : x86_64 x86_64
% 0.09/5.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.53 % Memory : 8046.5625MB
% 0.09/5.53 % OS : Linux 6.8.0-71-generic
% 0.09/5.53 % CPULimit : 300
% 0.09/5.53 % WCLimit : 300
% 0.09/5.53 % DateTime : Fri Sep 25 13:07:14 UTC 2026
% 0.09/5.54 % CPUTime :
% 0.09/5.54 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.54 % Process 237503 was started by sandbox on n003,
% 0.09/5.54 % Fri Sep 25 13:07:14 2026
% 0.09/5.54 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/5.54
% 0.09/5.54 % From the command line: assign(max_seconds, 300).
% 0.09/5.56
% 0.09/5.56 % SZS status Theorem for theBenchmark
% 0.09/5.56
% 0.09/5.56 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/5.56 % Length of proof is 20.
% 0.09/5.56 % Level of proof is 3.
% 0.09/5.56 % Maximum clause weight is 33.000.
% 0.09/5.56 % Given clauses 34.
% 0.09/5.56
% 0.09/5.56 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------