%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV163^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n031.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 3.71s 3.89s % Output : Proof 3.71s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SEV163^5 : TPTP v9.2.0. Released v4.0.0. % 0.03/0.13 % Command : duper %s % 0.14/0.34 % Computer : n031.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % 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:26:38 EDT 2025 % 0.14/0.35 % CPUTime : % 3.71/3.89 SZS status Theorem for theBenchmark.p % 3.71/3.89 SZS output start Proof for theBenchmark.p % 3.71/3.89 Clause #0 (by assumption #[]): Eq % 3.71/3.89 (Not % 3.71/3.89 (∀ (Xp : (a → a → a) → a), % 3.71/3.89 (Eq Xp fun Xg => Xg (Xp fun Xx Xy => Xx) (Xp fun Xx Xy => Xy)) → % 3.71/3.89 Eq (fun Xg => Xg (Xp fun Xx Xy => Xx) (Xp fun Xx Xy => Xy)) Xp)) % 3.71/3.89 True % 3.71/3.89 Clause #1 (by clausification #[0]): Eq % 3.71/3.89 (∀ (Xp : (a → a → a) → a), % 3.71/3.89 (Eq Xp fun Xg => Xg (Xp fun Xx Xy => Xx) (Xp fun Xx Xy => Xy)) → % 3.71/3.89 Eq (fun Xg => Xg (Xp fun Xx Xy => Xx) (Xp fun Xx Xy => Xy)) Xp) % 3.71/3.89 False % 3.71/3.89 Clause #2 (by clausification #[1]): ∀ (a_1 : (a → a → a) → a), % 3.71/3.89 Eq % 3.71/3.89 (Not % 3.71/3.89 ((Eq (skS.0 0 a_1) fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) → % 3.71/3.89 Eq (fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) (skS.0 0 a_1))) % 3.71/3.89 True % 3.71/3.89 Clause #3 (by clausification #[2]): ∀ (a_1 : (a → a → a) → a), % 3.71/3.89 Eq % 3.71/3.89 ((Eq (skS.0 0 a_1) fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) → % 3.71/3.89 Eq (fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) (skS.0 0 a_1)) % 3.71/3.89 False % 3.71/3.89 Clause #4 (by clausification #[3]): ∀ (a_1 : (a → a → a) → a), % 3.71/3.89 Eq (Eq (skS.0 0 a_1) fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) True % 3.71/3.89 Clause #5 (by clausification #[3]): ∀ (a_1 : (a → a → a) → a), % 3.71/3.89 Eq (Eq (fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) (skS.0 0 a_1)) False % 3.71/3.89 Clause #6 (by clausification #[4]): ∀ (a_1 : (a → a → a) → a), Eq (skS.0 0 a_1) fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy) % 3.71/3.89 Clause #18 (by clausification #[5]): ∀ (a_1 : (a → a → a) → a), Ne (fun Xg => Xg (skS.0 0 a_1 fun Xx Xy => Xx) (skS.0 0 a_1 fun Xx Xy => Xy)) (skS.0 0 a_1) % 3.71/3.89 Clause #19 (by forward positive simplify reflect #[18, 6]): False % 3.71/3.89 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------