%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV155+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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 09:06:55 AM UTC 2026
% Result : Theorem 0.14s 6.00s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 16 ( 9 unt; 0 def)
% Number of atoms : 77 ( 28 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 82 ( 21 ~; 13 |; 38 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 12 con; 0-3 aty)
% Number of variables : 16 ( 0 sgn 11 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pred_minus_1,axiom,
! [X] : minus(X,n1) = pred(X),
file('theBenchmark.p',pred_minus_1) ).
fof(cl5_nebula_norm_0005,conjecture,
( ( ! [B] :
( ( leq(B,pred(pv10))
& leq(n0,B) )
=> sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 )
& ! [A] :
( ( leq(A,pred(pv12))
& leq(n0,A) )
=> a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
=> ! [C] :
( ( leq(C,pred(pv10))
& leq(n0,C) )
=> ( pv10 != C
=> sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) ),
file('theBenchmark.p',cl5_nebula_norm_0005) ).
fof(cl5_nebula_norm_0005_neg,negated_conjecture,
~ ( ( ! [B] :
( ( leq(B,pred(pv10))
& leq(n0,B) )
=> sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 )
& ! [A] :
( ( leq(A,pred(pv12))
& leq(n0,A) )
=> a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
=> ! [C] :
( ( leq(C,pred(pv10))
& leq(n0,C) )
=> ( pv10 != C
=> sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0005]) ).
cnf(c_302,plain,
minus(A,n1) = pred(A),
inference(clausify,[status(thm)],[pred_minus_1]) ).
cnf(c_303,plain,
pred(A) = minus(A,n1),
inference(copy,[status(thm)],[c_302]) ).
fof(nnf_56,plain,
( ? [C] :
( sum(n0,n4,a_select3(q,C,tptp_sum_index)) != n1
& pv10 != C
& leq(C,pred(pv10))
& leq(n0,C) )
& ! [B] :
( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
| ~ leq(B,pred(pv10))
| ~ leq(n0,B) )
& ! [A] :
( divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,A)
| ~ leq(A,pred(pv12))
| ~ leq(n0,A) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70 ),
inference(fof_nnf,[status(thm)],[cl5_nebula_norm_0005_neg]) ).
fof(sk_cl5_nebula_norm_0005_neg,plain,
( sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) != n1
& pv10 != sK0
& leq(sK0,pred(pv10))
& leq(n0,sK0)
& ! [B] :
( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1
| ~ leq(B,pred(pv10))
| ~ leq(n0,B) )
& ! [A] :
( divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) = a_select3(q,pv10,A)
| ~ leq(A,pred(pv12))
| ~ leq(n0,A) )
& leq(pv12,n4)
& leq(pv10,n135299)
& leq(n0,pv12)
& leq(n0,pv10)
& sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) = pv70 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(C,sK0)],[nnf_56]) ).
cnf(c_381,negated_conjecture,
( sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1
| ~ leq(A,pred(pv10))
| ~ leq(n0,A) ),
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0005_neg]) ).
cnf(c_382,negated_conjecture,
( sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1
| ~ leq(A,minus(pv10,n1))
| ~ leq(n0,A) ),
inference(paramod,[status(thm)],[c_303,c_381]) ).
cnf(c_383,negated_conjecture,
leq(n0,sK0),
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0005_neg]) ).
cnf(c_384,negated_conjecture,
leq(sK0,pred(pv10)),
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0005_neg]) ).
cnf(c_385,negated_conjecture,
leq(sK0,minus(pv10,n1)),
inference(paramod,[status(thm)],[c_303,c_384]) ).
cnf(c_388,negated_conjecture,
sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) != n1,
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0005_neg]) ).
cnf(c_3123,negated_conjecture,
( sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) = n1
| ~ leq(sK0,minus(pv10,n1)) ),
inference(resolve,[status(thm)],[c_383,c_382]) ).
cnf(c_3124,negated_conjecture,
sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) = n1,
inference(resolve,[status(thm)],[c_385,c_3123]) ).
cnf(c_3122,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_388,c_3124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV155+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.38 % Computer : n007.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.09/5.38 % CPULimit : 300
% 0.09/5.38 % WCLimit : 300
% 0.09/5.38 % DateTime : Sat Sep 26 13:14:15 UTC 2026
% 0.09/5.38 % CPUTime :
% 0.09/5.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.38 % Process 3820305 was started by sandbox on n007,
% 0.09/5.38 % Sat Sep 26 13:14:15 2026
% 0.09/5.38 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/5.44
% 0.14/5.44 % From the command line: assign(max_seconds, 300).
% 0.14/6.00
% 0.14/6.00 % SZS status Theorem for theBenchmark
% 0.14/6.00
% 0.14/6.00 % Proof 1 at 0.47 (+ 0.07) seconds.
% 0.14/6.00 % Length of proof is 11.
% 0.14/6.00 % Level of proof is 4.
% 0.14/6.00 % Maximum clause weight is 17.000.
% 0.14/6.00 % Given clauses 290.
% 0.14/6.00
% 0.14/6.00 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------