TSTP Solution File: ITP130^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : ITP130^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n021.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 : Thu Aug 31 03:38:53 EDT 2023
% Result : Theorem 110.40s 110.56s
% Output : Proof 110.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ITP130^1 : TPTP v8.1.2. Released v7.5.0.
% 0.00/0.13 % Command : duper %s
% 0.13/0.35 % Computer : n021.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 : 300
% 0.13/0.35 % DateTime : Sun Aug 27 11:13:42 EDT 2023
% 0.13/0.35 % CPUTime :
% 110.40/110.56 SZS status Theorem for theBenchmark.p
% 110.40/110.56 SZS output start Proof for theBenchmark.p
% 110.40/110.56 Clause #3 (by assumption #[]): Eq
% 110.40/110.56 (∀ (X B : int) (W : nat),
% 110.40/110.56 Eq (ord_less_real (ring_1_of_int_real X) (power_power_real (ring_1_of_int_real B) W))
% 110.40/110.56 (ord_less_int X (power_power_int B W)))
% 110.40/110.56 True
% 110.40/110.56 Clause #79 (by assumption #[]): Eq (ord_less_int na (power_power_int ya p)) True
% 110.40/110.56 Clause #84 (by assumption #[]): Eq (Eq p (suc pm)) True
% 110.40/110.56 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
% 110.40/110.56 Clause #313 (by clausification #[84]): Eq p (suc pm)
% 110.40/110.56 Clause #316 (by clausification #[3]): ∀ (a : int),
% 110.40/110.56 Eq
% 110.40/110.56 (∀ (B : int) (W : nat),
% 110.40/110.56 Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real B) W))
% 110.40/110.56 (ord_less_int a (power_power_int B W)))
% 110.40/110.56 True
% 110.40/110.56 Clause #317 (by clausification #[316]): ∀ (a a_1 : int),
% 110.40/110.56 Eq
% 110.40/110.56 (∀ (W : nat),
% 110.40/110.56 Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real a_1) W))
% 110.40/110.56 (ord_less_int a (power_power_int a_1 W)))
% 110.40/110.56 True
% 110.40/110.56 Clause #318 (by clausification #[317]): ∀ (a a_1 : int) (a_2 : nat),
% 110.40/110.56 Eq
% 110.40/110.56 (Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real a_1) a_2))
% 110.40/110.56 (ord_less_int a (power_power_int a_1 a_2)))
% 110.40/110.56 True
% 110.40/110.56 Clause #319 (by clausification #[318]): ∀ (a a_1 : int) (a_2 : nat),
% 110.40/110.56 Eq (ord_less_real (ring_1_of_int_real a) (power_power_real (ring_1_of_int_real a_1) a_2))
% 110.40/110.56 (ord_less_int a (power_power_int a_1 a_2))
% 110.40/110.56 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
% 110.40/110.56 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
% 110.40/110.56 Clause #33698 (by superposition #[33697, 319]): Eq False (ord_less_int na (power_power_int ya p))
% 110.40/110.56 Clause #33721 (by superposition #[33698, 79]): Eq False True
% 110.40/110.56 Clause #33733 (by clausification #[33721]): False
% 110.40/110.56 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------