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

% Computer : n007.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:16 EDT 2023

% Result   : Unsatisfiable 0.47s 0.59s
% Output   : CNFRefutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   23 (  15 unt;   8 typ;   0 def)
%            Number of atoms       :   15 (  14 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    :    3 (   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    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   11 (   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 ).

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

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

cnf(ax_lub1a_1,hypothesis,
    least_upper_bound(a,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1a_1) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).

cnf(prove_ax_lub1a,negated_conjecture,
    least_upper_bound(least_upper_bound(a,b),c) != c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub1a) ).

cnf(associativity_of_lub,axiom,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).

cnf(ax_lub1a_2,hypothesis,
    least_upper_bound(b,c) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_lub1a_2) ).

cnf(c_0_5,hypothesis,
    least_upper_bound(a,c) = c,
    ax_lub1a_1 ).

cnf(c_0_6,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    symmetry_of_lub ).

cnf(c_0_7,negated_conjecture,
    least_upper_bound(least_upper_bound(a,b),c) != c,
    prove_ax_lub1a ).

cnf(c_0_8,axiom,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
    associativity_of_lub ).

cnf(c_0_9,hypothesis,
    least_upper_bound(c,a) = c,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,hypothesis,
    least_upper_bound(b,c) = c,
    ax_lub1a_2 ).

cnf(c_0_11,negated_conjecture,
    least_upper_bound(c,least_upper_bound(a,b)) != c,
    inference(rw,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_12,hypothesis,
    least_upper_bound(c,least_upper_bound(a,X1)) = least_upper_bound(c,X1),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    least_upper_bound(c,b) = c,
    inference(rw,[status(thm)],[c_0_10,c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP146-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n007.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 28 22:47:28 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.47/0.57  start to proof: theBenchmark
% 0.47/0.59  % Version  : CSE_E---1.5
% 0.47/0.59  % Problem  : theBenchmark.p
% 0.47/0.59  % Proof found
% 0.47/0.59  % SZS status Theorem for theBenchmark.p
% 0.47/0.59  % SZS output start Proof
% See solution above
% 0.47/0.59  % Total time : 0.005000 s
% 0.47/0.59  % SZS output end Proof
% 0.47/0.59  % Total time : 0.008000 s
%------------------------------------------------------------------------------