%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP190-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:15 EDT 2022 % Result : Unsatisfiable 0.77s 1.14s % Output : CNFRefutation 0.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : GRP190-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.03/0.12 % Command : fiesta-wrapper %s % 0.12/0.33 % Computer : n027.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 13:09:02 EDT 2022 % 0.12/0.33 % CPUTime : % 0.77/1.14 Theorem Proved. % 0.77/1.14 % SZS status Unsatisfiable % 0.77/1.14 % SZS output start CNFRefutation % 0.77/1.14 [1=axiom,[], % 0.77/1.14 least_upper_bound(a,b) = a]. % 0.77/1.14 [2=axiom,[], % 0.77/1.14 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.77/1.14 [4=axiom,[], % 0.77/1.14 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.77/1.14 [6=axiom,[], % 0.77/1.14 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.77/1.14 [7=axiom,[], % 0.77/1.14 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.77/1.14 [12=axiom,[], % 0.77/1.14 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.77/1.14 [13=demod(1),[12], % 0.77/1.14 least_upper_bound(b,a) = a]. % 0.77/1.14 [14=axiom,[], % 0.77/1.14 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.77/1.14 [15=axiom,[], % 0.77/1.14 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 0.77/1.14 [16=axiom,[], % 0.77/1.14 multiply(inverse(X10),X10) = identity]. % 0.77/1.14 [17=axiom,[], % 0.77/1.14 multiply(identity,X10) = X10]. % 0.77/1.14 [18=axiom,[], % 0.77/1.14 thtop(X10,X10) = thmfalse]. % 0.77/1.14 [19=axiom,[12], % 0.77/1.14 thtop(least_upper_bound(inverse(b),inverse(a)),inverse(b)) = thmtrue]. % 0.77/1.14 [21=param(6,13),[], % 0.77/1.14 greatest_lower_bound(b,a) = b]. % 0.77/1.14 [23=param(2,21),[], % 0.77/1.14 greatest_lower_bound(multiply(b,X10),multiply(a,X10)) = multiply(b,X10)]. % 0.77/1.14 [63=param(15,16),[17], % 0.77/1.14 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 0.77/1.14 [68=param(63,16),[], % 0.77/1.14 multiply(inverse(inverse(X10)),identity) = X10]. % 0.77/1.14 [70=param(63,63),[], % 0.77/1.14 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 0.77/1.14 [71=demod(68),[70], % 0.77/1.14 multiply(X10,identity) = X10]. % 0.77/1.14 [79=param(70,16),[], % 0.77/1.14 multiply(X10,inverse(X10)) = identity]. % 0.77/1.14 [88=param(23,79),[79], % 0.77/1.14 greatest_lower_bound(identity,multiply(a,inverse(b))) = identity]. % 0.77/1.14 [91=param(4,88),[71,71], % 0.77/1.14 greatest_lower_bound(X10,multiply(X10,multiply(a,inverse(b)))) = X10]. % 0.77/1.14 [561=param(91,63),[14], % 0.77/1.14 greatest_lower_bound(inverse(b),inverse(a)) = inverse(a)]. % 0.77/1.14 [564=param(7,561),[], % 0.77/1.14 least_upper_bound(inverse(b),inverse(a)) = inverse(b)]. % 0.77/1.14 [573=param(19,564),[18], % 0.77/1.14 thmtrue = thmfalse]. % 0.77/1.14 % SZS output end CNFRefutation % 0.77/1.14 Space: 550 KB %------------------------------------------------------------------------------