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

% Computer : n014.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:51 EDT 2023

% Result   : Unsatisfiable 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   21 (   7 unt;  11 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   12 (   7   ~;   5   |;   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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    5 (   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 ).

cnf(compatibility_of_order_relation_and_multiplication,axiom,
    ( less_or_equal(additive_identity,multiply(X1,X2))
    | ~ less_or_equal(additive_identity,X1)
    | ~ less_or_equal(additive_identity,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_multiplication) ).

cnf(less_or_equal_4,negated_conjecture,
    less_or_equal(additive_identity,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_4) ).

cnf(less_or_equal_3,negated_conjecture,
    less_or_equal(additive_identity,a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).

cnf(not_less_or_equal_5,negated_conjecture,
    ~ less_or_equal(additive_identity,multiply(a,b)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_5) ).

cnf(c_0_4,axiom,
    ( less_or_equal(additive_identity,multiply(X1,X2))
    | ~ less_or_equal(additive_identity,X1)
    | ~ less_or_equal(additive_identity,X2) ),
    compatibility_of_order_relation_and_multiplication ).

cnf(c_0_5,negated_conjecture,
    less_or_equal(additive_identity,b),
    less_or_equal_4 ).

cnf(c_0_6,negated_conjecture,
    ( less_or_equal(additive_identity,multiply(X1,b))
    | ~ less_or_equal(additive_identity,X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,negated_conjecture,
    less_or_equal(additive_identity,a),
    less_or_equal_3 ).

cnf(c_0_8,negated_conjecture,
    ~ less_or_equal(additive_identity,multiply(a,b)),
    not_less_or_equal_5 ).

cnf(c_0_9,negated_conjecture,
    $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.12  % Problem    : FLD071-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun Aug 27 23:25:16 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.006000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.009000 s
%------------------------------------------------------------------------------