%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n023.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 14 18:02:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    ~ equal(e5,e1),
    file('ALG199+1.p',unknown),
    [] ).

cnf(13,axiom,
    ~ equal(e4,e2),
    file('ALG199+1.p',unknown),
    [] ).

cnf(22,axiom,
    equal(op(e5,e5),e1),
    file('ALG199+1.p',unknown),
    [] ).

cnf(23,axiom,
    ~ equal(op(e0,e0),e0),
    file('ALG199+1.p',unknown),
    [] ).

cnf(24,axiom,
    ~ equal(op(e1,e1),e1),
    file('ALG199+1.p',unknown),
    [] ).

cnf(25,axiom,
    ~ equal(op(e2,e2),e2),
    file('ALG199+1.p',unknown),
    [] ).

cnf(26,axiom,
    ~ equal(op(e3,e3),e3),
    file('ALG199+1.p',unknown),
    [] ).

cnf(29,axiom,
    ~ equal(op(e6,e6),e6),
    file('ALG199+1.p',unknown),
    [] ).

cnf(30,axiom,
    equal(op(e5,op(e5,e5)),e4),
    file('ALG199+1.p',unknown),
    [] ).

cnf(374,axiom,
    equal(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e2),
    file('ALG199+1.p',unknown),
    [] ).

cnf(525,axiom,
    ( equal(op(e0,e0),e0)
    | equal(op(e1,e1),e1)
    | equal(op(e2,e2),e2)
    | equal(op(e3,e3),e3)
    | equal(op(e4,e4),e4)
    | equal(op(e5,e5),e5)
    | equal(op(e6,e6),e6) ),
    file('ALG199+1.p',unknown),
    [] ).

cnf(527,plain,
    equal(op(e5,e1),e4),
    inference(rew,[status(thm),theory(equality)],[22,30]),
    [iquote('0:Rew:22.0,30.0')] ).

cnf(553,plain,
    equal(op(e4,e4),e2),
    inference(rew,[status(thm),theory(equality)],[527,374,22]),
    [iquote('0:Rew:527.0,374.0,22.0,374.0')] ).

cnf(779,plain,
    ( equal(op(e0,e0),e0)
    | equal(op(e1,e1),e1)
    | equal(op(e2,e2),e2)
    | equal(op(e3,e3),e3)
    | equal(e4,e2)
    | equal(e5,e1)
    | equal(op(e6,e6),e6) ),
    inference(rew,[status(thm),theory(equality)],[22,525,553]),
    [iquote('0:Rew:22.0,525.5,553.0,525.4')] ).

cnf(780,plain,
    $false,
    inference(mrr,[status(thm)],[779,23,24,25,26,13,10,29]),
    [iquote('0:MRR:779.0,779.1,779.2,779.3,779.4,779.5,779.6,23.0,24.0,25.0,26.0,13.0,10.0,29.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : ALG199+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n023.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jun  8 01:07:38 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.56  
% 0.19/0.56  SPASS V 3.9 
% 0.19/0.56  SPASS beiseite: Proof found.
% 0.19/0.56  % SZS status Theorem
% 0.19/0.56  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.56  SPASS derived 66 clauses, backtracked 0 clauses, performed 0 splits and kept 557 clauses.
% 0.19/0.56  SPASS allocated 86783 KBytes.
% 0.19/0.56  SPASS spent	0:00:00.22 on the problem.
% 0.19/0.56  		0:00:00.04 for the input.
% 0.19/0.56  		0:00:00.08 for the FLOTTER CNF translation.
% 0.19/0.56  		0:00:00.00 for inferences.
% 0.19/0.56  		0:00:00.00 for the backtracking.
% 0.19/0.56  		0:00:00.05 for the reduction.
% 0.19/0.56  
% 0.19/0.56  
% 0.19/0.56  Here is a proof with depth 0, length 15 :
% 0.19/0.56  % SZS output start Refutation
% See solution above
% 0.19/0.56  Formulae used in the proof : ax5 ax6 co1
% 0.19/0.56  
%------------------------------------------------------------------------------