TSTP Solution File: NUM293+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : NUM293+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n005.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 10:55:10 EDT 2023
% Result : Theorem 19.38s 19.59s
% Output : Proof 19.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM293+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13 % Command : duper %s
% 0.13/0.35 % Computer : n005.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 : Fri Aug 25 09:54:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 19.38/19.59 SZS status Theorem for theBenchmark.p
% 19.38/19.59 SZS output start Proof for theBenchmark.p
% 19.38/19.59 Clause #13 (by assumption #[]): Eq (rdn_translate n13 (rdn_pos (rdn (rdnn n3) (rdnn n1)))) True
% 19.38/19.59 Clause #133 (by assumption #[]): Eq (rdn_translate nn6 (rdn_neg (rdnn n6))) True
% 19.38/19.59 Clause #281 (by assumption #[]): Eq (∀ (X Y RDN_X RDN_Y : Iota), And (rdn_translate X (rdn_neg RDN_X)) (rdn_translate Y (rdn_pos RDN_Y)) → less X Y) True
% 19.38/19.59 Clause #401 (by assumption #[]): Eq (Not (Exists fun X => less X n13)) True
% 19.38/19.59 Clause #427 (by clausification #[401]): Eq (Exists fun X => less X n13) False
% 19.38/19.59 Clause #428 (by clausification #[427]): ∀ (a : Iota), Eq (less a n13) False
% 19.38/19.59 Clause #445 (by clausification #[281]): ∀ (a : Iota),
% 19.38/19.59 Eq (∀ (Y RDN_X RDN_Y : Iota), And (rdn_translate a (rdn_neg RDN_X)) (rdn_translate Y (rdn_pos RDN_Y)) → less a Y) True
% 19.38/19.59 Clause #446 (by clausification #[445]): ∀ (a a_1 : Iota),
% 19.38/19.59 Eq (∀ (RDN_X RDN_Y : Iota), And (rdn_translate a (rdn_neg RDN_X)) (rdn_translate a_1 (rdn_pos RDN_Y)) → less a a_1)
% 19.38/19.59 True
% 19.38/19.59 Clause #447 (by clausification #[446]): ∀ (a a_1 a_2 : Iota),
% 19.38/19.59 Eq (∀ (RDN_Y : Iota), And (rdn_translate a (rdn_neg a_1)) (rdn_translate a_2 (rdn_pos RDN_Y)) → less a a_2) True
% 19.38/19.59 Clause #448 (by clausification #[447]): ∀ (a a_1 a_2 a_3 : Iota), Eq (And (rdn_translate a (rdn_neg a_1)) (rdn_translate a_2 (rdn_pos a_3)) → less a a_2) True
% 19.38/19.59 Clause #449 (by clausification #[448]): ∀ (a a_1 a_2 a_3 : Iota),
% 19.38/19.59 Or (Eq (And (rdn_translate a (rdn_neg a_1)) (rdn_translate a_2 (rdn_pos a_3))) False) (Eq (less a a_2) True)
% 19.38/19.59 Clause #450 (by clausification #[449]): ∀ (a a_1 a_2 a_3 : Iota),
% 19.38/19.59 Or (Eq (less a a_1) True) (Or (Eq (rdn_translate a (rdn_neg a_2)) False) (Eq (rdn_translate a_1 (rdn_pos a_3)) False))
% 19.38/19.59 Clause #454 (by superposition #[450, 133]): ∀ (a a_1 : Iota), Or (Eq (less nn6 a) True) (Or (Eq (rdn_translate a (rdn_pos a_1)) False) (Eq False True))
% 19.38/19.59 Clause #763 (by clausification #[454]): ∀ (a a_1 : Iota), Or (Eq (less nn6 a) True) (Eq (rdn_translate a (rdn_pos a_1)) False)
% 19.38/19.59 Clause #786 (by superposition #[763, 13]): Or (Eq (less nn6 n13) True) (Eq False True)
% 19.38/19.59 Clause #1031 (by clausification #[786]): Eq (less nn6 n13) True
% 19.38/19.59 Clause #1032 (by superposition #[1031, 428]): Eq True False
% 19.38/19.59 Clause #1034 (by clausification #[1032]): False
% 19.38/19.59 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------