%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO210+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 : n008.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.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 50 ( 22 ~; 16 |; 6 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 2 sgn 20 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ooc1,axiom,
! [A,L] : ~ unorthogonal_lines(orthogonal_through_point(L,A),L),
file('theBenchmark.p',ooc1) ).
fof(ooc2,axiom,
! [A,L] : ~ apart_point_and_line(A,orthogonal_through_point(L,A)),
file('theBenchmark.p',ooc2) ).
fof(ouo1,axiom,
! [A,L,M,N] :
( distinct_lines(L,M)
=> ( unorthogonal_lines(M,N)
| unorthogonal_lines(L,N)
| apart_point_and_line(A,M)
| apart_point_and_line(A,L) ) ),
file('theBenchmark.p',ouo1) ).
fof(ax2,axiom,
! [X,Y] :
( equal_lines(X,Y)
<=> ~ distinct_lines(X,Y) ),
file('theBenchmark.p',ax2) ).
fof(a4,axiom,
! [X,Y] :
( incident_point_and_line(X,Y)
<=> ~ apart_point_and_line(X,Y) ),
file('theBenchmark.p',a4) ).
fof(a5,axiom,
! [X,Y] :
( orthogonal_lines(X,Y)
<=> ~ unorthogonal_lines(X,Y) ),
file('theBenchmark.p',a5) ).
fof(con,conjecture,
! [A,L,M] :
( ( orthogonal_lines(L,M)
& incident_point_and_line(A,L) )
=> equal_lines(L,orthogonal_through_point(M,A)) ),
file('theBenchmark.p',con) ).
fof(con_neg,negated_conjecture,
~ ! [A,L,M] :
( ( orthogonal_lines(L,M)
& incident_point_and_line(A,L) )
=> equal_lines(L,orthogonal_through_point(M,A)) ),
inference(assume_negation,[status(cth)],[con]) ).
cnf(c_39,plain,
( distinct_lines(A,B)
| equal_lines(A,B) ),
inference(clausify,[status(thm)],[ax2]) ).
fof(nnf_36,plain,
? [A,L,M] :
( ~ equal_lines(L,orthogonal_through_point(M,A))
& orthogonal_lines(L,M)
& incident_point_and_line(A,L) ),
inference(fof_nnf,[status(thm)],[con_neg]) ).
fof(sk_con_neg,plain,
( ~ equal_lines(sK0,orthogonal_through_point(sK1,sK2))
& orthogonal_lines(sK0,sK1)
& incident_point_and_line(sK2,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK0,sK1]),skolemize(A,sK2),skolemize(L,sK0),skolemize(M,sK1)],[nnf_36]) ).
cnf(c_40,negated_conjecture,
~ equal_lines(sK0,orthogonal_through_point(sK1,sK2)),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_44,plain,
( ~ apart_point_and_line(A,B)
| ~ incident_point_and_line(A,B) ),
inference(clausify,[status(thm)],[a4]) ).
cnf(c_46,negated_conjecture,
incident_point_and_line(sK2,sK0),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_48,plain,
( ~ unorthogonal_lines(A,B)
| ~ orthogonal_lines(A,B) ),
inference(clausify,[status(thm)],[a5]) ).
cnf(c_49,negated_conjecture,
orthogonal_lines(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_con_neg]) ).
cnf(c_50,negated_conjecture,
~ unorthogonal_lines(sK0,sK1),
inference(resolve,[status(thm)],[c_49,c_48]) ).
cnf(c_60,plain,
( unorthogonal_lines(B,D)
| unorthogonal_lines(A,D)
| apart_point_and_line(C,B)
| apart_point_and_line(C,A)
| ~ distinct_lines(A,B) ),
inference(clausify,[status(thm)],[ouo1]) ).
cnf(c_61,plain,
~ apart_point_and_line(A,orthogonal_through_point(B,A)),
inference(clausify,[status(thm)],[ooc2]) ).
cnf(c_62,plain,
~ unorthogonal_lines(orthogonal_through_point(A,B),A),
inference(clausify,[status(thm)],[ooc1]) ).
cnf(c_85,negated_conjecture,
distinct_lines(sK0,orthogonal_through_point(sK1,sK2)),
inference(resolve,[status(thm)],[c_39,c_40]) ).
cnf(c_86,negated_conjecture,
~ apart_point_and_line(sK2,sK0),
inference(resolve,[status(thm)],[c_44,c_46]) ).
cnf(c_97,negated_conjecture,
( unorthogonal_lines(A,B)
| unorthogonal_lines(sK0,B)
| apart_point_and_line(sK2,A)
| ~ distinct_lines(sK0,A) ),
inference(resolve,[status(thm)],[c_60,c_86]) ).
cnf(c_98,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(A,sK2),B)
| unorthogonal_lines(sK0,B)
| ~ distinct_lines(sK0,orthogonal_through_point(A,sK2)) ),
inference(resolve,[status(thm)],[c_97,c_61]) ).
cnf(c_99,negated_conjecture,
( unorthogonal_lines(orthogonal_through_point(A,sK2),sK1)
| ~ distinct_lines(sK0,orthogonal_through_point(A,sK2)) ),
inference(resolve,[status(thm)],[c_98,c_50]) ).
cnf(c_100,negated_conjecture,
~ distinct_lines(sK0,orthogonal_through_point(sK1,sK2)),
inference(resolve,[status(thm)],[c_99,c_62]) ).
cnf(c_96,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_85,c_100]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GEO210+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n008.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 13:07:09 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 1117342 was started by sandbox2 on n008,
% 0.17/0.44 % Fri Sep 25 13:07:09 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.45
% 0.17/0.45 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.47 % Length of proof is 20.
% 0.17/0.47 % Level of proof is 3.
% 0.17/0.47 % Maximum clause weight is 20.000.
% 0.17/0.47 % Given clauses 35.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------