%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GRP004-1 : TPTP v8.1.0. Released v1.0.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 : Sat Jul 16 11:44:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    product(inverse(u),u,identity),
    file('GRP004-1.p',unknown),
    [] ).

cnf(2,axiom,
    product(identity,u,u),
    file('GRP004-1.p',unknown),
    [] ).

cnf(3,axiom,
    ( ~ product(u,v,w)
    | ~ product(x,v,y)
    | ~ product(z,x,u)
    | product(z,y,w) ),
    file('GRP004-1.p',unknown),
    [] ).

cnf(4,axiom,
    ( ~ product(u,v,w)
    | ~ product(x,y,v)
    | ~ product(u,x,z)
    | product(z,y,w) ),
    file('GRP004-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ product(a,u,identity),
    file('GRP004-1.p',unknown),
    [] ).

cnf(7,plain,
    ( ~ product(u,v,w)
    | ~ product(x,w,identity)
    | ~ product(x,u,a) ),
    inference(res,[status(thm),theory(equality)],[4,5]),
    [iquote('0:Res:4.3,5.0')] ).

cnf(16,plain,
    ( ~ product(u,v,w)
    | ~ product(x,u,identity)
    | product(x,w,v) ),
    inference(res,[status(thm),theory(equality)],[2,3]),
    [iquote('0:Res:2.0,3.0')] ).

cnf(21,plain,
    ( ~ product(u,inverse(v),identity)
    | product(u,identity,v) ),
    inference(res,[status(thm),theory(equality)],[1,16]),
    [iquote('0:Res:1.0,16.0')] ).

cnf(24,plain,
    ( ~ product(u,v,identity)
    | ~ product(u,identity,a) ),
    inference(res,[status(thm),theory(equality)],[2,7]),
    [iquote('0:Res:2.0,7.0')] ).

cnf(36,plain,
    ~ product(inverse(u),identity,a),
    inference(res,[status(thm),theory(equality)],[1,24]),
    [iquote('0:Res:1.0,24.0')] ).

cnf(81,plain,
    product(inverse(inverse(u)),identity,u),
    inference(res,[status(thm),theory(equality)],[1,21]),
    [iquote('0:Res:1.0,21.0')] ).

cnf(84,plain,
    $false,
    inference(unc,[status(thm)],[81,36]),
    [iquote('0:UnC:81.0,36.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jun 13 09:36:50 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.42  
% 0.20/0.42  SPASS V 3.9 
% 0.20/0.42  SPASS beiseite: Proof found.
% 0.20/0.42  % SZS status Theorem
% 0.20/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.42  SPASS derived 78 clauses, backtracked 0 clauses, performed 0 splits and kept 54 clauses.
% 0.20/0.42  SPASS allocated 63148 KBytes.
% 0.20/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.20/0.42  		0:00:00.04 for the input.
% 0.20/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42  		0:00:00.00 for inferences.
% 0.20/0.42  		0:00:00.00 for the backtracking.
% 0.20/0.42  		0:00:00.01 for the reduction.
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  Here is a proof with depth 3, length 12 :
% 0.20/0.42  % SZS output start Refutation
% See solution above
% 0.20/0.42  Formulae used in the proof : left_inverse left_identity associativity1 associativity2 prove_there_is_a_right_inverse
% 0.20/0.42  
%------------------------------------------------------------------------------