%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GRP163-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 : n017.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:25 EDT 2023

% Result   : Unsatisfiable 0.19s 0.39s
% Output   : Proof 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 01:19:43 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.39  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.19/0.39  
% 0.19/0.39  % SZS status Unsatisfiable
% 0.19/0.39  
% 0.19/0.39  % SZS output start Proof
% 0.19/0.39  Axiom 1 (symmetry_of_lub): least_upper_bound(X, Y) = least_upper_bound(Y, X).
% 0.19/0.39  Axiom 2 (symmetry_of_glb): greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X).
% 0.19/0.39  Axiom 3 (ax_transb_2): greatest_lower_bound(b, c) = b.
% 0.19/0.39  Axiom 4 (ax_transb_1): greatest_lower_bound(a, b) = a.
% 0.19/0.39  Axiom 5 (lub_absorbtion): least_upper_bound(X, greatest_lower_bound(X, Y)) = X.
% 0.19/0.39  Axiom 6 (glb_absorbtion): greatest_lower_bound(X, least_upper_bound(X, Y)) = X.
% 0.19/0.39  Axiom 7 (associativity_of_glb): greatest_lower_bound(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(greatest_lower_bound(X, Y), Z).
% 0.19/0.39  
% 0.19/0.39  Goal 1 (prove_ax_transb): greatest_lower_bound(a, c) = a.
% 0.19/0.39  Proof:
% 0.19/0.39    greatest_lower_bound(a, c)
% 0.19/0.39  = { by axiom 5 (lub_absorbtion) R->L }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, greatest_lower_bound(c, greatest_lower_bound(a, b))))
% 0.19/0.39  = { by axiom 2 (symmetry_of_glb) R->L }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, greatest_lower_bound(c, greatest_lower_bound(b, a))))
% 0.19/0.39  = { by axiom 7 (associativity_of_glb) }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, greatest_lower_bound(greatest_lower_bound(c, b), a)))
% 0.19/0.39  = { by axiom 2 (symmetry_of_glb) R->L }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, greatest_lower_bound(greatest_lower_bound(b, c), a)))
% 0.19/0.39  = { by axiom 3 (ax_transb_2) }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, greatest_lower_bound(b, a)))
% 0.19/0.39  = { by axiom 2 (symmetry_of_glb) R->L }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, greatest_lower_bound(a, b)))
% 0.19/0.39  = { by axiom 4 (ax_transb_1) }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(c, a))
% 0.19/0.39  = { by axiom 1 (symmetry_of_lub) R->L }
% 0.19/0.39    greatest_lower_bound(a, least_upper_bound(a, c))
% 0.19/0.39  = { by axiom 6 (glb_absorbtion) }
% 0.19/0.39    a
% 0.19/0.39  % SZS output end Proof
% 0.19/0.39  
% 0.19/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------