%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN963+1 : TPTP v9.2.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n007.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:19 PM UTC 2025 % Result : Theorem 4.06s 4.21s % Output : Proof 4.06s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN963+1 : TPTP v9.2.0. Released v3.1.0. % 0.07/0.13 % Command : duper %s % 0.14/0.35 % Computer : n007.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Thu Oct 2 15:15:23 EDT 2025 % 0.14/0.35 % CPUTime : % 4.06/4.21 SZS status Theorem for theBenchmark.p % 4.06/4.21 SZS output start Proof for theBenchmark.p % 4.06/4.21 Clause #0 (by assumption #[]): Eq (Not (Iff (Exists fun X => p X) (Exists fun Y => p Y))) True % 4.06/4.21 Clause #1 (by betaEtaReduce #[0]): Eq (Not (Iff (Exists p) (Exists p))) True % 4.06/4.21 Clause #2 (by clausification #[1]): Eq (Iff (Exists p) (Exists p)) False % 4.06/4.21 Clause #3 (by clausification #[2]): Or (Eq (Exists p) False) (Eq (Exists p) False) % 4.06/4.21 Clause #4 (by clausification #[2]): Or (Eq (Exists p) True) (Eq (Exists p) True) % 4.06/4.21 Clause #5 (by clausification #[3]): ∀ (a : Iota), Or (Eq (Exists p) False) (Eq (p a) False) % 4.06/4.21 Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (p a) False) (Eq (p a_1) False) % 4.06/4.21 Clause #7 (by clausification #[4]): ∀ (a : Iota), Or (Eq (Exists p) True) (Eq (p (skS.0 0 a)) True) % 4.06/4.21 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) True) (Eq (p (skS.0 1 a_1)) True) % 4.06/4.21 Clause #10 (by superposition #[8, 6]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) True) (Or (Eq True False) (Eq (p a_1) False)) % 4.06/4.21 Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) True) (Eq (p a_1) False) % 4.06/4.21 Clause #13 (by superposition #[11, 8]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) True) (Or (Eq (p (skS.0 0 a_1)) True) (Eq False True)) % 4.06/4.21 Clause #17 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) True) (Eq (p (skS.0 0 a_1)) True) % 4.06/4.21 Clause #20 (by equality factoring #[17]): ∀ (a : Iota), Or (Ne True True) (Eq (p (skS.0 0 a)) True) % 4.06/4.21 Clause #21 (by clausification #[20]): ∀ (a : Iota), Or (Eq (p (skS.0 0 a)) True) (Or (Eq True False) (Eq True False)) % 4.06/4.21 Clause #23 (by clausification #[21]): ∀ (a : Iota), Or (Eq (p (skS.0 0 a)) True) (Eq True False) % 4.06/4.21 Clause #24 (by clausification #[23]): ∀ (a : Iota), Eq (p (skS.0 0 a)) True % 4.06/4.21 Clause #25 (by superposition #[24, 6]): ∀ (a : Iota), Or (Eq True False) (Eq (p a) False) % 4.06/4.21 Clause #27 (by clausification #[25]): ∀ (a : Iota), Eq (p a) False % 4.06/4.21 Clause #28 (by superposition #[27, 24]): Eq False True % 4.06/4.21 Clause #29 (by clausification #[28]): False % 4.06/4.21 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------