%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SET199^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n019.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:59:48 PM UTC 2025 % Result : Theorem 4.20s 4.39s % Output : Proof 4.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SET199^5 : TPTP v9.2.0. Released v4.0.0. % 0.11/0.13 % Command : duper %s % 0.12/0.34 % Computer : n019.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 13:54:23 EDT 2025 % 0.12/0.34 % CPUTime : % 4.20/4.39 SZS status Theorem for theBenchmark.p % 4.20/4.39 SZS output start Proof for theBenchmark.p % 4.20/4.39 Clause #0 (by assumption #[]): Eq % 4.20/4.39 (Not % 4.20/4.39 (∀ (X Y Z : a → Prop), % 4.20/4.39 And (∀ (Xx : a), Z Xx → X Xx) (∀ (Xx : a), Z Xx → Y Xx) → ∀ (Xx : a), Z Xx → Or (X Xx) (Y Xx))) % 4.20/4.39 True % 4.20/4.39 Clause #1 (by clausification #[0]): Eq (∀ (X Y Z : a → Prop), And (∀ (Xx : a), Z Xx → X Xx) (∀ (Xx : a), Z Xx → Y Xx) → ∀ (Xx : a), Z Xx → Or (X Xx) (Y Xx)) % 4.20/4.39 False % 4.20/4.39 Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (Not % 4.20/4.39 (∀ (Y Z : a → Prop), % 4.20/4.39 And (∀ (Xx : a), Z Xx → skS.0 0 a_1 Xx) (∀ (Xx : a), Z Xx → Y Xx) → % 4.20/4.39 ∀ (Xx : a), Z Xx → Or (skS.0 0 a_1 Xx) (Y Xx))) % 4.20/4.39 True % 4.20/4.39 Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (∀ (Y Z : a → Prop), % 4.20/4.39 And (∀ (Xx : a), Z Xx → skS.0 0 a_1 Xx) (∀ (Xx : a), Z Xx → Y Xx) → ∀ (Xx : a), Z Xx → Or (skS.0 0 a_1 Xx) (Y Xx)) % 4.20/4.39 False % 4.20/4.39 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (Not % 4.20/4.39 (∀ (Z : a → Prop), % 4.20/4.39 And (∀ (Xx : a), Z Xx → skS.0 0 a_1 Xx) (∀ (Xx : a), Z Xx → skS.0 1 a_1 a_2 Xx) → % 4.20/4.39 ∀ (Xx : a), Z Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))) % 4.20/4.39 True % 4.20/4.39 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (∀ (Z : a → Prop), % 4.20/4.39 And (∀ (Xx : a), Z Xx → skS.0 0 a_1 Xx) (∀ (Xx : a), Z Xx → skS.0 1 a_1 a_2 Xx) → % 4.20/4.39 ∀ (Xx : a), Z Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) % 4.20/4.39 False % 4.20/4.39 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 a_3 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (Not % 4.20/4.39 (And (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 0 a_1 Xx) % 4.20/4.39 (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 1 a_1 a_2 Xx) → % 4.20/4.39 ∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx))) % 4.20/4.39 True % 4.20/4.39 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 a_3 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (And (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 0 a_1 Xx) % 4.20/4.39 (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 1 a_1 a_2 Xx) → % 4.20/4.39 ∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) % 4.20/4.39 False % 4.20/4.39 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a → Prop), % 4.20/4.39 Eq % 4.20/4.39 (And (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 0 a_1 Xx) % 4.20/4.39 (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 1 a_1 a_2 Xx)) % 4.20/4.39 True % 4.20/4.39 Clause #9 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a → Prop), Eq (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → Or (skS.0 0 a_1 Xx) (skS.0 1 a_1 a_2 Xx)) False % 4.20/4.39 Clause #10 (by clausification #[8]): ∀ (a_1 a_2 a_3 : a → Prop), Eq (∀ (Xx : a), skS.0 2 a_1 a_2 a_3 Xx → skS.0 1 a_1 a_2 Xx) True % 4.20/4.39 Clause #12 (by clausification #[10]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 2 a_1 a_2 a_3 a_4 → skS.0 1 a_1 a_2 a_4) True % 4.20/4.39 Clause #13 (by clausification #[12]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Or (Eq (skS.0 2 a_1 a_2 a_3 a_4) False) (Eq (skS.0 1 a_1 a_2 a_4) True) % 4.20/4.39 Clause #16 (by clausification #[9]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), % 4.20/4.39 Eq % 4.20/4.39 (Not % 4.20/4.39 (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4) → % 4.20/4.39 Or (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)))) % 4.20/4.39 True % 4.20/4.39 Clause #17 (by clausification #[16]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), % 4.20/4.39 Eq % 4.20/4.39 (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4) → % 4.20/4.39 Or (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4))) % 4.20/4.39 False % 4.20/4.39 Clause #18 (by clausification #[17]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) True % 4.20/4.39 Clause #19 (by clausification #[17]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), % 4.20/4.39 Eq (Or (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4))) False % 4.20/4.39 Clause #20 (by superposition #[18, 13]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Or (Eq True False) (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) True) % 4.20/4.39 Clause #23 (by clausification #[20]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) True % 4.20/4.39 Clause #24 (by clausification #[19]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) False % 4.20/4.39 Clause #26 (by superposition #[24, 23]): Eq False True % 4.20/4.39 Clause #27 (by clausification #[26]): False % 4.20/4.39 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------