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

% Computer : n025.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.34s 0.57s
% Output   : Refutation 0.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   10 (   8 unt;   0 nHn;  10 RR)
%            Number of literals    :   22 (   0 equ;  14 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    2 (   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(22,axiom,
    equal(op(e0,e0),e0),
    file('ALG200+1.p',unknown),
    [] ).

cnf(23,axiom,
    equal(op(e1,e1),e1),
    file('ALG200+1.p',unknown),
    [] ).

cnf(24,axiom,
    equal(op(e2,e2),e2),
    file('ALG200+1.p',unknown),
    [] ).

cnf(25,axiom,
    equal(op(e3,e3),e3),
    file('ALG200+1.p',unknown),
    [] ).

cnf(26,axiom,
    equal(op(e4,e4),e4),
    file('ALG200+1.p',unknown),
    [] ).

cnf(27,axiom,
    equal(op(e5,e5),e5),
    file('ALG200+1.p',unknown),
    [] ).

cnf(28,axiom,
    equal(op(e6,e6),e6),
    file('ALG200+1.p',unknown),
    [] ).

cnf(524,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('ALG200+1.p',unknown),
    [] ).

cnf(862,plain,
    ( ~ equal(e0,e0)
    | ~ equal(e1,e1)
    | ~ equal(e2,e2)
    | ~ equal(e3,e3)
    | ~ equal(e4,e4)
    | ~ equal(e5,e5)
    | ~ equal(e6,e6) ),
    inference(rew,[status(thm),theory(equality)],[28,524,27,26,25,24,23,22]),
    [iquote('0:Rew:28.0,524.6,27.0,524.5,26.0,524.4,25.0,524.3,24.0,524.2,23.0,524.1,22.0,524.0')] ).

cnf(863,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[862]),
    [iquote('0:Obv:862.6')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG200+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n025.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 05:44:49 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.34/0.57  
% 0.34/0.57  SPASS V 3.9 
% 0.34/0.57  SPASS beiseite: Proof found.
% 0.34/0.57  % SZS status Theorem
% 0.34/0.57  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.34/0.57  SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 483 clauses.
% 0.34/0.57  SPASS allocated 86791 KBytes.
% 0.34/0.57  SPASS spent	0:00:00.22 on the problem.
% 0.34/0.57  		0:00:00.05 for the input.
% 0.34/0.57  		0:00:00.08 for the FLOTTER CNF translation.
% 0.34/0.57  		0:00:00.00 for inferences.
% 0.34/0.57  		0:00:00.00 for the backtracking.
% 0.34/0.57  		0:00:00.06 for the reduction.
% 0.34/0.57  
% 0.34/0.57  
% 0.34/0.57  Here is a proof with depth 0, length 10 :
% 0.34/0.57  % SZS output start Refutation
% See solution above
% 0.34/0.57  Formulae used in the proof : co1
% 0.34/0.57  
%------------------------------------------------------------------------------