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

% Computer : n028.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:19:45 EDT 2022

% Result   : Unsatisfiable 0.20s 0.46s
% Output   : Refutation 0.20s
% 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    :   10 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ m1(e,b,b),
    file('SYN251-1.p',unknown),
    [] ).

cnf(21,axiom,
    l0(a),
    file('SYN251-1.p',unknown),
    [] ).

cnf(32,axiom,
    m0(b,b,e),
    file('SYN251-1.p',unknown),
    [] ).

cnf(54,axiom,
    ( ~ l0(u)
    | ~ m0(v,v,w)
    | m1(w,v,v) ),
    file('SYN251-1.p',unknown),
    [] ).

cnf(421,plain,
    ( ~ l0(u)
    | ~ m0(b,b,e) ),
    inference(res,[status(thm),theory(equality)],[54,1]),
    [iquote('0:Res:54.2,1.0')] ).

cnf(422,plain,
    ~ l0(u),
    inference(mrr,[status(thm)],[421,32]),
    [iquote('0:MRR:421.1,32.0')] ).

cnf(423,plain,
    $false,
    inference(unc,[status(thm)],[422,21]),
    [iquote('0:UnC:422.0,21.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN251-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n028.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 Jul 12 08:33:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.20/0.46  
% 0.20/0.46  SPASS V 3.9 
% 0.20/0.46  SPASS beiseite: Proof found.
% 0.20/0.46  % SZS status Theorem
% 0.20/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.46  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 335 clauses.
% 0.20/0.46  SPASS allocated 76099 KBytes.
% 0.20/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.20/0.46  		0:00:00.04 for the input.
% 0.20/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.46  		0:00:00.00 for inferences.
% 0.20/0.46  		0:00:00.00 for the backtracking.
% 0.20/0.46  		0:00:00.03 for the reduction.
% 0.20/0.46  
% 0.20/0.46  
% 0.20/0.46  Here is a proof with depth 1, length 7 :
% 0.20/0.46  % SZS output start Refutation
% See solution above
% 0.20/0.46  Formulae used in the proof : prove_this axiom_20 axiom_31 rule_015
% 0.20/0.46  
%------------------------------------------------------------------------------