%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO189+1 : 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 : n015.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:21 AM UTC 2026
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 11 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 71 ( 26 ~; 24 |; 15 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn 17 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ci1,axiom,
! [X,Y] :
( distinct_points(X,Y)
=> ~ apart_point_and_line(X,line_connecting(X,Y)) ),
file('theBenchmark.p',ci1) ).
fof(ci2,axiom,
! [X,Y] :
( distinct_points(X,Y)
=> ~ apart_point_and_line(Y,line_connecting(X,Y)) ),
file('theBenchmark.p',ci2) ).
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(con,conjecture,
! [X,Y,Z] :
( ( ~ apart_point_and_line(Z,line_connecting(X,Y))
& distinct_points(Y,Z)
& distinct_points(X,Z)
& distinct_points(X,Y) )
=> ~ apart_point_and_line(Y,line_connecting(X,Z)) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( ( ~ apart_point_and_line(Z,line_connecting(X,Y))
& distinct_points(Y,Z)
& distinct_points(X,Z)
& distinct_points(X,Y) )
=> ~ apart_point_and_line(Y,line_connecting(X,Z)) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_22,plain,
( ~ apart_point_and_line(A,line_connecting(A,B))
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[ci1]) ).
cnf(c_23,plain,
( ~ apart_point_and_line(B,line_connecting(A,B))
| ~ distinct_points(A,B) ),
inference(clausify,[status(thm)],[ci2]) ).
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_28,plain,
( apart_point_and_line(A,C)
| distinct_lines(B,C)
| ~ apart_point_and_line(A,B) ),
inference(clausify,[status(thm)],[ceq2]) ).
fof(nnf_15,plain,
? [X,Y,Z] :
( apart_point_and_line(Y,line_connecting(X,Z))
& ~ apart_point_and_line(Z,line_connecting(X,Y))
& distinct_points(Y,Z)
& distinct_points(X,Z)
& distinct_points(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( apart_point_and_line(sK1,line_connecting(sK0,sK2))
& ~ apart_point_and_line(sK2,line_connecting(sK0,sK1))
& distinct_points(sK1,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_15]) ).
cnf(c_30,negated_conjecture,
distinct_points(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_31,negated_conjecture,
distinct_points(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_33,negated_conjecture,
~ apart_point_and_line(sK2,line_connecting(sK0,sK1)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_34,negated_conjecture,
apart_point_and_line(sK1,line_connecting(sK0,sK2)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_35,plain,
~ apart_point_and_line(sK1,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_30,c_23]) ).
cnf(c_36,plain,
~ apart_point_and_line(sK0,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_30,c_22]) ).
cnf(c_38,plain,
~ apart_point_and_line(sK2,line_connecting(sK0,sK2)),
inference(resolve,[status(thm)],[c_31,c_23]) ).
cnf(c_39,plain,
~ apart_point_and_line(sK0,line_connecting(sK0,sK2)),
inference(resolve,[status(thm)],[c_31,c_22]) ).
cnf(c_44,plain,
( apart_point_and_line(sK1,A)
| distinct_lines(line_connecting(sK0,sK2),A) ),
inference(resolve,[status(thm)],[c_34,c_28]) ).
cnf(c_85,negated_conjecture,
( apart_point_and_line(sK2,B)
| apart_point_and_line(sK2,A)
| apart_point_and_line(sK0,B)
| apart_point_and_line(sK0,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_26,c_31]) ).
cnf(c_86,negated_conjecture,
( apart_point_and_line(sK2,A)
| apart_point_and_line(sK2,line_connecting(sK0,sK2))
| apart_point_and_line(sK0,A)
| ~ distinct_lines(line_connecting(sK0,sK2),A) ),
inference(resolve,[status(thm)],[c_85,c_39]) ).
cnf(c_87,negated_conjecture,
( apart_point_and_line(sK2,line_connecting(sK0,sK1))
| apart_point_and_line(sK2,line_connecting(sK0,sK2))
| ~ distinct_lines(line_connecting(sK0,sK2),line_connecting(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_86,c_36]) ).
cnf(c_88,negated_conjecture,
( apart_point_and_line(sK2,line_connecting(sK0,sK1))
| ~ distinct_lines(line_connecting(sK0,sK2),line_connecting(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_87,c_38]) ).
cnf(c_47,negated_conjecture,
~ distinct_lines(line_connecting(sK0,sK2),line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_88,c_33]) ).
cnf(c_89,plain,
apart_point_and_line(sK1,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_47,c_44]) ).
cnf(c_84,plain,
$false,
inference(resolve,[status(thm)],[c_35,c_89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO189+1 : 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.35 % Computer : n015.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 25 13:06:27 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 1420520 was started by sandbox on n015,
% 0.12/0.36 % Fri Sep 25 13:06:27 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.36
% 0.12/0.36 % 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 20.
% 0.12/0.38 % Level of proof is 4.
% 0.12/0.38 % Maximum clause weight is 18.000.
% 0.12/0.38 % Given clauses 41.
% 0.12/0.38
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------