TSTP Solution File: GRP179-1 by Fiesta---2

View Problem - Process Solution

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

% Computer : n028.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:13:07 EDT 2022

% Result   : Unsatisfiable 3.32s 3.76s
% Output   : CNFRefutation 3.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : GRP179-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : fiesta-wrapper %s
% 0.12/0.33  % Computer : n028.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 09:59:07 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 3.32/3.76  Theorem Proved.
% 3.32/3.76  % SZS status Unsatisfiable
% 3.32/3.76  % SZS output start CNFRefutation
% 3.32/3.76  [1=axiom,[],
% 3.32/3.76  			multiply(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 3.32/3.76  [2=axiom,[],
% 3.32/3.76  			multiply(least_upper_bound(X10,X11),X12) 	= least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 3.32/3.76  [4=axiom,[],
% 3.32/3.76  			multiply(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 3.32/3.76  [5=axiom,[],
% 3.32/3.76  			greatest_lower_bound(X10,least_upper_bound(X10,X11)) 	= X10].
% 3.32/3.76  [6=axiom,[],
% 3.32/3.76  			least_upper_bound(X10,greatest_lower_bound(X10,X11)) 	= X10].
% 3.32/3.76  [9=axiom,[],
% 3.32/3.76  			least_upper_bound(least_upper_bound(X10,X11),X12) 	= least_upper_bound(X10,least_upper_bound(X11,X12))].
% 3.32/3.76  [10=axiom,[],
% 3.32/3.76  			greatest_lower_bound(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 3.32/3.76  [11=axiom,[],
% 3.32/3.76  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 3.32/3.76  [12=axiom,[],
% 3.32/3.76  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 3.32/3.76  [13=axiom,[],
% 3.32/3.76  			multiply(multiply(X10,X11),X12) 	= multiply(X10,multiply(X11,X12))].
% 3.32/3.77  [14=axiom,[],
% 3.32/3.77  			multiply(inverse(X10),X10) 	= identity].
% 3.32/3.77  [15=axiom,[],
% 3.32/3.77  			multiply(identity,X10) 	= X10].
% 3.32/3.77  [16=axiom,[],
% 3.32/3.77  			thtop(X10,X10) 	= thmfalse].
% 3.32/3.77  [17=axiom,[11,12],
% 3.32/3.77  			thtop(inverse(least_upper_bound(b,a)),greatest_lower_bound(inverse(b),inverse(a))) 	= thmtrue].
% 3.32/3.77  [18=param(6,12),[],
% 3.32/3.77  			least_upper_bound(X10,greatest_lower_bound(X11,X10)) 	= X10].
% 3.32/3.77  [21=param(5,11),[],
% 3.32/3.77  			greatest_lower_bound(X10,least_upper_bound(X11,X10)) 	= X10].
% 3.32/3.77  [22=param(4,14),[],
% 3.32/3.77  			least_upper_bound(multiply(inverse(least_upper_bound(X10,X11)),X10),multiply(inverse(least_upper_bound(X10,X11)),X11)) 	= identity].
% 3.32/3.77  [38=param(6,10),[],
% 3.32/3.77  			least_upper_bound(greatest_lower_bound(X10,X11),greatest_lower_bound(X10,greatest_lower_bound(X11,X12))) 	= greatest_lower_bound(X10,X11)].
% 3.32/3.77  [53=param(13,14),[15],
% 3.32/3.77  			multiply(inverse(X11),multiply(X11,X10)) 	= X10].
% 3.32/3.77  [55=param(53,14),[],
% 3.32/3.77  			multiply(inverse(inverse(X10)),identity) 	= X10].
% 3.32/3.77  [57=param(53,53),[],
% 3.32/3.77  			multiply(inverse(inverse(X10)),X11) 	= multiply(X10,X11)].
% 3.32/3.77  [58=demod(55),[57],
% 3.32/3.77  			multiply(X10,identity) 	= X10].
% 3.32/3.77  [59=param(58,14),[],
% 3.32/3.77  			inverse(identity) 	= identity].
% 3.32/3.77  [65=param(57,14),[],
% 3.32/3.77  			multiply(X10,inverse(X10)) 	= identity].
% 3.32/3.77  [67=param(57,58),[58],
% 3.32/3.77  			inverse(inverse(X10)) 	= X10].
% 3.32/3.77  [71=param(22,58),[],
% 3.32/3.77  			least_upper_bound(inverse(least_upper_bound(identity,X10)),multiply(inverse(least_upper_bound(identity,X10)),X10)) 	= identity].
% 3.32/3.77  [75=param(65,13),[],
% 3.32/3.77  			multiply(X10,multiply(X11,inverse(multiply(X10,X11)))) 	= identity].
% 3.32/3.77  [129=param(53,75),[58],
% 3.32/3.77  			multiply(X11,inverse(multiply(X10,X11))) 	= inverse(X10)].
% 3.32/3.77  [131=param(129,1),[],
% 3.32/3.77  			multiply(X10,inverse(greatest_lower_bound(multiply(X11,X10),multiply(X12,X10)))) 	= inverse(greatest_lower_bound(X11,X12))].
% 3.32/3.77  [136=param(53,129),[],
% 3.32/3.77  			multiply(inverse(X10),inverse(X11)) 	= inverse(multiply(X11,X10))].
% 3.32/3.77  [157=param(136,67),[],
% 3.32/3.77  			multiply(inverse(X10),X11) 	= inverse(multiply(inverse(X11),X10))].
% 3.32/3.77  [163=demod(71),[157,4,58,14,11],
% 3.32/3.77  			least_upper_bound(inverse(least_upper_bound(identity,X10)),inverse(least_upper_bound(identity,inverse(X10)))) 	= identity].
% 3.32/3.77  [388=param(5,163),[12],
% 3.32/3.77  			greatest_lower_bound(identity,inverse(least_upper_bound(identity,X10))) 	= inverse(least_upper_bound(identity,X10))].
% 3.32/3.77  [396=param(6,388),[],
% 3.32/3.77  			least_upper_bound(identity,inverse(least_upper_bound(identity,X10))) 	= identity].
% 3.32/3.77  [403=param(38,388),[],
% 3.32/3.77  			least_upper_bound(greatest_lower_bound(X10,identity),greatest_lower_bound(X10,inverse(least_upper_bound(identity,X11)))) 	= greatest_lower_bound(X10,identity)].
% 3.32/3.77  [414=param(396,11),[],
% 3.32/3.77  			least_upper_bound(identity,inverse(least_upper_bound(X10,identity))) 	= identity].
% 3.32/3.77  [419=param(2,414),[15,15],
% 3.32/3.77  			least_upper_bound(X10,multiply(inverse(least_upper_bound(X11,identity)),X10)) 	= X10].
% 3.32/3.77  [463=param(419,157),[4,58,11],
% 3.32/3.77  			least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),multiply(inverse(X10),X11)))) 	= X10].
% 3.32/3.77  [557=param(463,53),[],
% 3.32/3.77  			least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),X11))) 	= X10].
% 3.32/3.77  [562=param(557,11),[],
% 3.32/3.77  			least_upper_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) 	= X10].
% 3.32/3.77  [585=param(21,562),[12],
% 3.32/3.77  			greatest_lower_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) 	= inverse(least_upper_bound(X11,inverse(X10)))].
% 3.32/3.77  [591=param(562,67),[],
% 3.32/3.77  			least_upper_bound(inverse(X10),inverse(least_upper_bound(X11,X10))) 	= inverse(X10)].
% 3.32/3.77  [599=param(591,6),[11],
% 3.32/3.77  			least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X10,X11))) 	= inverse(greatest_lower_bound(X10,X11))].
% 3.32/3.77  [602=param(591,18),[11],
% 3.32/3.77  			least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X11,X10))) 	= inverse(greatest_lower_bound(X11,X10))].
% 3.32/3.77  [624=param(602,59),[],
% 3.32/3.77  			least_upper_bound(identity,inverse(greatest_lower_bound(X10,identity))) 	= inverse(greatest_lower_bound(X10,identity))].
% 3.32/3.77  [688=param(131,14),[],
% 3.32/3.77  			multiply(X10,inverse(greatest_lower_bound(identity,multiply(X11,X10)))) 	= inverse(greatest_lower_bound(inverse(X10),X11))].
% 3.32/3.77  [2744=param(403,585),[11],
% 3.32/3.77  			least_upper_bound(inverse(least_upper_bound(identity,inverse(X10))),greatest_lower_bound(X10,identity)) 	= greatest_lower_bound(X10,identity)].
% 3.32/3.77  [2748=param(557,2744),[9,599,624],
% 3.32/3.77  			inverse(greatest_lower_bound(X10,identity)) 	= least_upper_bound(identity,inverse(X10))].
% 3.32/3.77  [2762=param(2748,12),[],
% 3.32/3.77  			inverse(greatest_lower_bound(identity,X10)) 	= least_upper_bound(identity,inverse(X10))].
% 3.32/3.77  [2763=demod(688),[2762,4,58,129],
% 3.32/3.77  			inverse(greatest_lower_bound(inverse(X10),X11)) 	= least_upper_bound(X10,inverse(X11))].
% 3.32/3.77  [3156=param(2763,67),[],
% 3.32/3.77  			inverse(greatest_lower_bound(X10,X11)) 	= least_upper_bound(inverse(X10),inverse(X11))].
% 3.32/3.77  [3206=param(67,3156),[],
% 3.32/3.77  			greatest_lower_bound(X10,X11) 	= inverse(least_upper_bound(inverse(X10),inverse(X11)))].
% 3.32/3.77  [3825=param(17,3206),[67,67,16],
% 3.32/3.77  			thmtrue 	= thmfalse].
% 3.32/3.77  % SZS output end CNFRefutation
% 3.32/3.77  Space:  17445 KB 
%------------------------------------------------------------------------------