%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP170-4 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n006.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.78s 1.16s % Output : CNFRefutation 0.78s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : GRP170-4 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.04/0.13 % Command : fiesta-wrapper %s % 0.14/0.34 % Computer : n006.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.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Mon Jun 13 21:55:56 EDT 2022 % 0.14/0.35 % CPUTime : % 0.78/1.16 Theorem Proved. % 0.78/1.16 % SZS status Unsatisfiable % 0.78/1.16 % SZS output start CNFRefutation % 0.78/1.16 [1=axiom,[], % 0.78/1.16 greatest_lower_bound(c,d) = c]. % 0.78/1.16 [2=axiom,[], % 0.78/1.16 least_upper_bound(a,b) = b]. % 0.78/1.16 [4=axiom,[], % 0.78/1.16 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.78/1.16 [6=axiom,[], % 0.78/1.16 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.78/1.16 [8=axiom,[], % 0.78/1.16 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.78/1.16 [11=axiom,[], % 0.78/1.16 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 0.78/1.16 [13=axiom,[], % 0.78/1.16 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.78/1.16 [14=demod(2),[13], % 0.78/1.16 least_upper_bound(b,a) = b]. % 0.78/1.16 [15=axiom,[], % 0.78/1.16 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.78/1.16 [16=demod(1),[15], % 0.78/1.16 greatest_lower_bound(d,c) = c]. % 0.78/1.16 [20=axiom,[], % 0.78/1.16 thtop(X10,X10) = thmfalse]. % 0.78/1.16 [21=axiom,[13], % 0.78/1.16 thtop(least_upper_bound(multiply(b,d),multiply(a,c)),multiply(b,d)) = thmtrue]. % 0.78/1.16 [23=param(4,14),[], % 0.78/1.16 least_upper_bound(multiply(b,X10),multiply(a,X10)) = multiply(b,X10)]. % 0.78/1.16 [24=param(8,16),[], % 0.78/1.16 least_upper_bound(d,c) = d]. % 0.78/1.16 [30=param(6,24),[], % 0.78/1.16 least_upper_bound(multiply(X10,d),multiply(X10,c)) = multiply(X10,d)]. % 0.78/1.16 [81=param(11,23),[], % 0.78/1.16 least_upper_bound(multiply(b,X10),least_upper_bound(multiply(a,X10),X11)) = least_upper_bound(multiply(b,X10),X11)]. % 0.78/1.16 [626=param(81,30),[23], % 0.78/1.16 least_upper_bound(multiply(b,d),multiply(a,c)) = multiply(b,d)]. % 0.78/1.16 [634=param(21,626),[20], % 0.78/1.16 thmtrue = thmfalse]. % 0.78/1.16 % SZS output end CNFRefutation % 0.78/1.16 Space: 525 KB %------------------------------------------------------------------------------