%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV151+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 : 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:54 AM UTC 2026
% Result : Theorem 6.07s 16.37s
% Output : CNFRefutation 6.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 23 unt; 0 def)
% Number of atoms : 57 ( 19 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 13 ~; 8 |; 7 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 25 ( 0 sgn 10 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(irreflexivity_gt,axiom,
! [X] : ~ gt(X,X),
file('theBenchmark.p',irreflexivity_gt) ).
fof(leq_succ,axiom,
! [X,Y] :
( leq(X,Y)
=> leq(X,succ(Y)) ),
file('theBenchmark.p',leq_succ) ).
fof(leq_succ_gt_equiv,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('theBenchmark.p',leq_succ_gt_equiv) ).
fof(succ_plus_1_r,axiom,
! [X] : plus(X,n1) = succ(X),
file('theBenchmark.p',succ_plus_1_r) ).
fof(succ_plus_1_l,axiom,
! [X] : plus(n1,X) = succ(X),
file('theBenchmark.p',succ_plus_1_l) ).
fof(finite_domain_0,axiom,
! [X] :
( ( leq(X,n0)
& leq(n0,X) )
=> X = n0 ),
file('theBenchmark.p',finite_domain_0) ).
fof(cl5_nebula_norm_0001,conjecture,
! [A] :
( ( leq(A,tptp_minus_1)
& leq(n0,A) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
file('theBenchmark.p',cl5_nebula_norm_0001) ).
fof(cl5_nebula_norm_0001_neg,negated_conjecture,
~ ! [A] :
( ( leq(A,tptp_minus_1)
& leq(n0,A) )
=> sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0001]) ).
cnf(c_63,plain,
~ gt(A,A),
inference(clausify,[status(thm)],[irreflexivity_gt]) ).
cnf(c_71,plain,
( leq(A,succ(B))
| ~ leq(A,B) ),
inference(clausify,[status(thm)],[leq_succ]) ).
cnf(c_72,plain,
( gt(succ(B),A)
| ~ leq(A,B) ),
inference(clausify,[status(thm)],[leq_succ_gt_equiv]) ).
fof(succ_tptp_minus_1,axiom,
succ(tptp_minus_1) = n0,
file('theBenchmark.p',succ_tptp_minus_1) ).
cnf(c_281,plain,
succ(tptp_minus_1) = n0,
inference(clausify,[status(thm)],[succ_tptp_minus_1]) ).
cnf(c_282,plain,
plus(A,n1) = succ(A),
inference(clausify,[status(thm)],[succ_plus_1_r]) ).
cnf(c_283,plain,
succ(A) = plus(A,n1),
inference(copy,[status(thm)],[c_282]) ).
cnf(c_284,plain,
plus(n1,A) = succ(A),
inference(clausify,[status(thm)],[succ_plus_1_l]) ).
cnf(c_285,plain,
plus(n1,A) = plus(A,n1),
inference(paramod,[status(thm)],[c_283,c_284]) ).
cnf(c_353,plain,
( n0 = A
| ~ leq(A,n0)
| ~ leq(n0,A) ),
inference(clausify,[status(thm)],[finite_domain_0]) ).
fof(nnf_56,plain,
? [A] :
( sum(n0,n4,a_select3(q,A,tptp_sum_index)) != n1
& leq(A,tptp_minus_1)
& leq(n0,A) ),
inference(fof_nnf,[status(thm)],[cl5_nebula_norm_0001_neg]) ).
fof(sk_cl5_nebula_norm_0001_neg,plain,
( sum(n0,n4,a_select3(q,sK0,tptp_sum_index)) != n1
& leq(sK0,tptp_minus_1)
& leq(n0,sK0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(A,sK0)],[nnf_56]) ).
cnf(c_367,negated_conjecture,
leq(n0,sK0),
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0001_neg]) ).
cnf(c_368,negated_conjecture,
leq(sK0,tptp_minus_1),
inference(split_conjunct,[status(thm)],[sk_cl5_nebula_norm_0001_neg]) ).
cnf(c_2655,plain,
plus(tptp_minus_1,n1) = n0,
inference(paramod,[status(thm)],[c_283,c_281]) ).
cnf(c_802,plain,
plus(n1,tptp_minus_1) = n0,
inference(paramod,[status(thm)],[c_285,c_2655]) ).
cnf(c_804,plain,
( gt(plus(B,n1),A)
| ~ leq(A,B) ),
inference(paramod,[status(thm)],[c_283,c_72]) ).
cnf(c_805,plain,
( leq(A,plus(B,n1))
| ~ leq(A,B) ),
inference(paramod,[status(thm)],[c_283,c_71]) ).
cnf(c_2656,negated_conjecture,
( n0 = sK0
| ~ leq(sK0,n0) ),
inference(resolve,[status(thm)],[c_367,c_353]) ).
cnf(c_1523,negated_conjecture,
( sK0 = n0
| ~ leq(sK0,n0) ),
inference(copy,[status(thm)],[c_2656]) ).
cnf(c_2657,negated_conjecture,
gt(plus(tptp_minus_1,n1),sK0),
inference(resolve,[status(thm)],[c_804,c_368]) ).
cnf(c_2658,negated_conjecture,
gt(plus(n1,tptp_minus_1),sK0),
inference(paramod,[status(thm)],[c_285,c_2657]) ).
cnf(c_2487,negated_conjecture,
gt(n0,sK0),
inference(paramod,[status(thm)],[c_802,c_2658]) ).
cnf(c_2659,negated_conjecture,
leq(sK0,plus(tptp_minus_1,n1)),
inference(resolve,[status(thm)],[c_805,c_368]) ).
cnf(c_2660,negated_conjecture,
leq(sK0,plus(n1,tptp_minus_1)),
inference(paramod,[status(thm)],[c_285,c_2659]) ).
cnf(c_2489,negated_conjecture,
leq(sK0,n0),
inference(paramod,[status(thm)],[c_802,c_2660]) ).
cnf(c_2653,negated_conjecture,
sK0 = n0,
inference(resolve,[status(thm)],[c_2489,c_1523]) ).
cnf(c_2661,negated_conjecture,
gt(n0,n0),
inference(paramod,[status(thm)],[c_2653,c_2487]) ).
cnf(c_2654,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_63,c_2661]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWV151+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/15.45 % Computer : n020.cluster.edu
% 0.17/15.45 % Model : x86_64 x86_64
% 0.17/15.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/15.45 % Memory : 8046.5625MB
% 0.17/15.45 % OS : Linux 6.8.0-71-generic
% 0.17/15.45 % CPULimit : 300
% 0.17/15.45 % WCLimit : 300
% 0.17/15.45 % DateTime : Sat Sep 26 13:17:34 UTC 2026
% 0.17/15.46 % CPUTime :
% 0.17/15.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/15.46 % Process 1667678 was started by sandbox on n020,
% 0.17/15.46 % Sat Sep 26 13:17:34 2026
% 0.17/15.46 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.22/15.56
% 0.22/15.56 % From the command line: assign(max_seconds, 300).
% 6.07/16.37
% 6.07/16.37 % given #500 (I,wt=113): 591 leq(n0,f19(A,B,C,D,E,F,V6,V7)) | leq(f22(A,B,C,D,E,F,V6,V7),V6) | a_select3(F,f24(A,B,C,D,E,F,V6,V7),f23(A,B,C,D,E,F,V6,V7)) != a_select3(F,f23(A,B,C,D,E,F,V6,V7),f24(A,B,C,D,E,F,V6,V7)) | -leq(n0,V6) | 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,V6) = 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)))),V6,n0). [factor(172,d,g),unit_del(e,64),unit_del(f,64)].
% 6.07/16.37
% 6.07/16.37 % SZS status Theorem for theBenchmark
% 6.07/16.37
% 6.07/16.37 % Proof 1 at 0.66 (+ 0.11) seconds.
% 6.07/16.37 % Length of proof is 26.
% 6.07/16.37 % Level of proof is 7.
% 6.07/16.37 % Maximum clause weight is 9.000.
% 6.07/16.37 % Given clauses 714.
% 6.07/16.37
% 6.07/16.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------