%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO196+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:24 AM UTC 2026
% Result : Theorem 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 24 ~; 14 |; 16 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 55 ( 9 sgn 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart2,axiom,
! [X] : ~ distinct_lines(X,X),
file('theBenchmark.p',apart2) ).
fof(apart5,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(Y,Z)
| distinct_lines(X,Z) ) ),
file('theBenchmark.p',apart5) ).
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(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(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,U,V] :
( ( incident_point_and_line(intersection_point(X,Y),V)
& incident_point_and_line(intersection_point(X,Y),U)
& convergent_lines(U,V)
& convergent_lines(X,Y) )
=> ( incident_point_and_line(intersection_point(U,V),Y)
& incident_point_and_line(intersection_point(U,V),X) ) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,U,V] :
( ( incident_point_and_line(intersection_point(X,Y),V)
& incident_point_and_line(intersection_point(X,Y),U)
& convergent_lines(U,V)
& convergent_lines(X,Y) )
=> ( incident_point_and_line(intersection_point(U,V),Y)
& incident_point_and_line(intersection_point(U,V),X) ) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_46,plain,
~ distinct_lines(A,A),
inference(clausify,[status(thm)],[apart2]) ).
cnf(c_49,plain,
( distinct_lines(B,C)
| distinct_lines(A,C)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[apart5]) ).
cnf(c_57,plain,
( apart_point_and_line(A,C)
| distinct_lines(B,C)
| ~ apart_point_and_line(A,B) ),
inference(clausify,[status(thm)],[ceq2]) ).
cnf(c_59,plain,
( convergent_lines(A,B)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[p1]) ).
cnf(c_60,plain,
~ convergent_lines(parallel_through_point(A,B),A),
inference(clausify,[status(thm)],[cp1]) ).
cnf(c_61,plain,
~ apart_point_and_line(A,parallel_through_point(B,A)),
inference(clausify,[status(thm)],[cp2]) ).
cnf(c_79,plain,
( apart_point_and_line(A,B)
| incident_point_and_line(A,B) ),
inference(clausify,[status(thm)],[a4]) ).
fof(nnf_36,plain,
? [X,Y,U,V] :
( ( ~ incident_point_and_line(intersection_point(U,V),Y)
| ~ incident_point_and_line(intersection_point(U,V),X) )
& incident_point_and_line(intersection_point(X,Y),V)
& incident_point_and_line(intersection_point(X,Y),U)
& convergent_lines(U,V)
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ( ~ incident_point_and_line(intersection_point(sK0,sK1),sK3)
| ~ incident_point_and_line(intersection_point(sK0,sK1),sK2) )
& incident_point_and_line(intersection_point(sK2,sK3),sK1)
& incident_point_and_line(intersection_point(sK2,sK3),sK0)
& convergent_lines(sK0,sK1)
& convergent_lines(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK0,sK1]),skolemize(X,sK2),skolemize(Y,sK3),skolemize(U,sK0),skolemize(V,sK1)],[nnf_36]) ).
cnf(c_84,negated_conjecture,
( ~ incident_point_and_line(intersection_point(sK0,sK1),sK3)
| ~ incident_point_and_line(intersection_point(sK0,sK1),sK2) ),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_85,plain,
~ distinct_lines(parallel_through_point(A,B),A),
inference(resolve,[status(thm)],[c_59,c_60]) ).
cnf(c_115,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK2)
| ~ incident_point_and_line(intersection_point(sK0,sK1),sK3) ),
inference(resolve,[status(thm)],[c_84,c_79]) ).
cnf(c_199,plain,
( distinct_lines(B,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_49,c_46]) ).
cnf(c_120,plain,
~ distinct_lines(A,parallel_through_point(A,B)),
inference(resolve,[status(thm)],[c_199,c_85]) ).
cnf(c_200,plain,
( apart_point_and_line(A,parallel_through_point(B,C))
| ~ apart_point_and_line(A,B) ),
inference(resolve,[status(thm)],[c_57,c_120]) ).
cnf(c_188,plain,
~ apart_point_and_line(A,B),
inference(resolve,[status(thm)],[c_200,c_61]) ).
cnf(c_196,plain,
~ incident_point_and_line(intersection_point(sK0,sK1),sK3),
inference(resolve,[status(thm)],[c_188,c_115]) ).
cnf(c_197,plain,
incident_point_and_line(A,B),
inference(resolve,[status(thm)],[c_188,c_79]) ).
cnf(c_198,plain,
$false,
inference(resolve,[status(thm)],[c_197,c_196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO196+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.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 13:04:28 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 2077231 was started by sandbox on n011,
% 0.09/0.37 % Fri Sep 25 13:04:28 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.39
% 0.09/0.39 % From the command line: assign(max_seconds, 300).
% 0.09/0.40
% 0.09/0.40 % SZS status Theorem for theBenchmark
% 0.09/0.40
% 0.09/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.40 % Length of proof is 23.
% 0.09/0.40 % Level of proof is 6.
% 0.09/0.40 % Maximum clause weight is 20.000.
% 0.09/0.40 % Given clauses 58.
% 0.09/0.40
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------