%------------------------------------------------------------------------------ % File : Fiesta---2 % Problem : GRP179-2 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : dedam % Command : fiesta-wrapper %s % Computer : n032.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:07 EDT 2022 % Result : Unsatisfiable 3.05s 3.46s % Output : CNFRefutation 3.05s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : GRP179-2 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.00/0.10 % Command : fiesta-wrapper %s % 0.10/0.30 % Computer : n032.cluster.edu % 0.10/0.30 % Model : x86_64 x86_64 % 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.30 % Memory : 8042.1875MB % 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.30 % CPULimit : 300 % 0.10/0.30 % WCLimit : 600 % 0.10/0.30 % DateTime : Tue Jun 14 05:24:42 EDT 2022 % 0.10/0.30 % CPUTime : % 3.05/3.46 Theorem Proved. % 3.05/3.46 % SZS status Unsatisfiable % 3.05/3.46 % SZS output start CNFRefutation % 3.05/3.46 [2=axiom,[], % 3.05/3.46 multiply(least_upper_bound(X10,X11),X12) = least_upper_bound(multiply(X10,X12),multiply(X11,X12))]. % 3.05/3.46 [4=axiom,[], % 3.05/3.46 multiply(X10,least_upper_bound(X11,X12)) = least_upper_bound(multiply(X10,X11),multiply(X10,X12))]. % 3.05/3.46 [5=axiom,[], % 3.05/3.46 greatest_lower_bound(X10,least_upper_bound(X10,X11)) = X10]. % 3.05/3.46 [6=axiom,[], % 3.05/3.46 least_upper_bound(X10,greatest_lower_bound(X10,X11)) = X10]. % 3.05/3.46 [9=axiom,[], % 3.05/3.46 least_upper_bound(least_upper_bound(X10,X11),X12) = least_upper_bound(X10,least_upper_bound(X11,X12))]. % 3.05/3.46 [10=axiom,[], % 3.05/3.46 greatest_lower_bound(greatest_lower_bound(X10,X11),X12) = greatest_lower_bound(X10,greatest_lower_bound(X11,X12))]. % 3.05/3.46 [11=axiom,[], % 3.05/3.46 least_upper_bound(X10,X11) = least_upper_bound(X11,X10)]. % 3.05/3.46 [12=axiom,[], % 3.05/3.46 greatest_lower_bound(X10,X11) = greatest_lower_bound(X11,X10)]. % 3.05/3.46 [13=axiom,[], % 3.05/3.46 multiply(multiply(X10,X11),X12) = multiply(X10,multiply(X11,X12))]. % 3.05/3.46 [14=axiom,[], % 3.05/3.46 multiply(inverse(X10),X10) = identity]. % 3.05/3.46 [15=axiom,[], % 3.05/3.46 multiply(identity,X10) = X10]. % 3.05/3.46 [16=axiom,[], % 3.05/3.46 thtop(X10,X10) = thmfalse]. % 3.05/3.46 [17=axiom,[11], % 3.05/3.46 thtop(least_upper_bound(identity,inverse(a)),inverse(greatest_lower_bound(a,identity))) = thmtrue]. % 3.05/3.46 [18=param(6,12),[], % 3.05/3.46 least_upper_bound(X10,greatest_lower_bound(X11,X10)) = X10]. % 3.05/3.46 [21=param(5,11),[], % 3.05/3.46 greatest_lower_bound(X10,least_upper_bound(X11,X10)) = X10]. % 3.05/3.46 [22=param(4,14),[], % 3.05/3.46 least_upper_bound(multiply(inverse(least_upper_bound(X10,X11)),X10),multiply(inverse(least_upper_bound(X10,X11)),X11)) = identity]. % 3.05/3.46 [38=param(6,10),[], % 3.05/3.46 least_upper_bound(greatest_lower_bound(X10,X11),greatest_lower_bound(X10,greatest_lower_bound(X11,X12))) = greatest_lower_bound(X10,X11)]. % 3.05/3.46 [53=param(13,14),[15], % 3.05/3.46 multiply(inverse(X11),multiply(X11,X10)) = X10]. % 3.05/3.46 [55=param(53,14),[], % 3.05/3.46 multiply(inverse(inverse(X10)),identity) = X10]. % 3.05/3.46 [57=param(53,53),[], % 3.05/3.46 multiply(inverse(inverse(X10)),X11) = multiply(X10,X11)]. % 3.05/3.46 [58=demod(55),[57], % 3.05/3.46 multiply(X10,identity) = X10]. % 3.05/3.46 [59=param(58,14),[], % 3.05/3.46 inverse(identity) = identity]. % 3.05/3.46 [65=param(57,14),[], % 3.05/3.46 multiply(X10,inverse(X10)) = identity]. % 3.05/3.46 [67=param(57,58),[58], % 3.05/3.46 inverse(inverse(X10)) = X10]. % 3.05/3.46 [71=param(22,58),[], % 3.05/3.46 least_upper_bound(inverse(least_upper_bound(identity,X10)),multiply(inverse(least_upper_bound(identity,X10)),X10)) = identity]. % 3.05/3.46 [75=param(65,13),[], % 3.05/3.46 multiply(X10,multiply(X11,inverse(multiply(X10,X11)))) = identity]. % 3.05/3.46 [129=param(53,75),[58], % 3.05/3.46 multiply(X11,inverse(multiply(X10,X11))) = inverse(X10)]. % 3.05/3.46 [136=param(53,129),[], % 3.05/3.46 multiply(inverse(X10),inverse(X11)) = inverse(multiply(X11,X10))]. % 3.05/3.46 [157=param(136,67),[], % 3.05/3.46 multiply(inverse(X10),X11) = inverse(multiply(inverse(X11),X10))]. % 3.05/3.46 [163=demod(71),[157,4,58,14,11], % 3.05/3.46 least_upper_bound(inverse(least_upper_bound(identity,X10)),inverse(least_upper_bound(identity,inverse(X10)))) = identity]. % 3.05/3.46 [388=param(5,163),[12], % 3.05/3.46 greatest_lower_bound(identity,inverse(least_upper_bound(identity,X10))) = inverse(least_upper_bound(identity,X10))]. % 3.05/3.46 [396=param(6,388),[], % 3.05/3.46 least_upper_bound(identity,inverse(least_upper_bound(identity,X10))) = identity]. % 3.05/3.46 [403=param(38,388),[], % 3.05/3.46 least_upper_bound(greatest_lower_bound(X10,identity),greatest_lower_bound(X10,inverse(least_upper_bound(identity,X11)))) = greatest_lower_bound(X10,identity)]. % 3.05/3.46 [414=param(396,11),[], % 3.05/3.46 least_upper_bound(identity,inverse(least_upper_bound(X10,identity))) = identity]. % 3.05/3.46 [419=param(2,414),[15,15], % 3.05/3.46 least_upper_bound(X10,multiply(inverse(least_upper_bound(X11,identity)),X10)) = X10]. % 3.05/3.46 [463=param(419,157),[4,58,11], % 3.05/3.46 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),multiply(inverse(X10),X11)))) = X10]. % 3.05/3.46 [557=param(463,53),[], % 3.05/3.46 least_upper_bound(X10,inverse(least_upper_bound(inverse(X10),X11))) = X10]. % 3.05/3.46 [562=param(557,11),[], % 3.05/3.46 least_upper_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = X10]. % 3.05/3.46 [585=param(21,562),[12], % 3.05/3.46 greatest_lower_bound(X10,inverse(least_upper_bound(X11,inverse(X10)))) = inverse(least_upper_bound(X11,inverse(X10)))]. % 3.05/3.46 [591=param(562,67),[], % 3.05/3.46 least_upper_bound(inverse(X10),inverse(least_upper_bound(X11,X10))) = inverse(X10)]. % 3.05/3.46 [599=param(591,6),[11], % 3.05/3.46 least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X10,X11))) = inverse(greatest_lower_bound(X10,X11))]. % 3.05/3.46 [602=param(591,18),[11], % 3.05/3.46 least_upper_bound(inverse(X10),inverse(greatest_lower_bound(X11,X10))) = inverse(greatest_lower_bound(X11,X10))]. % 3.05/3.46 [624=param(602,59),[], % 3.05/3.46 least_upper_bound(identity,inverse(greatest_lower_bound(X10,identity))) = inverse(greatest_lower_bound(X10,identity))]. % 3.05/3.46 [2744=param(403,585),[11], % 3.05/3.46 least_upper_bound(inverse(least_upper_bound(identity,inverse(X10))),greatest_lower_bound(X10,identity)) = greatest_lower_bound(X10,identity)]. % 3.05/3.46 [2748=param(557,2744),[9,599,624], % 3.05/3.46 inverse(greatest_lower_bound(X10,identity)) = least_upper_bound(identity,inverse(X10))]. % 3.05/3.46 [2805=param(17,2748),[16], % 3.05/3.46 thmtrue = thmfalse]. % 3.05/3.46 % SZS output end CNFRefutation % 3.05/3.46 Space: 16653 KB %------------------------------------------------------------------------------