%------------------------------------------------------------------------------
% File     : Fiesta---2
% Problem  : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : dedam
% Command  : fiesta-wrapper %s

% Computer : n022.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  : 600s
% DateTime : Sat Jul 16 09:12:53 EDT 2022

% Result   : Unsatisfiable 0.66s 1.06s
% Output   : CNFRefutation 0.66s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12  % Command  : fiesta-wrapper %s
% 0.12/0.33  % Computer : n022.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  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 02:08:03 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.66/1.06  Theorem Proved.
% 0.66/1.06  % SZS status Unsatisfiable
% 0.66/1.06  % SZS output start CNFRefutation
% 0.66/1.06  [1=axiom,[],
% 0.66/1.06  			least_upper_bound(b,c) 	= b].
% 0.66/1.06  [2=axiom,[],
% 0.66/1.06  			least_upper_bound(a,c) 	= a].
% 0.66/1.06  [7=axiom,[],
% 0.66/1.06  			greatest_lower_bound(X10,least_upper_bound(X10,X11)) 	= X10].
% 0.66/1.06  [12=axiom,[],
% 0.66/1.06  			greatest_lower_bound(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 0.66/1.06  [13=axiom,[],
% 0.66/1.06  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 0.66/1.06  [14=demod(2),[13],
% 0.66/1.06  			least_upper_bound(c,a) 	= a].
% 0.66/1.06  [15=axiom,[],
% 0.66/1.06  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 0.66/1.06  [19=axiom,[],
% 0.66/1.06  			thtop(X10,X10) 	= thmfalse].
% 0.66/1.06  [20=axiom,[15,15],
% 0.66/1.06  			thtop(greatest_lower_bound(c,greatest_lower_bound(b,a)),c) 	= thmtrue].
% 0.66/1.06  [21=param(7,14),[],
% 0.66/1.06  			greatest_lower_bound(c,a) 	= c].
% 0.66/1.06  [29=param(7,13),[],
% 0.66/1.06  			greatest_lower_bound(X10,least_upper_bound(X11,X10)) 	= X10].
% 0.66/1.06  [33=param(29,1),[15],
% 0.66/1.06  			greatest_lower_bound(b,c) 	= c].
% 0.66/1.06  [59=param(12,21),[],
% 0.66/1.06  			greatest_lower_bound(c,greatest_lower_bound(a,X10)) 	= greatest_lower_bound(c,X10)].
% 0.66/1.06  [146=param(59,15),[],
% 0.66/1.06  			greatest_lower_bound(c,greatest_lower_bound(X10,a)) 	= greatest_lower_bound(c,X10)].
% 0.66/1.06  [155=param(20,146),[15,33,19],
% 0.66/1.06  			thmtrue 	= thmfalse].
% 0.66/1.06  % SZS output end CNFRefutation
% 0.66/1.06  Space:    124 KB 
%------------------------------------------------------------------------------