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

% Computer : n020.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:55 EDT 2022

% Result   : Unsatisfiable 0.82s 1.19s
% Output   : CNFRefutation 0.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : fiesta-wrapper %s
% 0.12/0.33  % Computer : n020.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 : Mon Jun 13 16:39:35 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.82/1.19  Theorem Proved.
% 0.82/1.19  % SZS status Unsatisfiable
% 0.82/1.19  % SZS output start CNFRefutation
% 0.82/1.19  [1=axiom,[],
% 0.82/1.19  			greatest_lower_bound(b,c) 	= b].
% 0.82/1.19  [2=axiom,[],
% 0.82/1.19  			greatest_lower_bound(a,c) 	= a].
% 0.82/1.19  [7=axiom,[],
% 0.82/1.19  			greatest_lower_bound(X10,least_upper_bound(X10,X11)) 	= X10].
% 0.82/1.19  [8=axiom,[],
% 0.82/1.19  			least_upper_bound(X10,greatest_lower_bound(X10,X11)) 	= X10].
% 0.82/1.19  [11=axiom,[],
% 0.82/1.19  			least_upper_bound(least_upper_bound(X10,X11),X12) 	= least_upper_bound(X10,least_upper_bound(X11,X12))].
% 0.82/1.19  [13=axiom,[],
% 0.82/1.19  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 0.82/1.19  [14=axiom,[],
% 0.82/1.19  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 0.82/1.19  [15=demod(2),[14],
% 0.82/1.19  			greatest_lower_bound(c,a) 	= a].
% 0.82/1.19  [19=axiom,[],
% 0.82/1.19  			thtop(X10,X10) 	= thmfalse].
% 0.82/1.19  [20=axiom,[13,14,13],
% 0.82/1.19  			thtop(greatest_lower_bound(c,least_upper_bound(b,a)),least_upper_bound(b,a)) 	= thmtrue].
% 0.82/1.19  [23=param(8,15),[],
% 0.82/1.19  			least_upper_bound(c,a) 	= c].
% 0.82/1.19  [25=param(8,14),[],
% 0.82/1.19  			least_upper_bound(X10,greatest_lower_bound(X11,X10)) 	= X10].
% 0.82/1.19  [29=param(25,1),[13],
% 0.82/1.19  			least_upper_bound(b,c) 	= c].
% 0.82/1.19  [35=param(7,13),[],
% 0.82/1.19  			greatest_lower_bound(X10,least_upper_bound(X11,X10)) 	= X10].
% 0.82/1.19  [43=param(11,13),[11],
% 0.82/1.19  			least_upper_bound(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(X11,least_upper_bound(X10,X12))].
% 0.82/1.19  [47=param(11,29),[],
% 0.82/1.19  			least_upper_bound(b,least_upper_bound(c,X10)) 	= least_upper_bound(c,X10)].
% 0.82/1.19  [257=param(43,47),[],
% 0.82/1.19  			least_upper_bound(c,least_upper_bound(b,X10)) 	= least_upper_bound(c,X10)].
% 0.82/1.19  [271=param(35,257),[],
% 0.82/1.19  			greatest_lower_bound(least_upper_bound(b,X10),least_upper_bound(c,X10)) 	= least_upper_bound(b,X10)].
% 0.82/1.19  [921=param(271,23),[14],
% 0.82/1.19  			greatest_lower_bound(c,least_upper_bound(b,a)) 	= least_upper_bound(b,a)].
% 0.82/1.19  [935=param(20,921),[19],
% 0.82/1.19  			thmtrue 	= thmfalse].
% 0.82/1.19  % SZS output end CNFRefutation
% 0.82/1.19  Space:    846 KB 
%------------------------------------------------------------------------------