%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV160+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:56 AM UTC 2026
% Result : Theorem 10.13s 1.77s
% Output : CNFRefutation 10.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 75 ( 24 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 72 ( 14 ~; 9 |; 38 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 29 ( 29 usr; 17 con; 0-3 aty)
% Number of variables : 19 ( 0 sgn 14 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X] : ~ gt(X,X),
file('theBenchmark.p',irreflexivity_gt) ).
fof(leq_succ_gt_equiv,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('theBenchmark.p',leq_succ_gt_equiv) ).
fof(succ_pred,axiom,
! [X] : succ(pred(X)) = X,
file('theBenchmark.p',succ_pred) ).
fof(cl5_nebula_norm_0010,conjecture,
( ( ! [B] :
( ( leq(B,pred(pv10))
& leq(n0,B) )
=> sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 )
& ! [A] :
( ( leq(A,pred(pv47))
& leq(n0,A) )
=> a_select3(q,pv10,A) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
& leq(pv47,n4)
& leq(pv10,n135299)
& leq(n0,pv47)
& leq(n0,pv10)
& pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))) )
=> ! [C] :
( ( leq(C,pred(pv10))
& leq(n0,C) )
=> ( pv10 = C
=> sum(n0,n4,cond(tptp_term_equals(pv47,tptp_sum_index),divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,pv47)),minus(a_select2(x,pv10),a_select2(mu,pv47))),tptp_minus_2),times(a_select2(sigma,pv47),a_select2(sigma,pv47)))),a_select2(rho,pv47)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,pv47))),pv84),a_select3(q,C,tptp_sum_index))) = n1 ) ) ),
file('theBenchmark.p',cl5_nebula_norm_0010) ).
fof(cl5_nebula_norm_0010_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(pv47))
& leq(n0,A) )
=> a_select3(q,pv10,A) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
& leq(pv47,n4)
& leq(pv10,n135299)
& leq(n0,pv47)
& leq(n0,pv10)
& pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))) )
=> ! [C] :
( ( leq(C,pred(pv10))
& leq(n0,C) )
=> ( pv10 = C
=> sum(n0,n4,cond(tptp_term_equals(pv47,tptp_sum_index),divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,pv47)),minus(a_select2(x,pv10),a_select2(mu,pv47))),tptp_minus_2),times(a_select2(sigma,pv47),a_select2(sigma,pv47)))),a_select2(rho,pv47)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,pv47))),pv84),a_select3(q,C,tptp_sum_index))) = n1 ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0010]) ).
cnf(c_63,plain,
~ gt(A,A),
inference(clausify,[status(thm)],[irreflexivity_gt]) ).
cnf(c_72,plain,
( gt(succ(B),A)
| ~ leq(A,B) ),
inference(clausify,[status(thm)],[leq_succ_gt_equiv]) ).
cnf(c_302,plain,
succ(pred(A)) = A,
inference(clausify,[status(thm)],[succ_pred]) ).
fof(nnf_56,plain,
( ? [C] :
( sum(n0,n4,cond(tptp_term_equals(pv47,tptp_sum_index),divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,pv47)),minus(a_select2(x,pv10),a_select2(mu,pv47))),tptp_minus_2),times(a_select2(sigma,pv47),a_select2(sigma,pv47)))),a_select2(rho,pv47)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,pv47))),pv84),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(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) = a_select3(q,pv10,A)
| ~ leq(A,pred(pv47))
| ~ leq(n0,A) )
& leq(pv47,n4)
& leq(pv10,n135299)
& leq(n0,pv47)
& leq(n0,pv10)
& sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))) = pv84 ),
inference(fof_nnf,[status(thm)],[cl5_nebula_norm_0010_neg]) ).
fof(sk_cl5_nebula_norm_0010_neg,plain,
( sum(n0,n4,cond(tptp_term_equals(pv47,tptp_sum_index),divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,pv47)),minus(a_select2(x,pv10),a_select2(mu,pv47))),tptp_minus_2),times(a_select2(sigma,pv47),a_select2(sigma,pv47)))),a_select2(rho,pv47)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,pv47))),pv84),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(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,A)),minus(a_select2(x,pv10),a_select2(mu,A))),tptp_minus_2),times(a_select2(sigma,A),a_select2(sigma,A)))),a_select2(rho,A)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,A))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) = a_select3(q,pv10,A)
| ~ leq(A,pred(pv47))
| ~ leq(n0,A) )
& leq(pv47,n4)
& leq(pv10,n135299)
& leq(n0,pv47)
& leq(n0,pv10)
& sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))) = pv84 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(C,sK0)],[nnf_56]) ).
cnf(c_382,negated_conjecture,
leq(sK0,pred(pv10)),
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0010_neg]) ).
cnf(c_383,negated_conjecture,
pv10 = sK0,
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0010_neg]) ).
cnf(c_384,negated_conjecture,
sK0 = pv10,
inference(copy,[status(thm)],[c_383]) ).
cnf(c_849,negated_conjecture,
leq(pv10,pred(pv10)),
inference(paramod,[status(thm)],[c_384,c_382]) ).
cnf(c_2990,negated_conjecture,
gt(succ(pred(pv10)),pv10),
inference(resolve,[status(thm)],[c_849,c_72]) ).
cnf(c_2991,negated_conjecture,
gt(pv10,pv10),
inference(paramod,[status(thm)],[c_302,c_2990]) ).
cnf(c_2989,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_63,c_2991]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV160+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n020.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 : Sat Sep 26 13:17:49 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 1668464 was started by sandbox2 on n020,
% 0.08/0.36 % Sat Sep 26 13:17:49 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.41
% 0.12/0.41 % From the command line: assign(max_seconds, 300).
% 10.13/1.77
% 10.13/1.77 % given #500 (I,wt=143): 579 leq(n0,f19(A,B,C,D,E,F,n0,V6)) | leq(f21(A,B,C,D,E,F,n0,V6),n0) | leq(n0,f23(A,B,C,D,E,F,n0,V6)) | -leq(n0,V7) | -leq(V7,n0) | a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),n0,V7) = a_select3(tptp_madd(A,tptp_mmul(B,tptp_mmul(tptp_madd(tptp_mmul(C,tptp_mmul(D,trans(C))),tptp_mmul(E,tptp_mmul(F,trans(E)))),trans(B)))),V7,n0). [factor(158,d,e),flip(g),unit_del(d,64)].
% 10.13/1.77
% 10.13/1.77 % SZS status Theorem for theBenchmark
% 10.13/1.77
% 10.13/1.77 % Proof 1 at 1.17 (+ 0.15) seconds.
% 10.13/1.77 % Length of proof is 12.
% 10.13/1.77 % Level of proof is 4.
% 10.13/1.77 % Maximum clause weight is 20.000.
% 10.13/1.77 % Given clauses 770.
% 10.13/1.77
% 10.13/1.77 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------