%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SEV410^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:03:09 PM UTC 2025 % Result : Theorem 3.73s 3.92s % Output : Proof 3.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SEV410^5 : TPTP v9.2.0. Released v4.0.0. % 0.07/0.14 % Command : duper %s % 0.13/0.35 % Computer : n006.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Fri Oct 3 01:10:53 EDT 2025 % 0.13/0.35 % CPUTime : % 3.73/3.92 SZS status Theorem for theBenchmark.p % 3.73/3.92 SZS output start Proof for theBenchmark.p % 3.73/3.92 Clause #0 (by assumption #[]): Eq (Not ((cP fun Xx => Or (cA Xx) (cB Xx)) → Exists fun Xu => And (cP Xu) (∀ (Xx : Iota), cA Xx → Xu Xx))) True % 3.73/3.92 Clause #1 (by clausification #[0]): Eq ((cP fun Xx => Or (cA Xx) (cB Xx)) → Exists fun Xu => And (cP Xu) (∀ (Xx : Iota), cA Xx → Xu Xx)) False % 3.73/3.92 Clause #2 (by clausification #[1]): Eq (cP fun Xx => Or (cA Xx) (cB Xx)) True % 3.73/3.92 Clause #3 (by clausification #[1]): Eq (Exists fun Xu => And (cP Xu) (∀ (Xx : Iota), cA Xx → Xu Xx)) False % 3.73/3.92 Clause #4 (by clausification #[3]): ∀ (a : Iota → Prop), Eq (And (cP a) (∀ (Xx : Iota), cA Xx → a Xx)) False % 3.73/3.92 Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop), Or (Eq (cP a) False) (Eq (∀ (Xx : Iota), cA Xx → a Xx) False) % 3.73/3.92 Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (Not (cA (skS.0 0 a a_1) → a (skS.0 0 a a_1))) True) % 3.73/3.92 Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (cA (skS.0 0 a a_1) → a (skS.0 0 a a_1)) False) % 3.73/3.92 Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (cA (skS.0 0 a a_1)) True) % 3.73/3.92 Clause #9 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 : Iota), Or (Eq (cP a) False) (Eq (a (skS.0 0 a a_1)) False) % 3.73/3.92 Clause #10 (by superposition #[8, 2]): ∀ (a : Iota), Or (Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) True) (Eq False True) % 3.73/3.92 Clause #11 (by superposition #[9, 2]): ∀ (a : Iota), Or (Eq ((fun Xx => Or (cA Xx) (cB Xx)) (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) False) (Eq False True) % 3.73/3.92 Clause #13 (by clausification #[10]): ∀ (a : Iota), Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) True % 3.73/3.92 Clause #15 (by betaEtaReduce #[11]): ∀ (a : Iota), % 3.73/3.92 Or (Eq (Or (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) (cB (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a))) False) % 3.73/3.92 (Eq False True) % 3.73/3.92 Clause #17 (by clausification #[15]): ∀ (a : Iota), Or (Eq False True) (Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) False) % 3.73/3.92 Clause #25 (by clausification #[17]): ∀ (a : Iota), Eq (cA (skS.0 0 (fun Xx => Or (cA Xx) (cB Xx)) a)) False % 3.73/3.92 Clause #26 (by superposition #[25, 13]): Eq False True % 3.73/3.92 Clause #28 (by clausification #[26]): False % 3.73/3.92 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------