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

% Computer : n012.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 : Thu Jul 21 12:18:47 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ k2(e,u),
    file('SYN112-1.p',unknown),
    [] ).

cnf(4,axiom,
    n0(d,e),
    file('SYN112-1.p',unknown),
    [] ).

cnf(41,axiom,
    ( ~ n0(u,v)
    | l1(v,v) ),
    file('SYN112-1.p',unknown),
    [] ).

cnf(169,axiom,
    ( ~ l1(e,e)
    | k2(e,e) ),
    file('SYN112-1.p',unknown),
    [] ).

cnf(370,plain,
    ~ l1(e,e),
    inference(mrr,[status(thm)],[169,1]),
    [iquote('0:MRR:169.1,1.0')] ).

cnf(423,plain,
    ~ n0(u,e),
    inference(res,[status(thm),theory(equality)],[41,370]),
    [iquote('0:Res:41.1,370.0')] ).

cnf(426,plain,
    $false,
    inference(unc,[status(thm)],[423,4]),
    [iquote('0:UnC:423.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.07  % Problem  : SYN112-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.08  % Command  : run_spass %d %s
% 0.07/0.26  % Computer : n012.cluster.edu
% 0.07/0.26  % Model    : x86_64 x86_64
% 0.07/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26  % Memory   : 8042.1875MB
% 0.07/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26  % CPULimit : 300
% 0.07/0.26  % WCLimit  : 600
% 0.07/0.26  % DateTime : Tue Jul 12 05:10:42 EDT 2022
% 0.07/0.26  % CPUTime  : 
% 0.11/0.33  
% 0.11/0.33  SPASS V 3.9 
% 0.11/0.33  SPASS beiseite: Proof found.
% 0.11/0.33  % SZS status Theorem
% 0.11/0.33  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.11/0.33  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 335 clauses.
% 0.11/0.33  SPASS allocated 76100 KBytes.
% 0.11/0.33  SPASS spent	0:00:00.06 on the problem.
% 0.11/0.33  		0:00:00.02 for the input.
% 0.11/0.33  		0:00:00.00 for the FLOTTER CNF translation.
% 0.11/0.33  		0:00:00.00 for inferences.
% 0.11/0.33  		0:00:00.00 for the backtracking.
% 0.11/0.33  		0:00:00.01 for the reduction.
% 0.11/0.33  
% 0.11/0.33  
% 0.11/0.33  Here is a proof with depth 1, length 7 :
% 0.11/0.33  % SZS output start Refutation
% See solution above
% 0.11/0.33  Formulae used in the proof : prove_this axiom_3 rule_002 rule_130
% 0.11/0.33  
%------------------------------------------------------------------------------