%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV689-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n017.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:44:49 EDT 2022

% Result   : Unsatisfiable 0.19s 0.58s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    5 (   4 unt;   0 nHn;   5 RR)
%            Number of literals    :    6 (   0 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(750,axiom,
    ( ~ c_HOL_Oord__class_Oless(u,v,tc_nat)
    | c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(u,w,tc_nat),v,tc_nat) ),
    file('SWV689-1.p',unknown),
    [] ).

cnf(767,axiom,
    c_HOL_Oord__class_Oless(v_i,v_n,tc_nat),
    file('SWV689-1.p',unknown),
    [] ).

cnf(798,axiom,
    ~ c_HOL_Oord__class_Oless(c_HOL_Ominus__class_Ominus(v_i,v_k,tc_nat),v_n,tc_nat),
    file('SWV689-1.p',unknown),
    [] ).

cnf(849,plain,
    ~ c_HOL_Oord__class_Oless(v_i,v_n,tc_nat),
    inference(res,[status(thm),theory(equality)],[750,798]),
    [iquote('0:Res:750.1,798.0')] ).

cnf(891,plain,
    $false,
    inference(mrr,[status(thm)],[849,767]),
    [iquote('0:MRR:849.0,767.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV689-1 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n017.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 : Thu Jun 16 01:51:10 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.58  
% 0.19/0.58  SPASS V 3.9 
% 0.19/0.58  SPASS beiseite: Proof found.
% 0.19/0.58  % SZS status Theorem
% 0.19/0.58  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.58  SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 629 clauses.
% 0.19/0.58  SPASS allocated 76912 KBytes.
% 0.19/0.58  SPASS spent	0:00:00.22 on the problem.
% 0.19/0.58  		0:00:00.06 for the input.
% 0.19/0.58  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.58  		0:00:00.00 for inferences.
% 0.19/0.58  		0:00:00.00 for the backtracking.
% 0.19/0.58  		0:00:00.09 for the reduction.
% 0.19/0.58  
% 0.19/0.58  
% 0.19/0.58  Here is a proof with depth 1, length 5 :
% 0.19/0.58  % SZS output start Refutation
% See solution above
% 0.19/0.58  Formulae used in the proof : cls_less__imp__diff__less_0 cls_CHAINED_0 cls_conjecture_0
% 0.19/0.58  
%------------------------------------------------------------------------------