%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN981+1 : TPTP v9.2.0. Released v3.1.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n027.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:21 PM UTC 2025 % Result : Theorem 3.46s 3.61s % Output : Proof 3.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN981+1 : TPTP v9.2.0. Released v3.1.0. % 0.03/0.13 % Command : duper %s % 0.13/0.34 % Computer : n027.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Thu Oct 2 15:24:08 EDT 2025 % 0.13/0.35 % CPUTime : % 3.46/3.61 SZS status Theorem for theBenchmark.p % 3.46/3.61 SZS output start Proof for theBenchmark.p % 3.46/3.61 Clause #0 (by assumption #[]): Eq (Not (And (∀ (X : Iota), p X → q X) (Exists fun Y => q Y → r Y) → Exists fun Z => p Z → r Z)) True % 3.46/3.61 Clause #1 (by clausification #[0]): Eq (And (∀ (X : Iota), p X → q X) (Exists fun Y => q Y → r Y) → Exists fun Z => p Z → r Z) False % 3.46/3.61 Clause #2 (by clausification #[1]): Eq (And (∀ (X : Iota), p X → q X) (Exists fun Y => q Y → r Y)) True % 3.46/3.61 Clause #3 (by clausification #[1]): Eq (Exists fun Z => p Z → r Z) False % 3.46/3.61 Clause #4 (by clausification #[2]): Eq (Exists fun Y => q Y → r Y) True % 3.46/3.61 Clause #5 (by clausification #[2]): Eq (∀ (X : Iota), p X → q X) True % 3.46/3.61 Clause #6 (by clausification #[4]): ∀ (a : Iota), Eq (q (skS.0 0 a) → r (skS.0 0 a)) True % 3.46/3.61 Clause #7 (by clausification #[6]): ∀ (a : Iota), Or (Eq (q (skS.0 0 a)) False) (Eq (r (skS.0 0 a)) True) % 3.46/3.61 Clause #8 (by clausification #[5]): ∀ (a : Iota), Eq (p a → q a) True % 3.46/3.61 Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (p a) False) (Eq (q a) True) % 3.46/3.61 Clause #10 (by clausification #[3]): ∀ (a : Iota), Eq (p a → r a) False % 3.46/3.61 Clause #11 (by clausification #[10]): ∀ (a : Iota), Eq (p a) True % 3.46/3.61 Clause #12 (by clausification #[10]): ∀ (a : Iota), Eq (r a) False % 3.46/3.61 Clause #13 (by superposition #[11, 9]): ∀ (a : Iota), Or (Eq True False) (Eq (q a) True) % 3.46/3.61 Clause #14 (by clausification #[13]): ∀ (a : Iota), Eq (q a) True % 3.46/3.61 Clause #15 (by backward demodulation #[14, 7]): ∀ (a : Iota), Or (Eq True False) (Eq (r (skS.0 0 a)) True) % 3.46/3.61 Clause #17 (by clausification #[15]): ∀ (a : Iota), Eq (r (skS.0 0 a)) True % 3.46/3.61 Clause #18 (by superposition #[17, 12]): Eq True False % 3.46/3.61 Clause #19 (by clausification #[18]): False % 3.46/3.61 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------