%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN061+1 : TPTP v9.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n029.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:07:05 PM UTC 2025 % Result : Theorem 3.40s 3.57s % Output : Proof 3.40s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SYN061+1 : TPTP v9.2.0. Released v2.0.0. % 0.14/0.14 % Command : duper %s % 0.14/0.35 % Computer : n029.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % 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 15:47:38 EDT 2025 % 0.14/0.35 % CPUTime : % 3.40/3.57 SZS status Theorem for theBenchmark.p % 3.40/3.57 SZS output start Proof for theBenchmark.p % 3.40/3.57 Clause #0 (by assumption #[]): Eq (Not (Exists fun X => And (big_f X) (Or (big_g X) (big_h X)))) True % 3.40/3.57 Clause #1 (by assumption #[]): Eq (Exists fun X => And (big_i X) (big_f X)) True % 3.40/3.57 Clause #2 (by assumption #[]): Eq (∀ (X : Iota), Not (big_h X) → big_j X) True % 3.40/3.57 Clause #3 (by assumption #[]): Eq (Not (Exists fun X => And (big_i X) (big_j X))) True % 3.40/3.57 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Not (big_h a) → big_j a) True % 3.40/3.57 Clause #5 (by clausification #[4]): ∀ (a : Iota), Or (Eq (Not (big_h a)) False) (Eq (big_j a) True) % 3.40/3.57 Clause #6 (by clausification #[5]): ∀ (a : Iota), Or (Eq (big_j a) True) (Eq (big_h a) True) % 3.40/3.57 Clause #7 (by clausification #[1]): ∀ (a : Iota), Eq (And (big_i (skS.0 0 a)) (big_f (skS.0 0 a))) True % 3.40/3.57 Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (big_f (skS.0 0 a)) True % 3.40/3.57 Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (big_i (skS.0 0 a)) True % 3.40/3.57 Clause #10 (by clausification #[3]): Eq (Exists fun X => And (big_i X) (big_j X)) False % 3.40/3.57 Clause #11 (by clausification #[10]): ∀ (a : Iota), Eq (And (big_i a) (big_j a)) False % 3.40/3.57 Clause #12 (by clausification #[11]): ∀ (a : Iota), Or (Eq (big_i a) False) (Eq (big_j a) False) % 3.40/3.57 Clause #13 (by superposition #[12, 9]): ∀ (a : Iota), Or (Eq (big_j (skS.0 0 a)) False) (Eq False True) % 3.40/3.57 Clause #14 (by clausification #[13]): ∀ (a : Iota), Eq (big_j (skS.0 0 a)) False % 3.40/3.57 Clause #15 (by clausification #[0]): Eq (Exists fun X => And (big_f X) (Or (big_g X) (big_h X))) False % 3.40/3.57 Clause #16 (by clausification #[15]): ∀ (a : Iota), Eq (And (big_f a) (Or (big_g a) (big_h a))) False % 3.40/3.57 Clause #17 (by clausification #[16]): ∀ (a : Iota), Or (Eq (big_f a) False) (Eq (Or (big_g a) (big_h a)) False) % 3.40/3.57 Clause #18 (by clausification #[17]): ∀ (a : Iota), Or (Eq (big_f a) False) (Eq (big_h a) False) % 3.40/3.57 Clause #20 (by superposition #[18, 8]): ∀ (a : Iota), Or (Eq (big_h (skS.0 0 a)) False) (Eq False True) % 3.40/3.57 Clause #23 (by clausification #[20]): ∀ (a : Iota), Eq (big_h (skS.0 0 a)) False % 3.40/3.57 Clause #24 (by superposition #[23, 6]): ∀ (a : Iota), Or (Eq (big_j (skS.0 0 a)) True) (Eq False True) % 3.40/3.57 Clause #25 (by clausification #[24]): ∀ (a : Iota), Eq (big_j (skS.0 0 a)) True % 3.40/3.57 Clause #26 (by superposition #[25, 14]): Eq True False % 3.40/3.57 Clause #27 (by clausification #[26]): False % 3.40/3.57 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------