%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : COM021+4 : TPTP v8.1.0. Released v4.0.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 : Fri Jul 15 01:44:21 EDT 2022

% Result   : Theorem 0.14s 0.45s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   6 unt;   1 nHn;   7 RR)
%            Number of literals    :    9 (   0 equ;   2 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(46,axiom,
    sdtmndtasgtdt0(xb,xR,xx),
    file('COM021+4.p',unknown),
    [] ).

cnf(50,axiom,
    ~ sdtmndtasgtdt0(xb,xR,xd),
    file('COM021+4.p',unknown),
    [] ).

cnf(54,axiom,
    ~ aReductOfIn0(u,xd,xR),
    file('COM021+4.p',unknown),
    [] ).

cnf(88,axiom,
    ( aReductOfIn0(skc24,xd,xR)
    | aReductOfIn0(xx,xd,xR)
    | equal(xx,xd) ),
    file('COM021+4.p',unknown),
    [] ).

cnf(135,plain,
    equal(xx,xd),
    inference(mrr,[status(thm)],[88,54]),
    [iquote('0:MRR:88.0,88.1,54.0,54.0')] ).

cnf(138,plain,
    sdtmndtasgtdt0(xb,xR,xd),
    inference(rew,[status(thm),theory(equality)],[135,46]),
    [iquote('0:Rew:135.0,46.0')] ).

cnf(140,plain,
    $false,
    inference(mrr,[status(thm)],[138,50]),
    [iquote('0:MRR:138.0,50.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : COM021+4 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.10  % Command  : run_spass %d %s
% 0.09/0.29  % Computer : n004.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Thu Jun 16 16:52:38 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.14/0.45  
% 0.14/0.45  SPASS V 3.9 
% 0.14/0.45  SPASS beiseite: Proof found.
% 0.14/0.45  % SZS status Theorem
% 0.14/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.14/0.45  SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 73 clauses.
% 0.14/0.45  SPASS allocated 98529 KBytes.
% 0.14/0.45  SPASS spent	0:00:00.15 on the problem.
% 0.14/0.45  		0:00:00.04 for the input.
% 0.14/0.45  		0:00:00.08 for the FLOTTER CNF translation.
% 0.14/0.45  		0:00:00.00 for inferences.
% 0.14/0.45  		0:00:00.00 for the backtracking.
% 0.14/0.45  		0:00:00.00 for the reduction.
% 0.14/0.45  
% 0.14/0.45  
% 0.14/0.45  Here is a proof with depth 0, length 7 :
% 0.14/0.45  % SZS output start Refutation
% See solution above
% 0.14/0.45  Formulae used in the proof : m__850 m__ m__818
% 0.14/0.45  
%------------------------------------------------------------------------------