%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO201+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:26 AM UTC 2026
% Result : Theorem 0.09s 0.37s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 75 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 65 ( 24 ~; 31 |; 3 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 19 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart3,axiom,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',apart3) ).
fof(ax6,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(Y,Z)
| convergent_lines(X,Z) ) ),
file('theBenchmark.p',ax6) ).
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(con,conjecture,
! [X,Y] :
( convergent_lines(X,Y)
=> ~ distinct_points(intersection_point(X,Y),intersection_point(Y,X)) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y] :
( convergent_lines(X,Y)
=> ~ distinct_points(intersection_point(X,Y),intersection_point(Y,X)) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_18,plain,
~ convergent_lines(A,A),
inference(clausify,[status(thm)],[apart3]) ).
cnf(c_21,plain,
( convergent_lines(B,C)
| convergent_lines(A,C)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ax6]) ).
cnf(c_24,plain,
( ~ apart_point_and_line(intersection_point(A,B),A)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ci3]) ).
cnf(c_25,plain,
( ~ apart_point_and_line(intersection_point(A,B),B)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ci4]) ).
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]) ).
cnf(c_29,plain,
( convergent_lines(A,C)
| distinct_lines(B,C)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ceq3]) ).
fof(nnf_15,plain,
? [X,Y] :
( distinct_points(intersection_point(X,Y),intersection_point(Y,X))
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0))
& convergent_lines(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_15]) ).
cnf(c_30,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_31,negated_conjecture,
distinct_points(intersection_point(sK0,sK1),intersection_point(sK1,sK0)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_33,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_30,c_25]) ).
cnf(c_34,plain,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_30,c_24]) ).
cnf(c_35,plain,
( convergent_lines(sK1,A)
| convergent_lines(sK0,A) ),
inference(resolve,[status(thm)],[c_30,c_21]) ).
cnf(c_36,plain,
( apart_point_and_line(intersection_point(sK1,sK0),B)
| apart_point_and_line(intersection_point(sK1,sK0),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_31,c_26]) ).
cnf(c_44,plain,
( convergent_lines(A,B)
| convergent_lines(sK1,B)
| convergent_lines(sK0,A) ),
inference(resolve,[status(thm)],[c_35,c_21]) ).
cnf(c_59,plain,
( convergent_lines(sK1,sK0)
| convergent_lines(sK0,sK0) ),
inference(factor,[status(thm)],[c_44]) ).
cnf(c_45,plain,
convergent_lines(sK1,sK0),
inference(resolve,[status(thm)],[c_18,c_59]) ).
cnf(c_46,plain,
( convergent_lines(sK1,A)
| distinct_lines(sK0,A) ),
inference(resolve,[status(thm)],[c_45,c_29]) ).
cnf(c_47,plain,
~ apart_point_and_line(intersection_point(sK1,sK0),sK0),
inference(resolve,[status(thm)],[c_45,c_25]) ).
cnf(c_48,plain,
~ apart_point_and_line(intersection_point(sK1,sK0),sK1),
inference(resolve,[status(thm)],[c_45,c_24]) ).
cnf(c_60,plain,
( apart_point_and_line(intersection_point(sK1,sK0),A)
| apart_point_and_line(intersection_point(sK1,sK0),sK0)
| apart_point_and_line(intersection_point(sK0,sK1),A)
| ~ distinct_lines(sK0,A) ),
inference(resolve,[status(thm)],[c_36,c_34]) ).
cnf(c_61,plain,
( apart_point_and_line(intersection_point(sK1,sK0),sK1)
| apart_point_and_line(intersection_point(sK1,sK0),sK0)
| ~ distinct_lines(sK0,sK1) ),
inference(resolve,[status(thm)],[c_60,c_33]) ).
cnf(c_62,plain,
( apart_point_and_line(intersection_point(sK1,sK0),sK1)
| ~ distinct_lines(sK0,sK1) ),
inference(resolve,[status(thm)],[c_61,c_47]) ).
cnf(c_55,plain,
~ distinct_lines(sK0,sK1),
inference(resolve,[status(thm)],[c_62,c_48]) ).
cnf(c_63,plain,
convergent_lines(sK1,sK1),
inference(resolve,[status(thm)],[c_55,c_46]) ).
cnf(c_58,plain,
$false,
inference(resolve,[status(thm)],[c_18,c_63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO201+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.34 % Computer : n003.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Fri Sep 25 13:06:54 UTC 2026
% 0.09/0.34 % CPUTime :
% 0.09/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35 % Process 236235 was started by sandbox2 on n003,
% 0.09/0.35 % Fri Sep 25 13:06:54 2026
% 0.09/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.35
% 0.09/0.35 % From the command line: assign(max_seconds, 300).
% 0.09/0.37
% 0.09/0.37 % SZS status Theorem for theBenchmark
% 0.09/0.37
% 0.09/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.37 % Length of proof is 26.
% 0.09/0.37 % Level of proof is 7.
% 0.09/0.37 % Maximum clause weight is 23.000.
% 0.09/0.37 % Given clauses 29.
% 0.09/0.37
% 0.09/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------