%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO203+1 : 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 : n016.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 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 26 ( 10 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 57 ( 19 ~; 21 |; 11 &)
% ( 0 <=>; 6 =>; 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 : 31 ( 0 sgn 16 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ci1,axiom,
! [X,Y] :
( distinct_points(X,Y)
=> ~ apart_point_and_line(X,line_connecting(X,Y)) ),
file('theBenchmark.p',ci1) ).
fof(ci2,axiom,
! [X,Y] :
( distinct_points(X,Y)
=> ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
file('theBenchmark.p',ci2) ).
fof(ci3,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ apart_point_and_line(intersection_point(X,Y),X) ),
file('theBenchmark.p',ci3) ).
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_22,plain,
( ~ apart_point_and_line(A,line_connecting(A,B))
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[ci1]) ).
cnf(c_23,plain,
( ~ apart_point_and_line(B,line_connecting(A,B))
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[ci2]) ).
cnf(c_24,plain,
( ~ apart_point_and_line(intersection_point(A,B),A)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ci3]) ).
cnf(c_26,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_15,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_15]) ).
cnf(c_30,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_31,negated_conjecture,
convergent_lines(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_32,negated_conjecture,
distinct_points(intersection_point(sK0,sK1),intersection_point(sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_33,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_36,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_30,c_24]) ).
cnf(c_40,plain,
~ apart_point_and_line(intersection_point(sK0,sK2),sK0),
inference(resolve,[status(thm)],[c_31,c_24]) ).
cnf(c_42,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_32,c_26]) ).
cnf(c_43,plain,
~ apart_point_and_line(intersection_point(sK0,sK2),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(resolve,[status(thm)],[c_32,c_23]) ).
cnf(c_44,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),line_connecting(intersection_point(sK0,sK1),intersection_point(sK0,sK2))),
inference(resolve,[status(thm)],[c_32,c_22]) ).
cnf(c_65,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_42,c_33]) ).
cnf(c_66,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_44,c_65]) ).
cnf(c_67,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_36,c_66]) ).
cnf(c_68,negated_conjecture,
apart_point_and_line(intersection_point(sK0,sK2),sK0),
inference(resolve,[status(thm)],[c_43,c_67]) ).
cnf(c_64,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_40,c_68]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO203+1 : 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/0.36 % Computer : n016.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:09:46 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2443413 was started by sandbox on n016,
% 0.09/0.37 % Fri Sep 25 13:09:46 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % 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.00 (+ 0.00) seconds.
% 0.09/0.39 % Length of proof is 19.
% 0.09/0.39 % Level of proof is 3.
% 0.09/0.39 % Maximum clause weight is 23.000.
% 0.09/0.39 % Given clauses 28.
% 0.09/0.39
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------