%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN372+1 : TPTP v9.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n020.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:07:31 PM UTC 2025 % Result : Theorem 3.52s 3.68s % Output : Proof 3.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SYN372+1 : TPTP v9.2.0. Released v2.0.0. % 0.06/0.13 % Command : duper %s % 0.13/0.34 % Computer : n020.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 : Thu Oct 2 15:08:53 EDT 2025 % 0.13/0.34 % CPUTime : % 3.52/3.68 SZS status Theorem for theBenchmark.p % 3.52/3.68 SZS output start Proof for theBenchmark.p % 3.52/3.68 Clause #0 (by assumption #[]): Eq (Not (∀ (X : Iota), (Exists fun Y => big_p Y → big_q X) → Exists fun Y => big_p Y → big_q Y)) True % 3.52/3.68 Clause #1 (by clausification #[0]): Eq (∀ (X : Iota), (Exists fun Y => big_p Y → big_q X) → Exists fun Y => big_p Y → big_q Y) False % 3.52/3.68 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (Not ((Exists fun Y => big_p Y → big_q (skS.0 0 a)) → Exists fun Y => big_p Y → big_q Y)) True % 3.52/3.68 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq ((Exists fun Y => big_p Y → big_q (skS.0 0 a)) → Exists fun Y => big_p Y → big_q Y) False % 3.52/3.68 Clause #4 (by clausification #[3]): ∀ (a : Iota), Eq (Exists fun Y => big_p Y → big_q (skS.0 0 a)) True % 3.52/3.68 Clause #5 (by clausification #[3]): Eq (Exists fun Y => big_p Y → big_q Y) False % 3.52/3.68 Clause #6 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (big_p (skS.0 1 a a_1) → big_q (skS.0 0 a)) True % 3.52/3.68 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (big_p (skS.0 1 a a_1)) False) (Eq (big_q (skS.0 0 a)) True) % 3.52/3.68 Clause #8 (by clausification #[5]): ∀ (a : Iota), Eq (big_p a → big_q a) False % 3.52/3.68 Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (big_p a) True % 3.52/3.68 Clause #10 (by clausification #[8]): ∀ (a : Iota), Eq (big_q a) False % 3.52/3.68 Clause #11 (by superposition #[9, 7]): ∀ (a : Iota), Or (Eq True False) (Eq (big_q (skS.0 0 a)) True) % 3.52/3.68 Clause #13 (by clausification #[11]): ∀ (a : Iota), Eq (big_q (skS.0 0 a)) True % 3.52/3.68 Clause #14 (by superposition #[13, 10]): Eq True False % 3.52/3.68 Clause #15 (by clausification #[14]): False % 3.52/3.68 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------