%------------------------------------------------------------------------------ % File : SuperZenon---0.0.1 % Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % Computer : n014.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 : Mon Jul 18 14:47:29 EDT 2022 % Result : Theorem 1.94s 2.14s % Output : Proof 1.94s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0. % 0.12/0.12 % Command : run_super_zenon -p0 -itptp -om -max-time %d %s % 0.12/0.32 % Computer : n014.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Thu Jul 7 16:26:22 EDT 2022 % 0.12/0.32 % CPUTime : % 1.94/2.14 % SZS status Theorem % 1.94/2.14 (* PROOF-FOUND *) % 1.94/2.14 (* BEGIN-PROOF *) % 1.94/2.14 % SZS output start Proof % 1.94/2.14 1. (ord_less_eq (int) (one_one (int)) (t)) (-. (ord_less_eq (int) (one_one (int)) (t))) ### Axiom % 1.94/2.14 2. ((t) != (one_one (int))) ((one_one (int)) = (t)) ### Sym(=) % 1.94/2.14 3. (-. ((one_one (int)) != (t))) ((t) != (one_one (int))) ### NotNot 2 % 1.94/2.14 4. (-. ((ord_less_eq (int) (one_one (int)) (t)) /\ ((one_one (int)) != (t)))) ((t) != (one_one (int))) (ord_less_eq (int) (one_one (int)) (t)) ### NotAnd 1 3 % 1.94/2.14 5. (-. (ord_less (int) (one_one (int)) (t))) (ord_less (int) (one_one (int)) (t)) ### Axiom % 1.94/2.14 6. ((ord_less (int) (one_one (int)) (t)) <=> ((ord_less_eq (int) (one_one (int)) (t)) /\ ((one_one (int)) != (t)))) (-. (ord_less (int) (one_one (int)) (t))) (ord_less_eq (int) (one_one (int)) (t)) ((t) != (one_one (int))) ### Equiv 4 5 % 1.94/2.14 7. (All W_1, ((ord_less (int) (one_one (int)) W_1) <=> ((ord_less_eq (int) (one_one (int)) W_1) /\ ((one_one (int)) != W_1)))) ((t) != (one_one (int))) (ord_less_eq (int) (one_one (int)) (t)) (-. (ord_less (int) (one_one (int)) (t))) ### All 6 % 1.94/2.14 8. (All Z_1, (All W_1, ((ord_less (int) Z_1 W_1) <=> ((ord_less_eq (int) Z_1 W_1) /\ (Z_1 != W_1))))) (-. (ord_less (int) (one_one (int)) (t))) (ord_less_eq (int) (one_one (int)) (t)) ((t) != (one_one (int))) ### All 7 % 1.94/2.14 9. (-. (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int)))))) ### Axiom % 1.94/2.14 10. ((ord_less (int) (one_one (int)) (t)) => (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) (-. (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) ((t) != (one_one (int))) (ord_less_eq (int) (one_one (int)) (t)) (All Z_1, (All W_1, ((ord_less (int) Z_1 W_1) <=> ((ord_less_eq (int) Z_1 W_1) /\ (Z_1 != W_1))))) ### Imply 8 9 % 1.94/2.14 11. (-. (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int)))))) ### Axiom % 1.94/2.14 12. (((t) = (one_one (int))) => (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) (All Z_1, (All W_1, ((ord_less (int) Z_1 W_1) <=> ((ord_less_eq (int) Z_1 W_1) /\ (Z_1 != W_1))))) (ord_less_eq (int) (one_one (int)) (t)) (-. (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) ((ord_less (int) (one_one (int)) (t)) => (Ex X, (Ex Y, ((plus_plus (int) (power_power (int) X (number_number_of (nat) (bit0 (bit1 (pls))))) (power_power (int) Y (number_number_of (nat) (bit0 (bit1 (pls)))))) = (plus_plus (int) (times_times (int) (number_number_of (int) (bit0 (bit0 (bit1 (pls))))) (m)) (one_one (int))))))) ### Imply 10 11 % 1.94/2.14 % SZS output end Proof % 1.94/2.14 (* END-PROOF *) %------------------------------------------------------------------------------