%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO226+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 : n008.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:36 AM UTC 2026
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 7 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 45 ( 15 ~; 10 |; 14 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart1,axiom,
! [X] : ~ distinct_points(X,X),
file('theBenchmark.p',apart1) ).
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(con,conjecture,
! [L,M] :
( ( convergent_lines(L,M)
& line(M)
& line(L) )
=> ? [X] :
( point(X)
=> ( ~ apart_point_and_line(X,M)
& ~ apart_point_and_line(X,L) ) ) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [L,M] :
( ( convergent_lines(L,M)
& line(M)
& line(L) )
=> ? [X] :
( point(X)
=> ( ~ apart_point_and_line(X,M)
& ~ apart_point_and_line(X,L) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_18,plain,
~ distinct_points(A,A),
inference(clausify,[status(thm)],[apart1]) ).
cnf(c_26,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_27,plain,
( distinct_points(C,intersection_point(A,B))
| ~ apart_point_and_line(C,B)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[con2]) ).
fof(nnf_17,plain,
? [L,M] :
( ! [X] :
( ( apart_point_and_line(X,M)
| apart_point_and_line(X,L) )
& point(X) )
& convergent_lines(L,M)
& line(M)
& line(L) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ! [X] :
( ( apart_point_and_line(X,sK1)
| apart_point_and_line(X,sK0) )
& point(X) )
& convergent_lines(sK0,sK1)
& line(sK1)
& line(sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(L,sK0),skolemize(M,sK1)],[nnf_17]) ).
cnf(c_38,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_40,negated_conjecture,
( apart_point_and_line(A,sK1)
| apart_point_and_line(A,sK0) ),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_62,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,sK1) ),
inference(resolve,[status(thm)],[c_27,c_38]) ).
cnf(c_48,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),sK1),
inference(resolve,[status(thm)],[c_62,c_18]) ).
cnf(c_63,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,sK0) ),
inference(resolve,[status(thm)],[c_26,c_38]) ).
cnf(c_49,negated_conjecture,
~ apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_63,c_18]) ).
cnf(c_64,negated_conjecture,
apart_point_and_line(intersection_point(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_48,c_40]) ).
cnf(c_61,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_49,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO226+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n008.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:39 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 1124286 was started by sandbox on n008,
% 0.12/0.36 % Fri Sep 25 13:09:39 2026
% 0.12/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.12/0.37
% 0.12/0.37 % From the command line: assign(max_seconds, 300).
% 0.12/0.38
% 0.12/0.38 % SZS status Theorem for theBenchmark
% 0.12/0.38
% 0.12/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.12/0.38 % Length of proof is 11.
% 0.12/0.38 % Level of proof is 3.
% 0.12/0.38 % Maximum clause weight is 21.000.
% 0.12/0.38 % Given clauses 26.
% 0.12/0.38
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------