%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO176+2 : 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 : n009.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:16 AM UTC 2026
% Result : Theorem 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 38 ( 12 ~; 12 |; 10 &)
% ( 0 <=>; 4 =>; 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn 11 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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,
! [X,Y,U,V] :
( ( ( apart_point_and_line(X,V)
| apart_point_and_line(X,U) )
& convergent_lines(U,V)
& distinct_points(X,Y) )
=> distinct_points(X,intersection_point(U,V)) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,U,V] :
( ( ( apart_point_and_line(X,V)
| apart_point_and_line(X,U) )
& convergent_lines(U,V)
& distinct_points(X,Y) )
=> distinct_points(X,intersection_point(U,V)) ),
inference(assume_negation,[status(cth)],[con]) ).
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]) ).
fof(nnf_13,plain,
? [X,Y,U,V] :
( ~ distinct_points(X,intersection_point(U,V))
& ( apart_point_and_line(X,V)
| apart_point_and_line(X,U) )
& convergent_lines(U,V)
& distinct_points(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ distinct_points(sK2,intersection_point(sK0,sK1))
& ( apart_point_and_line(sK2,sK1)
| apart_point_and_line(sK2,sK0) )
& convergent_lines(sK0,sK1)
& distinct_points(sK2,sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK0,sK1]),skolemize(X,sK2),skolemize(Y,sK3),skolemize(U,sK0),skolemize(V,sK1)],[nnf_13]) ).
cnf(c_29,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_30,negated_conjecture,
( apart_point_and_line(sK2,sK1)
| apart_point_and_line(sK2,sK0) ),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_31,negated_conjecture,
~ distinct_points(sK2,intersection_point(sK0,sK1)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_50,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,sK1) ),
inference(resolve,[status(thm)],[c_23,c_29]) ).
cnf(c_46,negated_conjecture,
~ apart_point_and_line(sK2,sK1),
inference(resolve,[status(thm)],[c_50,c_31]) ).
cnf(c_51,negated_conjecture,
( distinct_points(A,intersection_point(sK0,sK1))
| ~ apart_point_and_line(A,sK0) ),
inference(resolve,[status(thm)],[c_22,c_29]) ).
cnf(c_47,negated_conjecture,
~ apart_point_and_line(sK2,sK0),
inference(resolve,[status(thm)],[c_51,c_31]) ).
cnf(c_52,negated_conjecture,
apart_point_and_line(sK2,sK1),
inference(resolve,[status(thm)],[c_47,c_30]) ).
cnf(c_49,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_46,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO176+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n009.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:01:45 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 1652522 was started by sandbox2 on n009,
% 0.09/0.36 % Fri Sep 25 13:01:45 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Theorem for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 10.
% 0.09/0.38 % Level of proof is 3.
% 0.09/0.38 % Maximum clause weight is 11.000.
% 0.09/0.38 % Given clauses 18.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------