%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN382+1 : TPTP v9.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n016.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:33 PM UTC 2025 % Result : Theorem 3.51s 3.71s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : SYN382+1 : TPTP v9.2.0. Released v2.0.0. % 0.04/0.15 % Command : duper %s % 0.14/0.37 % Computer : n016.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 300 % 0.14/0.37 % DateTime : Thu Oct 2 15:28:53 EDT 2025 % 0.14/0.37 % CPUTime : % 3.51/3.71 SZS status Theorem for theBenchmark.p % 3.51/3.71 SZS output start Proof for theBenchmark.p % 3.51/3.71 Clause #0 (by assumption #[]): Eq % 3.51/3.71 (Not % 3.51/3.71 ((∀ (Z : Iota), Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X Z)) → % 3.51/3.71 ∀ (Y : Iota), Exists fun X => Or (big_p X Y) (big_q X Y))) % 3.51/3.71 True % 3.51/3.71 Clause #1 (by clausification #[0]): Eq % 3.51/3.71 ((∀ (Z : Iota), Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X Z)) → % 3.51/3.71 ∀ (Y : Iota), Exists fun X => Or (big_p X Y) (big_q X Y)) % 3.51/3.71 False % 3.51/3.71 Clause #2 (by clausification #[1]): Eq (∀ (Z : Iota), Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X Z)) True % 3.51/3.71 Clause #3 (by clausification #[1]): Eq (∀ (Y : Iota), Exists fun X => Or (big_p X Y) (big_q X Y)) False % 3.51/3.71 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun X => Or (∀ (Y : Iota), big_p X Y) (big_q X a)) True % 3.51/3.71 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (Or (∀ (Y : Iota), big_p (skS.0 0 a a_1) Y) (big_q (skS.0 0 a a_1) a)) True % 3.51/3.71 Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (∀ (Y : Iota), big_p (skS.0 0 a a_1) Y) True) (Eq (big_q (skS.0 0 a a_1) a) True) % 3.51/3.71 Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Or (Eq (big_q (skS.0 0 a a_1) a) True) (Eq (big_p (skS.0 0 a a_1) a_2) True) % 3.51/3.71 Clause #8 (by clausification #[3]): ∀ (a : Iota), Eq (Not (Exists fun X => Or (big_p X (skS.0 1 a)) (big_q X (skS.0 1 a)))) True % 3.51/3.71 Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (Exists fun X => Or (big_p X (skS.0 1 a)) (big_q X (skS.0 1 a))) False % 3.51/3.71 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Eq (Or (big_p a (skS.0 1 a_1)) (big_q a (skS.0 1 a_1))) False % 3.51/3.71 Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (big_q a (skS.0 1 a_1)) False % 3.51/3.71 Clause #12 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (big_p a (skS.0 1 a_1)) False % 3.51/3.71 Clause #14 (by superposition #[12, 7]): ∀ (a a_1 : Iota), Or (Eq (big_q (skS.0 0 a a_1) a) True) (Eq False True) % 3.51/3.71 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (big_q (skS.0 0 a a_1) a) True % 3.51/3.71 Clause #16 (by superposition #[15, 11]): Eq True False % 3.51/3.71 Clause #17 (by clausification #[16]): False % 3.51/3.71 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------