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

% Computer : n029.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:12 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV077+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun 15 15:51:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.51  
% 0.20/0.51  SPASS V 3.9 
% 0.20/0.51  SPASS beiseite: Proof found.
% 0.20/0.51  % SZS status Theorem
% 0.20/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.51  SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 106 clauses.
% 0.20/0.51  SPASS allocated 85751 KBytes.
% 0.20/0.51  SPASS spent	0:00:00.14 on the problem.
% 0.20/0.51  		0:00:00.04 for the input.
% 0.20/0.51  		0:00:00.08 for the FLOTTER CNF translation.
% 0.20/0.51  		0:00:00.00 for inferences.
% 0.20/0.51  		0:00:00.00 for the backtracking.
% 0.20/0.51  		0:00:00.00 for the reduction.
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  Here is a proof with depth 0, length 11 :
% 0.20/0.51  % SZS output start Refutation
% 0.20/0.51  1[0:Inp] ||  -> true__dfg*.
% 0.20/0.51  2[0:Inp] ||  -> leq(n0,pv31)*l.
% 0.20/0.51  30[0:Inp] ||  -> leq(pv31,minus(n5,n1))*r.
% 0.20/0.51  56[0:Inp] ||  -> equal(minus(u,n1),pred(u))**.
% 0.20/0.51  96[0:Inp] || leq(n0,pv31) leq(pv31,minus(n5,n1))*r -> SkC0.
% 0.20/0.51  103[0:Inp] || true__dfg leq(n0,pv31) leq(pv31,minus(n5,n1))*r SkC0 -> .
% 0.20/0.51  153[0:Rew:56.0,30.0] ||  -> leq(pv31,pred(n5))*r.
% 0.20/0.51  154[0:Rew:56.0,96.1] || leq(n0,pv31) leq(pv31,pred(n5))*r -> SkC0.
% 0.20/0.51  155[0:MRR:154.0,154.1,2.0,153.0] ||  -> SkC0*.
% 0.20/0.51  156[0:Rew:56.0,103.2] || true__dfg leq(n0,pv31) leq(pv31,pred(n5))*r SkC0 -> .
% 0.20/0.51  157[0:MRR:156.0,156.1,156.2,156.3,1.0,2.0,153.0,155.0] ||  -> .
% 0.20/0.51  % SZS output end Refutation
% 0.20/0.51  Formulae used in the proof : ttrue cl5_nebula_array_0018 pred_minus_1
% 0.20/0.51  
%------------------------------------------------------------------------------