%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO147^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n003.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 08:08:39 PM UTC 2025 % Result : Theorem 5.23s 5.40s % Output : Proof 5.23s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYO147^5 : TPTP v9.2.0. Released v4.0.0. % 0.03/0.13 % Command : duper %s % 0.13/0.34 % Computer : n003.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 : Fri Oct 3 13:52:53 EDT 2025 % 0.13/0.34 % CPUTime : % 5.23/5.40 SZS status Theorem for theBenchmark.p % 5.23/5.40 SZS output start Proof for theBenchmark.p % 5.23/5.40 Clause #0 (by assumption #[]): Eq (Not (Exists fun Xy => ∀ (Xx : Iota), And (And (cP1 Xx) (cP1 Xy → cP2 Xx)) (cP2 Xy → cP3 Xx) → cP3 Xy)) True % 5.23/5.40 Clause #1 (by clausification #[0]): Eq (Exists fun Xy => ∀ (Xx : Iota), And (And (cP1 Xx) (cP1 Xy → cP2 Xx)) (cP2 Xy → cP3 Xx) → cP3 Xy) False % 5.23/5.40 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (Xx : Iota), And (And (cP1 Xx) (cP1 a → cP2 Xx)) (cP2 a → cP3 Xx) → cP3 a) False % 5.23/5.40 Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota), % 5.23/5.40 Eq (Not (And (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1))) (cP2 a → cP3 (skS.0 0 a a_1)) → cP3 a)) True % 5.23/5.40 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), % 5.23/5.40 Eq (And (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1))) (cP2 a → cP3 (skS.0 0 a a_1)) → cP3 a) False % 5.23/5.40 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (And (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1))) (cP2 a → cP3 (skS.0 0 a a_1))) True % 5.23/5.40 Clause #6 (by clausification #[4]): ∀ (a : Iota), Eq (cP3 a) False % 5.23/5.40 Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (cP2 a → cP3 (skS.0 0 a a_1)) True % 5.23/5.40 Clause #8 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (And (cP1 (skS.0 0 a a_1)) (cP1 a → cP2 (skS.0 0 a a_1))) True % 5.23/5.40 Clause #9 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (cP2 a) False) (Eq (cP3 (skS.0 0 a a_1)) True) % 5.23/5.40 Clause #10 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (cP1 a → cP2 (skS.0 0 a a_1)) True % 5.23/5.40 Clause #11 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (cP1 (skS.0 0 a a_1)) True % 5.23/5.40 Clause #12 (by clausification #[10]): ∀ (a a_1 : Iota), Or (Eq (cP1 a) False) (Eq (cP2 (skS.0 0 a a_1)) True) % 5.23/5.40 Clause #13 (by superposition #[11, 12]): ∀ (a a_1 a_2 : Iota), Or (Eq (cP2 (skS.0 0 (skS.0 0 a a_1) a_2)) True) (Eq False True) % 5.23/5.40 Clause #14 (by clausification #[13]): ∀ (a a_1 a_2 : Iota), Eq (cP2 (skS.0 0 (skS.0 0 a a_1) a_2)) True % 5.23/5.40 Clause #15 (by superposition #[14, 9]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq True False) (Eq (cP3 (skS.0 0 (skS.0 0 (skS.0 0 a a_1) a_2) a_3)) True) % 5.23/5.40 Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 a_3 : Iota), Eq (cP3 (skS.0 0 (skS.0 0 (skS.0 0 a a_1) a_2) a_3)) True % 5.23/5.40 Clause #17 (by superposition #[16, 6]): Eq True False % 5.23/5.40 Clause #18 (by clausification #[17]): False % 5.23/5.40 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------