%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM787^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n026.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:57:20 PM UTC 2025 % Result : Theorem 3.44s 3.66s % Output : Proof 3.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM787^1 : TPTP v9.2.0. Released v3.7.0. % 0.11/0.13 % Command : duper %s % 0.14/0.34 % Computer : n026.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Fri Oct 3 06:55:53 EDT 2025 % 0.14/0.34 % CPUTime : % 3.44/3.66 SZS status Theorem for theBenchmark.p % 3.44/3.66 SZS output start Proof for theBenchmark.p % 3.44/3.66 Clause #0 (by assumption #[]): Eq (Not (less x0 y0)) True % 3.44/3.66 Clause #2 (by assumption #[]): Eq (∀ (Xx0 Xy0 : rat), Not (is Xx0 Xy0) → Not (more Xx0 Xy0) → less Xx0 Xy0) True % 3.44/3.66 Clause #3 (by assumption #[]): Eq (Not (Not (more x0 y0) → is x0 y0)) True % 3.44/3.66 Clause #8 (by clausification #[0]): Eq (less x0 y0) False % 3.44/3.66 Clause #9 (by clausification #[3]): Eq (Not (more x0 y0) → is x0 y0) False % 3.44/3.66 Clause #10 (by clausification #[9]): Eq (Not (more x0 y0)) True % 3.44/3.66 Clause #11 (by clausification #[9]): Eq (is x0 y0) False % 3.44/3.66 Clause #12 (by clausification #[10]): Eq (more x0 y0) False % 3.44/3.66 Clause #13 (by clausification #[2]): ∀ (a : rat), Eq (∀ (Xy0 : rat), Not (is a Xy0) → Not (more a Xy0) → less a Xy0) True % 3.44/3.66 Clause #14 (by clausification #[13]): ∀ (a a_1 : rat), Eq (Not (is a a_1) → Not (more a a_1) → less a a_1) True % 3.44/3.66 Clause #15 (by clausification #[14]): ∀ (a a_1 : rat), Or (Eq (Not (is a a_1)) False) (Eq (Not (more a a_1) → less a a_1) True) % 3.44/3.66 Clause #16 (by clausification #[15]): ∀ (a a_1 : rat), Or (Eq (Not (more a a_1) → less a a_1) True) (Eq (is a a_1) True) % 3.44/3.66 Clause #17 (by clausification #[16]): ∀ (a a_1 : rat), Or (Eq (is a a_1) True) (Or (Eq (Not (more a a_1)) False) (Eq (less a a_1) True)) % 3.44/3.66 Clause #18 (by clausification #[17]): ∀ (a a_1 : rat), Or (Eq (is a a_1) True) (Or (Eq (less a a_1) True) (Eq (more a a_1) True)) % 3.44/3.66 Clause #19 (by superposition #[18, 8]): Or (Eq (is x0 y0) True) (Or (Eq (more x0 y0) True) (Eq True False)) % 3.44/3.66 Clause #20 (by clausification #[19]): Or (Eq (is x0 y0) True) (Eq (more x0 y0) True) % 3.44/3.66 Clause #21 (by forward demodulation #[20, 11]): Or (Eq False True) (Eq (more x0 y0) True) % 3.44/3.66 Clause #22 (by clausification #[21]): Eq (more x0 y0) True % 3.44/3.66 Clause #23 (by superposition #[22, 12]): Eq True False % 3.44/3.66 Clause #24 (by clausification #[23]): False % 3.44/3.66 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------