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