%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV161^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n016.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:54 PM UTC 2025 % Result : Theorem 5.29s 5.47s % Output : Proof 5.29s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.10 % Problem : SEV161^5 : TPTP v9.2.0. Released v4.0.0. % 0.03/0.10 % Command : duper %s % 0.09/0.30 % Computer : n016.cluster.edu % 0.09/0.30 % Model : x86_64 x86_64 % 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.30 % Memory : 8042.1875MB % 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.30 % CPULimit : 300 % 0.09/0.30 % WCLimit : 300 % 0.09/0.30 % DateTime : Fri Oct 3 01:01:38 EDT 2025 % 0.09/0.30 % CPUTime : % 5.29/5.47 SZS status Theorem for theBenchmark.p % 5.29/5.47 SZS output start Proof for theBenchmark.p % 5.29/5.47 Clause #0 (by assumption #[]): Eq (Not (∀ (Xr : a → a → Prop) (Xx Xy : a), Iff (Xr Xx Xy) (Xr Xx Xy))) True % 5.29/5.47 Clause #1 (by clausification #[0]): Eq (∀ (Xr : a → a → Prop) (Xx Xy : a), Iff (Xr Xx Xy) (Xr Xx Xy)) False % 5.29/5.47 Clause #2 (by clausification #[1]): ∀ (a_1 : a → a → Prop), Eq (Not (∀ (Xx Xy : a), Iff (skS.0 0 a_1 Xx Xy) (skS.0 0 a_1 Xx Xy))) True % 5.29/5.47 Clause #3 (by clausification #[2]): ∀ (a_1 : a → a → Prop), Eq (∀ (Xx Xy : a), Iff (skS.0 0 a_1 Xx Xy) (skS.0 0 a_1 Xx Xy)) False % 5.29/5.47 Clause #4 (by clausification #[3]): ∀ (a_1 : a → a → Prop) (a_2 : a), % 5.29/5.47 Eq (Not (∀ (Xy : a), Iff (skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy) (skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy))) True % 5.29/5.47 Clause #5 (by clausification #[4]): ∀ (a_1 : a → a → Prop) (a_2 : a), % 5.29/5.47 Eq (∀ (Xy : a), Iff (skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy) (skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy)) False % 5.29/5.47 Clause #6 (by clausification #[5]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), % 5.29/5.47 Eq % 5.29/5.47 (Not % 5.29/5.47 (Iff (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)))) % 5.29/5.47 True % 5.29/5.47 Clause #7 (by clausification #[6]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), % 5.29/5.47 Eq (Iff (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3))) % 5.29/5.47 False % 5.29/5.47 Clause #8 (by clausification #[7]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), % 5.29/5.47 Or (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) False) % 5.29/5.47 (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) False) % 5.29/5.47 Clause #9 (by clausification #[7]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), % 5.29/5.47 Or (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) True) % 5.29/5.47 (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) True) % 5.29/5.47 Clause #10 (by eliminate duplicate literals #[8]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) False % 5.29/5.47 Clause #11 (by eliminate duplicate literals #[9]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) True % 5.29/5.47 Clause #12 (by superposition #[11, 10]): Eq True False % 5.29/5.47 Clause #13 (by clausification #[12]): False % 5.29/5.47 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------