%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP156-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 : n012.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:19 EDT 2023

% Result   : Unsatisfiable 0.21s 0.60s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   19 (  11 unt;   8 typ;   0 def)
%            Number of atoms       :   11 (  10 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   :   10 (   2 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,
    b: $i ).

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

cnf(prove_ax_mono1c,negated_conjecture,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_mono1c) ).

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

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

cnf(ax_mono1c_1,hypothesis,
    least_upper_bound(a,b) = b,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_mono1c_1) ).

cnf(c_0_4,negated_conjecture,
    greatest_lower_bound(multiply(a,c),multiply(b,c)) != multiply(a,c),
    prove_ax_mono1c ).

cnf(c_0_5,axiom,
    multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
    monotony_glb2 ).

cnf(c_0_6,axiom,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    glb_absorbtion ).

cnf(c_0_7,hypothesis,
    least_upper_bound(a,b) = b,
    ax_mono1c_1 ).

cnf(c_0_8,negated_conjecture,
    multiply(greatest_lower_bound(a,b),c) != multiply(a,c),
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_9,hypothesis,
    greatest_lower_bound(a,b) = a,
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : GRP156-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 : n012.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.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 29 02:30:39 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.60  % Version  : CSE_E---1.5
% 0.21/0.60  % Problem  : theBenchmark.p
% 0.21/0.60  % Proof found
% 0.21/0.60  % SZS status Theorem for theBenchmark.p
% 0.21/0.60  % SZS output start Proof
% See solution above
% 0.21/0.60  % Total time : 0.004000 s
% 0.21/0.60  % SZS output end Proof
% 0.21/0.60  % Total time : 0.007000 s
%------------------------------------------------------------------------------