%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV056+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Wed Jul 20 21:41:07 EDT 2022

% Result   : Theorem 0.49s 0.69s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWV056+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.13/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.20/0.35  % CPULimit : 300
% 0.20/0.35  % WCLimit  : 600
% 0.20/0.35  % DateTime : Tue Jun 14 19:23:39 EDT 2022
% 0.20/0.35  % CPUTime  : 
% 0.49/0.69  
% 0.49/0.69  SPASS V 3.9 
% 0.49/0.69  SPASS beiseite: Proof found.
% 0.49/0.69  % SZS status Theorem
% 0.49/0.69  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.49/0.69  SPASS derived 291 clauses, backtracked 104 clauses, performed 1 splits and kept 458 clauses.
% 0.49/0.69  SPASS allocated 86073 KBytes.
% 0.49/0.69  SPASS spent	0:00:00.31 on the problem.
% 0.49/0.69  		0:00:00.04 for the input.
% 0.49/0.69  		0:00:00.07 for the FLOTTER CNF translation.
% 0.49/0.69  		0:00:00.00 for inferences.
% 0.49/0.69  		0:00:00.00 for the backtracking.
% 0.49/0.69  		0:00:00.12 for the reduction.
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Here is a proof with depth 1, length 16 :
% 0.49/0.69  % SZS output start Refutation
% 0.49/0.69  2[0:Inp] ||  -> leq(n0,pv25)*r.
% 0.49/0.69  28[0:Inp] ||  -> equal(succ(tptp_minus_1),n0)**.
% 0.49/0.69  30[0:Inp] ||  -> leq(pv25,minus(n5,n1))*r.
% 0.49/0.69  48[0:Inp] ||  -> equal(pred(succ(u)),u)**.
% 0.49/0.69  51[0:Inp] ||  -> equal(sum__dfg(n0,tptp_minus_1,u),n0)**.
% 0.49/0.69  52[0:Inp] ||  -> equal(sum__dfg(n0,tptp_minus_1,u),tptp_float_0_0)**.
% 0.49/0.69  55[0:Inp] ||  -> equal(minus(u,n1),pred(u))**.
% 0.49/0.69  110[0:Inp] || equal(sum__dfg(n0,minus(n0,n1),a_select3(q,pv77,pv25)),n0)** leq(n0,pv25) leq(pv25,minus(n5,n1)) -> .
% 0.49/0.69  138[0:Rew:52.0,51.0] ||  -> equal(tptp_float_0_0,n0)**.
% 0.49/0.69  139[0:Rew:138.0,52.0] ||  -> equal(sum__dfg(n0,tptp_minus_1,u),n0)**.
% 0.49/0.69  150[0:Rew:55.0,30.0] ||  -> leq(pv25,pred(n5))*r.
% 0.49/0.69  151[0:Rew:55.0,110.2,55.0,110.0] || equal(sum__dfg(n0,pred(n0),a_select3(q,pv77,pv25)),n0)** leq(n0,pv25) leq(pv25,pred(n5)) -> .
% 0.49/0.69  152[0:MRR:151.1,151.2,2.0,150.0] || equal(sum__dfg(n0,pred(n0),a_select3(q,pv77,pv25)),n0)** -> .
% 0.49/0.69  540[0:SpR:28.0,48.0] ||  -> equal(pred(n0),tptp_minus_1)**.
% 0.49/0.69  595[0:Rew:139.0,152.0,540.0,152.0] || equal(n0,n0)* -> .
% 0.49/0.69  596[0:Obv:595.0] ||  -> .
% 0.49/0.69  % SZS output end Refutation
% 0.49/0.69  Formulae used in the proof : cl5_nebula_norm_0040 succ_tptp_minus_1 pred_succ sum_plus_base sum_plus_base_float pred_minus_1
% 0.49/0.69  
%------------------------------------------------------------------------------