%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n016.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:07 EDT 2022 % Result : Unsatisfiable 2.43s 2.80s % Output : CNFRefutation 2.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.12/0.13 % Command : fiesta-wrapper %s % 0.12/0.33 % Computer : n016.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 08:31:29 EDT 2022 % 0.12/0.34 % CPUTime : % 2.43/2.80 Theorem Proved. % 2.43/2.80 % SZS status Unsatisfiable % 2.43/2.80 % SZS output start CNFRefutation % 2.43/2.80 [1=axiom,[], % 2.43/2.80 greatest_lower_bound(a,b) = identity]. % 2.43/2.80 [2=axiom,[], % 2.43/2.80 greatest_lower_bound(identity,c) = identity]. % 2.43/2.80 [5=axiom,[], % 2.43/2.80 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 2.43/2.80 [7=axiom,[], % 2.43/2.80 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 2.43/2.80 [8=axiom,[], % 2.43/2.80 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 2.43/2.80 [9=axiom,[], % 2.43/2.80 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 2.43/2.80 [10=axiom,[], % 2.43/2.80 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 2.43/2.80 [14=axiom,[], % 2.43/2.80 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 2.43/2.80 [15=axiom,[], % 2.43/2.80 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 2.43/2.80 [16=axiom,[], % 2.43/2.80 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 2.43/2.80 [17=demod(1),[16], % 2.43/2.80 greatest_lower_bound(b,a) = identity]. % 2.43/2.80 [19=demod(2),[16], % 2.43/2.80 greatest_lower_bound(c,identity) = identity]. % 2.43/2.80 [21=axiom,[], % 2.43/2.80 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 2.43/2.80 [22=axiom,[], % 2.43/2.80 multiply(inverse(X10),X10) = identity]. % 2.43/2.80 [23=axiom,[], % 2.43/2.80 multiply(identity,X10) = X10]. % 2.43/2.80 [24=axiom,[], % 2.43/2.80 thtop(X10,X10) = thmfalse]. % 2.43/2.80 [25=axiom,[16], % 2.43/2.80 thtop(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(c,a)) = thmtrue]. % 2.43/2.80 [29=param(5,17),[23], % 2.43/2.80 greatest_lower_bound(multiply(b,X10),multiply(a,X10)) = X10]. % 2.43/2.80 [30=param(7,17),[], % 2.43/2.80 multiply(X10,identity) = greatest_lower_bound(multiply(X10,b),multiply(X10,a))]. % 2.43/2.80 [43=param(10,19),[], % 2.43/2.80 least_upper_bound(c,identity) = c]. % 2.43/2.80 [54=param(8,43),[30], % 2.43/2.80 least_upper_bound(multiply(X10,c),greatest_lower_bound(multiply(X10,b),multiply(X10,a))) = multiply(X10,c)]. % 2.43/2.80 [73=param(14,16),[14], % 2.43/2.80 greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(X11,greatest_lower_bound(X10,X12))]. % 2.43/2.80 [88=param(21,22),[23], % 2.43/2.80 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 2.43/2.80 [90=param(88,22),[30], % 2.43/2.80 greatest_lower_bound(multiply(inverse(inverse(X10)),b),multiply(inverse(inverse(X10)),a)) = X10]. % 2.43/2.80 [92=param(88,88),[], % 2.43/2.80 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 2.43/2.80 [93=demod(90),[92,92], % 2.43/2.80 greatest_lower_bound(multiply(X10,b),multiply(X10,a)) = X10]. % 2.43/2.80 [94=demod(54),[93,15], % 2.43/2.80 least_upper_bound(X10,multiply(X10,c)) = multiply(X10,c)]. % 2.43/2.80 [101=param(9,94),[], % 2.43/2.80 greatest_lower_bound(X10,multiply(X10,c)) = X10]. % 2.43/2.80 [555=param(73,29),[], % 2.43/2.80 greatest_lower_bound(multiply(b,X11),greatest_lower_bound(X10,multiply(a,X11))) = greatest_lower_bound(X10,X11)]. % 2.43/2.80 [11068=param(555,101),[16,16], % 2.43/2.80 greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(c,a)]. % 2.43/2.80 [11088=param(25,11068),[24], % 2.43/2.80 thmtrue = thmfalse]. % 2.43/2.80 % SZS output end CNFRefutation % 2.43/2.80 Space: 16514 KB %------------------------------------------------------------------------------