%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : KLE053+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n020.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 : Sun Jul 17 02:28:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    equal(multiplication(one,u),u),
    file('KLE053+1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ equal(domain__dfg(domain__dfg(skc1)),domain__dfg(skc1)),
    file('KLE053+1.p',unknown),
    [] ).

cnf(13,axiom,
    equal(domain__dfg(multiplication(u,domain__dfg(v))),domain__dfg(multiplication(u,v))),
    file('KLE053+1.p',unknown),
    [] ).

cnf(166,plain,
    equal(domain__dfg(multiplication(one,u)),domain__dfg(domain__dfg(u))),
    inference(spr,[status(thm),theory(equality)],[5,13]),
    [iquote('0:SpR:5.0,13.0')] ).

cnf(169,plain,
    equal(domain__dfg(domain__dfg(u)),domain__dfg(u)),
    inference(rew,[status(thm),theory(equality)],[5,166]),
    [iquote('0:Rew:5.0,166.0')] ).

cnf(170,plain,
    $false,
    inference(unc,[status(thm)],[169,9]),
    [iquote('0:UnC:169.0,9.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.11  % Problem  : KLE053+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n020.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Thu Jun 16 12:12:04 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.43  
% 0.19/0.43  SPASS V 3.9 
% 0.19/0.43  SPASS beiseite: Proof found.
% 0.19/0.43  % SZS status Theorem
% 0.19/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.43  SPASS derived 118 clauses, backtracked 0 clauses, performed 0 splits and kept 47 clauses.
% 0.19/0.43  SPASS allocated 85203 KBytes.
% 0.19/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.19/0.43  		0:00:00.03 for the input.
% 0.19/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43  		0:00:00.00 for inferences.
% 0.19/0.43  		0:00:00.00 for the backtracking.
% 0.19/0.43  		0:00:00.01 for the reduction.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Here is a proof with depth 1, length 6 :
% 0.19/0.43  % SZS output start Refutation
% See solution above
% 0.19/0.43  Formulae used in the proof : multiplicative_left_identity goals domain2
% 0.19/0.43  
%------------------------------------------------------------------------------