%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : FLD056-3 : 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 : n005.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:41 EDT 2023

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

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

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

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

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

tff(decl_26,type,
    product: ( $i * $i * $i ) > $o ).

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

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

tff(decl_29,type,
    add: ( $i * $i ) > $i ).

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

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

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

cnf(totality_of_order_relation,axiom,
    ( less_or_equal(X1,X2)
    | less_or_equal(X2,X1)
    | ~ defined(X1)
    | ~ defined(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).

cnf(a_is_defined,hypothesis,
    defined(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).

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

cnf(c_0_3,axiom,
    ( less_or_equal(X1,X2)
    | less_or_equal(X2,X1)
    | ~ defined(X1)
    | ~ defined(X2) ),
    totality_of_order_relation ).

cnf(c_0_4,plain,
    ( less_or_equal(X1,X1)
    | ~ defined(X1) ),
    inference(ef,[status(thm)],[c_0_3]) ).

cnf(c_0_5,hypothesis,
    defined(a),
    a_is_defined ).

cnf(c_0_6,negated_conjecture,
    ~ less_or_equal(a,a),
    not_less_or_equal_2 ).

cnf(c_0_7,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : FLD056-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n005.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   : Mon Aug 28 00:16:38 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.55  start to proof: theBenchmark
% 0.19/0.57  % Version  : CSE_E---1.5
% 0.19/0.57  % Problem  : theBenchmark.p
% 0.19/0.57  % Proof found
% 0.19/0.57  % SZS status Theorem for theBenchmark.p
% 0.19/0.57  % SZS output start Proof
% See solution above
% 0.19/0.57  % Total time : 0.006000 s
% 0.19/0.57  % SZS output end Proof
% 0.19/0.57  % Total time : 0.009000 s
%------------------------------------------------------------------------------