%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof

% Computer : n010.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 01:17:32 EDT 2023

% Result   : Unsatisfiable 0.22s 0.40s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : GRP176-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.15/0.35  % Computer : n010.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Mon Aug 28 22:56:19 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.22/0.40  Command-line arguments: --no-flatten-goal
% 0.22/0.40  
% 0.22/0.40  % SZS status Unsatisfiable
% 0.22/0.42  
% 0.22/0.42  % SZS output start Proof
% 0.22/0.42  Axiom 1 (monotony_lub1): multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z)).
% 0.22/0.42  Axiom 2 (monotony_lub2): multiply(least_upper_bound(X, Y), Z) = least_upper_bound(multiply(X, Z), multiply(Y, Z)).
% 0.22/0.42  
% 0.22/0.42  Goal 1 (prove_p07): multiply(c, multiply(least_upper_bound(a, b), d)) = least_upper_bound(multiply(c, multiply(a, d)), multiply(c, multiply(b, d))).
% 0.22/0.42  Proof:
% 0.22/0.42    multiply(c, multiply(least_upper_bound(a, b), d))
% 0.22/0.42  = { by axiom 2 (monotony_lub2) }
% 0.22/0.42    multiply(c, least_upper_bound(multiply(a, d), multiply(b, d)))
% 0.22/0.42  = { by axiom 1 (monotony_lub1) }
% 0.22/0.42    least_upper_bound(multiply(c, multiply(a, d)), multiply(c, multiply(b, d)))
% 0.22/0.42  % SZS output end Proof
% 0.22/0.42  
% 0.22/0.42  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------