%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : GRP176-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 : n029.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:29 EDT 2023

% Result   : Unsatisfiable 0.53s 0.58s
% Output   : CNFRefutation 0.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   16 (   7 unt;   9 typ;   0 def)
%            Number of atoms       :    7 (   6 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    :    4 (   2 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    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   12 (   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,
    c: $i ).

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

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

tff(decl_30,type,
    d: $i ).

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

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

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

cnf(c_0_3,negated_conjecture,
    multiply(c,multiply(least_upper_bound(a,b),d)) != least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))),
    prove_p07 ).

cnf(c_0_4,axiom,
    multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_lub1 ).

cnf(c_0_5,axiom,
    multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
    monotony_lub2 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon Aug 28 23:23:41 EDT 2023
% 0.19/0.33  % CPUTime  : 
% 0.19/0.56  start to proof: theBenchmark
% 0.53/0.58  % Version  : CSE_E---1.5
% 0.53/0.58  % Problem  : theBenchmark.p
% 0.53/0.58  % Proof found
% 0.53/0.58  % SZS status Theorem for theBenchmark.p
% 0.53/0.58  % SZS output start Proof
% See solution above
% 0.53/0.58  % Total time : 0.004000 s
% 0.53/0.58  % SZS output end Proof
% 0.53/0.58  % Total time : 0.007000 s
%------------------------------------------------------------------------------