%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV122^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n022.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:51 PM UTC 2025 % Result : Theorem 3.50s 3.69s % Output : Proof 3.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEV122^5 : TPTP v9.2.0. Released v4.0.0. % 0.14/0.14 % Command : duper %s % 0.14/0.35 % Computer : n022.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 01:45:08 EDT 2025 % 0.14/0.35 % CPUTime : % 3.50/3.69 SZS status Theorem for theBenchmark.p % 3.50/3.69 SZS output start Proof for theBenchmark.p % 3.50/3.69 Clause #0 (by assumption #[]): Eq % 3.50/3.69 (Not % 3.50/3.69 (∀ (PROP : (a → a → Prop) → Prop), % 3.50/3.69 ((a → a → Prop) → Prop) → % 3.50/3.69 Eq % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (PROP Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (PROP Xp) → Xp Xx Xy)) % 3.50/3.69 True % 3.50/3.69 Clause #1 (by clausification #[0]): Eq % 3.50/3.69 (∀ (PROP : (a → a → Prop) → Prop), % 3.50/3.69 ((a → a → Prop) → Prop) → % 3.50/3.69 Eq % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (PROP Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (PROP Xp) → Xp Xx Xy) % 3.50/3.69 False % 3.50/3.69 Clause #2 (by clausification #[1]): ∀ (a_1 : (a → a → Prop) → Prop), % 3.50/3.69 Eq % 3.50/3.69 (Not % 3.50/3.69 (((a → a → Prop) → Prop) → % 3.50/3.69 Eq % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy)) % 3.50/3.69 True % 3.50/3.69 Clause #3 (by clausification #[2]): ∀ (a_1 : (a → a → Prop) → Prop), % 3.50/3.69 Eq % 3.50/3.69 (((a → a → Prop) → Prop) → % 3.50/3.69 Eq % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 False % 3.50/3.69 Clause #4 (by clausification #[3]): ∀ (a_1 : (a → a → Prop) → Prop), % 3.50/3.69 ((a → a → Prop) → Prop) → % 3.50/3.69 Eq % 3.50/3.69 (Not % 3.50/3.69 (Eq % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy)) % 3.50/3.69 True % 3.50/3.69 Clause #5 (by clausification #[4]): ∀ (a_1 : (a → a → Prop) → Prop), % 3.50/3.69 Eq % 3.50/3.69 (Eq % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 False % 3.50/3.69 Clause #6 (by clausification #[5]): ∀ (a_1 : (a → a → Prop) → Prop), % 3.50/3.69 Ne % 3.50/3.69 (fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), % 3.50/3.69 And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy) % 3.50/3.69 fun Xx Xy => % 3.50/3.69 ∀ (Xp : a → a → Prop), And (∀ (Xx0 Xy0 : a), (Exists fun R => R Xx0 Xy0) → Xp Xx0 Xy0) (skS.0 0 a_1 Xp) → Xp Xx Xy % 3.50/3.69 Clause #7 (by eliminate resolved literals #[6]): False % 3.50/3.69 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------