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

% Computer : n029.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:27:56 EDT 2022

% Result   : Theorem 0.20s 0.45s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   11 (   5 unt;   1 nHn;  11 RR)
%            Number of literals    :   18 (   0 equ;   7 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 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(1,axiom,
    ~ equal(c(one),zero),
    file('KLE005+1.p',unknown),
    [] ).

cnf(5,axiom,
    equal(multiplication(one,u),u),
    file('KLE005+1.p',unknown),
    [] ).

cnf(9,axiom,
    ( test__dfg(u)
    | equal(c(u),zero) ),
    file('KLE005+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ complement(u,v)
    | equal(multiplication(u,v),zero) ),
    file('KLE005+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ test__dfg(u)
    | ~ equal(c(u),v)
    | complement(u,v) ),
    file('KLE005+1.p',unknown),
    [] ).

cnf(24,plain,
    test__dfg(one),
    inference(res,[status(thm),theory(equality)],[9,1]),
    [iquote('0:Res:9.1,1.0')] ).

cnf(63,plain,
    ( ~ complement(one,u)
    | equal(zero,u) ),
    inference(spr,[status(thm),theory(equality)],[15,5]),
    [iquote('0:SpR:15.1,5.0')] ).

cnf(111,plain,
    ( ~ test__dfg(u)
    | complement(u,c(u)) ),
    inference(eqr,[status(thm),theory(equality)],[19]),
    [iquote('0:EqR:19.1')] ).

cnf(118,plain,
    ( ~ test__dfg(one)
    | equal(c(one),zero) ),
    inference(res,[status(thm),theory(equality)],[111,63]),
    [iquote('0:Res:111.1,63.0')] ).

cnf(119,plain,
    equal(c(one),zero),
    inference(ssi,[status(thm)],[118,24]),
    [iquote('0:SSi:118.0,24.0')] ).

cnf(120,plain,
    $false,
    inference(mrr,[status(thm)],[119,1]),
    [iquote('0:MRR:119.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : KLE005+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n029.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Thu Jun 16 08:32:27 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.45  
% 0.20/0.45  SPASS V 3.9 
% 0.20/0.45  SPASS beiseite: Proof found.
% 0.20/0.45  % SZS status Theorem
% 0.20/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.45  SPASS derived 89 clauses, backtracked 0 clauses, performed 0 splits and kept 51 clauses.
% 0.20/0.45  SPASS allocated 97659 KBytes.
% 0.20/0.45  SPASS spent	0:00:00.09 on the problem.
% 0.20/0.45  		0:00:00.04 for the input.
% 0.20/0.45  		0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45  		0:00:00.00 for inferences.
% 0.20/0.45  		0:00:00.00 for the backtracking.
% 0.20/0.45  		0:00:00.00 for the reduction.
% 0.20/0.45  
% 0.20/0.45  
% 0.20/0.45  Here is a proof with depth 2, length 11 :
% 0.20/0.45  % SZS output start Refutation
% See solution above
% 0.20/0.45  Formulae used in the proof : goals multiplicative_left_identity test_4 test_2 test_3
% 0.20/0.45  
%------------------------------------------------------------------------------