%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO145^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n002.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 3.47s 3.63s % Output : Proof 3.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SYO145^5 : TPTP v9.2.0. Released v4.0.0. % 0.10/0.13 % Command : duper %s % 0.13/0.34 % Computer : n002.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:34:53 EDT 2025 % 0.13/0.34 % CPUTime : % 3.47/3.63 SZS status Theorem for theBenchmark.p % 3.47/3.63 SZS output start Proof for theBenchmark.p % 3.47/3.63 Clause #0 (by assumption #[]): Eq % 3.47/3.63 (Not % 3.47/3.63 ((∀ (Xx : Iota), Exists fun Xy => cP Xx Xy) → % 3.47/3.63 ∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy))) % 3.47/3.63 True % 3.47/3.63 Clause #1 (by betaEtaReduce #[0]): Eq (Not ((∀ (Xx : Iota), Exists (cP Xx)) → ∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy))) % 3.47/3.63 True % 3.47/3.63 Clause #2 (by clausification #[1]): Eq ((∀ (Xx : Iota), Exists (cP Xx)) → ∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy)) False % 3.47/3.63 Clause #3 (by clausification #[2]): Eq (∀ (Xx : Iota), Exists (cP Xx)) True % 3.47/3.63 Clause #4 (by clausification #[2]): Eq (∀ (Xx : Iota), Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP Xx Xy)) False % 3.47/3.63 Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (Exists (cP a)) True % 3.47/3.63 Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (cP a (skS.0 0 a a_1)) True % 3.47/3.63 Clause #7 (by clausification #[4]): ∀ (a : Iota), Eq (Not (Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP (skS.0 1 a) Xy))) True % 3.47/3.63 Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (Exists fun Xy => Exists fun Xz => And (cP Xy Xz) (cP (skS.0 1 a) Xy)) False % 3.47/3.63 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (Exists fun Xz => And (cP a Xz) (cP (skS.0 1 a_1) a)) False % 3.47/3.63 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota), Eq (And (cP a a_1) (cP (skS.0 1 a_2) a)) False % 3.47/3.63 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Or (Eq (cP a a_1) False) (Eq (cP (skS.0 1 a_2) a) False) % 3.47/3.63 Clause #12 (by superposition #[11, 6]): ∀ (a a_1 : Iota), Or (Eq (cP (skS.0 1 a) a_1) False) (Eq False True) % 3.47/3.63 Clause #13 (by clausification #[12]): ∀ (a a_1 : Iota), Eq (cP (skS.0 1 a) a_1) False % 3.47/3.63 Clause #14 (by superposition #[13, 6]): Eq False True % 3.47/3.63 Clause #15 (by clausification #[14]): False % 3.47/3.63 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------