%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO202+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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.12s 0.40s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 50 ( 21 unt; 0 def)
% Number of atoms : 109 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 98 ( 39 ~; 38 |; 12 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 108 ( 20 sgn 36 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart2,axiom,
! [X] : ~ distinct_lines(X,X),
file('theBenchmark.p',apart2) ).
fof(apart3,axiom,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',apart3) ).
fof(apart5,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(Y,Z)
| distinct_lines(X,Z) ) ),
file('theBenchmark.p',apart5) ).
fof(ax6,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(Y,Z)
| convergent_lines(X,Z) ) ),
file('theBenchmark.p',ax6) ).
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(ceq2,axiom,
! [X,Y,Z] :
( apart_point_and_line(X,Y)
=> ( apart_point_and_line(X,Z)
| distinct_lines(Y,Z) ) ),
file('theBenchmark.p',ceq2) ).
fof(ceq3,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(X,Z)
| distinct_lines(Y,Z) ) ),
file('theBenchmark.p',ceq3) ).
fof(p1,axiom,
! [X,Y] :
( distinct_lines(X,Y)
=> convergent_lines(X,Y) ),
file('theBenchmark.p',p1) ).
fof(cp1,axiom,
! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
file('theBenchmark.p',cp1) ).
fof(cp2,axiom,
! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
file('theBenchmark.p',cp2) ).
fof(ooc1,axiom,
! [A,L] : ~ unorthogonal_lines(orthogonal_through_point(L,A),L),
file('theBenchmark.p',ooc1) ).
fof(coipo1,axiom,
! [L,M] :
~ ( ~ unorthogonal_lines(L,M)
& ~ convergent_lines(L,M) ),
file('theBenchmark.p',coipo1) ).
fof(ax1,axiom,
! [X,Y] :
( equal_points(X,Y)
<=> ~ distinct_points(X,Y) ),
file('theBenchmark.p',ax1) ).
fof(con,conjecture,
! [X,Y,Z] :
( ( convergent_lines(line_connecting(X,Y),line_connecting(X,Z))
& distinct_points(X,Z)
& distinct_points(X,Y) )
=> equal_points(intersection_point(line_connecting(X,Y),line_connecting(X,Z)),X) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( ( convergent_lines(line_connecting(X,Y),line_connecting(X,Z))
& distinct_points(X,Z)
& distinct_points(X,Y) )
=> equal_points(intersection_point(line_connecting(X,Y),line_connecting(X,Z)),X) ),
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(intersection_point(line_connecting(X,Y),line_connecting(X,Z)),X)
& convergent_lines(line_connecting(X,Y),line_connecting(X,Z))
& distinct_points(X,Z)
& distinct_points(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ equal_points(intersection_point(line_connecting(sK0,sK1),line_connecting(sK0,sK2)),sK0)
& convergent_lines(line_connecting(sK0,sK1),line_connecting(sK0,sK2))
& distinct_points(sK0,sK2)
& distinct_points(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2)],[nnf_36]) ).
cnf(c_39,negated_conjecture,
~ equal_points(intersection_point(line_connecting(sK0,sK1),line_connecting(sK0,sK2)),sK0),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_48,negated_conjecture,
distinct_points(intersection_point(line_connecting(sK0,sK1),line_connecting(sK0,sK2)),sK0),
inference(resolve,[status(thm)],[c_39,c_37]) ).
cnf(c_60,plain,
( unorthogonal_lines(A,B)
| convergent_lines(A,B) ),
inference(clausify,[status(thm)],[coipo1]) ).
cnf(c_63,plain,
~ unorthogonal_lines(orthogonal_through_point(A,B),A),
inference(clausify,[status(thm)],[ooc1]) ).
cnf(c_69,plain,
~ apart_point_and_line(A,parallel_through_point(B,A)),
inference(clausify,[status(thm)],[cp2]) ).
cnf(c_70,plain,
~ convergent_lines(parallel_through_point(A,B),A),
inference(clausify,[status(thm)],[cp1]) ).
cnf(c_71,plain,
( convergent_lines(A,B)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[p1]) ).
cnf(c_72,plain,
( convergent_lines(A,C)
| distinct_lines(B,C)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ceq3]) ).
cnf(c_73,plain,
( apart_point_and_line(A,C)
| distinct_lines(B,C)
| ~ apart_point_and_line(A,B) ),
inference(clausify,[status(thm)],[ceq2]) ).
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_80,plain,
( convergent_lines(B,C)
| convergent_lines(A,C)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ax6]) ).
cnf(c_81,plain,
( distinct_lines(B,C)
| distinct_lines(A,C)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[apart5]) ).
cnf(c_83,plain,
~ convergent_lines(A,A),
inference(clausify,[status(thm)],[apart3]) ).
cnf(c_84,plain,
~ distinct_lines(A,A),
inference(clausify,[status(thm)],[apart2]) ).
cnf(c_91,plain,
convergent_lines(orthogonal_through_point(A,B),A),
inference(resolve,[status(thm)],[c_63,c_60]) ).
cnf(c_92,plain,
~ distinct_lines(parallel_through_point(A,B),A),
inference(resolve,[status(thm)],[c_71,c_70]) ).
cnf(c_96,plain,
( apart_point_and_line(sK0,B)
| apart_point_and_line(sK0,A)
| apart_point_and_line(intersection_point(line_connecting(sK0,sK1),line_connecting(sK0,sK2)),B)
| apart_point_and_line(intersection_point(line_connecting(sK0,sK1),line_connecting(sK0,sK2)),A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_75,c_48]) ).
cnf(c_190,plain,
( convergent_lines(B,A)
| ~ convergent_lines(A,B) ),
inference(resolve,[status(thm)],[c_80,c_83]) ).
cnf(c_110,plain,
~ convergent_lines(A,parallel_through_point(A,B)),
inference(resolve,[status(thm)],[c_190,c_70]) ).
cnf(c_191,plain,
( distinct_lines(B,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_81,c_84]) ).
cnf(c_112,plain,
~ distinct_lines(A,parallel_through_point(A,B)),
inference(resolve,[status(thm)],[c_191,c_92]) ).
cnf(c_171,plain,
( convergent_lines(orthogonal_through_point(A,C),B)
| distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_91,c_72]) ).
cnf(c_192,plain,
( convergent_lines(B,parallel_through_point(A,C))
| ~ convergent_lines(A,B) ),
inference(resolve,[status(thm)],[c_80,c_110]) ).
cnf(c_178,plain,
~ convergent_lines(A,parallel_through_point(parallel_through_point(A,B),C)),
inference(resolve,[status(thm)],[c_192,c_70]) ).
cnf(c_193,plain,
( apart_point_and_line(A,parallel_through_point(B,C))
| ~ apart_point_and_line(A,B) ),
inference(resolve,[status(thm)],[c_73,c_112]) ).
cnf(c_181,plain,
~ apart_point_and_line(A,B),
inference(resolve,[status(thm)],[c_193,c_69]) ).
cnf(c_194,plain,
( apart_point_and_line(sK0,B)
| apart_point_and_line(sK0,A)
| apart_point_and_line(intersection_point(line_connecting(sK0,sK1),line_connecting(sK0,sK2)),B)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_181,c_96]) ).
cnf(c_195,plain,
( apart_point_and_line(sK0,B)
| apart_point_and_line(sK0,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_181,c_194]) ).
cnf(c_196,plain,
( apart_point_and_line(sK0,B)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_181,c_195]) ).
cnf(c_187,plain,
~ distinct_lines(A,B),
inference(resolve,[status(thm)],[c_181,c_196]) ).
cnf(c_188,plain,
convergent_lines(orthogonal_through_point(A,B),C),
inference(resolve,[status(thm)],[c_187,c_171]) ).
cnf(c_189,plain,
$false,
inference(resolve,[status(thm)],[c_188,c_178]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO202+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n020.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Fri Sep 25 13:05:49 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.37 % Process 2982533 was started by sandbox2 on n020,
% 0.12/0.37 % Fri Sep 25 13:05:49 2026
% 0.12/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.39
% 0.12/0.39 % From the command line: assign(max_seconds, 300).
% 0.12/0.40
% 0.12/0.40 % SZS status Theorem for theBenchmark
% 0.12/0.40
% 0.12/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.40 % Length of proof is 40.
% 0.12/0.40 % Level of proof is 7.
% 0.12/0.40 % Maximum clause weight is 42.000.
% 0.12/0.40 % Given clauses 55.
% 0.12/0.40
% 0.12/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------