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

% Computer : n026.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:05 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ skC0,
    file('ALG039+1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ skC1,
    file('ALG039+1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ skC2,
    file('ALG039+1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ equal(e3,e0),
    file('ALG039+1.p',unknown),
    [] ).

cnf(18,axiom,
    equal(op(e1,e1),e0),
    file('ALG039+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( equal(op(e1,e1),e3)
    | skC0
    | skC1
    | skC2 ),
    file('ALG039+1.p',unknown),
    [] ).

cnf(150,plain,
    ( equal(e3,e0)
    | skC0
    | skC1
    | skC2 ),
    inference(rew,[status(thm),theory(equality)],[18,21]),
    [iquote('0:Rew:18.0,21.0')] ).

cnf(151,plain,
    $false,
    inference(mrr,[status(thm)],[150,6,1,2,3]),
    [iquote('0:MRR:150.0,150.1,150.2,150.3,6.0,1.0,2.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : ALG039+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n026.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 : Wed Jun  8 21:28:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.46  
% 0.18/0.46  SPASS V 3.9 
% 0.18/0.46  SPASS beiseite: Proof found.
% 0.18/0.46  % SZS status Theorem
% 0.18/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.46  SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 78 clauses.
% 0.18/0.46  SPASS allocated 85418 KBytes.
% 0.18/0.46  SPASS spent	0:00:00.11 on the problem.
% 0.18/0.46  		0:00:00.04 for the input.
% 0.18/0.46  		0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.46  		0:00:00.00 for inferences.
% 0.18/0.46  		0:00:00.00 for the backtracking.
% 0.18/0.46  		0:00:00.00 for the reduction.
% 0.18/0.46  
% 0.18/0.46  
% 0.18/0.46  Here is a proof with depth 0, length 8 :
% 0.18/0.46  % SZS output start Refutation
% See solution above
% 0.18/0.46  Formulae used in the proof : co1 ax5 ax6
% 0.18/0.46  
%------------------------------------------------------------------------------