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

% Computer : n004.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:29 EDT 2022

% Result   : Theorem 0.41s 0.59s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SWV165+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun 15 11:32:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.41/0.59  
% 0.41/0.59  SPASS V 3.9 
% 0.41/0.59  SPASS beiseite: Proof found.
% 0.41/0.59  % SZS status Theorem
% 0.41/0.59  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.41/0.59  SPASS derived 193 clauses, backtracked 0 clauses, performed 0 splits and kept 154 clauses.
% 0.41/0.59  SPASS allocated 85788 KBytes.
% 0.41/0.59  SPASS spent	0:00:00.22 on the problem.
% 0.41/0.59  		0:00:00.04 for the input.
% 0.41/0.59  		0:00:00.08 for the FLOTTER CNF translation.
% 0.41/0.59  		0:00:00.00 for inferences.
% 0.41/0.59  		0:00:00.00 for the backtracking.
% 0.41/0.59  		0:00:00.02 for the reduction.
% 0.41/0.59  
% 0.41/0.59  
% 0.41/0.59  Here is a proof with depth 1, length 15 :
% 0.41/0.59  % SZS output start Refutation
% 0.41/0.59  2[0:Inp] ||  -> leq(n0,skc1)*r.
% 0.41/0.59  3[0:Inp] ||  -> leq(skc1,tptp_minus_1)*l.
% 0.41/0.59  28[0:Inp] || gt(u,u)* -> .
% 0.41/0.59  30[0:Inp] ||  -> equal(succ(tptp_minus_1),n0)**.
% 0.41/0.59  71[0:Inp] || leq(u,v)* -> leq(u,succ(v))*.
% 0.41/0.59  72[0:Inp] || leq(u,v)* -> gt(succ(v),u)*.
% 0.41/0.59  96[0:Inp] || leq(u,n0)* leq(n0,u)* -> equal(u,n0).
% 0.41/0.59  176[0:Res:3.0,71.0] ||  -> leq(skc1,succ(tptp_minus_1))*r.
% 0.41/0.59  177[0:Res:3.0,72.0] ||  -> gt(succ(tptp_minus_1),skc1)*l.
% 0.41/0.59  235[0:Res:2.0,96.0] || leq(skc1,n0)*l -> equal(skc1,n0).
% 0.41/0.59  329[0:Rew:30.0,176.0] ||  -> leq(skc1,n0)*l.
% 0.41/0.59  330[0:Rew:30.0,177.0] ||  -> gt(n0,skc1)*r.
% 0.41/0.59  333[0:MRR:235.0,329.0] ||  -> equal(skc1,n0)**.
% 0.41/0.59  339[0:Rew:333.0,330.0] ||  -> gt(n0,n0)*.
% 0.41/0.59  347[0:MRR:339.0,28.0] ||  -> .
% 0.41/0.59  % SZS output end Refutation
% 0.41/0.59  Formulae used in the proof : cl5_nebula_init_0001 irreflexivity_gt succ_tptp_minus_1 leq_succ leq_succ_gt_equiv finite_domain_0
% 0.41/0.59  
%------------------------------------------------------------------------------