TSTP Solution File: GRP190-2 by Fiesta---2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Fiesta---2
% Problem : GRP190-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : dedam
% Command : fiesta-wrapper %s
% Computer : n019.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:15 EDT 2022
% Result : Unsatisfiable 0.87s 1.23s
% Output : CNFRefutation 0.87s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP190-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.15 % Command : fiesta-wrapper %s
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Mon Jun 13 15:47:39 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.87/1.23 Theorem Proved.
% 0.87/1.23 % SZS status Unsatisfiable
% 0.87/1.23 % SZS output start CNFRefutation
% 0.87/1.23 [1=axiom,[],
% 0.87/1.23 least_upper_bound(a,b) = a].
% 0.87/1.23 [2=axiom,[],
% 0.87/1.23 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.87/1.23 [4=axiom,[],
% 0.87/1.23 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.87/1.23 [6=axiom,[],
% 0.87/1.23 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10].
% 0.87/1.23 [12=axiom,[],
% 0.87/1.23 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)].
% 0.87/1.23 [13=demod(1),[12],
% 0.87/1.23 least_upper_bound(b,a) = a].
% 0.87/1.23 [14=axiom,[],
% 0.87/1.23 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)].
% 0.87/1.23 [15=axiom,[],
% 0.87/1.23 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))].
% 0.87/1.23 [16=axiom,[],
% 0.87/1.23 multiply(inverse(X10),X10) = identity].
% 0.87/1.23 [17=axiom,[],
% 0.87/1.23 multiply(identity,X10) = X10].
% 0.87/1.23 [18=axiom,[],
% 0.87/1.23 thtop(X10,X10) = thmfalse].
% 0.87/1.23 [19=axiom,[14],
% 0.87/1.23 thtop(greatest_lower_bound(inverse(b),inverse(a)),inverse(a)) = thmtrue].
% 0.87/1.23 [21=param(6,13),[],
% 0.87/1.23 greatest_lower_bound(b,a) = b].
% 0.87/1.23 [23=param(2,21),[],
% 0.87/1.23 greatest_lower_bound(multiply(b,X10),multiply(a,X10)) = multiply(b,X10)].
% 0.87/1.23 [63=param(15,16),[17],
% 0.87/1.23 multiply(inverse(X11),multiply(X11,X10)) = X10].
% 0.87/1.23 [68=param(63,16),[],
% 0.87/1.23 multiply(inverse(inverse(X10)),identity) = X10].
% 0.87/1.23 [70=param(63,63),[],
% 0.87/1.23 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)].
% 0.87/1.23 [71=demod(68),[70],
% 0.87/1.23 multiply(X10,identity) = X10].
% 0.87/1.23 [79=param(70,16),[],
% 0.87/1.23 multiply(X10,inverse(X10)) = identity].
% 0.87/1.23 [88=param(23,79),[79],
% 0.87/1.23 greatest_lower_bound(identity,multiply(a,inverse(b))) = identity].
% 0.87/1.23 [91=param(4,88),[71,71],
% 0.87/1.23 greatest_lower_bound(X10,multiply(X10,multiply(a,inverse(b)))) = X10].
% 0.87/1.23 [561=param(91,63),[14],
% 0.87/1.23 greatest_lower_bound(inverse(b),inverse(a)) = inverse(a)].
% 0.87/1.23 [566=param(19,561),[18],
% 0.87/1.23 thmtrue = thmfalse].
% 0.87/1.23 % SZS output end CNFRefutation
% 0.87/1.23 Space: 545 KB
%------------------------------------------------------------------------------