TSTP Solution File: GRP185-3 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP185-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n021.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:12 EDT 2022
% Result : Unsatisfiable 0.42s 1.07s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP185-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.12 % Command : fiesta-wrapper %s
% 0.12/0.33 % Computer : n021.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 06:00:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.07 Theorem Proved.
% 0.42/1.07 % SZS status Unsatisfiable
% 0.42/1.07 % SZS output start CNFRefutation
% 0.42/1.07 [2=axiom,[],
% 0.42/1.07 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.42/1.07 [4=axiom,[],
% 0.42/1.07 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.42/1.07 [5=axiom,[],
% 0.42/1.07 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10].
% 0.42/1.07 [9=axiom,[],
% 0.42/1.07 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))].
% 0.42/1.07 [11=axiom,[],
% 0.42/1.07 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.42/1.07 [13=axiom,[],
% 0.42/1.07 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))].
% 0.42/1.07 [14=axiom,[],
% 0.42/1.07 multiply(inverse(X10),X10) = identity].
% 0.42/1.07 [15=axiom,[],
% 0.42/1.07 multiply(identity,X10) = X10].
% 0.42/1.07 [16=axiom,[],
% 0.42/1.07 thtop(X10,X10) = thmfalse].
% 0.42/1.07 [17=axiom,[11,2,4,4,15,15,11,9,11],
% 0.42/1.07 thtop(greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity))))),least_upper_bound(identity,multiply(a,b))) = thmtrue].
% 0.42/1.07 [21=param(5,11),[],
% 0.42/1.07 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10].
% 0.42/1.07 [29=param(9,11),[],
% 0.42/1.07 least_upper_bound(X10,least_upper_bound(X11,X12)) = least_upper_bound(X12,least_upper_bound(X10,X11))].
% 0.42/1.07 [33=param(21,9),[],
% 0.42/1.07 greatest_lower_bound(X10,least_upper_bound(X11,least_upper_bound(X12,X10))) = X10].
% 0.42/1.07 [53=param(13,14),[15],
% 0.42/1.07 multiply(inverse(X11),multiply(X11,X10)) = X10].
% 0.42/1.07 [55=param(53,14),[],
% 0.42/1.07 multiply(inverse(inverse(X10)),identity) = X10].
% 0.42/1.07 [57=param(53,53),[],
% 0.42/1.07 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)].
% 0.42/1.07 [58=demod(55),[57],
% 0.42/1.07 multiply(X10,identity) = X10].
% 0.42/1.07 [106=param(17,29),[58,33,16],
% 0.42/1.07 thmtrue = thmfalse].
% 0.42/1.07 % SZS output end CNFRefutation
% 0.42/1.07 Space: 91 KB
%------------------------------------------------------------------------------