%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP702-11 : TPTP v8.1.2. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n007.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 : Thu Aug 31 00:23:13 EDT 2023

% Result   : Unsatisfiable 0.49s 0.56s
% Output   : CNFRefutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   20 (  10 unt;  10 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 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

tff(decl_24,type,
    rd: ( $i * $i ) > $i ).

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

tff(decl_26,type,
    op_c: $i ).

tff(decl_27,type,
    op_d: $i ).

tff(decl_28,type,
    op_e: $i ).

tff(decl_29,type,
    op_f: $i ).

tff(decl_30,type,
    x0: $i ).

tff(decl_31,type,
    x1: $i ).

cnf(f02,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

cnf(f11,axiom,
    op_d = ld(X1,mult(op_c,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f11) ).

cnf(goal,negated_conjecture,
    mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).

cnf(f09,axiom,
    mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).

cnf(c_0_4,axiom,
    ld(X1,mult(X1,X2)) = X2,
    f02 ).

cnf(c_0_5,axiom,
    op_d = ld(X1,mult(op_c,X1)),
    f11 ).

cnf(c_0_6,negated_conjecture,
    mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
    goal ).

cnf(c_0_7,plain,
    op_d = op_c,
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,axiom,
    mult(X1,mult(X2,op_c)) = mult(mult(X1,X2),op_c),
    f09 ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_8]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10  % Problem    : GRP702-11 : TPTP v8.1.2. Released v8.1.0.
% 0.04/0.11  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.10/0.31  % Computer : n007.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Tue Aug 29 00:39:43 EDT 2023
% 0.16/0.31  % CPUTime  : 
% 0.16/0.54  start to proof: theBenchmark
% 0.49/0.56  % Version  : CSE_E---1.5
% 0.49/0.56  % Problem  : theBenchmark.p
% 0.49/0.56  % Proof found
% 0.49/0.56  % SZS status Theorem for theBenchmark.p
% 0.49/0.56  % SZS output start Proof
% See solution above
% 0.49/0.56  % Total time : 0.004000 s
% 0.49/0.56  % SZS output end Proof
% 0.49/0.56  % Total time : 0.006000 s
%------------------------------------------------------------------------------