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