%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n025.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:12:55 EDT 2022 % Result : Unsatisfiable 0.82s 1.19s % Output : CNFRefutation 0.82s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.08/0.13 % Command : fiesta-wrapper %s % 0.13/0.35 % Computer : n025.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Mon Jun 13 06:03:38 EDT 2022 % 0.13/0.35 % CPUTime : % 0.82/1.19 Theorem Proved. % 0.82/1.19 % SZS status Unsatisfiable % 0.82/1.19 % SZS output start CNFRefutation % 0.82/1.19 [1=axiom,[], % 0.82/1.19 least_upper_bound(b,c) = c]. % 0.82/1.19 [2=axiom,[], % 0.82/1.19 least_upper_bound(a,c) = c]. % 0.82/1.19 [4=axiom,[], % 0.82/1.19 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.82/1.19 [7=axiom,[], % 0.82/1.19 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.82/1.19 [11=axiom,[], % 0.82/1.19 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 0.82/1.19 [13=axiom,[], % 0.82/1.19 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.82/1.19 [14=demod(2),[13], % 0.82/1.19 least_upper_bound(c,a) = c]. % 0.82/1.19 [15=axiom,[], % 0.82/1.19 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.82/1.19 [16=axiom,[], % 0.82/1.19 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 0.82/1.19 [17=axiom,[], % 0.82/1.19 multiply(inverse(X10),X10) = identity]. % 0.82/1.19 [18=axiom,[], % 0.82/1.19 multiply(identity,X10) = X10]. % 0.82/1.19 [19=axiom,[], % 0.82/1.19 thtop(X10,X10) = thmfalse]. % 0.82/1.19 [20=axiom,[13,15,13], % 0.82/1.19 thtop(greatest_lower_bound(c,least_upper_bound(b,a)),least_upper_bound(b,a)) = thmtrue]. % 0.82/1.19 [22=param(4,1),[], % 0.82/1.19 least_upper_bound(multiply(b,X10),multiply(c,X10)) = multiply(c,X10)]. % 0.82/1.19 [29=param(7,13),[], % 0.82/1.19 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 0.82/1.19 [45=param(11,14),[], % 0.82/1.19 least_upper_bound(c,least_upper_bound(a,X10)) = least_upper_bound(c,X10)]. % 0.82/1.19 [52=param(29,45),[15], % 0.82/1.19 greatest_lower_bound(least_upper_bound(c,X10),least_upper_bound(a,X10)) = least_upper_bound(a,X10)]. % 0.82/1.19 [70=param(16,17),[18], % 0.82/1.19 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 0.82/1.19 [72=param(70,17),[], % 0.82/1.19 multiply(inverse(inverse(X10)),identity) = X10]. % 0.82/1.19 [74=param(70,70),[], % 0.82/1.19 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 0.82/1.19 [75=demod(72),[74], % 0.82/1.19 multiply(X10,identity) = X10]. % 0.82/1.19 [78=param(74,17),[], % 0.82/1.19 multiply(X10,inverse(X10)) = identity]. % 0.82/1.19 [86=param(22,78),[13,78], % 0.82/1.19 least_upper_bound(identity,multiply(b,inverse(c))) = identity]. % 0.82/1.19 [104=param(4,86),[18,18,16], % 0.82/1.19 least_upper_bound(X10,multiply(b,multiply(inverse(c),X10))) = X10]. % 0.82/1.19 [756=param(52,104),[17,75,13,17,75,13], % 0.82/1.19 greatest_lower_bound(c,least_upper_bound(b,a)) = least_upper_bound(b,a)]. % 0.82/1.19 [760=param(20,756),[19], % 0.82/1.19 thmtrue = thmfalse]. % 0.82/1.19 % SZS output end CNFRefutation % 0.82/1.19 Space: 646 KB %------------------------------------------------------------------------------