%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP170-3 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n026.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.17s % Output : CNFRefutation 0.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP170-3 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.08/0.13 % Command : fiesta-wrapper %s % 0.15/0.35 % Computer : n026.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 600 % 0.15/0.35 % DateTime : Mon Jun 13 10:13:35 EDT 2022 % 0.15/0.35 % CPUTime : % 0.46/1.17 Theorem Proved. % 0.46/1.17 % SZS status Unsatisfiable % 0.46/1.17 % SZS output start CNFRefutation % 0.46/1.17 [1=axiom,[], % 0.46/1.17 least_upper_bound(c,d) = d]. % 0.46/1.17 [2=axiom,[], % 0.46/1.17 least_upper_bound(a,b) = b]. % 0.46/1.17 [4=axiom,[], % 0.46/1.17 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.46/1.17 [6=axiom,[], % 0.46/1.17 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.46/1.17 [7=axiom,[], % 0.46/1.17 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.46/1.17 [11=axiom,[], % 0.46/1.17 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 0.46/1.17 [13=axiom,[], % 0.46/1.17 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.46/1.17 [14=demod(1),[13], % 0.46/1.17 least_upper_bound(d,c) = d]. % 0.46/1.17 [15=demod(2),[13], % 0.46/1.17 least_upper_bound(b,a) = b]. % 0.46/1.17 [16=axiom,[], % 0.46/1.17 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.46/1.17 [20=axiom,[], % 0.46/1.17 thtop(X10,X10) = thmfalse]. % 0.46/1.17 [21=axiom,[16], % 0.46/1.17 thtop(greatest_lower_bound(multiply(b,d),multiply(a,c)),multiply(a,c)) = thmtrue]. % 0.46/1.17 [23=param(4,15),[], % 0.46/1.17 least_upper_bound(multiply(b,X10),multiply(a,X10)) = multiply(b,X10)]. % 0.46/1.17 [26=param(6,14),[], % 0.46/1.17 least_upper_bound(multiply(X10,d),multiply(X10,c)) = multiply(X10,d)]. % 0.46/1.17 [30=param(7,13),[], % 0.46/1.17 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 0.46/1.17 [81=param(11,23),[], % 0.46/1.17 least_upper_bound(multiply(b,X10),least_upper_bound(multiply(a,X10),X11)) = least_upper_bound(multiply(b,X10),X11)]. % 0.46/1.17 [600=param(81,26),[23], % 0.46/1.17 least_upper_bound(multiply(b,d),multiply(a,c)) = multiply(b,d)]. % 0.46/1.17 [619=param(30,600),[16], % 0.46/1.17 greatest_lower_bound(multiply(b,d),multiply(a,c)) = multiply(a,c)]. % 0.46/1.17 [628=param(21,619),[20], % 0.46/1.17 thmtrue = thmfalse]. % 0.46/1.17 % SZS output end CNFRefutation % 0.46/1.17 Space: 528 KB %------------------------------------------------------------------------------