%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP170-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n009.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:03 EDT 2022 % Result : Unsatisfiable 0.46s 1.15s % Output : CNFRefutation 0.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : GRP170-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.13 % Command : fiesta-wrapper %s % 0.13/0.34 % Computer : n009.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.35 % DateTime : Tue Jun 14 01:15:38 EDT 2022 % 0.13/0.35 % CPUTime : % 0.46/1.15 Theorem Proved. % 0.46/1.15 % SZS status Unsatisfiable % 0.46/1.15 % SZS output start CNFRefutation % 0.46/1.15 [1=axiom,[], % 0.46/1.15 greatest_lower_bound(c,d) = c]. % 0.46/1.15 [2=axiom,[], % 0.46/1.15 greatest_lower_bound(a,b) = a]. % 0.46/1.15 [3=axiom,[], % 0.46/1.15 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.46/1.15 [5=axiom,[], % 0.46/1.15 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.46/1.15 [12=axiom,[], % 0.46/1.15 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 0.46/1.15 [14=axiom,[], % 0.46/1.15 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.46/1.15 [15=demod(1),[14], % 0.46/1.15 greatest_lower_bound(d,c) = c]. % 0.46/1.15 [16=demod(2),[14], % 0.46/1.15 greatest_lower_bound(b,a) = a]. % 0.46/1.15 [20=axiom,[], % 0.46/1.15 thtop(X10,X10) = thmfalse]. % 0.46/1.15 [21=axiom,[14], % 0.46/1.15 thtop(greatest_lower_bound(multiply(b,d),multiply(a,c)),multiply(a,c)) = thmtrue]. % 0.46/1.15 [23=param(3,16),[], % 0.46/1.15 greatest_lower_bound(multiply(b,X10),multiply(a,X10)) = multiply(a,X10)]. % 0.46/1.15 [26=param(5,15),[], % 0.46/1.15 greatest_lower_bound(multiply(X10,d),multiply(X10,c)) = multiply(X10,c)]. % 0.46/1.15 [76=param(12,23),[], % 0.46/1.15 greatest_lower_bound(multiply(b,X10),greatest_lower_bound(multiply(a,X10),X11)) = greatest_lower_bound(multiply(a,X10),X11)]. % 0.46/1.15 [527=param(76,26),[26], % 0.46/1.15 greatest_lower_bound(multiply(b,d),multiply(a,c)) = multiply(a,c)]. % 0.46/1.15 [601=param(21,527),[20], % 0.46/1.15 thmtrue = thmfalse]. % 0.46/1.15 % SZS output end CNFRefutation % 0.46/1.15 Space: 497 KB %------------------------------------------------------------------------------