%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n029.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:06:22 AM UTC 2026 % Result : Theorem 13.35s 13.67s % Output : Proof 13.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT070+1 : TPTP v9.3.0. Released v9.3.0. % 0.00/0.05 % Command : duper %s % 0.11/0.36 % Computer : n029.cluster.edu % 0.11/0.36 % Model : x86_64 x86_64 % 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.36 % Memory : 8046.5625MB % 0.11/0.36 % OS : Linux 6.8.0-71-generic % 0.11/0.36 % CPULimit : 300 % 0.11/0.36 % WCLimit : 300 % 0.11/0.36 % DateTime : Mon Sep 7 13:55:42 UTC 2026 % 0.11/0.36 % CPUTime : % 13.35/13.67 SZS status Theorem for theBenchmark.p % 13.35/13.67 SZS output start Proof for theBenchmark.p % 13.35/13.67 Clause #3 (by assumption #[]): Eq (∀ (X Y : Iota), Iff (leq X Y) (Or (less X Y) (Eq X Y))) True % 13.35/13.67 Clause #28 (by assumption #[]): Eq (∀ (V InfD SupD : Iota), And (leq InfD V) (leq V SupD) → completion_compatible V InfD SupD) True % 13.35/13.67 Clause #36 (by assumption #[]): Eq (∀ (X : Iota), leq ninf X) True % 13.35/13.67 Clause #37 (by assumption #[]): Eq (∀ (X : Iota), leq X nsup) True % 13.35/13.67 Clause #39 (by assumption #[]): Eq (Not (Exists fun V => And (And (leq ninf V) (leq V nsup)) (completion_compatible V ninf nsup))) True % 13.35/13.67 Clause #42 (by clausification #[37]): ∀ (a : Iota), Eq (leq a nsup) True % 13.35/13.67 Clause #43 (by clausification #[36]): ∀ (a : Iota), Eq (leq ninf a) True % 13.35/13.67 Clause #132 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (Y : Iota), Iff (leq a Y) (Or (less a Y) (Eq a Y))) True % 13.35/13.67 Clause #133 (by clausification #[132]): ∀ (a a_1 : Iota), Eq (Iff (leq a a_1) (Or (less a a_1) (Eq a a_1))) True % 13.35/13.67 Clause #134 (by clausification #[133]): ∀ (a a_1 : Iota), Or (Eq (leq a a_1) True) (Eq (Or (less a a_1) (Eq a a_1)) False) % 13.35/13.67 Clause #136 (by clausification #[134]): ∀ (a a_1 : Iota), Or (Eq (leq a a_1) True) (Eq (Eq a a_1) False) % 13.35/13.67 Clause #138 (by clausification #[136]): ∀ (a a_1 : Iota), Or (Eq (leq a a_1) True) (Ne a a_1) % 13.35/13.67 Clause #139 (by destructive equality resolution #[138]): ∀ (a : Iota), Eq (leq a a) True % 13.35/13.67 Clause #154 (by clausification #[28]): ∀ (a : Iota), Eq (∀ (InfD SupD : Iota), And (leq InfD a) (leq a SupD) → completion_compatible a InfD SupD) True % 13.35/13.67 Clause #155 (by clausification #[154]): ∀ (a a_1 : Iota), Eq (∀ (SupD : Iota), And (leq a a_1) (leq a_1 SupD) → completion_compatible a_1 a SupD) True % 13.35/13.67 Clause #156 (by clausification #[155]): ∀ (a a_1 a_2 : Iota), Eq (And (leq a a_1) (leq a_1 a_2) → completion_compatible a_1 a a_2) True % 13.35/13.67 Clause #157 (by clausification #[156]): ∀ (a a_1 a_2 : Iota), Or (Eq (And (leq a a_1) (leq a_1 a_2)) False) (Eq (completion_compatible a_1 a a_2) True) % 13.35/13.67 Clause #158 (by clausification #[157]): ∀ (a a_1 a_2 : Iota), Or (Eq (completion_compatible a a_1 a_2) True) (Or (Eq (leq a_1 a) False) (Eq (leq a a_2) False)) % 13.35/13.67 Clause #161 (by superposition #[158, 139]): ∀ (a a_1 : Iota), Or (Eq (completion_compatible a a a_1) True) (Or (Eq (leq a a_1) False) (Eq False True)) % 13.35/13.67 Clause #726 (by clausification #[39]): Eq (Exists fun V => And (And (leq ninf V) (leq V nsup)) (completion_compatible V ninf nsup)) False % 13.35/13.67 Clause #727 (by clausification #[726]): ∀ (a : Iota), Eq (And (And (leq ninf a) (leq a nsup)) (completion_compatible a ninf nsup)) False % 13.35/13.67 Clause #728 (by clausification #[727]): ∀ (a : Iota), Or (Eq (And (leq ninf a) (leq a nsup)) False) (Eq (completion_compatible a ninf nsup) False) % 13.35/13.67 Clause #729 (by clausification #[728]): ∀ (a : Iota), Or (Eq (completion_compatible a ninf nsup) False) (Or (Eq (leq ninf a) False) (Eq (leq a nsup) False)) % 13.35/13.67 Clause #730 (by forward demodulation #[729, 43]): ∀ (a : Iota), Or (Eq (completion_compatible a ninf nsup) False) (Or (Eq True False) (Eq (leq a nsup) False)) % 13.35/13.67 Clause #731 (by clausification #[730]): ∀ (a : Iota), Or (Eq (completion_compatible a ninf nsup) False) (Eq (leq a nsup) False) % 13.35/13.67 Clause #732 (by forward demodulation #[731, 42]): ∀ (a : Iota), Or (Eq (completion_compatible a ninf nsup) False) (Eq True False) % 13.35/13.67 Clause #733 (by clausification #[732]): ∀ (a : Iota), Eq (completion_compatible a ninf nsup) False % 13.35/13.67 Clause #1916 (by clausification #[161]): ∀ (a a_1 : Iota), Or (Eq (completion_compatible a a a_1) True) (Eq (leq a a_1) False) % 13.35/13.67 Clause #1921 (by superposition #[1916, 43]): ∀ (a : Iota), Or (Eq (completion_compatible ninf ninf a) True) (Eq False True) % 13.35/13.67 Clause #1926 (by clausification #[1921]): ∀ (a : Iota), Eq (completion_compatible ninf ninf a) True % 13.35/13.67 Clause #1927 (by superposition #[1926, 733]): Eq True False % 13.35/13.67 Clause #1932 (by clausification #[1927]): False % 13.35/13.67 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------