%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU923^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n018.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:02:38 PM UTC 2025 % Result : Theorem 3.35s 3.58s % Output : Proof 3.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU923^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.13 % Command : duper %s % 0.14/0.35 % Computer : n018.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Fri Oct 3 05:26:23 EDT 2025 % 0.14/0.35 % CPUTime : % 3.35/3.58 SZS status Theorem for theBenchmark.p % 3.35/3.58 SZS output start Proof for theBenchmark.p % 3.35/3.58 Clause #0 (by assumption #[]): Eq (Not ((∀ (Xx Xy : b), Eq (cF Xx) (cF Xy) → Eq Xx Xy) → ∀ (Xx Xy : b), Eq (cF Xx) (cF Xy) → Eq Xx Xy)) True % 3.35/3.58 Clause #1 (by clausification #[0]): Eq ((∀ (Xx Xy : b), Eq (cF Xx) (cF Xy) → Eq Xx Xy) → ∀ (Xx Xy : b), Eq (cF Xx) (cF Xy) → Eq Xx Xy) False % 3.35/3.58 Clause #2 (by clausification #[1]): Eq (∀ (Xx Xy : b), Eq (cF Xx) (cF Xy) → Eq Xx Xy) True % 3.35/3.58 Clause #3 (by clausification #[1]): Eq (∀ (Xx Xy : b), Eq (cF Xx) (cF Xy) → Eq Xx Xy) False % 3.35/3.58 Clause #4 (by clausification #[2]): ∀ (a_1 : b), Eq (∀ (Xy : b), Eq (cF a_1) (cF Xy) → Eq a_1 Xy) True % 3.35/3.58 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : b), Eq (Eq (cF a_1) (cF a_2) → Eq a_1 a_2) True % 3.35/3.58 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : b), Or (Eq (Eq (cF a_1) (cF a_2)) False) (Eq (Eq a_1 a_2) True) % 3.35/3.58 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : b), Or (Eq (Eq a_1 a_2) True) (Ne (cF a_1) (cF a_2)) % 3.35/3.58 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : b), Or (Ne (cF a_1) (cF a_2)) (Eq a_1 a_2) % 3.35/3.58 Clause #10 (by clausification #[3]): ∀ (a_1 : b), Eq (Not (∀ (Xy : b), Eq (cF (skS.0 0 a_1)) (cF Xy) → Eq (skS.0 0 a_1) Xy)) True % 3.35/3.58 Clause #11 (by clausification #[10]): ∀ (a_1 : b), Eq (∀ (Xy : b), Eq (cF (skS.0 0 a_1)) (cF Xy) → Eq (skS.0 0 a_1) Xy) False % 3.35/3.58 Clause #12 (by clausification #[11]): ∀ (a_1 a_2 : b), Eq (Not (Eq (cF (skS.0 0 a_1)) (cF (skS.0 1 a_1 a_2)) → Eq (skS.0 0 a_1) (skS.0 1 a_1 a_2))) True % 3.35/3.58 Clause #13 (by clausification #[12]): ∀ (a_1 a_2 : b), Eq (Eq (cF (skS.0 0 a_1)) (cF (skS.0 1 a_1 a_2)) → Eq (skS.0 0 a_1) (skS.0 1 a_1 a_2)) False % 3.35/3.58 Clause #14 (by clausification #[13]): ∀ (a_1 a_2 : b), Eq (Eq (cF (skS.0 0 a_1)) (cF (skS.0 1 a_1 a_2))) True % 3.35/3.58 Clause #15 (by clausification #[13]): ∀ (a a_1 : b), Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) False % 3.35/3.58 Clause #16 (by clausification #[14]): ∀ (a_1 a_2 : b), Eq (cF (skS.0 0 a_1)) (cF (skS.0 1 a_1 a_2)) % 3.35/3.58 Clause #17 (by superposition #[16, 8]): ∀ (a_1 a_2 a_3 : b), Or (Ne (cF (skS.0 0 a_1)) (cF a_2)) (Eq (skS.0 1 a_1 a_3) a_2) % 3.35/3.58 Clause #19 (by clausification #[15]): ∀ (a a_1 : b), Ne (skS.0 0 a) (skS.0 1 a a_1) % 3.35/3.58 Clause #20 (by equality resolution #[17]): ∀ (a a_1 : b), Eq (skS.0 1 a a_1) (skS.0 0 a) % 3.35/3.58 Clause #22 (by forward contextual literal cutting #[20, 19]): False % 3.35/3.58 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------