%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV056+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 : 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 09:06:43 AM UTC 2026
% Result : Theorem 5.23s 1.15s
% Output : CNFRefutation 5.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 16 unt; 0 def)
% Number of atoms : 37 ( 18 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 30 ( 15 ~; 7 |; 6 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 6 ( 1 sgn 3 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sum_plus_base,axiom,
! [Body] : sum(n0,tptp_minus_1,Body) = n0,
file('theBenchmark.p',sum_plus_base) ).
fof(pred_minus_1,axiom,
! [X] : minus(X,n1) = pred(X),
file('theBenchmark.p',pred_minus_1) ).
fof(pred_succ,axiom,
! [X] : pred(succ(X)) = X,
file('theBenchmark.p',pred_succ) ).
fof(cl5_nebula_norm_0040,conjecture,
( ( leq(pv25,minus(n5,n1))
& leq(n0,pv25) )
=> ( leq(pv25,minus(n5,n1))
& leq(n0,pv25)
& n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
file('theBenchmark.p',cl5_nebula_norm_0040) ).
fof(cl5_nebula_norm_0040_neg,negated_conjecture,
~ ( ( leq(pv25,minus(n5,n1))
& leq(n0,pv25) )
=> ( leq(pv25,minus(n5,n1))
& leq(n0,pv25)
& n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0040]) ).
cnf(c_278,plain,
sum(n0,tptp_minus_1,A) = n0,
inference(clausify,[status(thm)],[sum_plus_base]) ).
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_300,plain,
minus(A,n1) = pred(A),
inference(clausify,[status(thm)],[pred_minus_1]) ).
cnf(c_301,plain,
pred(succ(A)) = A,
inference(clausify,[status(thm)],[pred_succ]) ).
cnf(c_358,negated_conjecture,
leq(n0,pv25),
inference(clausify,[status(thm)],[cl5_nebula_norm_0040_neg]) ).
cnf(c_359,negated_conjecture,
leq(pv25,minus(n5,n1)),
inference(clausify,[status(thm)],[cl5_nebula_norm_0040_neg]) ).
cnf(c_360,negated_conjecture,
leq(pv25,pred(n5)),
inference(paramod,[status(thm)],[c_300,c_359]) ).
cnf(c_361,negated_conjecture,
( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0 ),
inference(clausify,[status(thm)],[cl5_nebula_norm_0040_neg]) ).
cnf(c_1188,negated_conjecture,
( ~ leq(pv25,minus(n5,n1))
| ~ leq(n0,pv25)
| sum(n0,pred(n0),a_select3(q,pv77,pv25)) != n0 ),
inference(paramod,[status(thm)],[c_300,c_361]) ).
cnf(c_1189,negated_conjecture,
( ~ leq(pv25,pred(n5))
| ~ leq(n0,pv25)
| sum(n0,pred(n0),a_select3(q,pv77,pv25)) != n0 ),
inference(paramod,[status(thm)],[c_300,c_1188]) ).
cnf(c_1190,negated_conjecture,
( ~ leq(pv25,pred(n5))
| sum(n0,pred(n0),a_select3(q,pv77,pv25)) != n0 ),
inference(resolve,[status(thm)],[c_358,c_1189]) ).
cnf(c_362,negated_conjecture,
sum(n0,pred(n0),a_select3(q,pv77,pv25)) != n0,
inference(resolve,[status(thm)],[c_360,c_1190]) ).
cnf(c_1182,plain,
pred(n0) = tptp_minus_1,
inference(paramod,[status(thm)],[c_281,c_301]) ).
cnf(c_1191,negated_conjecture,
sum(n0,tptp_minus_1,a_select3(q,pv77,pv25)) != n0,
inference(paramod,[status(thm)],[c_1182,c_362]) ).
cnf(c_1192,negated_conjecture,
n0 != n0,
inference(paramod,[status(thm)],[c_278,c_1191]) ).
cnf(c_1187,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_1192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV056+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/0.36 % Computer : n026.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 13:12:41 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.14/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.14/0.37 % Process 1068140 was started by sandbox on n026,
% 0.14/0.37 % Sat Sep 26 13:12:41 2026
% 0.14/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/0.42
% 0.14/0.42 % From the command line: assign(max_seconds, 300).
% 5.23/1.15
% 5.23/1.15 % SZS status Theorem for theBenchmark
% 5.23/1.15
% 5.23/1.15 % Proof 1 at 0.62 (+ 0.08) seconds.
% 5.23/1.15 % Length of proof is 15.
% 5.23/1.15 % Level of proof is 4.
% 5.23/1.15 % Maximum clause weight is 25.000.
% 5.23/1.15 % Given clauses 232.
% 5.23/1.15
% 5.23/1.15 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------