%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO101^5 : TPTP v9.2.0. Released v4.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:08:35 PM UTC 2025 % Result : Theorem 3.55s 3.77s % Output : Proof 3.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYO101^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.13 % Command : duper %s % 0.14/0.34 % Computer : n020.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Oct 3 14:36:23 EDT 2025 % 0.14/0.35 % CPUTime : % 3.55/3.77 SZS status Theorem for theBenchmark.p % 3.55/3.77 SZS output start Proof for theBenchmark.p % 3.55/3.77 Clause #0 (by assumption #[]): Eq % 3.55/3.77 (Not % 3.55/3.77 ((∀ (X : Iota), Exists fun Y => cP X → ∀ (Z : Iota), And (cR X Y) (cP Z)) → % 3.55/3.77 Exists fun U => ∀ (V : Iota), cP V → cR cW U)) % 3.55/3.77 True % 3.55/3.77 Clause #1 (by clausification #[0]): Eq % 3.55/3.77 ((∀ (X : Iota), Exists fun Y => cP X → ∀ (Z : Iota), And (cR X Y) (cP Z)) → % 3.55/3.77 Exists fun U => ∀ (V : Iota), cP V → cR cW U) % 3.55/3.77 False % 3.55/3.77 Clause #2 (by clausification #[1]): Eq (∀ (X : Iota), Exists fun Y => cP X → ∀ (Z : Iota), And (cR X Y) (cP Z)) True % 3.55/3.77 Clause #3 (by clausification #[1]): Eq (Exists fun U => ∀ (V : Iota), cP V → cR cW U) False % 3.55/3.77 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun Y => cP a → ∀ (Z : Iota), And (cR a Y) (cP Z)) True % 3.55/3.77 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (cP a → ∀ (Z : Iota), And (cR a (skS.0 0 a a_1)) (cP Z)) True % 3.55/3.77 Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Or (Eq (cP a) False) (Eq (∀ (Z : Iota), And (cR a (skS.0 0 a a_1)) (cP Z)) True) % 3.55/3.77 Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Or (Eq (cP a) False) (Eq (And (cR a (skS.0 0 a a_1)) (cP a_2)) True) % 3.55/3.77 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (cP a) False) (Eq (cP a_1) True) % 3.55/3.77 Clause #9 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (cP a) False) (Eq (cR a (skS.0 0 a a_1)) True) % 3.55/3.77 Clause #10 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (V : Iota), cP V → cR cW a) False % 3.55/3.77 Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (Not (cP (skS.0 1 a a_1) → cR cW a)) True % 3.55/3.77 Clause #12 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (cP (skS.0 1 a a_1) → cR cW a) False % 3.55/3.77 Clause #13 (by clausification #[12]): ∀ (a a_1 : Iota), Eq (cP (skS.0 1 a a_1)) True % 3.55/3.77 Clause #14 (by clausification #[12]): ∀ (a : Iota), Eq (cR cW a) False % 3.55/3.77 Clause #15 (by superposition #[13, 8]): ∀ (a : Iota), Or (Eq True False) (Eq (cP a) True) % 3.55/3.77 Clause #16 (by clausification #[15]): ∀ (a : Iota), Eq (cP a) True % 3.55/3.77 Clause #17 (by forward demodulation #[9, 16]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (cR a (skS.0 0 a a_1)) True) % 3.55/3.77 Clause #18 (by clausification #[17]): ∀ (a a_1 : Iota), Eq (cR a (skS.0 0 a a_1)) True % 3.55/3.77 Clause #19 (by superposition #[18, 14]): Eq True False % 3.55/3.77 Clause #20 (by clausification #[19]): False % 3.55/3.77 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------