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

% Computer : n005.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:33 EDT 2022

% Result   : Theorem 0.54s 0.75s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14  % Problem  : SWV182+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.09/0.15  % Command  : run_spass %d %s
% 0.15/0.37  % Computer : n005.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 600
% 0.15/0.37  % DateTime : Tue Jun 14 15:56:54 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.54/0.75  
% 0.54/0.75  SPASS V 3.9 
% 0.54/0.75  SPASS beiseite: Proof found.
% 0.54/0.75  % SZS status Theorem
% 0.54/0.75  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.54/0.75  SPASS derived 772 clauses, backtracked 43 clauses, performed 3 splits and kept 553 clauses.
% 0.54/0.75  SPASS allocated 86421 KBytes.
% 0.54/0.75  SPASS spent	0:00:00.36 on the problem.
% 0.54/0.75  		0:00:00.04 for the input.
% 0.54/0.75  		0:00:00.08 for the FLOTTER CNF translation.
% 0.54/0.75  		0:00:00.00 for inferences.
% 0.54/0.75  		0:00:00.01 for the backtracking.
% 0.54/0.75  		0:00:00.13 for the reduction.
% 0.54/0.75  
% 0.54/0.75  
% 0.54/0.75  Here is a proof with depth 2, length 18 :
% 0.54/0.75  % SZS output start Refutation
% 0.54/0.75  2[0:Inp] ||  -> leq(n0,skc1)*r.
% 0.54/0.75  4[0:Inp] ||  -> leq(n1,loopcounter)*r.
% 0.54/0.75  5[0:Inp] ||  -> leq(skc1,n4)*l.
% 0.54/0.75  19[0:Inp] ||  -> gt(n1,n0)*r.
% 0.54/0.75  59[0:Inp] || equal(a_select2(rho_init,skc1),init)** -> .
% 0.54/0.75  101[0:Inp] || leq(u,v)* -> gt(v,u) equal(u,v).
% 0.54/0.75  106[0:Inp] || gt(u,v)* gt(v,w)* -> gt(u,w)*.
% 0.54/0.75  115[0:Inp] || gt(loopcounter,n0) leq(n0,u) leq(u,n4) -> equal(a_select2(rho_init,u),init)**.
% 0.54/0.75  224[0:Res:5.0,115.2] || gt(loopcounter,n0) leq(n0,skc1) -> equal(a_select2(rho_init,skc1),init)**.
% 0.54/0.75  253[0:Res:4.0,101.0] ||  -> gt(loopcounter,n1)*l equal(loopcounter,n1).
% 0.54/0.75  359[0:MRR:224.1,224.2,2.0,59.0] || gt(loopcounter,n0)*r -> .
% 0.54/0.75  449[1:Spt:253.1] ||  -> equal(loopcounter,n1)**.
% 0.54/0.75  482[1:Rew:449.0,359.0] || gt(n1,n0)*r -> .
% 0.54/0.75  493[1:MRR:482.0,19.0] ||  -> .
% 0.54/0.75  522[1:Spt:493.0,253.1,449.0] || equal(loopcounter,n1)** -> .
% 0.54/0.75  523[1:Spt:493.0,253.0] ||  -> gt(loopcounter,n1)*l.
% 0.54/0.75  1196[0:NCh:106.2,106.1,359.0,19.0] || gt(loopcounter,n1)*l -> .
% 0.54/0.75  1198[1:MRR:1196.0,523.0] ||  -> .
% 0.54/0.75  % SZS output end Refutation
% 0.54/0.75  Formulae used in the proof : cl5_nebula_init_0086 gt_1_0 leq_gt2 transitivity_gt
% 0.54/0.75  
%------------------------------------------------------------------------------