%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO084^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n004.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:34 PM UTC 2025 % Result : Theorem 3.32s 3.51s % Output : Proof 3.32s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SYO084^5 : TPTP v9.2.0. Released v4.0.0. % 0.12/0.13 % Command : duper %s % 0.12/0.34 % Computer : n004.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Fri Oct 3 13:23:53 EDT 2025 % 0.12/0.34 % CPUTime : % 3.32/3.51 SZS status Theorem for theBenchmark.p % 3.32/3.51 SZS output start Proof for theBenchmark.p % 3.32/3.51 Clause #0 (by assumption #[]): Eq (Not (Exists fun Xv => ∀ (Xj : Iota), Exists fun Xq => Or (cP a Xj (h Xj)) (cP Xv Xj (k Xj)) → cP Xv Xj Xq)) True % 3.32/3.51 Clause #1 (by clausification #[0]): Eq (Exists fun Xv => ∀ (Xj : Iota), Exists fun Xq => Or (cP a Xj (h Xj)) (cP Xv Xj (k Xj)) → cP Xv Xj Xq) False % 3.32/3.51 Clause #2 (by clausification #[1]): ∀ (a_1 : Iota), Eq (∀ (Xj : Iota), Exists fun Xq => Or (cP a Xj (h Xj)) (cP a_1 Xj (k Xj)) → cP a_1 Xj Xq) False % 3.32/3.51 Clause #3 (by clausification #[2]): ∀ (a_1 a_2 : Iota), % 3.32/3.51 Eq % 3.32/3.51 (Not % 3.32/3.51 (Exists fun Xq => % 3.32/3.51 Or (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (cP a_1 (skS.0 0 a_1 a_2) (k (skS.0 0 a_1 a_2))) → % 3.32/3.51 cP a_1 (skS.0 0 a_1 a_2) Xq)) % 3.32/3.51 True % 3.32/3.51 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : Iota), % 3.32/3.51 Eq % 3.32/3.51 (Exists fun Xq => % 3.32/3.51 Or (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (cP a_1 (skS.0 0 a_1 a_2) (k (skS.0 0 a_1 a_2))) → % 3.32/3.51 cP a_1 (skS.0 0 a_1 a_2) Xq) % 3.32/3.51 False % 3.32/3.51 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 a_3 : Iota), % 3.32/3.51 Eq % 3.32/3.51 (Or (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (cP a_1 (skS.0 0 a_1 a_2) (k (skS.0 0 a_1 a_2))) → % 3.32/3.51 cP a_1 (skS.0 0 a_1 a_2) a_3) % 3.32/3.51 False % 3.32/3.51 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : Iota), % 3.32/3.51 Eq (Or (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (cP a_1 (skS.0 0 a_1 a_2) (k (skS.0 0 a_1 a_2)))) True % 3.32/3.51 Clause #7 (by clausification #[5]): ∀ (a a_1 a_2 : Iota), Eq (cP a (skS.0 0 a a_1) a_2) False % 3.32/3.51 Clause #8 (by clausification #[6]): ∀ (a_1 a_2 : Iota), % 3.32/3.51 Or (Eq (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) True) (Eq (cP a_1 (skS.0 0 a_1 a_2) (k (skS.0 0 a_1 a_2))) True) % 3.32/3.51 Clause #10 (by superposition #[7, 8]): ∀ (a_1 a_2 : Iota), Or (Eq (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) True) (Eq True False) % 3.32/3.51 Clause #11 (by clausification #[10]): ∀ (a_1 a_2 : Iota), Eq (cP a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) True % 3.32/3.51 Clause #12 (by superposition #[11, 7]): Eq True False % 3.32/3.51 Clause #13 (by clausification #[12]): False % 3.32/3.51 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------