%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN926+1 : TPTP v9.2.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n010.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:08:15 PM UTC 2025 % Result : Theorem 3.66s 3.85s % Output : Proof 3.66s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SYN926+1 : TPTP v9.2.0. Released v3.1.0. % 0.03/0.14 % Command : duper %s % 0.13/0.35 % Computer : n010.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 : Thu Oct 2 15:35:08 EDT 2025 % 0.13/0.36 % CPUTime : % 3.66/3.85 SZS status Theorem for theBenchmark.p % 3.66/3.85 SZS output start Proof for theBenchmark.p % 3.66/3.85 Clause #0 (by assumption #[]): Eq (Not ((Exists fun X => And (p X) (q X)) → And (Exists fun X => p X) (Exists fun X => q X))) True % 3.66/3.85 Clause #1 (by betaEtaReduce #[0]): Eq (Not ((Exists fun X => And (p X) (q X)) → And (Exists p) (Exists q))) True % 3.66/3.85 Clause #2 (by clausification #[1]): Eq ((Exists fun X => And (p X) (q X)) → And (Exists p) (Exists q)) False % 3.66/3.85 Clause #3 (by clausification #[2]): Eq (Exists fun X => And (p X) (q X)) True % 3.66/3.85 Clause #4 (by clausification #[2]): Eq (And (Exists p) (Exists q)) False % 3.66/3.85 Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (And (p (skS.0 0 a)) (q (skS.0 0 a))) True % 3.66/3.85 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (q (skS.0 0 a)) True % 3.66/3.85 Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (p (skS.0 0 a)) True % 3.66/3.85 Clause #8 (by clausification #[4]): Or (Eq (Exists p) False) (Eq (Exists q) False) % 3.66/3.85 Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (Exists q) False) (Eq (p a) False) % 3.66/3.85 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (p a) False) (Eq (q a_1) False) % 3.66/3.85 Clause #11 (by superposition #[10, 7]): ∀ (a : Iota), Or (Eq (q a) False) (Eq False True) % 3.66/3.85 Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (q a) False % 3.66/3.85 Clause #13 (by superposition #[12, 6]): Eq False True % 3.66/3.85 Clause #14 (by clausification #[13]): False % 3.66/3.85 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------