%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN363+1 : TPTP v9.2.0. Released v2.0.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:07:30 PM UTC 2025 % Result : Theorem 5.51s 5.75s % Output : Proof 5.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.12 % Problem : SYN363+1 : TPTP v9.2.0. Released v2.0.0. % 0.02/0.13 % Command : duper %s % 0.11/0.33 % Computer : n007.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Thu Oct 2 15:23:53 EDT 2025 % 0.11/0.33 % CPUTime : % 5.51/5.75 SZS status Theorem for theBenchmark.p % 5.51/5.75 SZS output start Proof for theBenchmark.p % 5.51/5.75 Clause #0 (by assumption #[]): Eq % 5.51/5.75 (Not % 5.51/5.75 (And (∀ (X : Iota), big_r X b) (∀ (Y : Iota), (Exists fun Z => big_r Y Z) → big_r a Y) → % 5.51/5.75 Exists fun U => ∀ (V : Iota), big_r U V)) % 5.51/5.75 True % 5.51/5.75 Clause #1 (by betaEtaReduce #[0]): Eq % 5.51/5.75 (Not % 5.51/5.75 (And (∀ (X : Iota), big_r X b) (∀ (Y : Iota), Exists (big_r Y) → big_r a Y) → % 5.51/5.75 Exists fun U => ∀ (V : Iota), big_r U V)) % 5.51/5.75 True % 5.51/5.75 Clause #2 (by clausification #[1]): Eq % 5.51/5.75 (And (∀ (X : Iota), big_r X b) (∀ (Y : Iota), Exists (big_r Y) → big_r a Y) → Exists fun U => ∀ (V : Iota), big_r U V) % 5.51/5.75 False % 5.51/5.75 Clause #3 (by clausification #[2]): Eq (And (∀ (X : Iota), big_r X b) (∀ (Y : Iota), Exists (big_r Y) → big_r a Y)) True % 5.51/5.75 Clause #4 (by clausification #[2]): Eq (Exists fun U => ∀ (V : Iota), big_r U V) False % 5.51/5.75 Clause #5 (by clausification #[3]): Eq (∀ (Y : Iota), Exists (big_r Y) → big_r a Y) True % 5.51/5.75 Clause #6 (by clausification #[3]): Eq (∀ (X : Iota), big_r X b) True % 5.51/5.75 Clause #7 (by clausification #[5]): ∀ (a_1 : Iota), Eq (Exists (big_r a_1) → big_r a a_1) True % 5.51/5.75 Clause #8 (by clausification #[7]): ∀ (a_1 : Iota), Or (Eq (Exists (big_r a_1)) False) (Eq (big_r a a_1) True) % 5.51/5.75 Clause #9 (by clausification #[8]): ∀ (a_1 a_2 : Iota), Or (Eq (big_r a a_1) True) (Eq (big_r a_1 a_2) False) % 5.51/5.75 Clause #10 (by clausification #[6]): ∀ (a : Iota), Eq (big_r a b) True % 5.51/5.75 Clause #11 (by superposition #[10, 9]): ∀ (a_1 : Iota), Or (Eq (big_r a a_1) True) (Eq True False) % 5.51/5.75 Clause #12 (by clausification #[11]): ∀ (a_1 : Iota), Eq (big_r a a_1) True % 5.51/5.75 Clause #13 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (V : Iota), big_r a V) False % 5.51/5.75 Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (Not (big_r a (skS.0 0 a a_1))) True % 5.51/5.75 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (big_r a (skS.0 0 a a_1)) False % 5.51/5.75 Clause #16 (by superposition #[15, 12]): Eq False True % 5.51/5.75 Clause #17 (by clausification #[16]): False % 5.51/5.75 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------