%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO159^5 : TPTP v9.2.0. Released v4.0.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:40 PM UTC 2025 % Result : Theorem 3.31s 3.50s % Output : Proof 3.31s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.07 % Problem : SYO159^5 : TPTP v9.2.0. Released v4.0.0. % 0.08/0.08 % Command : duper %s % 0.08/0.28 % Computer : n020.cluster.edu % 0.08/0.28 % Model : x86_64 x86_64 % 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.28 % Memory : 8042.1875MB % 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.28 % CPULimit : 300 % 0.08/0.28 % WCLimit : 300 % 0.08/0.28 % DateTime : Fri Oct 3 13:27:53 EDT 2025 % 0.08/0.28 % CPUTime : % 3.31/3.50 SZS status Theorem for theBenchmark.p % 3.31/3.50 SZS output start Proof for theBenchmark.p % 3.31/3.50 Clause #0 (by assumption #[]): Eq % 3.31/3.50 (Not % 3.31/3.50 (Not (∀ (Xx : Iota), cA Xx → Exists fun Xy => And (cB Xx Xy) (cC Xy)) → % 3.31/3.50 Exists fun Xu => And (cA Xu) (Not (Exists fun Xv => Not (cB Xu Xv → Not (cC Xv)))))) % 3.31/3.50 True % 3.31/3.50 Clause #1 (by clausification #[0]): Eq % 3.31/3.50 (Not (∀ (Xx : Iota), cA Xx → Exists fun Xy => And (cB Xx Xy) (cC Xy)) → % 3.31/3.50 Exists fun Xu => And (cA Xu) (Not (Exists fun Xv => Not (cB Xu Xv → Not (cC Xv))))) % 3.31/3.50 False % 3.31/3.50 Clause #2 (by clausification #[1]): Eq (Not (∀ (Xx : Iota), cA Xx → Exists fun Xy => And (cB Xx Xy) (cC Xy))) True % 3.31/3.50 Clause #3 (by clausification #[1]): Eq (Exists fun Xu => And (cA Xu) (Not (Exists fun Xv => Not (cB Xu Xv → Not (cC Xv))))) False % 3.31/3.50 Clause #4 (by clausification #[2]): Eq (∀ (Xx : Iota), cA Xx → Exists fun Xy => And (cB Xx Xy) (cC Xy)) False % 3.31/3.50 Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (cA (skS.0 0 a) → Exists fun Xy => And (cB (skS.0 0 a) Xy) (cC Xy))) True % 3.31/3.50 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (cA (skS.0 0 a) → Exists fun Xy => And (cB (skS.0 0 a) Xy) (cC Xy)) False % 3.31/3.50 Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (cA (skS.0 0 a)) True % 3.31/3.50 Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (Exists fun Xy => And (cB (skS.0 0 a) Xy) (cC Xy)) False % 3.31/3.50 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (And (cB (skS.0 0 a) a_1) (cC a_1)) False % 3.31/3.50 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (cB (skS.0 0 a) a_1) False) (Eq (cC a_1) False) % 3.31/3.50 Clause #11 (by clausification #[3]): ∀ (a : Iota), Eq (And (cA a) (Not (Exists fun Xv => Not (cB a Xv → Not (cC Xv))))) False % 3.31/3.50 Clause #12 (by clausification #[11]): ∀ (a : Iota), Or (Eq (cA a) False) (Eq (Not (Exists fun Xv => Not (cB a Xv → Not (cC Xv)))) False) % 3.31/3.50 Clause #13 (by clausification #[12]): ∀ (a : Iota), Or (Eq (cA a) False) (Eq (Exists fun Xv => Not (cB a Xv → Not (cC Xv))) True) % 3.31/3.50 Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (cA a) False) (Eq (Not (cB a (skS.0 1 a a_1) → Not (cC (skS.0 1 a a_1)))) True) % 3.31/3.50 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Or (Eq (cA a) False) (Eq (cB a (skS.0 1 a a_1) → Not (cC (skS.0 1 a a_1))) False) % 3.31/3.50 Clause #16 (by clausification #[15]): ∀ (a a_1 : Iota), Or (Eq (cA a) False) (Eq (cB a (skS.0 1 a a_1)) True) % 3.31/3.50 Clause #17 (by clausification #[15]): ∀ (a a_1 : Iota), Or (Eq (cA a) False) (Eq (Not (cC (skS.0 1 a a_1))) False) % 3.31/3.50 Clause #18 (by superposition #[16, 7]): ∀ (a a_1 : Iota), Or (Eq (cB (skS.0 0 a) (skS.0 1 (skS.0 0 a) a_1)) True) (Eq False True) % 3.31/3.50 Clause #19 (by clausification #[17]): ∀ (a a_1 : Iota), Or (Eq (cA a) False) (Eq (cC (skS.0 1 a a_1)) True) % 3.31/3.50 Clause #20 (by superposition #[19, 7]): ∀ (a a_1 : Iota), Or (Eq (cC (skS.0 1 (skS.0 0 a) a_1)) True) (Eq False True) % 3.31/3.50 Clause #21 (by clausification #[20]): ∀ (a a_1 : Iota), Eq (cC (skS.0 1 (skS.0 0 a) a_1)) True % 3.31/3.50 Clause #22 (by clausification #[18]): ∀ (a a_1 : Iota), Eq (cB (skS.0 0 a) (skS.0 1 (skS.0 0 a) a_1)) True % 3.31/3.50 Clause #23 (by superposition #[22, 10]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (cC (skS.0 1 (skS.0 0 a) a_1)) False) % 3.31/3.50 Clause #24 (by clausification #[23]): ∀ (a a_1 : Iota), Eq (cC (skS.0 1 (skS.0 0 a) a_1)) False % 3.31/3.50 Clause #25 (by superposition #[24, 21]): Eq False True % 3.31/3.50 Clause #26 (by clausification #[25]): False % 3.31/3.50 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------