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

% Computer : n007.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:42:00 EDT 2022

% Result   : Unsatisfiable 1.51s 1.72s
% Output   : Refutation 1.51s
% 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  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    c_lessequals(u,c_plus(u,v,tc_nat),tc_nat),
    file('SWV280-1.p',unknown),
    [] ).

cnf(5,axiom,
    ( ~ c_lessequals(v_sko__urX(u),v,tc_nat)
    | ~ c_in(c_Message_Omsg_ONonce(v),c_Event_Oused(u),tc_Message_Omsg) ),
    file('SWV280-1.p',unknown),
    [] ).

cnf(6,axiom,
    c_in(c_Message_Omsg_ONonce(u),c_Event_Oused(v_evs),tc_Message_Omsg),
    file('SWV280-1.p',unknown),
    [] ).

cnf(3151,plain,
    ~ c_lessequals(v_sko__urX(v_evs),u,tc_nat),
    inference(res,[status(thm),theory(equality)],[6,5]),
    [iquote('0:Res:6.0,5.0')] ).

cnf(3165,plain,
    $false,
    inference(unc,[status(thm)],[3151,1]),
    [iquote('0:UnC:3151.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SWV280-1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 16:31:10 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.51/1.72  
% 1.51/1.72  SPASS V 3.9 
% 1.51/1.72  SPASS beiseite: Proof found.
% 1.51/1.72  % SZS status Theorem
% 1.51/1.72  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.51/1.72  SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 2781 clauses.
% 1.51/1.72  SPASS allocated 80190 KBytes.
% 1.51/1.72  SPASS spent	0:00:01.33 on the problem.
% 1.51/1.72  		0:00:00.25 for the input.
% 1.51/1.72  		0:00:00.00 for the FLOTTER CNF translation.
% 1.51/1.72  		0:00:00.00 for inferences.
% 1.51/1.72  		0:00:00.00 for the backtracking.
% 1.51/1.72  		0:00:00.73 for the reduction.
% 1.51/1.72  
% 1.51/1.72  
% 1.51/1.72  Here is a proof with depth 1, length 5 :
% 1.51/1.72  % SZS output start Refutation
% See solution above
% 1.51/1.72  Formulae used in the proof : cls_Nat_Ole__add1_0 cls_Public_ONonce__supply__lemma_0 cls_conjecture_0
% 1.51/1.72  
%------------------------------------------------------------------------------