%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP193-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n021.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:16 EDT 2022 % Result : Unsatisfiable 0.73s 1.11s % Output : CNFRefutation 0.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : GRP193-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.07/0.13 % Command : fiesta-wrapper %s % 0.14/0.34 % Computer : n021.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.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 13 05:57:11 EDT 2022 % 0.14/0.35 % CPUTime : % 0.73/1.11 Theorem Proved. % 0.73/1.11 % SZS status Unsatisfiable % 0.73/1.11 % SZS output start CNFRefutation % 0.73/1.11 [1=axiom,[], % 0.73/1.11 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))]. % 0.73/1.11 [2=axiom,[], % 0.73/1.11 greatest_lower_bound(a,b) = identity]. % 0.73/1.11 [3=demod(1),[2,2], % 0.73/1.11 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))) = multiply(identity,greatest_lower_bound(a,c))]. % 0.73/1.11 [7=axiom,[], % 0.73/1.11 multiply(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.73/1.11 [9=axiom,[], % 0.73/1.11 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.73/1.11 [10=demod(3),[9,9], % 0.73/1.11 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(identity,a),multiply(identity,c))) = greatest_lower_bound(multiply(identity,a),multiply(identity,c))]. % 0.73/1.11 [12=axiom,[], % 0.73/1.11 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.73/1.11 [14=axiom,[], % 0.73/1.11 greatest_lower_bound(X10,X10) = X10]. % 0.73/1.11 [17=axiom,[], % 0.73/1.11 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 0.73/1.11 [18=axiom,[], % 0.73/1.11 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.73/1.11 [22=axiom,[], % 0.73/1.11 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.73/1.11 [23=demod(2),[22], % 0.73/1.11 greatest_lower_bound(b,a) = identity]. % 0.73/1.11 [24=demod(10),[22,22], % 0.73/1.11 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(identity,c),multiply(identity,a))) = greatest_lower_bound(multiply(identity,c),multiply(identity,a))]. % 0.73/1.11 [27=axiom,[], % 0.73/1.11 multiply(identity,X10) = X10]. % 0.73/1.11 [28=demod(24),[27,27,18,27,27], % 0.73/1.11 least_upper_bound(greatest_lower_bound(c,a),greatest_lower_bound(a,multiply(b,c))) = greatest_lower_bound(c,a)]. % 0.73/1.11 [29=axiom,[], % 0.73/1.11 thtop(X10,X10) = thmfalse]. % 0.73/1.11 [30=axiom,[22], % 0.73/1.11 thtop(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(c,a)) = thmtrue]. % 0.73/1.11 [51=param(12,18),[], % 0.73/1.11 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 0.73/1.11 [58=param(17,14),[], % 0.73/1.11 greatest_lower_bound(X10,greatest_lower_bound(X10,X11)) = greatest_lower_bound(X10,X11)]. % 0.73/1.11 [60=param(17,22),[17], % 0.73/1.11 greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(X11,greatest_lower_bound(X10,X12))]. % 0.73/1.11 [61=param(17,23),[], % 0.73/1.11 greatest_lower_bound(identity,X10) = greatest_lower_bound(b,greatest_lower_bound(a,X10))]. % 0.73/1.11 [65=param(61,14),[], % 0.73/1.11 greatest_lower_bound(b,greatest_lower_bound(a,identity)) = identity]. % 0.73/1.11 [66=param(61,22),[], % 0.73/1.11 greatest_lower_bound(b,greatest_lower_bound(a,X10)) = greatest_lower_bound(X10,identity)]. % 0.73/1.11 [67=demod(65),[-66,14,23], % 0.73/1.11 greatest_lower_bound(b,identity) = identity]. % 0.73/1.11 [68=param(7,67),[27,27,22], % 0.73/1.11 greatest_lower_bound(X10,multiply(b,X10)) = X10]. % 0.73/1.11 [81=param(51,28),[22,17,58], % 0.73/1.11 greatest_lower_bound(c,greatest_lower_bound(a,multiply(b,c))) = greatest_lower_bound(a,multiply(b,c))]. % 0.73/1.11 [462=param(60,68),[], % 0.73/1.11 greatest_lower_bound(X11,greatest_lower_bound(X10,multiply(b,X11))) = greatest_lower_bound(X10,X11)]. % 0.73/1.11 [463=demod(81),[462,22], % 0.73/1.11 greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(c,a)]. % 0.73/1.11 [479=param(30,463),[29], % 0.73/1.11 thmtrue = thmfalse]. % 0.73/1.11 % SZS output end CNFRefutation % 0.73/1.11 Space: 327 KB %------------------------------------------------------------------------------