%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : COM043_5 : TPTP v9.2.0. Released v6.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n015.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:45:50 PM UTC 2025 % Result : Theorem 4.37s 4.58s % Output : Proof 4.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.14 % Problem : COM043_5 : TPTP v9.2.0. Released v6.0.0. % 0.13/0.15 % Command : duper %s % 0.14/0.37 % Computer : n015.cluster.edu % 0.14/0.37 % Model : x86_64 x86_64 % 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.37 % Memory : 8042.1875MB % 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.37 % CPULimit : 300 % 0.14/0.37 % WCLimit : 300 % 0.14/0.37 % DateTime : Thu Oct 2 15:48:23 EDT 2025 % 0.14/0.37 % CPUTime : % 4.37/4.58 SZS status Theorem for theBenchmark.p % 4.37/4.58 SZS output start Proof for theBenchmark.p % 4.37/4.58 Clause #0 (by assumption #[]): Eq (Eq a (nDvd d l ks)) True % 4.37/4.58 Clause #1 (by assumption #[]): Eq (Eq (div_mod int i (divisor a)) (div_mod int j (divisor a))) True % 4.37/4.58 Clause #63 (by assumption #[]): Eq (∀ (Ks1 : list int) (I D : int), Eq (divisor (nDvd D I Ks1)) D) True % 4.37/4.58 Clause #134 (by assumption #[]): Eq (Not (Eq (div_mod int i d) (div_mod int j d))) True % 4.37/4.58 Clause #135 (by clausification #[0]): Eq a (nDvd d l ks) % 4.37/4.58 Clause #136 (by clausification #[1]): Eq (div_mod int i (divisor a)) (div_mod int j (divisor a)) % 4.37/4.58 Clause #286 (by clausification #[134]): Eq (Eq (div_mod int i d) (div_mod int j d)) False % 4.37/4.58 Clause #287 (by clausification #[286]): Ne (div_mod int i d) (div_mod int j d) % 4.37/4.58 Clause #491 (by clausification #[63]): ∀ (a : list int), Eq (∀ (I D : int), Eq (divisor (nDvd D I a)) D) True % 4.37/4.58 Clause #492 (by clausification #[491]): ∀ (a : int) (a_1 : list int), Eq (∀ (D : int), Eq (divisor (nDvd D a a_1)) D) True % 4.37/4.58 Clause #493 (by clausification #[492]): ∀ (a a_1 : int) (a_2 : list int), Eq (Eq (divisor (nDvd a a_1 a_2)) a) True % 4.37/4.58 Clause #494 (by clausification #[493]): ∀ (a a_1 : int) (a_2 : list int), Eq (divisor (nDvd a a_1 a_2)) a % 4.37/4.58 Clause #495 (by superposition #[494, 135]): Eq (divisor a) d % 4.37/4.58 Clause #496 (by backward demodulation #[495, 136]): Eq (div_mod int i d) (div_mod int j (divisor a)) % 4.37/4.58 Clause #510 (by forward demodulation #[496, 495]): Eq (div_mod int i d) (div_mod int j d) % 4.37/4.58 Clause #511 (by forward contextual literal cutting #[510, 287]): False % 4.37/4.58 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------