%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n022.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:04 EDT 2022 % Result : Unsatisfiable 0.73s 1.09s % Output : CNFRefutation 0.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.06/0.13 % Command : fiesta-wrapper %s % 0.14/0.34 % Computer : n022.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jun 14 13:45:18 EDT 2022 % 0.14/0.34 % CPUTime : % 0.73/1.09 Theorem Proved. % 0.73/1.09 % SZS status Unsatisfiable % 0.73/1.09 % SZS output start CNFRefutation % 0.73/1.09 [1=axiom,[], % 0.73/1.09 greatest_lower_bound(identity,b) = identity]. % 0.73/1.09 [2=axiom,[], % 0.73/1.09 greatest_lower_bound(identity,a) = identity]. % 0.73/1.09 [4=axiom,[], % 0.73/1.09 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.73/1.09 [5=axiom,[], % 0.73/1.09 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.73/1.09 [6=axiom,[], % 0.73/1.09 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.73/1.09 [7=axiom,[], % 0.73/1.09 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.73/1.09 [8=axiom,[], % 0.73/1.09 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.73/1.09 [11=axiom,[], % 0.73/1.09 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 0.73/1.09 [13=axiom,[], % 0.73/1.09 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.73/1.09 [14=axiom,[], % 0.73/1.09 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.73/1.09 [15=demod(1),[14], % 0.73/1.09 greatest_lower_bound(b,identity) = identity]. % 0.73/1.09 [16=demod(2),[14], % 0.73/1.09 greatest_lower_bound(a,identity) = identity]. % 0.73/1.09 [17=axiom,[], % 0.73/1.09 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 0.73/1.09 [18=axiom,[], % 0.73/1.09 multiply(inverse(X10),X10) = identity]. % 0.73/1.09 [19=axiom,[], % 0.73/1.09 multiply(identity,X10) = X10]. % 0.73/1.09 [20=axiom,[], % 0.73/1.09 thtop(X10,X10) = thmfalse]. % 0.73/1.09 [21=axiom,[], % 0.73/1.09 thtop(greatest_lower_bound(identity,multiply(a,b)),identity) = thmtrue]. % 0.73/1.09 [24=param(5,15),[], % 0.73/1.09 greatest_lower_bound(multiply(X10,b),multiply(X10,identity)) = multiply(X10,identity)]. % 0.73/1.09 [32=param(8,16),[], % 0.73/1.09 least_upper_bound(a,identity) = a]. % 0.73/1.09 [36=param(4,32),[19,13], % 0.73/1.09 least_upper_bound(X10,multiply(a,X10)) = multiply(a,X10)]. % 0.73/1.09 [76=param(17,18),[19], % 0.73/1.09 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 0.73/1.09 [84=param(24,18),[], % 0.73/1.09 greatest_lower_bound(identity,multiply(inverse(b),identity)) = multiply(inverse(b),identity)]. % 0.73/1.09 [91=param(76,18),[], % 0.73/1.09 multiply(inverse(inverse(X10)),identity) = X10]. % 0.73/1.09 [94=param(76,76),[], % 0.73/1.09 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 0.73/1.09 [95=demod(91),[94], % 0.73/1.09 multiply(X10,identity) = X10]. % 0.73/1.09 [102=demod(84),[95,95], % 0.73/1.09 greatest_lower_bound(identity,inverse(b)) = inverse(b)]. % 0.73/1.09 [116=param(8,102),[], % 0.73/1.09 least_upper_bound(identity,inverse(b)) = identity]. % 0.73/1.09 [125=param(6,116),[95,95], % 0.73/1.09 least_upper_bound(X10,multiply(X10,inverse(b))) = X10]. % 0.73/1.09 [183=param(125,18),[13], % 0.73/1.09 least_upper_bound(identity,inverse(inverse(b))) = inverse(inverse(b))]. % 0.73/1.09 [186=param(11,183),[], % 0.73/1.09 least_upper_bound(identity,least_upper_bound(inverse(inverse(b)),X10)) = least_upper_bound(inverse(inverse(b)),X10)]. % 0.73/1.09 [206=param(94,95),[95], % 0.73/1.09 inverse(inverse(X10)) = X10]. % 0.73/1.09 [211=demod(186),[206,206], % 0.73/1.09 least_upper_bound(identity,least_upper_bound(b,X10)) = least_upper_bound(b,X10)]. % 0.73/1.09 [221=param(7,211),[], % 0.73/1.09 greatest_lower_bound(identity,least_upper_bound(b,X10)) = identity]. % 0.73/1.09 [239=param(221,36),[], % 0.73/1.09 greatest_lower_bound(identity,multiply(a,b)) = identity]. % 0.73/1.09 [293=param(21,239),[20], % 0.73/1.09 thmtrue = thmfalse]. % 0.73/1.09 % SZS output end CNFRefutation % 0.73/1.09 Space: 216 KB %------------------------------------------------------------------------------