%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO192+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n019.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:23 AM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 23 ( 11 unt; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 43 ( 19 ~; 11 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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; 3 con; 0-2 aty)
% Number of variables : 46 ( 7 sgn 19 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart2,axiom,
! [X] : ~ distinct_lines(X,X),
file('theBenchmark.p',apart2) ).
fof(apart5,axiom,
! [X,Y,Z] :
( distinct_lines(X,Y)
=> ( distinct_lines(Y,Z)
| distinct_lines(X,Z) ) ),
file('theBenchmark.p',apart5) ).
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(p1,axiom,
! [X,Y] :
( distinct_lines(X,Y)
=> convergent_lines(X,Y) ),
file('theBenchmark.p',p1) ).
fof(cp1,axiom,
! [X,Y] : ~ convergent_lines(parallel_through_point(Y,X),Y),
file('theBenchmark.p',cp1) ).
fof(cp2,axiom,
! [X,Y] : ~ apart_point_and_line(X,parallel_through_point(Y,X)),
file('theBenchmark.p',cp2) ).
fof(con,conjecture,
! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( apart_point_and_line(intersection_point(X,Y),Z)
=> ( distinct_lines(Y,Z)
& distinct_lines(X,Z) ) ) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y,Z] :
( convergent_lines(X,Y)
=> ( apart_point_and_line(intersection_point(X,Y),Z)
=> ( distinct_lines(Y,Z)
& distinct_lines(X,Z) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(nnf_36,plain,
? [X,Y,Z] :
( ( ~ distinct_lines(Y,Z)
| ~ distinct_lines(X,Z) )
& apart_point_and_line(intersection_point(X,Y),Z)
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ( ~ distinct_lines(sK1,sK2)
| ~ distinct_lines(sK0,sK2) )
& apart_point_and_line(intersection_point(sK0,sK1),sK2)
& convergent_lines(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X,sK0),skolemize(Y,sK1),skolemize(Z,sK2)],[nnf_36]) ).
cnf(c_48,negated_conjecture,
apart_point_and_line(intersection_point(sK0,sK1),sK2),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_67,plain,
~ apart_point_and_line(A,parallel_through_point(B,A)),
inference(clausify,[status(thm)],[cp2]) ).
cnf(c_68,plain,
~ convergent_lines(parallel_through_point(A,B),A),
inference(clausify,[status(thm)],[cp1]) ).
cnf(c_69,plain,
( convergent_lines(A,B)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[p1]) ).
cnf(c_71,plain,
( apart_point_and_line(A,C)
| distinct_lines(B,C)
| ~ apart_point_and_line(A,B) ),
inference(clausify,[status(thm)],[ceq2]) ).
cnf(c_79,plain,
( distinct_lines(B,C)
| distinct_lines(A,C)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[apart5]) ).
cnf(c_82,plain,
~ distinct_lines(A,A),
inference(clausify,[status(thm)],[apart2]) ).
cnf(c_93,plain,
~ distinct_lines(parallel_through_point(A,B),A),
inference(resolve,[status(thm)],[c_69,c_68]) ).
cnf(c_157,plain,
( distinct_lines(B,A)
| ~ distinct_lines(A,B) ),
inference(resolve,[status(thm)],[c_79,c_82]) ).
cnf(c_103,plain,
~ distinct_lines(A,parallel_through_point(A,B)),
inference(resolve,[status(thm)],[c_157,c_93]) ).
cnf(c_158,plain,
( apart_point_and_line(A,parallel_through_point(B,C))
| ~ apart_point_and_line(A,B) ),
inference(resolve,[status(thm)],[c_71,c_103]) ).
cnf(c_155,plain,
~ apart_point_and_line(A,B),
inference(resolve,[status(thm)],[c_158,c_67]) ).
cnf(c_156,plain,
$false,
inference(resolve,[status(thm)],[c_155,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO192+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.40 % Computer : n019.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8046.5625MB
% 0.14/0.40 % OS : Linux 6.8.0-71-generic
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Fri Sep 25 13:04:35 UTC 2026
% 0.14/0.40 % CPUTime :
% 0.14/0.41 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.41 % Process 2814555 was started by sandbox2 on n019,
% 0.14/0.41 % Fri Sep 25 13:04:35 2026
% 0.14/0.41 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.14/0.42
% 0.14/0.42 % From the command line: assign(max_seconds, 300).
% 0.14/0.44
% 0.14/0.44 % SZS status Theorem for theBenchmark
% 0.14/0.44
% 0.14/0.44 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.14/0.44 % Length of proof is 18.
% 0.14/0.44 % Level of proof is 5.
% 0.14/0.44 % Maximum clause weight is 15.000.
% 0.14/0.44 % Given clauses 48.
% 0.14/0.44
% 0.14/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------