%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SET599^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n005.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:00:13 PM UTC 2025 % Result : Theorem 3.65s 3.87s % Output : Proof 3.65s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.20 % Problem : SET599^5 : TPTP v9.2.0. Released v4.0.0. % 0.13/0.21 % Command : duper %s % 0.15/0.43 % Computer : n005.cluster.edu % 0.15/0.43 % Model : x86_64 x86_64 % 0.15/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.43 % Memory : 8042.1875MB % 0.15/0.43 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.43 % CPULimit : 300 % 0.15/0.43 % WCLimit : 300 % 0.15/0.43 % DateTime : Thu Oct 2 14:46:23 EDT 2025 % 0.15/0.43 % CPUTime : % 3.65/3.87 SZS status Theorem for theBenchmark.p % 3.65/3.87 SZS output start Proof for theBenchmark.p % 3.65/3.87 Clause #0 (by assumption #[]): Eq (Not (∀ (X Y : a → Prop) (Xx : a), And (X Xx) (Not (Y Xx)) → Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx))))) % 3.65/3.87 True % 3.65/3.87 Clause #1 (by clausification #[0]): Eq (∀ (X Y : a → Prop) (Xx : a), And (X Xx) (Not (Y Xx)) → Or (And (X Xx) (Not (Y Xx))) (And (Y Xx) (Not (X Xx)))) False % 3.65/3.87 Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop), % 3.65/3.87 Eq % 3.65/3.87 (Not % 3.65/3.87 (∀ (Y : a → Prop) (Xx : a), % 3.65/3.87 And (skS.0 0 a_1 Xx) (Not (Y Xx)) → Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx))))) % 3.65/3.87 True % 3.65/3.87 Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop), % 3.65/3.87 Eq % 3.65/3.87 (∀ (Y : a → Prop) (Xx : a), % 3.65/3.87 And (skS.0 0 a_1 Xx) (Not (Y Xx)) → Or (And (skS.0 0 a_1 Xx) (Not (Y Xx))) (And (Y Xx) (Not (skS.0 0 a_1 Xx)))) % 3.65/3.87 False % 3.65/3.87 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop), % 3.65/3.87 Eq % 3.65/3.87 (Not % 3.65/3.87 (∀ (Xx : a), % 3.65/3.87 And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx)) → % 3.65/3.87 Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx))))) % 3.65/3.87 True % 3.65/3.87 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop), % 3.65/3.87 Eq % 3.65/3.87 (∀ (Xx : a), % 3.65/3.87 And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx)) → % 3.65/3.87 Or (And (skS.0 0 a_1 Xx) (Not (skS.0 1 a_1 a_2 Xx))) (And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 0 a_1 Xx)))) % 3.65/3.87 False % 3.65/3.87 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Eq % 3.65/3.87 (Not % 3.65/3.87 (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) → % 3.65/3.87 Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) % 3.65/3.87 (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)))))) % 3.65/3.87 True % 3.65/3.87 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Eq % 3.65/3.87 (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) → % 3.65/3.87 Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) % 3.65/3.87 (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))))) % 3.65/3.87 False % 3.65/3.87 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) True % 3.65/3.87 Clause #9 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Eq % 3.65/3.87 (Or (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) % 3.65/3.87 (And (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3))))) % 3.65/3.87 False % 3.65/3.87 Clause #10 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) True % 3.65/3.87 Clause #11 (by clausification #[8]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) True % 3.65/3.87 Clause #12 (by clausification #[10]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) False % 3.65/3.87 Clause #14 (by clausification #[9]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Eq (And (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)))) False % 3.65/3.87 Clause #18 (by clausification #[14]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Or (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False) (Eq (Not (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3))) False) % 3.65/3.87 Clause #19 (by clausification #[18]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), % 3.65/3.87 Or (Eq (skS.0 0 a_1 (skS.0 2 a_1 a_2 a_3)) False) (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True) % 3.65/3.87 Clause #20 (by forward demodulation #[19, 11]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Or (Eq True False) (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True) % 3.65/3.87 Clause #21 (by clausification #[20]): ∀ (a_1 a_2 : a → Prop) (a_3 : a), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3)) True % 3.65/3.87 Clause #22 (by superposition #[21, 12]): Eq True False % 3.65/3.87 Clause #23 (by clausification #[22]): False % 3.65/3.87 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------