%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM673^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n013.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:01 PM UTC 2025 % Result : Theorem 5.75s 5.99s % Output : Proof 5.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : NUM673^1 : TPTP v9.2.0. Released v3.7.0. % 0.11/0.13 % Command : duper %s % 0.12/0.34 % Computer : n013.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 : Fri Oct 3 07:26:23 EDT 2025 % 0.12/0.34 % CPUTime : % 5.75/5.99 SZS status Theorem for theBenchmark.p % 5.75/5.99 SZS output start Proof for theBenchmark.p % 5.75/5.99 Clause #0 (by assumption #[]): Eq (more x y) True % 5.75/5.99 Clause #1 (by assumption #[]): Eq (∀ (Xx Xy Xz : nat), more Xx Xy → more (pl Xx Xz) (pl Xy Xz)) True % 5.75/5.99 Clause #2 (by assumption #[]): Eq (∀ (Xx Xy : nat), Eq (pl Xx Xy) (pl Xy Xx)) True % 5.75/5.99 Clause #3 (by assumption #[]): Eq (Not (more (pl z x) (pl z y))) True % 5.75/5.99 Clause #4 (by clausification #[3]): Eq (more (pl z x) (pl z y)) False % 5.75/5.99 Clause #5 (by clausification #[2]): ∀ (a : nat), Eq (∀ (Xy : nat), Eq (pl a Xy) (pl Xy a)) True % 5.75/5.99 Clause #6 (by clausification #[5]): ∀ (a a_1 : nat), Eq (Eq (pl a a_1) (pl a_1 a)) True % 5.75/5.99 Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Eq (pl a a_1) (pl a_1 a) % 5.75/5.99 Clause #8 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy Xz : nat), more a Xy → more (pl a Xz) (pl Xy Xz)) True % 5.75/5.99 Clause #9 (by clausification #[8]): ∀ (a a_1 : nat), Eq (∀ (Xz : nat), more a a_1 → more (pl a Xz) (pl a_1 Xz)) True % 5.75/5.99 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : nat), Eq (more a a_1 → more (pl a a_2) (pl a_1 a_2)) True % 5.75/5.99 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : nat), Or (Eq (more a a_1) False) (Eq (more (pl a a_2) (pl a_1 a_2)) True) % 5.75/5.99 Clause #12 (by superposition #[11, 0]): ∀ (a : nat), Or (Eq (more (pl x a) (pl y a)) True) (Eq False True) % 5.75/5.99 Clause #13 (by clausification #[12]): ∀ (a : nat), Eq (more (pl x a) (pl y a)) True % 5.75/5.99 Clause #16 (by superposition #[13, 7]): ∀ (a : nat), Eq (more (pl a x) (pl y a)) True % 5.75/5.99 Clause #24 (by superposition #[16, 7]): ∀ (a : nat), Eq (more (pl a x) (pl a y)) True % 5.75/5.99 Clause #25 (by superposition #[24, 4]): Eq True False % 5.75/5.99 Clause #27 (by clausification #[25]): False % 5.75/5.99 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------