%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO211+1 : 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 : n002.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:30 AM UTC 2026
% Result : Theorem 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 9 unt; 0 def)
% Number of atoms : 13 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 5 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(apart3,axiom,
! [X] : ~ convergent_lines(X,X),
file('theBenchmark.p',apart3) ).
fof(occu1,axiom,
! [L,M] :
( unorthogonal_lines(L,M)
| convergent_lines(L,M) ),
file('theBenchmark.p',occu1) ).
fof(con,conjecture,
! [L] : unorthogonal_lines(L,L),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [L] : unorthogonal_lines(L,L),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_26,plain,
~ convergent_lines(A,A),
inference(clausify,[status(thm)],[apart3]) ).
cnf(c_41,plain,
( unorthogonal_lines(A,B)
| convergent_lines(A,B) ),
inference(clausify,[status(thm)],[occu1]) ).
fof(nnf_23,plain,
? [L] : ~ unorthogonal_lines(L,L),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
~ unorthogonal_lines(sK0,sK0),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(L,sK0)],[nnf_23]) ).
cnf(c_48,negated_conjecture,
~ unorthogonal_lines(sK0,sK0),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_55,negated_conjecture,
convergent_lines(sK0,sK0),
inference(resolve,[status(thm)],[c_48,c_41]) ).
cnf(c_54,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_26,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO211+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n002.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:08:51 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 3331551 was started by sandbox2 on n002,
% 0.10/0.37 % Fri Sep 25 13:08:51 2026
% 0.10/0.37 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/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 7.
% 0.10/0.39 % Level of proof is 2.
% 0.10/0.39 % Maximum clause weight is 6.000.
% 0.10/0.39 % Given clauses 25.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------