%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWV048+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 : n012.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:42 AM UTC 2026
% Result : Theorem 1.89s 0.59s
% Output : CNFRefutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 21 unt; 0 def)
% Number of atoms : 77 ( 47 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 80 ( 35 ~; 27 |; 12 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 11 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_0016,conjecture,
( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
file('theBenchmark.p',cl5_nebula_norm_0016) ).
fof(cl5_nebula_norm_0016_neg,negated_conjecture,
~ ( ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
=> ( ( n0 = pv78
=> true )
& ( n0 != pv78
=> ( leq(pv35,minus(n5,n1))
& leq(n0,pv35)
& pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
& n0 = sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) ) ) ) ),
inference(assume_negation,[status(cth)],[cl5_nebula_norm_0016]) ).
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]) ).
fof(ttrue,axiom,
true,
file('theBenchmark.p',ttrue) ).
cnf(c_319,plain,
true,
inference(clausify,[status(thm)],[ttrue]) ).
cnf(c_365,negated_conjecture,
sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
inference(clausify,[status(thm)],[cl5_nebula_norm_0016_neg]) ).
cnf(c_366,negated_conjecture,
sum(n0,pred(n135300),a_select3(q,pv79,pv35)) = pv78,
inference(paramod,[status(thm)],[c_300,c_365]) ).
cnf(c_367,negated_conjecture,
leq(n0,pv35),
inference(clausify,[status(thm)],[cl5_nebula_norm_0016_neg]) ).
cnf(c_368,negated_conjecture,
leq(pv35,minus(n5,n1)),
inference(clausify,[status(thm)],[cl5_nebula_norm_0016_neg]) ).
cnf(c_369,negated_conjecture,
leq(pv35,pred(n5)),
inference(paramod,[status(thm)],[c_300,c_368]) ).
cnf(c_370,negated_conjecture,
( ~ true
| pv78 != n0 ),
inference(clausify,[status(thm)],[cl5_nebula_norm_0016_neg]) ).
cnf(c_371,negated_conjecture,
pv78 != n0,
inference(resolve,[status(thm)],[c_319,c_370]) ).
cnf(c_372,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
| sum(n0,minus(n0,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(clausify,[status(thm)],[cl5_nebula_norm_0016_neg]) ).
cnf(c_1187,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(paramod,[status(thm)],[c_300,c_372]) ).
cnf(c_1188,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| sum(n0,pred(n135300),a_select3(q,pv79,pv35)) != pv78
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(paramod,[status(thm)],[c_300,c_1187]) ).
cnf(c_1189,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| pv78 != pv78
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(paramod,[status(thm)],[c_366,c_1188]) ).
cnf(c_1190,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,pred(n5))
| ~ leq(n0,pv35)
| pv78 != pv78
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(paramod,[status(thm)],[c_300,c_1189]) ).
cnf(c_1191,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,pred(n5))
| ~ leq(n0,pv35)
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(copy,[status(thm)],[c_1190]) ).
cnf(c_1192,negated_conjecture,
( pv78 = n0
| ~ leq(pv35,pred(n5))
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(resolve,[status(thm)],[c_367,c_1191]) ).
cnf(c_1193,negated_conjecture,
( pv78 = n0
| sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0 ),
inference(resolve,[status(thm)],[c_369,c_1192]) ).
cnf(c_373,negated_conjecture,
sum(n0,pred(n0),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
inference(resolve,[status(thm)],[c_371,c_1193]) ).
cnf(c_1181,plain,
pred(n0) = tptp_minus_1,
inference(paramod,[status(thm)],[c_281,c_301]) ).
cnf(c_1194,negated_conjecture,
sum(n0,tptp_minus_1,times(a_select3(q,pv81,pv35),a_select2(x,pv81))) != n0,
inference(paramod,[status(thm)],[c_1181,c_373]) ).
cnf(c_1195,negated_conjecture,
n0 != n0,
inference(paramod,[status(thm)],[c_278,c_1194]) ).
cnf(c_1186,negated_conjecture,
$false,
inference(copy,[status(thm)],[c_1195]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV048+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sat Sep 26 13:09:05 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.04/0.30 % Process 681418 was started by sandbox on n012,
% 0.04/0.30 % Sat Sep 26 13:09:05 2026
% 0.04/0.30 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.33
% 0.08/0.33 % From the command line: assign(max_seconds, 300).
% 1.89/0.59
% 1.89/0.59 % SZS status Theorem for theBenchmark
% 1.89/0.59
% 1.89/0.59 % Proof 1 at 0.21 (+ 0.04) seconds.
% 1.89/0.59 % Length of proof is 20.
% 1.89/0.59 % Level of proof is 4.
% 1.89/0.59 % Maximum clause weight is 34.000.
% 1.89/0.59 % Given clauses 232.
% 1.89/0.59
% 1.89/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------