TSTP Solution File: GRP186-1 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP186-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n027.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:13 EDT 2022
% Result : Unsatisfiable 3.67s 4.02s
% Output : CNFRefutation 3.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP186-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.13 % Command : fiesta-wrapper %s
% 0.12/0.34 % Computer : n027.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 : 600
% 0.12/0.34 % DateTime : Tue Jun 14 06:05:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.67/4.02 Theorem Proved.
% 3.67/4.02 % SZS status Unsatisfiable
% 3.67/4.02 % SZS output start CNFRefutation
% 3.67/4.02 [1=axiom,[],
% 3.67/4.02 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 3.67/4.02 [2=axiom,[],
% 3.67/4.02 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 3.67/4.02 [4=axiom,[],
% 3.67/4.02 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 3.67/4.02 [5=axiom,[],
% 3.67/4.02 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10].
% 3.67/4.02 [6=axiom,[],
% 3.67/4.02 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10].
% 3.67/4.02 [9=axiom,[],
% 3.67/4.02 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))].
% 3.67/4.02 [10=axiom,[],
% 3.67/4.02 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 3.67/4.02 [11=axiom,[],
% 3.67/4.02 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 3.67/4.02 [12=axiom,[],
% 3.67/4.02 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)].
% 3.67/4.02 [13=axiom,[],
% 3.67/4.02 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))].
% 3.67/4.02 [14=axiom,[],
% 3.67/4.02 multiply(inverse(X10),X10) = identity].
% 3.67/4.02 [15=axiom,[],
% 3.67/4.02 multiply(identity,X10) = X10].
% 3.67/4.02 [16=axiom,[],
% 3.67/4.02 thtop(X10,X10) = thmfalse].
% 3.67/4.02 [17=axiom,[11],
% 3.67/4.02 thtop(least_upper_bound(identity,multiply(a,b)),multiply(a,inverse(greatest_lower_bound(a,inverse(b))))) = thmtrue].
% 3.67/4.02 [18=param(6,12),[],
% 3.67/4.02 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10].
% 3.67/4.02 [21=param(5,11),[],
% 3.67/4.02 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10].
% 3.67/4.02 [22=param(4,14),[],
% 3.67/4.02 least_upper_bound(multiply(inverse(least_upper_bound(X10,X11)),X10),multiply(inverse(least_upper_bound(X10,X11)),X11)) = identity].
% 3.67/4.02 [38=param(6,10),[],
% 3.67/4.02 least_upper_bound(greatest_lower_bound(X10,X11),greatest_lower_bound(X10,greatest_lower_bound(X11,X12))) = greatest_lower_bound(X10,X11)].
% 3.67/4.02 [53=param(13,14),[15],
% 3.67/4.02 multiply(inverse(X11),multiply(X11,X10)) = X10].
% 3.67/4.02 [55=param(53,14),[],
% 3.67/4.02 multiply(inverse(inverse(X10)),identity) = X10].
% 3.67/4.02 [57=param(53,53),[],
% 3.67/4.02 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)].
% 3.67/4.02 [58=demod(55),[57],
% 3.67/4.02 multiply(X10,identity) = X10].
% 3.67/4.02 [59=param(58,14),[],
% 3.67/4.02 inverse(identity) = identity].
% 3.67/4.02 [65=param(57,14),[],
% 3.67/4.02 multiply(X10,inverse(X10)) = identity].
% 3.67/4.02 [67=param(57,58),[58],
% 3.67/4.02 inverse(inverse(X10)) = X10].
% 3.67/4.02 [71=param(22,58),[],
% 3.67/4.02 least_upper_bound(inverse(least_upper_bound(identity,X10)),multiply(inverse(least_upper_bound(identity,X10)),X10)) = identity].
% 3.67/4.02 [75=param(65,13),[],
% 3.67/4.02 multiply(X10,multiply(X11,inverse(multiply(X10,X11)))) = identity].
% 3.67/4.02 [129=param(53,75),[58],
% 3.67/4.02 multiply(X11,inverse(multiply(X10,X11))) = inverse(X10)].
% 3.67/4.02 [136=param(53,129),[],
% 3.67/4.02 multiply(inverse(X10),inverse(X11)) = inverse(multiply(X11,X10))].
% 3.67/4.02 [157=param(136,67),[],
% 3.67/4.02 multiply(inverse(X10),X11) = inverse(multiply(inverse(X11),X10))].
% 3.67/4.02 [163=demod(71),[157,4,58,14,11],
% 3.67/4.02 least_upper_bound(inverse(least_upper_bound(identity,X10)),inverse(least_upper_bound(identity,inverse(X10)))) = identity].
% 3.67/4.02 [167=param(67,136),[],
% 3.67/4.02 inverse(multiply(inverse(X10),inverse(X11))) = multiply(X11,X10)].
% 3.67/4.02 [172=param(17,167),[67,1,65,136],
% 3.67/4.02 thtop(least_upper_bound(identity,multiply(a,b)),inverse(greatest_lower_bound(identity,inverse(multiply(a,b))))) = thmtrue].
% 3.67/4.02 [389=param(5,163),[12],
% 3.67/4.02 greatest_lower_bound(identity,inverse(least_upper_bound(identity,X10))) = inverse(least_upper_bound(identity,X10))].
% 3.67/4.02 [397=param(6,389),[],
% 3.67/4.02 least_upper_bound(identity,inverse(least_upper_bound(identity,X10))) = identity].
% 3.67/4.02 [404=param(38,389),[],
% 3.67/4.02 least_upper_bound(greatest_lower_bound(X10,identity),greatest_lower_bound(X10,inverse(least_upper_bound(identity,X11)))) = greatest_lower_bound(X10,identity)].
% 3.67/4.02 [415=param(397,11),[],
% 3.67/4.02 least_upper_bound(identity,inverse(least_upper_bound(X10,identity))) = identity].
% 3.67/4.02 [420=param(2,415),[15,15],
% 3.67/4.02 least_upper_bound(X10,multiply(inverse(least_upper_bound(X11,identity)),X10)) = X10].
% 3.67/4.02 [464=param(420,157),[4,58,11],
% 3.67/4.02 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),multiply(inverse(X10),X11)))) = X10].
% 3.67/4.02 [558=param(464,53),[],
% 3.67/4.02 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),X11))) = X10].
% 3.67/4.02 [563=param(558,11),[],
% 3.67/4.02 least_upper_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = X10].
% 3.67/4.02 [586=param(21,563),[12],
% 3.67/4.02 greatest_lower_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = inverse(least_upper_bound(X11,inverse(X10)))].
% 3.67/4.02 [592=param(563,67),[],
% 3.67/4.02 least_upper_bound(inverse(X10),inverse(least_upper_bound(X11,X10))) = inverse(X10)].
% 3.67/4.02 [600=param(592,6),[11],
% 3.67/4.02 least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X10,X11))) = inverse(greatest_lower_bound(X10,X11))].
% 3.67/4.02 [603=param(592,18),[11],
% 3.67/4.02 least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X11,X10))) = inverse(greatest_lower_bound(X11,X10))].
% 3.67/4.02 [622=param(603,59),[],
% 3.67/4.02 least_upper_bound(identity,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(X10,identity))].
% 3.67/4.02 [2761=param(404,586),[11],
% 3.67/4.02 least_upper_bound(inverse(least_upper_bound(identity,inverse(X10))),greatest_lower_bound(X10,identity)) = greatest_lower_bound(X10,identity)].
% 3.67/4.02 [2765=param(558,2761),[9,600,622],
% 3.67/4.02 inverse(greatest_lower_bound(X10,identity)) = least_upper_bound(identity,inverse(X10))].
% 3.67/4.02 [2823=param(67,2765),[],
% 3.67/4.02 greatest_lower_bound(X10,identity) = inverse(least_upper_bound(identity,inverse(X10)))].
% 3.67/4.02 [2901=param(2823,12),[],
% 3.67/4.02 greatest_lower_bound(identity,X10) = inverse(least_upper_bound(identity,inverse(X10)))].
% 3.67/4.02 [3162=param(172,2901),[67,67,16],
% 3.67/4.02 thmtrue = thmfalse].
% 3.67/4.02 % SZS output end CNFRefutation
% 3.67/4.02 Space: 16966 KB
%------------------------------------------------------------------------------