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

% Computer : n027.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:17:20 EDT 2023

% Result   : Unsatisfiable 0.20s 0.54s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   11 (   5 unt;   6 typ;   0 def)
%            Number of atoms       :    5 (   4 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    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    7 (   4   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    identity: $i ).

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

tff(decl_24,type,
    inverse: $i > $i ).

tff(decl_25,type,
    greatest_lower_bound: ( $i * $i ) > $i ).

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

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

cnf(prove_ax_reflb,negated_conjecture,
    greatest_lower_bound(a,a) != a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_reflb) ).

cnf(idempotence_of_gld,axiom,
    greatest_lower_bound(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',idempotence_of_gld) ).

cnf(c_0_2,negated_conjecture,
    greatest_lower_bound(a,a) != a,
    prove_ax_reflb ).

cnf(c_0_3,axiom,
    greatest_lower_bound(X1,X1) = X1,
    idempotence_of_gld ).

cnf(c_0_4,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2,c_0_3])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP161-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n027.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.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon Aug 28 21:09:37 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.20/0.53  start to proof: theBenchmark
% 0.20/0.54  % Version  : CSE_E---1.5
% 0.20/0.54  % Problem  : theBenchmark.p
% 0.20/0.54  % Proof found
% 0.20/0.54  % SZS status Theorem for theBenchmark.p
% 0.20/0.54  % SZS output start Proof
% See solution above
% 0.20/0.54  % Total time : 0.003000 s
% 0.20/0.54  % SZS output end Proof
% 0.20/0.54  % Total time : 0.006000 s
%------------------------------------------------------------------------------