%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO216^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n006.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:08:45 PM UTC 2025 % Result : Theorem 3.51s 3.74s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.11 % Problem : SYO216^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.13 % Command : duper %s % 0.12/0.34 % Computer : n006.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Fri Oct 3 14:05:53 EDT 2025 % 0.12/0.34 % CPUTime : % 3.51/3.74 SZS status Theorem for theBenchmark.p % 3.51/3.74 SZS output start Proof for theBenchmark.p % 3.51/3.74 Clause #0 (by assumption #[]): Eq (Not (∀ (X Y Z : b → b), Eq (fun W => X (Y (Z W))) fun W => X (Y (Z W)))) True % 3.51/3.74 Clause #1 (by clausification #[0]): Eq (∀ (X Y Z : b → b), Eq (fun W => X (Y (Z W))) fun W => X (Y (Z W))) False % 3.51/3.74 Clause #2 (by clausification #[1]): ∀ (a : b → b), Eq (Not (∀ (Y Z : b → b), Eq (fun W => skS.0 0 a (Y (Z W))) fun W => skS.0 0 a (Y (Z W)))) True % 3.51/3.74 Clause #3 (by clausification #[2]): ∀ (a : b → b), Eq (∀ (Y Z : b → b), Eq (fun W => skS.0 0 a (Y (Z W))) fun W => skS.0 0 a (Y (Z W))) False % 3.51/3.74 Clause #4 (by clausification #[3]): ∀ (a a_1 : b → b), % 3.51/3.74 Eq (Not (∀ (Z : b → b), Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (Z W))) fun W => skS.0 0 a (skS.0 1 a a_1 (Z W)))) True % 3.51/3.74 Clause #5 (by clausification #[4]): ∀ (a a_1 : b → b), % 3.51/3.74 Eq (∀ (Z : b → b), Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (Z W))) fun W => skS.0 0 a (skS.0 1 a a_1 (Z W))) False % 3.51/3.74 Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 : b → b), % 3.51/3.74 Eq % 3.51/3.74 (Not % 3.51/3.74 (Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) fun W => % 3.51/3.74 skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W)))) % 3.51/3.74 True % 3.51/3.74 Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : b → b), % 3.51/3.74 Eq % 3.51/3.74 (Eq (fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) fun W => % 3.51/3.74 skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) % 3.51/3.74 False % 3.51/3.74 Clause #8 (by clausification #[7]): ∀ (a a_1 a_2 : b → b), % 3.51/3.74 Ne (fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W))) fun W => skS.0 0 a (skS.0 1 a a_1 (skS.0 2 a a_1 a_2 W)) % 3.51/3.74 Clause #9 (by eliminate resolved literals #[8]): False % 3.51/3.74 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------