%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO199+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 : n017.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:25 AM UTC 2026
% Result : Theorem 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 41 ( 16 unt; 0 def)
% Number of atoms : 100 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 93 ( 34 ~; 36 |; 15 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 56 ( 0 sgn 23 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart1,axiom,
! [X] : ~ distinct_points(X,X),
file('theBenchmark.p',apart1) ).
fof(apart3,axiom,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',apart3) ).
fof(apart6,axiom,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( convergent_lines(Y,Z)
| convergent_lines(X,Z) ) ),
file('theBenchmark.p',apart6) ).
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(ceq1,axiom,
! [X,Y,Z] :
( apart_point_and_line(X,Y)
=> ( apart_point_and_line(Z,Y)
| distinct_points(X,Z) ) ),
file('theBenchmark.p',ceq1) ).
fof(ceq3,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('theBenchmark.p',ceq3) ).
fof(con,conjecture,
! [X,Y,Z] :
( ( ~ apart_point_and_line(intersection_point(X,Y),Z)
& convergent_lines(X,Z)
& convergent_lines(Z,Y)
& convergent_lines(X,Y) )
=> ~ apart_point_and_line(intersection_point(Y,X),Z) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( ( ~ apart_point_and_line(intersection_point(X,Y),Z)
& convergent_lines(X,Z)
& convergent_lines(Z,Y)
& convergent_lines(X,Y) )
=> ~ apart_point_and_line(intersection_point(Y,X),Z) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_14,plain,
~ distinct_points(A,A),
inference(clausify,[status(thm)],[apart1]) ).
cnf(c_16,plain,
~ convergent_lines(A,A),
inference(clausify,[status(thm)],[apart3]) ).
cnf(c_19,plain,
( convergent_lines(B,C)
| convergent_lines(A,C)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[apart6]) ).
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_23,plain,
( distinct_points(C,intersection_point(A,B))
| ~ apart_point_and_line(C,B)
| ~ 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]) ).
cnf(c_25,plain,
( apart_point_and_line(C,B)
| distinct_points(A,C)
| ~ apart_point_and_line(A,B) ),
inference(clausify,[status(thm)],[ceq1]) ).
cnf(c_27,plain,
( distinct_lines(A,B)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ceq3]) ).
fof(nnf_13,plain,
? [X,Y,Z] :
( apart_point_and_line(intersection_point(Y,X),Z)
& ~ apart_point_and_line(intersection_point(X,Y),Z)
& convergent_lines(X,Z)
& convergent_lines(Z,Y)
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( apart_point_and_line(intersection_point(sK1,sK0),sK2)
& ~ apart_point_and_line(intersection_point(sK0,sK1),sK2)
& convergent_lines(sK0,sK2)
& convergent_lines(sK2,sK1)
& 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_31,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_32,negated_conjecture,
apart_point_and_line(intersection_point(sK1,sK0),sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_33,plain,
distinct_lines(sK0,sK1),
inference(resolve,[status(thm)],[c_28,c_27]) ).
cnf(c_36,plain,
( convergent_lines(sK1,A)
| convergent_lines(sK0,A) ),
inference(resolve,[status(thm)],[c_28,c_19]) ).
cnf(c_123,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,sK1) ),
inference(resolve,[status(thm)],[c_23,c_28]) ).
cnf(c_37,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_123,c_14]) ).
cnf(c_124,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_38,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_124,c_14]) ).
cnf(c_52,plain,
( apart_point_and_line(A,sK2)
| distinct_points(intersection_point(sK1,sK0),A) ),
inference(resolve,[status(thm)],[c_32,c_25]) ).
cnf(c_65,plain,
convergent_lines(sK1,sK0),
inference(resolve,[status(thm)],[c_36,c_16]) ).
cnf(c_125,plain,
( distinct_points(A,intersection_point(sK1,sK0))
| ~ apart_point_and_line(A,sK0) ),
inference(resolve,[status(thm)],[c_23,c_65]) ).
cnf(c_73,plain,
~ apart_point_and_line(intersection_point(sK1,sK0),sK0),
inference(resolve,[status(thm)],[c_125,c_14]) ).
cnf(c_126,plain,
( distinct_points(A,intersection_point(sK1,sK0))
| ~ apart_point_and_line(A,sK1) ),
inference(resolve,[status(thm)],[c_22,c_65]) ).
cnf(c_74,plain,
~ apart_point_and_line(intersection_point(sK1,sK0),sK1),
inference(resolve,[status(thm)],[c_126,c_14]) ).
cnf(c_127,plain,
( apart_point_and_line(B,sK1)
| apart_point_and_line(B,sK0)
| apart_point_and_line(A,sK1)
| apart_point_and_line(A,sK0)
| ~ distinct_points(A,B) ),
inference(resolve,[status(thm)],[c_24,c_33]) ).
cnf(c_128,plain,
( apart_point_and_line(A,sK1)
| apart_point_and_line(A,sK0)
| apart_point_and_line(intersection_point(sK1,sK0),sK1)
| ~ distinct_points(intersection_point(sK1,sK0),A) ),
inference(resolve,[status(thm)],[c_127,c_73]) ).
cnf(c_129,plain,
( apart_point_and_line(A,sK1)
| apart_point_and_line(A,sK0)
| ~ distinct_points(intersection_point(sK1,sK0),A) ),
inference(resolve,[status(thm)],[c_128,c_74]) ).
cnf(c_130,plain,
( apart_point_and_line(intersection_point(sK0,sK1),sK1)
| ~ distinct_points(intersection_point(sK1,sK0),intersection_point(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_129,c_38]) ).
cnf(c_89,plain,
~ distinct_points(intersection_point(sK1,sK0),intersection_point(sK0,sK1)),
inference(resolve,[status(thm)],[c_130,c_37]) ).
cnf(c_131,negated_conjecture,
distinct_points(intersection_point(sK1,sK0),intersection_point(sK0,sK1)),
inference(resolve,[status(thm)],[c_52,c_31]) ).
cnf(c_122,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_89,c_131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO199+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 % Computer : n017.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Fri Sep 25 13:00:03 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.45 % Process 2325268 was started by sandbox on n017,
% 0.19/0.45 % Fri Sep 25 13:00:03 2026
% 0.19/0.45 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.19/0.46
% 0.19/0.46 % From the command line: assign(max_seconds, 300).
% 0.19/0.49
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49
% 0.19/0.49 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.19/0.49 % Length of proof is 29.
% 0.19/0.49 % Level of proof is 6.
% 0.19/0.49 % Maximum clause weight is 23.000.
% 0.19/0.49 % Given clauses 48.
% 0.19/0.49
% 0.19/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------