%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO171+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 : n018.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:14 AM UTC 2026
% Result : Theorem 0.11s 0.40s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 10 ( 4 unt; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 1 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 6 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ceq3,axiom,
! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('theBenchmark.p',ceq3) ).
fof(con,conjecture,
! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X,Y] :
( convergent_lines(X,Y)
=> distinct_lines(X,Y) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_27,plain,
( distinct_lines(A,B)
| ~ convergent_lines(A,B) ),
inference(clausify,[status(thm)],[ceq3]) ).
fof(nnf_13,plain,
? [X,Y] :
( ~ distinct_lines(X,Y)
& convergent_lines(X,Y) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ distinct_lines(sK0,sK1)
& convergent_lines(sK0,sK1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X,sK0),skolemize(Y,sK1)],[nnf_13]) ).
cnf(c_28,negated_conjecture,
convergent_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_29,negated_conjecture,
~ distinct_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_31,negated_conjecture,
distinct_lines(sK0,sK1),
inference(resolve,[status(thm)],[c_28,c_27]) ).
cnf(c_30,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_29,c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO171+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.11/0.38 % Computer : n018.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Fri Sep 25 13:02:51 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38 % Process 2014656 was started by sandbox2 on n018,
% 0.11/0.38 % Fri Sep 25 13:02:51 2026
% 0.11/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.39
% 0.11/0.39 % From the command line: assign(max_seconds, 300).
% 0.11/0.40
% 0.11/0.40 % SZS status Theorem for theBenchmark
% 0.11/0.40
% 0.11/0.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.40 % Length of proof is 6.
% 0.11/0.40 % Level of proof is 2.
% 0.11/0.40 % Maximum clause weight is 6.000.
% 0.11/0.40 % Given clauses 15.
% 0.11/0.40
% 0.11/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------