%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO173+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 : n013.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:15 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 58 ( 18 ~; 22 |; 13 &)
% ( 0 <=>; 5 =>; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn 16 !; 4 ?)
% 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(con,conjecture,
! [X,Y,U,V] :
( ( distinct_lines(U,line_connecting(X,Y))
& convergent_lines(U,V)
& distinct_points(X,Y) )
=> ( apart_point_and_line(Y,U)
| apart_point_and_line(X,U) ) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,U,V] :
( ( distinct_lines(U,line_connecting(X,Y))
& convergent_lines(U,V)
& distinct_points(X,Y) )
=> ( apart_point_and_line(Y,U)
| apart_point_and_line(X,U) ) ),
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]) ).
fof(nnf_15,plain,
? [X,Y,U,V] :
( ~ apart_point_and_line(Y,U)
& ~ apart_point_and_line(X,U)
& distinct_lines(U,line_connecting(X,Y))
& convergent_lines(U,V)
& distinct_points(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ apart_point_and_line(sK1,sK2)
& ~ apart_point_and_line(sK0,sK2)
& distinct_lines(sK2,line_connecting(sK0,sK1))
& convergent_lines(sK2,sK3)
& distinct_points(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(U,sK2),skolemize(V,sK3)],[nnf_15]) ).
cnf(c_30,negated_conjecture,
distinct_points(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_32,negated_conjecture,
distinct_lines(sK2,line_connecting(sK0,sK1)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_33,negated_conjecture,
~ apart_point_and_line(sK0,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_34,negated_conjecture,
~ apart_point_and_line(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_35,plain,
( apart_point_and_line(sK1,B)
| apart_point_and_line(sK1,A)
| apart_point_and_line(sK0,B)
| apart_point_and_line(sK0,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_30,c_26]) ).
cnf(c_36,plain,
~ apart_point_and_line(sK1,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_30,c_23]) ).
cnf(c_37,plain,
~ apart_point_and_line(sK0,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_30,c_22]) ).
cnf(c_45,negated_conjecture,
( apart_point_and_line(sK1,line_connecting(sK0,sK1))
| apart_point_and_line(sK1,sK2)
| apart_point_and_line(sK0,line_connecting(sK0,sK1))
| apart_point_and_line(sK0,sK2) ),
inference(resolve,[status(thm)],[c_35,c_32]) ).
cnf(c_46,negated_conjecture,
( apart_point_and_line(sK1,line_connecting(sK0,sK1))
| apart_point_and_line(sK1,sK2)
| apart_point_and_line(sK0,line_connecting(sK0,sK1)) ),
inference(resolve,[status(thm)],[c_33,c_45]) ).
cnf(c_47,negated_conjecture,
( apart_point_and_line(sK1,line_connecting(sK0,sK1))
| apart_point_and_line(sK1,sK2) ),
inference(resolve,[status(thm)],[c_37,c_46]) ).
cnf(c_48,negated_conjecture,
apart_point_and_line(sK1,line_connecting(sK0,sK1)),
inference(resolve,[status(thm)],[c_34,c_47]) ).
cnf(c_44,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_36,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO173+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 13:00:22 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37 % Process 478029 was started by sandbox on n013,
% 0.10/0.37 % Fri Sep 25 13:00:22 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38
% 0.10/0.38 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Theorem for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.39 % Length of proof is 15.
% 0.10/0.39 % Level of proof is 3.
% 0.10/0.39 % Maximum clause weight is 18.000.
% 0.10/0.39 % Given clauses 20.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------