%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : DAT157^1 : TPTP v9.2.0. Released v7.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n012.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 07:47:13 PM UTC 2025 % Result : Theorem 9.22s 9.40s % Output : Proof 9.22s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : DAT157^1 : TPTP v9.2.0. Released v7.0.0. % 0.11/0.13 % Command : duper %s % 0.14/0.34 % Computer : n012.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.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Thu Oct 2 21:44:53 EDT 2025 % 0.14/0.35 % CPUTime : % 9.22/9.40 SZS status Theorem for theBenchmark.p % 9.22/9.40 SZS output start Proof for theBenchmark.p % 9.22/9.40 Clause #31 (by assumption #[]): Eq (Exists fun X3 => And (member a X3 (coinductive_lset a ysa)) (less_eq x X3)) True % 9.22/9.40 Clause #229 (by assumption #[]): Eq (∀ (Y5 : a), member a Y5 (coinductive_lset a ysa) → less_eq x Y5 → thesis) True % 9.22/9.40 Clause #230 (by assumption #[]): Eq (Not thesis) True % 9.22/9.40 Clause #231 (by clausification #[230]): Eq thesis False % 9.22/9.40 Clause #232 (by clausification #[229]): ∀ (a_1 : a), Eq (member a a_1 (coinductive_lset a ysa) → less_eq x a_1 → thesis) True % 9.22/9.40 Clause #233 (by clausification #[232]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Eq (less_eq x a_1 → thesis) True) % 9.22/9.40 Clause #234 (by clausification #[233]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Or (Eq (less_eq x a_1) False) (Eq thesis True)) % 9.22/9.40 Clause #235 (by forward demodulation #[234, 231]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Or (Eq (less_eq x a_1) False) (Eq False True)) % 9.22/9.40 Clause #236 (by clausification #[235]): ∀ (a_1 : a), Or (Eq (member a a_1 (coinductive_lset a ysa)) False) (Eq (less_eq x a_1) False) % 9.22/9.40 Clause #1185 (by clausification #[31]): ∀ (a_1 : a), Eq (And (member a (skS.0 12 a_1) (coinductive_lset a ysa)) (less_eq x (skS.0 12 a_1))) True % 9.22/9.40 Clause #1186 (by clausification #[1185]): ∀ (a_1 : a), Eq (less_eq x (skS.0 12 a_1)) True % 9.22/9.40 Clause #1187 (by clausification #[1185]): ∀ (a_1 : a), Eq (member a (skS.0 12 a_1) (coinductive_lset a ysa)) True % 9.22/9.40 Clause #3168 (by superposition #[1187, 236]): ∀ (a_1 : a), Or (Eq True False) (Eq (less_eq x (skS.0 12 a_1)) False) % 9.22/9.40 Clause #3213 (by clausification #[3168]): ∀ (a_1 : a), Eq (less_eq x (skS.0 12 a_1)) False % 9.22/9.40 Clause #3214 (by superposition #[3213, 1186]): Eq False True % 9.22/9.40 Clause #3222 (by clausification #[3214]): False % 9.22/9.40 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------