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

% Computer : n020.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:34 EDT 2022

% Result   : Theorem 0.22s 0.55s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV190+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n020.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.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue Jun 14 21:06:34 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.22/0.55  
% 0.22/0.55  SPASS V 3.9 
% 0.22/0.55  SPASS beiseite: Proof found.
% 0.22/0.55  % SZS status Theorem
% 0.22/0.55  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.55  SPASS derived 192 clauses, backtracked 0 clauses, performed 0 splits and kept 182 clauses.
% 0.22/0.55  SPASS allocated 85831 KBytes.
% 0.22/0.55  SPASS spent	0:00:00.18 on the problem.
% 0.22/0.55  		0:00:00.04 for the input.
% 0.22/0.55  		0:00:00.08 for the FLOTTER CNF translation.
% 0.22/0.55  		0:00:00.00 for inferences.
% 0.22/0.55  		0:00:00.00 for the backtracking.
% 0.22/0.55  		0:00:00.02 for the reduction.
% 0.22/0.55  
% 0.22/0.55  
% 0.22/0.55  Here is a proof with depth 1, length 15 :
% 0.22/0.55  % SZS output start Refutation
% 0.22/0.55  4[0:Inp] ||  -> leq(skc2,tptp_minus_1)*l.
% 0.22/0.55  5[0:Inp] ||  -> leq(n0,skc2)*r.
% 0.22/0.55  29[0:Inp] || gt(u,u)* -> .
% 0.22/0.55  31[0:Inp] ||  -> equal(succ(tptp_minus_1),n0)**.
% 0.22/0.55  100[0:Inp] || leq(u,v)* -> leq(u,succ(v))*.
% 0.22/0.55  101[0:Inp] || leq(u,v)* -> gt(succ(v),u)*.
% 0.22/0.55  125[0:Inp] || leq(u,n0)* leq(n0,u)* -> equal(u,n0).
% 0.22/0.55  206[0:Res:5.0,125.0] || leq(skc2,n0)*l -> equal(skc2,n0).
% 0.22/0.55  318[0:Res:4.0,100.0] ||  -> leq(skc2,succ(tptp_minus_1))*r.
% 0.22/0.55  319[0:Res:4.0,101.0] ||  -> gt(succ(tptp_minus_1),skc2)*l.
% 0.22/0.55  358[0:Rew:31.0,318.0] ||  -> leq(skc2,n0)*l.
% 0.22/0.55  359[0:Rew:31.0,319.0] ||  -> gt(n0,skc2)*r.
% 0.22/0.55  362[0:MRR:206.0,358.0] ||  -> equal(skc2,n0)**.
% 0.22/0.55  373[0:Rew:362.0,359.0] ||  -> gt(n0,n0)*.
% 0.22/0.55  377[0:MRR:373.0,29.0] ||  -> .
% 0.22/0.55  % SZS output end Refutation
% 0.22/0.55  Formulae used in the proof : quaternion_ds1_inuse_0001 irreflexivity_gt succ_tptp_minus_1 leq_succ leq_succ_gt_equiv finite_domain_0
% 0.22/0.55  
%------------------------------------------------------------------------------