%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GEO083+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n026.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:00 AM UTC 2026
% Result : Theorem 233.71s 41.31s
% Output : CNFRefutation 233.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 109 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 102 ( 38 ~; 37 |; 20 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 4 sgn 41 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(part_of_defn,axiom,
! [C,C1] :
( part_of(C1,C)
<=> ! [P] :
( incident_c(P,C1)
=> incident_c(P,C) ) ),
file('theBenchmark.p',part_of_defn) ).
fof(sum_defn,axiom,
! [C,C1,C2] :
( C = sum(C1,C2)
<=> ! [Q] :
( incident_c(Q,C)
<=> ( incident_c(Q,C2)
| incident_c(Q,C1) ) ) ),
file('theBenchmark.p',sum_defn) ).
fof(c3,axiom,
! [C] :
? [P] : inner_point(P,C),
file('theBenchmark.p',c3) ).
fof(c4,axiom,
! [C,P] :
( inner_point(P,C)
=> ? [C1,C2] :
( C = sum(C1,C2)
& meet(P,C1,C2) ) ),
file('theBenchmark.p',c4) ).
fof(corollary_2_6_1,conjecture,
! [C1,C2,C3,P] :
( ( meet(P,C1,C3)
& meet(P,C1,C2)
& part_of(C2,C3) )
=> part_of(sum(C1,C2),sum(C1,C3)) ),
file('theBenchmark.p',corollary_2_6_1) ).
fof(corollary_2_6_1_neg,negated_conjecture,
~ ! [C1,C2,C3,P] :
( ( meet(P,C1,C3)
& meet(P,C1,C2)
& part_of(C2,C3) )
=> part_of(sum(C1,C2),sum(C1,C3)) ),
inference(assume_negation,[status(cth)],[corollary_2_6_1]) ).
fof(nnf_10,plain,
! [C] :
? [P] : inner_point(P,C),
inference(fof_nnf,[status(thm)],[c3]) ).
fof(sk_c3,plain,
! [C] : inner_point(sK0(C),C),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(P,sK0(C))],[nnf_10]) ).
cnf(c_21,plain,
inner_point(sK0(A),A),
inference(split_conjunct,[status(thm)],[sk_c3]) ).
fof(nnf_11,plain,
! [C,P] :
( ? [C1,C2] :
( sum(C1,C2) = C
& meet(P,C1,C2) )
| ~ inner_point(P,C) ),
inference(fof_nnf,[status(thm)],[c4]) ).
fof(sk_c4_sk,plain,
! [C,P] :
( ( sum(sK1(C,P),sK2(C,P)) = C
& meet(P,sK1(C,P),sK2(C,P)) )
| ~ inner_point(P,C) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(C1,sK1(C,P)),skolemize(C2,sK2(C,P))],[nnf_11]) ).
fof(sk_c4,plain,
( ! [VAR_0,VAR_1] :
( sum(sK1(VAR_1,VAR_0),sK2(VAR_1,VAR_0)) = VAR_1
| ~ inner_point(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( meet(VAR_0,sK1(VAR_1,VAR_0),sK2(VAR_1,VAR_0))
| ~ inner_point(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_c4_sk]) ).
cnf(c_23,plain,
( sum(sK1(B,A),sK2(B,A)) = B
| ~ inner_point(A,B) ),
inference(split_conjunct,[status(thm)],[sk_c4]) ).
cnf(c_33,plain,
sum(sK1(A,sK0(A)),sK2(A,sK0(A))) = A,
inference(resolve,[status(thm)],[c_23,c_21]) ).
fof(nnf_17,plain,
? [C1,C2,C3,P] :
( ~ part_of(sum(C1,C2),sum(C1,C3))
& meet(P,C1,C3)
& meet(P,C1,C2)
& part_of(C2,C3) ),
inference(fof_nnf,[status(thm)],[corollary_2_6_1_neg]) ).
fof(sk_corollary_2_6_1_neg,plain,
( ~ part_of(sum(sK3,sK4),sum(sK3,sK5))
& meet(sK7,sK3,sK5)
& meet(sK7,sK3,sK4)
& part_of(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK7,sK3]),skolemize(C1,sK3),skolemize(C2,sK4),skolemize(C3,sK5),skolemize(P,sK7)],[nnf_17]) ).
cnf(c_38,negated_conjecture,
~ part_of(sum(sK3,sK4),sum(sK3,sK5)),
inference(split_conjunct,[status(thm)],[sk_corollary_2_6_1_neg]) ).
cnf(c_41,negated_conjecture,
part_of(sK4,sK5),
inference(split_conjunct,[status(thm)],[sk_corollary_2_6_1_neg]) ).
cnf(c_68,plain,
( ~ incident_c(D,B)
| incident_c(D,C)
| sum(A,B) != C ),
inference(clausify,[status(thm)],[sum_defn]) ).
cnf(c_69,plain,
( ~ incident_c(D,A)
| incident_c(D,C)
| sum(A,B) != C ),
inference(clausify,[status(thm)],[sum_defn]) ).
cnf(c_70,plain,
( incident_c(D,B)
| incident_c(D,A)
| ~ incident_c(D,C)
| sum(A,B) != C ),
inference(clausify,[status(thm)],[sum_defn]) ).
fof(nnf_1,plain,
! [C,C1] :
( ( ? [P] :
( ~ incident_c(P,C)
& incident_c(P,C1) )
| part_of(C1,C) )
& ( ! [X0] :
( incident_c(X0,C)
| ~ incident_c(X0,C1) )
| ~ part_of(C1,C) ) ),
inference(fof_nnf,[status(thm)],[part_of_defn]) ).
fof(sk_part_of_defn_sk,plain,
! [C,C1] :
( ( ( ~ incident_c(sK6(C,C1),C)
& incident_c(sK6(C,C1),C1) )
| part_of(C1,C) )
& ( ! [X0] :
( incident_c(X0,C)
| ~ incident_c(X0,C1) )
| ~ part_of(C1,C) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(P,sK6(C,C1))],[nnf_1]) ).
fof(sk_part_of_defn,plain,
( ! [VAR_0,VAR_1] :
( ~ incident_c(sK6(VAR_1,VAR_0),VAR_1)
| part_of(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( incident_c(sK6(VAR_1,VAR_0),VAR_0)
| part_of(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( incident_c(VAR_2,VAR_1)
| ~ incident_c(VAR_2,VAR_0)
| ~ part_of(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_part_of_defn_sk]) ).
cnf(c_71,plain,
( ~ incident_c(sK6(B,A),B)
| part_of(A,B) ),
inference(split_conjunct,[status(thm)],[sk_part_of_defn]) ).
cnf(c_72,plain,
( incident_c(sK6(B,A),A)
| part_of(A,B) ),
inference(split_conjunct,[status(thm)],[sk_part_of_defn]) ).
cnf(c_73,plain,
( incident_c(C,B)
| ~ incident_c(C,A)
| ~ part_of(A,B) ),
inference(split_conjunct,[status(thm)],[sk_part_of_defn]) ).
cnf(c_9903,plain,
A = sum(sK1(A,sK0(A)),sK2(A,sK0(A))),
inference(copy,[status(thm)],[c_33]) ).
cnf(c_9904,plain,
( ~ incident_c(A,C)
| incident_c(A,sum(sK1(sum(B,C),sK0(sum(B,C))),sK2(sum(B,C),sK0(sum(B,C))))) ),
inference(resolve,[status(thm)],[c_68,c_9903]) ).
cnf(c_124,plain,
( ~ incident_c(A,C)
| incident_c(A,sum(B,C)) ),
inference(paramod,[status(thm)],[c_33,c_9904]) ).
cnf(c_9905,plain,
A = sum(sK1(A,sK0(A)),sK2(A,sK0(A))),
inference(copy,[status(thm)],[c_33]) ).
cnf(c_9906,plain,
( ~ incident_c(A,B)
| incident_c(A,sum(sK1(sum(B,C),sK0(sum(B,C))),sK2(sum(B,C),sK0(sum(B,C))))) ),
inference(resolve,[status(thm)],[c_69,c_9905]) ).
cnf(c_131,plain,
( ~ incident_c(A,B)
| incident_c(A,sum(B,C)) ),
inference(paramod,[status(thm)],[c_33,c_9906]) ).
cnf(c_9907,plain,
A = sum(sK1(A,sK0(A)),sK2(A,sK0(A))),
inference(copy,[status(thm)],[c_33]) ).
cnf(c_9908,plain,
( incident_c(A,C)
| incident_c(A,B)
| ~ incident_c(A,sum(sK1(sum(B,C),sK0(sum(B,C))),sK2(sum(B,C),sK0(sum(B,C))))) ),
inference(resolve,[status(thm)],[c_70,c_9907]) ).
cnf(c_138,plain,
( incident_c(A,C)
| incident_c(A,B)
| ~ incident_c(A,sum(B,C)) ),
inference(paramod,[status(thm)],[c_33,c_9908]) ).
cnf(c_142,negated_conjecture,
~ incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sum(sK3,sK5)),
inference(resolve,[status(thm)],[c_71,c_38]) ).
cnf(c_143,plain,
incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sum(sK3,sK4)),
inference(resolve,[status(thm)],[c_72,c_38]) ).
cnf(c_146,plain,
( incident_c(A,sK5)
| ~ incident_c(A,sK4) ),
inference(resolve,[status(thm)],[c_73,c_41]) ).
cnf(c_2706,plain,
~ incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sK3),
inference(resolve,[status(thm)],[c_131,c_142]) ).
cnf(c_2707,plain,
~ incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sK5),
inference(resolve,[status(thm)],[c_124,c_142]) ).
cnf(c_9909,plain,
( incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sK4)
| incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sK3) ),
inference(resolve,[status(thm)],[c_143,c_138]) ).
cnf(c_2797,plain,
incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sK4),
inference(resolve,[status(thm)],[c_2706,c_9909]) ).
cnf(c_9910,plain,
~ incident_c(sK6(sum(sK3,sK5),sum(sK3,sK4)),sK4),
inference(resolve,[status(thm)],[c_146,c_2707]) ).
cnf(c_9902,plain,
$false,
inference(resolve,[status(thm)],[c_2797,c_9910]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO083+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.59 % Computer : n026.cluster.edu
% 0.10/10.59 % Model : x86_64 x86_64
% 0.10/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.59 % Memory : 8046.5625MB
% 0.10/10.59 % OS : Linux 6.8.0-71-generic
% 0.10/10.60 % CPULimit : 300
% 0.10/10.60 % WCLimit : 300
% 0.10/10.60 % DateTime : Fri Sep 25 12:43:22 UTC 2026
% 0.15/10.60 % CPUTime :
% 0.15/10.60 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/10.60 % Process 2533843 was started by sandbox on n026,
% 0.15/10.60 % Fri Sep 25 12:43:22 2026
% 0.15/10.60 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.15/10.61
% 0.15/10.61 % From the command line: assign(max_seconds, 300).
% 233.71/41.31
% 233.71/41.31 % given #500 (T,wt=18): 2044 incident_c(f2(c11,c10,c11),sum(c10,A)). [resolve(131,b,1210,a)].
% 233.71/41.31
% 233.71/41.31 % given #1000 (A,wt=28): 321 -incident_c(f13(A,c10),c11) | end_point(f13(A,c10),c11) | incident_c(f13(A,c10),A) | c10 = A. [resolve(92,a,43,b),flip(d)].
% 233.71/41.31
% 233.71/41.31 % given #1500 (T,wt=22): 534 -meet(A,B,c10) | -incident_c(f7(c10),B) | end_point(f7(c10),B). [resolve(452,a,54,c)].
% 233.71/41.31
% 233.71/41.31 % given #2000 (W,wt=23): 4542 incident_c(f5(c13,c12,sum(A,c12)),c12). [resolve(247,b,1479,a),unit_del(a,1748)].
% 233.71/41.31
% 233.71/41.31 % SZS status Theorem for theBenchmark
% 233.71/41.31
% 233.71/41.31 % Proof 1 at 5.31 (+ 1.15) seconds.
% 233.71/41.31 % Length of proof is 26.
% 233.71/41.31 % Level of proof is 6.
% 233.71/41.31 % Maximum clause weight is 31.000.
% 233.71/41.31 % Given clauses 2079.
% 233.71/41.31
% 233.71/41.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------