%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN956+1 : TPTP v9.2.0. Released v3.1.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:08:18 PM UTC 2025 % Result : Theorem 3.34s 3.51s % Output : Proof 3.34s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SYN956+1 : TPTP v9.2.0. Released v3.1.0. % 0.11/0.13 % Command : duper %s % 0.12/0.34 % Computer : n020.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Thu Oct 2 15:49:08 EDT 2025 % 0.12/0.34 % CPUTime : % 3.34/3.51 SZS status Theorem for theBenchmark.p % 3.34/3.51 SZS output start Proof for theBenchmark.p % 3.34/3.51 Clause #0 (by assumption #[]): Eq (Not ((Exists fun X => a X → b X) → (∀ (X : Iota), a X) → Exists fun X => b X)) True % 3.34/3.51 Clause #1 (by betaEtaReduce #[0]): Eq (Not ((Exists fun X => a X → b X) → (∀ (X : Iota), a X) → Exists b)) True % 3.34/3.51 Clause #2 (by clausification #[1]): Eq ((Exists fun X => a X → b X) → (∀ (X : Iota), a X) → Exists b) False % 3.34/3.51 Clause #3 (by clausification #[2]): Eq (Exists fun X => a X → b X) True % 3.34/3.51 Clause #4 (by clausification #[2]): Eq ((∀ (X : Iota), a X) → Exists b) False % 3.34/3.51 Clause #5 (by clausification #[3]): ∀ (a_1 : Iota), Eq (a (skS.0 0 a_1) → b (skS.0 0 a_1)) True % 3.34/3.51 Clause #6 (by clausification #[5]): ∀ (a_1 : Iota), Or (Eq (a (skS.0 0 a_1)) False) (Eq (b (skS.0 0 a_1)) True) % 3.34/3.51 Clause #7 (by clausification #[4]): Eq (∀ (X : Iota), a X) True % 3.34/3.51 Clause #8 (by clausification #[4]): Eq (Exists b) False % 3.34/3.51 Clause #9 (by clausification #[7]): ∀ (a_1 : Iota), Eq (a a_1) True % 3.34/3.51 Clause #10 (by superposition #[9, 6]): ∀ (a : Iota), Or (Eq True False) (Eq (b (skS.0 0 a)) True) % 3.34/3.51 Clause #11 (by clausification #[8]): ∀ (a : Iota), Eq (b a) False % 3.34/3.51 Clause #13 (by clausification #[10]): ∀ (a : Iota), Eq (b (skS.0 0 a)) True % 3.34/3.51 Clause #14 (by superposition #[13, 11]): Eq True False % 3.34/3.51 Clause #15 (by clausification #[14]): False % 3.34/3.51 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------