%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEU858^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n002.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:34 PM UTC 2025 % Result : Theorem 4.22s 4.45s % Output : Proof 4.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.15 % Problem : SEU858^5 : TPTP v9.2.0. Released v4.0.0. % 0.14/0.16 % Command : duper %s % 0.14/0.37 % Computer : n002.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 300 % 0.14/0.37 % DateTime : Fri Oct 3 05:33:53 EDT 2025 % 0.21/0.38 % CPUTime : % 4.22/4.45 SZS status Theorem for theBenchmark.p % 4.22/4.45 SZS output start Proof for theBenchmark.p % 4.22/4.45 Clause #0 (by assumption #[]): Eq % 4.22/4.45 (Not % 4.22/4.45 (∀ (Xw : (a → Prop) → Prop), % 4.22/4.45 And (Xw fun Xx => False) (∀ (Xr : a → Prop) (Xx : a), Xw Xr → Xw fun Xt => Or (Xr Xt) (Eq Xt Xx)) → % 4.22/4.45 Xw fun Xx => False)) % 4.22/4.45 True % 4.22/4.45 Clause #1 (by clausification #[0]): Eq % 4.22/4.45 (∀ (Xw : (a → Prop) → Prop), % 4.22/4.45 And (Xw fun Xx => False) (∀ (Xr : a → Prop) (Xx : a), Xw Xr → Xw fun Xt => Or (Xr Xt) (Eq Xt Xx)) → % 4.22/4.45 Xw fun Xx => False) % 4.22/4.45 False % 4.22/4.45 Clause #2 (by clausification #[1]): ∀ (a_1 : (a → Prop) → Prop), % 4.22/4.45 Eq % 4.22/4.45 (Not % 4.22/4.45 (And (skS.0 0 a_1 fun Xx => False) % 4.22/4.45 (∀ (Xr : a → Prop) (Xx : a), skS.0 0 a_1 Xr → skS.0 0 a_1 fun Xt => Or (Xr Xt) (Eq Xt Xx)) → % 4.22/4.45 skS.0 0 a_1 fun Xx => False)) % 4.22/4.45 True % 4.22/4.45 Clause #3 (by clausification #[2]): ∀ (a_1 : (a → Prop) → Prop), % 4.22/4.45 Eq % 4.22/4.45 (And (skS.0 0 a_1 fun Xx => False) % 4.22/4.45 (∀ (Xr : a → Prop) (Xx : a), skS.0 0 a_1 Xr → skS.0 0 a_1 fun Xt => Or (Xr Xt) (Eq Xt Xx)) → % 4.22/4.45 skS.0 0 a_1 fun Xx => False) % 4.22/4.45 False % 4.22/4.45 Clause #4 (by clausification #[3]): ∀ (a_1 : (a → Prop) → Prop), % 4.22/4.45 Eq % 4.22/4.45 (And (skS.0 0 a_1 fun Xx => False) % 4.22/4.45 (∀ (Xr : a → Prop) (Xx : a), skS.0 0 a_1 Xr → skS.0 0 a_1 fun Xt => Or (Xr Xt) (Eq Xt Xx))) % 4.22/4.45 True % 4.22/4.45 Clause #5 (by clausification #[3]): ∀ (a_1 : (a → Prop) → Prop), Eq (skS.0 0 a_1 fun Xx => False) False % 4.22/4.45 Clause #7 (by clausification #[4]): ∀ (a_1 : (a → Prop) → Prop), Eq (skS.0 0 a_1 fun Xx => False) True % 4.22/4.45 Clause #11 (by superposition #[7, 5]): Eq True False % 4.22/4.45 Clause #14 (by clausification #[11]): False % 4.22/4.45 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------