%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n023.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:02 EDT 2022 % Result : Unsatisfiable 0.44s 1.11s % Output : CNFRefutation 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.11/0.13 % Command : fiesta-wrapper %s % 0.12/0.34 % Computer : n023.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 13 15:53:51 EDT 2022 % 0.12/0.34 % CPUTime : % 0.44/1.11 Theorem Proved. % 0.44/1.11 % SZS status Unsatisfiable % 0.44/1.11 % SZS output start CNFRefutation % 0.44/1.11 [1=axiom,[], % 0.44/1.11 least_upper_bound(inverse(a),inverse(b)) = inverse(b)]. % 0.44/1.11 [3=axiom,[], % 0.44/1.11 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 0.44/1.11 [4=axiom,[], % 0.44/1.11 multiply(X10,greatest_lower_bound(X11,X12)) = greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))]. % 0.44/1.11 [6=axiom,[], % 0.44/1.11 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 0.44/1.11 [7=axiom,[], % 0.44/1.11 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 0.44/1.11 [12=axiom,[], % 0.44/1.11 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 0.44/1.11 [13=demod(1),[12], % 0.44/1.11 least_upper_bound(inverse(b),inverse(a)) = inverse(b)]. % 0.44/1.11 [14=axiom,[], % 0.44/1.11 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 0.44/1.11 [15=axiom,[], % 0.44/1.11 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 0.44/1.11 [16=axiom,[], % 0.44/1.11 multiply(inverse(X10),X10) = identity]. % 0.44/1.11 [17=axiom,[], % 0.44/1.11 multiply(identity,X10) = X10]. % 0.44/1.11 [18=axiom,[], % 0.44/1.11 thtop(X10,X10) = thmfalse]. % 0.44/1.11 [19=axiom,[12], % 0.44/1.11 thtop(least_upper_bound(b,a),a) = thmtrue]. % 0.44/1.11 [20=param(7,14),[], % 0.44/1.11 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10]. % 0.44/1.11 [28=param(3,13),[], % 0.44/1.11 least_upper_bound(multiply(inverse(b),X10),multiply(inverse(a),X10)) = multiply(inverse(b),X10)]. % 0.44/1.11 [55=param(15,16),[17], % 0.44/1.11 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 0.44/1.11 [57=param(55,16),[], % 0.44/1.11 multiply(inverse(inverse(X10)),identity) = X10]. % 0.44/1.11 [59=param(55,55),[], % 0.44/1.11 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 0.44/1.11 [60=demod(57),[59], % 0.44/1.11 multiply(X10,identity) = X10]. % 0.44/1.11 [69=param(59,60),[60], % 0.44/1.11 inverse(inverse(X10)) = X10]. % 0.44/1.11 [86=param(28,16),[12], % 0.44/1.11 least_upper_bound(identity,multiply(inverse(b),a)) = multiply(inverse(b),a)]. % 0.44/1.11 [179=param(6,86),[], % 0.44/1.11 greatest_lower_bound(identity,multiply(inverse(b),a)) = identity]. % 0.44/1.11 [187=param(4,179),[60,60], % 0.44/1.11 greatest_lower_bound(X10,multiply(X10,multiply(inverse(b),a))) = X10]. % 0.44/1.11 [192=param(187,55),[69,69], % 0.44/1.11 greatest_lower_bound(b,a) = b]. % 0.44/1.11 [198=param(20,192),[12], % 0.44/1.11 least_upper_bound(b,a) = a]. % 0.44/1.11 [203=param(19,198),[18], % 0.44/1.11 thmtrue = thmfalse]. % 0.44/1.11 % SZS output end CNFRefutation % 0.44/1.11 Space: 168 KB %------------------------------------------------------------------------------