%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV405^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n026.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:03:08 PM UTC 2025 % Result : Theorem 3.51s 3.71s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEV405^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.13 % Command : duper %s % 0.14/0.34 % Computer : n026.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.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Oct 3 01:43:38 EDT 2025 % 0.14/0.34 % CPUTime : % 3.51/3.71 SZS status Theorem for theBenchmark.p % 3.51/3.71 SZS output start Proof for theBenchmark.p % 3.51/3.71 Clause #0 (by assumption #[]): Eq (Not (Exists fun U => ∀ (V : Iota), Iff (U V) cA)) True % 3.51/3.71 Clause #1 (by clausification #[0]): Eq (Exists fun U => ∀ (V : Iota), Iff (U V) cA) False % 3.51/3.71 Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop), Eq (∀ (V : Iota), Iff (a V) cA) False % 3.51/3.71 Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Not (Iff (a (skS.0 0 a a_1)) cA)) True % 3.51/3.71 Clause #4 (by clausification #[3]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Iff (a (skS.0 0 a a_1)) cA) False % 3.51/3.71 Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (a (skS.0 0 a a_1)) False) (Eq cA False) % 3.51/3.71 Clause #6 (by clausification #[4]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (a (skS.0 0 a a_1)) True) (Eq cA True) % 3.51/3.71 Clause #10 (by fluidSup #[5, 5]): ∀ (a : Prop), Or (Eq cA False) (Or (Eq ((fun _ => a) False) False) (Eq cA False)) % 3.51/3.71 Clause #17 (by betaEtaReduce #[10]): ∀ (a : Prop), Or (Eq cA False) (Or (Eq a False) (Eq cA False)) % 3.51/3.71 Clause #18 (by eliminate duplicate literals #[17]): ∀ (a : Prop), Or (Eq cA False) (Eq a False) % 3.51/3.71 Clause #24 (by equality factoring #[6]): Or (Ne True True) (Eq cA True) % 3.51/3.71 Clause #43 (by clausification #[24]): Or (Eq cA True) (Or (Eq True False) (Eq True False)) % 3.51/3.71 Clause #45 (by clausification #[43]): Or (Eq cA True) (Eq True False) % 3.51/3.71 Clause #46 (by clausification #[45]): Eq cA True % 3.51/3.71 Clause #47 (by superposition #[46, 18]): ∀ (a : Prop), Or (Eq True False) (Eq a False) % 3.51/3.71 Clause #53 (by clausification #[47]): ∀ (a : Prop), Eq a False % 3.51/3.71 Clause #55 (by falseElim #[53]): False % 3.51/3.71 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------