%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : ITP130^1 : TPTP v9.2.0. Released v7.5.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n011.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 : 300s % DateTime : Fri Oct 3 07:51:17 PM UTC 2025 % Result : Theorem 101.95s 102.19s % Output : Proof 101.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : ITP130^1 : TPTP v9.2.0. Released v7.5.0. % 0.11/0.13 % Command : duper %s % 0.13/0.34 % Computer : n011.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Thu Oct 2 23:32:38 EDT 2025 % 0.13/0.34 % CPUTime : % 101.95/102.19 SZS status Theorem for theBenchmark.p % 101.95/102.19 SZS output start Proof for theBenchmark.p % 101.95/102.19 Clause #3 (by assumption #[]): Eq % 101.95/102.19 (∀ (X B : int) (W : nat), % 101.95/102.19 Eq (ord_less_real (ring_1_of_int_real X) (power_power_real (ring_1_of_int_real B) W)) % 101.95/102.19 (ord_less_int X (power_power_int B W))) % 101.95/102.19 True % 101.95/102.19 Clause #79 (by assumption #[]): Eq (ord_less_int na (power_power_int ya p)) True % 101.95/102.19 Clause #84 (by assumption #[]): Eq (Eq p (suc pm)) True % 101.95/102.19 Clause #292 (by assumption #[]): Eq (Not (ord_less_real (ring_1_of_int_real na) (power_power_real (ring_1_of_int_real ya) (suc pm)))) True % 101.95/102.19 Clause #313 (by clausification #[84]): Eq p (suc pm) % 101.95/102.19 Clause #316 (by clausification #[3]): ∀ (a : int), % 101.95/102.19 Eq % 101.95/102.19 (∀ (B : int) (W : nat), % 101.95/102.19 Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real B) W)) % 101.95/102.19 (ord_less_int a (power_power_int B W))) % 101.95/102.19 True % 101.95/102.19 Clause #317 (by clausification #[316]): ∀ (a a_1 : int), % 101.95/102.19 Eq % 101.95/102.19 (∀ (W : nat), % 101.95/102.19 Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real a_1) W)) % 101.95/102.19 (ord_less_int a (power_power_int a_1 W))) % 101.95/102.19 True % 101.95/102.19 Clause #318 (by clausification #[317]): ∀ (a a_1 : int) (a_2 : nat), % 101.95/102.19 Eq % 101.95/102.19 (Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real a_1) a_2)) % 101.95/102.19 (ord_less_int a (power_power_int a_1 a_2))) % 101.95/102.19 True % 101.95/102.19 Clause #319 (by clausification #[318]): ∀ (a a_1 : int) (a_2 : nat), % 101.95/102.19 Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real a_1) a_2)) % 101.95/102.19 (ord_less_int a (power_power_int a_1 a_2)) % 101.95/102.19 Clause #33696 (by clausification #[292]): Eq (ord_less_real (ring_1_of_int_real na) (power_power_real (ring_1_of_int_real ya) (suc pm))) False % 101.95/102.19 Clause #33697 (by forward demodulation #[33696, 313]): Eq (ord_less_real (ring_1_of_int_real na) (power_power_real (ring_1_of_int_real ya) p)) False % 101.95/102.19 Clause #33698 (by superposition #[33697, 319]): Eq False (ord_less_int na (power_power_int ya p)) % 101.95/102.19 Clause #33721 (by superposition #[33698, 79]): Eq False True % 101.95/102.19 Clause #33733 (by clausification #[33721]): False % 101.95/102.19 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------