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

% Computer : n021.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 22:27:26 EDT 2023

% Result   : Unsatisfiable 0.18s 0.57s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   25 (   8 unt;  12 typ;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (   9   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   7   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn;   0   !;   0   ?;   0   :)

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

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

tff(decl_24,type,
    defined: $i > $o ).

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

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

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

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

tff(decl_29,type,
    multiplicative_inverse: $i > $i ).

tff(decl_30,type,
    less_or_equal: ( $i * $i ) > $o ).

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

tff(decl_32,type,
    b: $i ).

tff(decl_33,type,
    d: $i ).

cnf(symmetry_of_equality,axiom,
    ( equalish(X1,X2)
    | ~ equalish(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).

cnf(a_equals_d_4,negated_conjecture,
    equalish(a,d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_equals_d_4) ).

cnf(compatibility_of_equality_and_multiplication,axiom,
    ( equalish(multiply(X1,X2),multiply(X3,X2))
    | ~ defined(X2)
    | ~ equalish(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).

cnf(multiply_not_equal_to_multiply_5,negated_conjecture,
    ~ equalish(multiply(d,b),multiply(a,b)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_not_equal_to_multiply_5) ).

cnf(b_is_defined,hypothesis,
    defined(b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).

cnf(c_0_5,axiom,
    ( equalish(X1,X2)
    | ~ equalish(X2,X1) ),
    symmetry_of_equality ).

cnf(c_0_6,negated_conjecture,
    equalish(a,d),
    a_equals_d_4 ).

cnf(c_0_7,axiom,
    ( equalish(multiply(X1,X2),multiply(X3,X2))
    | ~ defined(X2)
    | ~ equalish(X1,X3) ),
    compatibility_of_equality_and_multiplication ).

cnf(c_0_8,negated_conjecture,
    equalish(d,a),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    ~ equalish(multiply(d,b),multiply(a,b)),
    multiply_not_equal_to_multiply_5 ).

cnf(c_0_10,negated_conjecture,
    ( equalish(multiply(d,X1),multiply(a,X1))
    | ~ defined(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,hypothesis,
    defined(b),
    b_is_defined ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : FLD030-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 28 00:32:28 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.18/0.53  start to proof: theBenchmark
% 0.18/0.57  % Version  : CSE_E---1.5
% 0.18/0.57  % Problem  : theBenchmark.p
% 0.18/0.57  % Proof found
% 0.18/0.57  % SZS status Theorem for theBenchmark.p
% 0.18/0.57  % SZS output start Proof
% See solution above
% 0.18/0.57  % Total time : 0.021000 s
% 0.18/0.57  % SZS output end Proof
% 0.18/0.57  % Total time : 0.024000 s
%------------------------------------------------------------------------------