%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO178+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n007.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:17 AM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 43 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 18 ~; 10 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 13 !; 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(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(con,conjecture,
! [X,Y,Z] :
( ( apart_point_and_line(Z,line_connecting(X,Y))
& distinct_points(X,Y) )
=> ( distinct_points(Z,Y)
& distinct_points(Z,X) ) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( ( apart_point_and_line(Z,line_connecting(X,Y))
& distinct_points(X,Y) )
=> ( distinct_points(Z,Y)
& distinct_points(Z,X) ) ),
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_27,plain,
( apart_point_and_line(C,B)
| distinct_points(A,C)
| ~ apart_point_and_line(A,B) ),
inference(clausify,[status(thm)],[ceq1]) ).
fof(nnf_15,plain,
? [X,Y,Z] :
( ( ~ distinct_points(Z,Y)
| ~ distinct_points(Z,X) )
& apart_point_and_line(Z,line_connecting(X,Y))
& distinct_points(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ( ~ distinct_points(sK2,sK1)
| ~ distinct_points(sK2,sK0) )
& apart_point_and_line(sK2,line_connecting(sK0,sK1))
& 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,
apart_point_and_line(sK2,line_connecting(sK0,sK1)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_32,negated_conjecture,
( ~ distinct_points(sK2,sK1)
| ~ distinct_points(sK2,sK0) ),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_34,plain,
~ apart_point_and_line(sK1,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_30,c_23]) ).
cnf(c_35,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(A,line_connecting(sK0,sK1))
| distinct_points(sK2,A) ),
inference(resolve,[status(thm)],[c_31,c_27]) ).
cnf(c_55,negated_conjecture,
( ~ distinct_points(sK2,sK0)
| apart_point_and_line(sK1,line_connecting(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_38,c_32]) ).
cnf(c_48,negated_conjecture,
~ distinct_points(sK2,sK0),
inference(resolve,[status(thm)],[c_34,c_55]) ).
cnf(c_56,plain,
apart_point_and_line(sK0,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_48,c_38]) ).
cnf(c_54,plain,
$false,
inference(resolve,[status(thm)],[c_35,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GEO178+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n007.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 13:00:09 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 1056996 was started by sandbox2 on n007,
% 0.17/0.44 % Fri Sep 25 13:00:09 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.47 % Length of proof is 15.
% 0.17/0.47 % Level of proof is 4.
% 0.17/0.47 % Maximum clause weight is 9.000.
% 0.17/0.47 % Given clauses 26.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------