%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO125+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 : n016.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:07 AM UTC 2026
% Result : Theorem 0.16s 20.38s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 118 ( 17 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 126 ( 43 ~; 48 |; 27 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-4 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-5 aty)
% Number of variables : 91 ( 2 sgn 58 !; 7 ?)
% 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(finish_point_defn,axiom,
! [P,O] :
( finish_point(P,O)
<=> ( ! [Q] :
( ( incident_o(Q,O)
& P != Q )
=> ordered_by(O,Q,P) )
& incident_o(P,O) ) ),
file('theBenchmark.p',finish_point_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(corollary_4_10_2,conjecture,
! [O,P,Q] :
( ( finish_point(Q,O)
& finish_point(P,O) )
=> P = Q ),
file('theBenchmark.p',corollary_4_10_2) ).
fof(corollary_4_10_2_neg,negated_conjecture,
~ ! [O,P,Q] :
( ( finish_point(Q,O)
& finish_point(P,O) )
=> P = Q ),
inference(assume_negation,[status(cth)],[corollary_4_10_2]) ).
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(sK4(P,Q,R,O,C),C)
| ~ incident_o(sK4(P,Q,R,O,C),O) )
& ( incident_c(sK4(P,Q,R,O,C),C)
| incident_o(sK4(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,sK4]),skolemize(X0,sK0(P,Q,R,O)),skolemize(X2,sK4(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(sK4(VAR_1,VAR_2,VAR_3,VAR_0,VAR_4),VAR_4)
| ~ incident_o(sK4(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(sK4(VAR_1,VAR_2,VAR_3,VAR_0,VAR_4),VAR_4)
| incident_o(sK4(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_52,plain,
( ~ ordered_by(A,C,B)
| ~ ordered_by(A,D,C)
| between_o(A,B,C,D) ),
inference(clausify,[status(thm)],[between_o_defn]) ).
cnf(c_64,plain,
( ordered_by(B,C,A)
| ~ incident_o(C,B)
| C = A
| ~ finish_point(A,B) ),
inference(clausify,[status(thm)],[finish_point_defn]) ).
fof(nnf_28,plain,
? [O,P,Q] :
( Q != P
& finish_point(Q,O)
& finish_point(P,O) ),
inference(fof_nnf,[status(thm)],[corollary_4_10_2_neg]) ).
fof(sk_corollary_4_10_2_neg,plain,
( sK3 != sK1
& finish_point(sK3,sK2)
& finish_point(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(O,sK2),skolemize(P,sK1),skolemize(Q,sK3)],[nnf_28]) ).
cnf(c_68,negated_conjecture,
finish_point(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_corollary_4_10_2_neg]) ).
cnf(c_69,negated_conjecture,
finish_point(sK3,sK2),
inference(split_conjunct,[status(thm)],[sk_corollary_4_10_2_neg]) ).
cnf(c_70,plain,
( incident_o(A,B)
| ~ finish_point(A,B) ),
inference(clausify,[status(thm)],[finish_point_defn]) ).
cnf(c_71,negated_conjecture,
incident_o(sK3,sK2),
inference(resolve,[status(thm)],[c_70,c_69]) ).
cnf(c_72,negated_conjecture,
incident_o(sK1,sK2),
inference(resolve,[status(thm)],[c_70,c_68]) ).
cnf(c_73,negated_conjecture,
( ordered_by(sK2,A,sK3)
| ~ incident_o(A,sK2)
| A = sK3 ),
inference(resolve,[status(thm)],[c_64,c_69]) ).
cnf(c_74,negated_conjecture,
( ordered_by(sK2,A,sK3)
| ~ incident_o(A,sK2)
| sK3 = A ),
inference(copy,[status(thm)],[c_73]) ).
cnf(c_75,negated_conjecture,
( ordered_by(sK2,A,sK1)
| ~ incident_o(A,sK2)
| A = sK1 ),
inference(resolve,[status(thm)],[c_64,c_68]) ).
cnf(c_76,negated_conjecture,
( ordered_by(sK2,A,sK1)
| ~ incident_o(A,sK2)
| sK1 = A ),
inference(copy,[status(thm)],[c_75]) ).
cnf(c_91,plain,
( between_c(sK0(D,C,B,A),D,C,B)
| ~ ordered_by(A,C,D)
| ~ ordered_by(A,B,C) ),
inference(resolve,[status(thm)],[c_52,c_47]) ).
cnf(c_134,plain,
( D != B
| ~ between_c(A,B,C,D) ),
inference(clausify,[status(thm)],[between_c_defn]) ).
cnf(c_148,negated_conjecture,
sK3 != sK1,
inference(split_conjunct,[status(thm)],[sk_corollary_4_10_2_neg]) ).
cnf(c_1999,negated_conjecture,
( ordered_by(sK2,sK1,sK3)
| sK3 = sK1 ),
inference(resolve,[status(thm)],[c_74,c_72]) ).
cnf(c_217,negated_conjecture,
ordered_by(sK2,sK1,sK3),
inference(resolve,[status(thm)],[c_148,c_1999]) ).
cnf(c_2000,negated_conjecture,
( ordered_by(sK2,sK3,sK1)
| sK1 = sK3 ),
inference(resolve,[status(thm)],[c_76,c_71]) ).
cnf(c_2001,negated_conjecture,
( ordered_by(sK2,sK3,sK1)
| sK3 = sK1 ),
inference(copy,[status(thm)],[c_2000]) ).
cnf(c_218,negated_conjecture,
ordered_by(sK2,sK3,sK1),
inference(resolve,[status(thm)],[c_148,c_2001]) ).
cnf(c_712,plain,
( between_c(sK0(sK3,sK1,A,sK2),sK3,sK1,A)
| ~ ordered_by(sK2,A,sK1) ),
inference(resolve,[status(thm)],[c_217,c_91]) ).
cnf(c_1984,plain,
between_c(sK0(sK3,sK1,sK3,sK2),sK3,sK1,sK3),
inference(resolve,[status(thm)],[c_712,c_218]) ).
cnf(c_2002,plain,
sK3 != sK3,
inference(resolve,[status(thm)],[c_1984,c_134]) ).
cnf(c_1998,plain,
$false,
inference(copy,[status(thm)],[c_2002]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GEO125+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.38 % Computer : n016.cluster.edu
% 0.09/5.38 % Model : x86_64 x86_64
% 0.09/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38 % Memory : 8046.5625MB
% 0.09/5.38 % OS : Linux 6.8.0-71-generic
% 0.03/20.24 % CPULimit : 300
% 0.03/20.24 % WCLimit : 300
% 0.03/20.24 % DateTime : Fri Sep 25 12:50:36 UTC 2026
% 0.03/20.24 % CPUTime :
% 0.03/20.24 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/20.24 % Process 2138213 was started by sandbox2 on n012,
% 0.03/20.24 % Fri Sep 25 12:50:36 2026
% 0.03/20.24 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.03/20.24
% 0.03/20.24 % From the command line: assign(max_seconds, 300).
% 0.16/20.38
% 0.16/20.38 % SZS status Theorem for theBenchmark
% 0.16/20.38
% 0.16/20.38 % Proof 1 at 0.11 (+ 0.02) seconds.
% 0.16/20.38 % Length of proof is 25.
% 0.16/20.38 % Level of proof is 7.
% 0.16/20.38 % Maximum clause weight is 27.000.
% 0.16/20.38 % Given clauses 268.
% 0.16/20.38
% 0.16/20.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------