%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : BOO018-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n004.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  : 300s
% DateTime : Wed Aug 30 18:05:52 EDT 2023

% Result   : Unsatisfiable 0.10s 0.42s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   15 (  10 unt;   5 typ;   0 def)
%            Number of atoms       :   10 (   9 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    5 (   3   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    add: ( $i * $i ) > $i ).

tff(decl_23,type,
    multiply: ( $i * $i ) > $i ).

tff(decl_24,type,
    additive_identity: $i ).

tff(decl_25,type,
    multiplicative_identity: $i ).

tff(decl_26,type,
    inverse: $i > $i ).

cnf(multiplicative_id1,axiom,
    multiply(X1,multiplicative_identity) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_id1) ).

cnf(commutativity_of_multiply,axiom,
    multiply(X1,X2) = multiply(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',commutativity_of_multiply) ).

cnf(multiplicative_inverse1,axiom,
    multiply(X1,inverse(X1)) = additive_identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO004-0.ax',multiplicative_inverse1) ).

cnf(prove_inverse_of_1_is_0,negated_conjecture,
    inverse(multiplicative_identity) != additive_identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_of_1_is_0) ).

cnf(c_0_4,axiom,
    multiply(X1,multiplicative_identity) = X1,
    multiplicative_id1 ).

cnf(c_0_5,axiom,
    multiply(X1,X2) = multiply(X2,X1),
    commutativity_of_multiply ).

cnf(c_0_6,axiom,
    multiply(X1,inverse(X1)) = additive_identity,
    multiplicative_inverse1 ).

cnf(c_0_7,plain,
    multiply(multiplicative_identity,X1) = X1,
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    inverse(multiplicative_identity) != additive_identity,
    prove_inverse_of_1_is_0 ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : BOO018-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.07  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.06/0.26  % Computer : n004.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit   : 300
% 0.06/0.26  % WCLimit    : 300
% 0.06/0.26  % DateTime   : Sun Aug 27 08:22:07 EDT 2023
% 0.06/0.26  % CPUTime  : 
% 0.10/0.41  start to proof: theBenchmark
% 0.10/0.42  % Version  : CSE_E---1.5
% 0.10/0.42  % Problem  : theBenchmark.p
% 0.10/0.42  % Proof found
% 0.10/0.42  % SZS status Theorem for theBenchmark.p
% 0.10/0.42  % SZS output start Proof
% See solution above
% 0.10/0.42  % Total time : 0.003000 s
% 0.10/0.42  % SZS output end Proof
% 0.10/0.42  % Total time : 0.006000 s
%------------------------------------------------------------------------------