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

% Computer : n011.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:22:55 EDT 2023

% Result   : Unsatisfiable 0.21s 0.58s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   18 (  11 unt;   7 typ;   0 def)
%            Number of atoms       :   11 (  10 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Maximal term depth    :    4 (   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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   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,
    x0: $i ).

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

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

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

cnf(f07,axiom,
    mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f07) ).

cnf(f04,axiom,
    rd(mult(X1,X2),X2) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).

cnf(c_0_4,negated_conjecture,
    mult(mult(x0,x1),op_c) != mult(x0,mult(x1,op_c)),
    goal ).

cnf(c_0_5,axiom,
    mult(op_c,X1) = mult(X1,op_c),
    f09 ).

cnf(c_0_6,axiom,
    mult(X1,mult(X2,X3)) = mult(rd(mult(X1,X2),X1),mult(X1,X3)),
    f07 ).

cnf(c_0_7,axiom,
    rd(mult(X1,X2),X2) = X1,
    f04 ).

cnf(c_0_8,negated_conjecture,
    mult(x0,mult(op_c,x1)) != mult(op_c,mult(x0,x1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]) ).

cnf(c_0_9,plain,
    mult(X1,mult(op_c,X2)) = mult(op_c,mult(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_5]),c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : GRP665-12 : TPTP v8.1.2. Released v8.1.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.21/0.34  % CPULimit   : 300
% 0.21/0.34  % WCLimit    : 300
% 0.21/0.34  % DateTime   : Mon Aug 28 22:48:11 EDT 2023
% 0.21/0.34  % CPUTime  : 
% 0.21/0.57  start to proof: theBenchmark
% 0.21/0.58  % Version  : CSE_E---1.5
% 0.21/0.58  % Problem  : theBenchmark.p
% 0.21/0.58  % Proof found
% 0.21/0.58  % SZS status Theorem for theBenchmark.p
% 0.21/0.58  % SZS output start Proof
% See solution above
% 0.21/0.58  % Total time : 0.005000 s
% 0.21/0.58  % SZS output end Proof
% 0.21/0.58  % Total time : 0.008000 s
%------------------------------------------------------------------------------