%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO207+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:29 AM UTC 2026
% Result : Theorem 0.11s 0.37s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn 3 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart3,axiom,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',apart3) ).
fof(con,conjecture,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [X] : ~ convergent_lines(X,X),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_19,plain,
~ convergent_lines(A,A),
inference(clausify,[status(thm)],[apart3]) ).
fof(nnf_16,plain,
? [X] : convergent_lines(X,X),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
convergent_lines(sK0,sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X,sK0)],[nnf_16]) ).
cnf(c_34,negated_conjecture,
convergent_lines(sK0,sK0),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_35,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_19,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO207+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n018.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 25 13:08:05 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 2023464 was started by sandbox2 on n018,
% 0.08/0.35 % Fri Sep 25 13:08:05 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.35
% 0.08/0.35 % From the command line: assign(max_seconds, 300).
% 0.11/0.37
% 0.11/0.37 % SZS status Theorem for theBenchmark
% 0.11/0.37
% 0.11/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.37 % Length of proof is 5.
% 0.11/0.37 % Level of proof is 2.
% 0.11/0.37 % Maximum clause weight is 3.000.
% 0.11/0.37 % Given clauses 0.
% 0.11/0.37
% 0.11/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------