%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO117+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n015.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:06 AM UTC 2026
% Result : Theorem 0.17s 0.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 8 unt; 0 def)
% Number of atoms : 75 ( 2 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 91 ( 35 ~; 33 |; 19 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-5 aty)
% Number of variables : 82 ( 5 sgn 53 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(between_c_defn,axiom,
! [C,P,Q,R] :
( between_c(C,P,Q,R)
<=> ( ? [Cpp] :
( inner_point(Q,Cpp)
& end_point(R,Cpp)
& end_point(P,Cpp)
& part_of(Cpp,C) )
& P != R ) ),
file('theBenchmark.p',between_c_defn) ).
fof(between_o_defn,axiom,
! [O,P,Q,R] :
( between_o(O,P,Q,R)
<=> ( ( ordered_by(O,Q,P)
& ordered_by(O,R,Q) )
| ( ordered_by(O,Q,R)
& ordered_by(O,P,Q) ) ) ),
file('theBenchmark.p',between_o_defn) ).
fof(o3,axiom,
! [P,Q,R,O] :
( between_o(O,P,Q,R)
<=> ? [C] :
( between_c(C,P,Q,R)
& ! [P] :
( incident_o(P,O)
<=> incident_c(P,C) ) ) ),
file('theBenchmark.p',o3) ).
fof(theorem_4_4,conjecture,
! [O,P] : ~ ordered_by(O,P,P),
file('theBenchmark.p',theorem_4_4) ).
fof(theorem_4_4_neg,negated_conjecture,
~ ! [O,P] : ~ ordered_by(O,P,P),
inference(assume_negation,[status(cth)],[theorem_4_4]) ).
fof(nnf_23,plain,
! [P,Q,R,O] :
( ( ! [C] :
( ~ between_c(C,P,Q,R)
| ? [X2] :
( ( ~ incident_c(X2,C)
| ~ incident_o(X2,O) )
& ( incident_c(X2,C)
| incident_o(X2,O) ) ) )
| between_o(O,P,Q,R) )
& ( ? [X0] :
( between_c(X0,P,Q,R)
& ! [X1] :
( ( ~ incident_c(X1,X0)
| incident_o(X1,O) )
& ( incident_c(X1,X0)
| ~ incident_o(X1,O) ) ) )
| ~ between_o(O,P,Q,R) ) ),
inference(fof_nnf,[status(thm)],[o3]) ).
fof(sk_o3_sk,plain,
! [P,Q,R,O] :
( ( ! [C] :
( ~ between_c(C,P,Q,R)
| ( ( ~ incident_c(sK3(P,Q,R,O,C),C)
| ~ incident_o(sK3(P,Q,R,O,C),O) )
& ( incident_c(sK3(P,Q,R,O,C),C)
| incident_o(sK3(P,Q,R,O,C),O) ) ) )
| between_o(O,P,Q,R) )
& ( ( between_c(sK0(P,Q,R,O),P,Q,R)
& ! [X1] :
( ( ~ incident_c(X1,sK0(P,Q,R,O))
| incident_o(X1,O) )
& ( incident_c(X1,sK0(P,Q,R,O))
| ~ incident_o(X1,O) ) ) )
| ~ between_o(O,P,Q,R) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK3]),skolemize(X0,sK0(P,Q,R,O)),skolemize(X2,sK3(P,Q,R,O,C))],[nnf_23]) ).
fof(sk_o3,plain,
( ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ between_c(VAR_4,VAR_1,VAR_2,VAR_3)
| ~ incident_c(sK3(VAR_1,VAR_2,VAR_3,VAR_0,VAR_4),VAR_4)
| ~ incident_o(sK3(VAR_1,VAR_2,VAR_3,VAR_0,VAR_4),VAR_0)
| between_o(VAR_0,VAR_1,VAR_2,VAR_3) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ between_c(VAR_4,VAR_1,VAR_2,VAR_3)
| incident_c(sK3(VAR_1,VAR_2,VAR_3,VAR_0,VAR_4),VAR_4)
| incident_o(sK3(VAR_1,VAR_2,VAR_3,VAR_0,VAR_4),VAR_0)
| between_o(VAR_0,VAR_1,VAR_2,VAR_3) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( between_c(sK0(VAR_1,VAR_2,VAR_3,VAR_0),VAR_1,VAR_2,VAR_3)
| ~ between_o(VAR_0,VAR_1,VAR_2,VAR_3) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ incident_c(VAR_4,sK0(VAR_1,VAR_2,VAR_3,VAR_0))
| incident_o(VAR_4,VAR_0)
| ~ between_o(VAR_0,VAR_1,VAR_2,VAR_3) )
& ! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( incident_c(VAR_4,sK0(VAR_1,VAR_2,VAR_3,VAR_0))
| ~ incident_o(VAR_4,VAR_0)
| ~ between_o(VAR_0,VAR_1,VAR_2,VAR_3) ) ),
inference(cnf_transformation,[status(thm)],[sk_o3_sk]) ).
cnf(c_47,plain,
( between_c(sK0(B,C,D,A),B,C,D)
| ~ between_o(A,B,C,D) ),
inference(split_conjunct,[status(thm)],[sk_o3]) ).
cnf(c_53,plain,
( ~ ordered_by(A,C,D)
| ~ ordered_by(A,B,C)
| between_o(A,B,C,D) ),
inference(clausify,[status(thm)],[between_o_defn]) ).
cnf(c_80,plain,
( between_c(sK0(B,C,D,A),B,C,D)
| ~ ordered_by(A,C,D)
| ~ ordered_by(A,B,C) ),
inference(resolve,[status(thm)],[c_53,c_47]) ).
cnf(c_126,plain,
( D != B
| ~ between_c(A,B,C,D) ),
inference(clausify,[status(thm)],[between_c_defn]) ).
fof(nnf_28,plain,
? [O,P] : ordered_by(O,P,P),
inference(fof_nnf,[status(thm)],[theorem_4_4_neg]) ).
fof(sk_theorem_4_4_neg,plain,
ordered_by(sK1,sK2,sK2),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(O,sK1),skolemize(P,sK2)],[nnf_28]) ).
cnf(c_140,negated_conjecture,
ordered_by(sK1,sK2,sK2),
inference(split_conjunct,[status(thm)],[sk_theorem_4_4_neg]) ).
cnf(c_180,plain,
( between_c(sK0(B,B,B,A),B,B,B)
| ~ ordered_by(A,B,B) ),
inference(factor,[status(thm)],[c_80]) ).
cnf(c_505,plain,
~ between_c(A,B,C,B),
inference(xxres,[status(thm)],[c_126]) ).
cnf(c_506,plain,
~ ordered_by(A,B,B),
inference(resolve,[status(thm)],[c_505,c_180]) ).
cnf(c_507,plain,
$false,
inference(resolve,[status(thm)],[c_506,c_140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GEO117+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n015.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 12:52:27 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43 % Process 1387261 was started by sandbox2 on n015,
% 0.17/0.43 % Fri Sep 25 12:52:27 2026
% 0.17/0.43 % 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.55
% 0.17/0.55 % SZS status Theorem for theBenchmark
% 0.17/0.55
% 0.17/0.55 % Proof 1 at 0.06 (+ 0.03) seconds.
% 0.17/0.55 % Length of proof is 13.
% 0.17/0.55 % Level of proof is 5.
% 0.17/0.55 % Maximum clause weight is 27.000.
% 0.17/0.55 % Given clauses 57.
% 0.17/0.55
% 0.17/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------