%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV408^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n020.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:09 PM UTC 2025 % Result : Theorem 3.57s 3.74s % Output : Proof 3.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SEV408^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.14 % Command : duper %s % 0.15/0.35 % Computer : n020.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Fri Oct 3 01:29:38 EDT 2025 % 0.15/0.36 % CPUTime : % 3.57/3.74 SZS status Theorem for theBenchmark.p % 3.57/3.74 SZS output start Proof for theBenchmark.p % 3.57/3.74 Clause #0 (by assumption #[]): Eq (Not (Exists fun G => ∀ (A : Iota → Prop), G A → Exists fun B => And (cF B) (∀ (Xx : Iota), A Xx → B Xx))) True % 3.57/3.74 Clause #1 (by clausification #[0]): Eq (Exists fun G => ∀ (A : Iota → Prop), G A → Exists fun B => And (cF B) (∀ (Xx : Iota), A Xx → B Xx)) False % 3.57/3.74 Clause #2 (by clausification #[1]): ∀ (a : (Iota → Prop) → Prop), % 3.57/3.74 Eq (∀ (A : Iota → Prop), a A → Exists fun B => And (cF B) (∀ (Xx : Iota), A Xx → B Xx)) False % 3.57/3.74 Clause #3 (by clausification #[2]): ∀ (a : (Iota → Prop) → Prop) (a_1 : Iota → Prop), % 3.57/3.74 Eq (Not (a (skS.0 0 a a_1) → Exists fun B => And (cF B) (∀ (Xx : Iota), skS.0 0 a a_1 Xx → B Xx))) True % 3.57/3.74 Clause #4 (by clausification #[3]): ∀ (a : (Iota → Prop) → Prop) (a_1 : Iota → Prop), % 3.57/3.74 Eq (a (skS.0 0 a a_1) → Exists fun B => And (cF B) (∀ (Xx : Iota), skS.0 0 a a_1 Xx → B Xx)) False % 3.57/3.74 Clause #5 (by clausification #[4]): ∀ (a : (Iota → Prop) → Prop) (a_1 : Iota → Prop), Eq (a (skS.0 0 a a_1)) True % 3.57/3.74 Clause #10 (by fluidSup #[5, 5]): ∀ (a : Prop), Eq ((fun _ => a) True) True % 3.57/3.74 Clause #17 (by betaEtaReduce #[10]): ∀ (a : Prop), Eq a True % 3.57/3.74 Clause #18 (by falseElim #[17]): False % 3.57/3.74 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------