%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM687^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n019.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:04 PM UTC 2025 % Result : Theorem 4.19s 4.35s % Output : Proof 4.19s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM687^1 : TPTP v9.2.0. Released v3.7.0. % 0.03/0.14 % Command : duper %s % 0.15/0.35 % Computer : n019.cluster.edu % 0.15/0.35 % Model : x86_64 x86_64 % 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.35 % Memory : 8042.1875MB % 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.35 % CPULimit : 300 % 0.15/0.35 % WCLimit : 300 % 0.15/0.35 % DateTime : Fri Oct 3 07:28:08 EDT 2025 % 0.15/0.35 % CPUTime : % 4.19/4.35 SZS status Theorem for theBenchmark.p % 4.19/4.35 SZS output start Proof for theBenchmark.p % 4.19/4.35 Clause #0 (by assumption #[]): Eq (Not (more x y) → Eq x y) True % 4.19/4.35 Clause #1 (by assumption #[]): Eq (more z u) True % 4.19/4.35 Clause #3 (by assumption #[]): Eq (∀ (Xx Xy Xz Xu : nat), Eq Xx Xy → more Xz Xu → more (pl Xx Xz) (pl Xy Xu)) True % 4.19/4.35 Clause #4 (by assumption #[]): Eq (∀ (Xx Xy Xz Xu : nat), more Xx Xy → more Xz Xu → more (pl Xx Xz) (pl Xy Xu)) True % 4.19/4.35 Clause #5 (by assumption #[]): Eq (Not (more (pl x z) (pl y u))) True % 4.19/4.35 Clause #10 (by clausification #[0]): Or (Eq (Not (more x y)) False) (Eq (Eq x y) True) % 4.19/4.35 Clause #11 (by clausification #[10]): Or (Eq (Eq x y) True) (Eq (more x y) True) % 4.19/4.35 Clause #12 (by clausification #[11]): Or (Eq (more x y) True) (Eq x y) % 4.19/4.35 Clause #13 (by clausification #[5]): Eq (more (pl x z) (pl y u)) False % 4.19/4.35 Clause #14 (by clausification #[4]): ∀ (a : nat), Eq (∀ (Xy Xz Xu : nat), more a Xy → more Xz Xu → more (pl a Xz) (pl Xy Xu)) True % 4.19/4.35 Clause #15 (by clausification #[14]): ∀ (a a_1 : nat), Eq (∀ (Xz Xu : nat), more a a_1 → more Xz Xu → more (pl a Xz) (pl a_1 Xu)) True % 4.19/4.35 Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 : nat), Eq (∀ (Xu : nat), more a a_1 → more a_2 Xu → more (pl a a_2) (pl a_1 Xu)) True % 4.19/4.35 Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 a_3 : nat), Eq (more a a_1 → more a_2 a_3 → more (pl a a_2) (pl a_1 a_3)) True % 4.19/4.35 Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 a_3 : nat), Or (Eq (more a a_1) False) (Eq (more a_2 a_3 → more (pl a a_2) (pl a_1 a_3)) True) % 4.19/4.35 Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 a_3 : nat), % 4.19/4.35 Or (Eq (more a a_1) False) (Or (Eq (more a_2 a_3) False) (Eq (more (pl a a_2) (pl a_1 a_3)) True)) % 4.19/4.35 Clause #21 (by superposition #[19, 12]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Or (Eq (more (pl x a) (pl y a_1)) True) (Or (Eq False True) (Eq x y))) % 4.19/4.35 Clause #22 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy Xz Xu : nat), Eq a Xy → more Xz Xu → more (pl a Xz) (pl Xy Xu)) True % 4.19/4.35 Clause #23 (by clausification #[22]): ∀ (a a_1 : nat), Eq (∀ (Xz Xu : nat), Eq a a_1 → more Xz Xu → more (pl a Xz) (pl a_1 Xu)) True % 4.19/4.35 Clause #24 (by clausification #[23]): ∀ (a a_1 a_2 : nat), Eq (∀ (Xu : nat), Eq a a_1 → more a_2 Xu → more (pl a a_2) (pl a_1 Xu)) True % 4.19/4.35 Clause #25 (by clausification #[24]): ∀ (a a_1 a_2 a_3 : nat), Eq (Eq a a_1 → more a_2 a_3 → more (pl a a_2) (pl a_1 a_3)) True % 4.19/4.35 Clause #26 (by clausification #[25]): ∀ (a a_1 a_2 a_3 : nat), Or (Eq (Eq a a_1) False) (Eq (more a_2 a_3 → more (pl a a_2) (pl a_1 a_3)) True) % 4.19/4.35 Clause #27 (by clausification #[26]): ∀ (a a_1 a_2 a_3 : nat), Or (Eq (more a a_1 → more (pl a_2 a) (pl a_3 a_1)) True) (Ne a_2 a_3) % 4.19/4.35 Clause #28 (by clausification #[27]): ∀ (a a_1 a_2 a_3 : nat), Or (Ne a a_1) (Or (Eq (more a_2 a_3) False) (Eq (more (pl a a_2) (pl a_1 a_3)) True)) % 4.19/4.35 Clause #29 (by destructive equality resolution #[28]): ∀ (a a_1 a_2 : nat), Or (Eq (more a a_1) False) (Eq (more (pl a_2 a) (pl a_2 a_1)) True) % 4.19/4.35 Clause #30 (by superposition #[29, 1]): ∀ (a : nat), Or (Eq (more (pl a z) (pl a u)) True) (Eq False True) % 4.19/4.35 Clause #32 (by clausification #[30]): ∀ (a : nat), Eq (more (pl a z) (pl a u)) True % 4.19/4.35 Clause #51 (by clausification #[21]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Or (Eq (more (pl x a) (pl y a_1)) True) (Eq x y)) % 4.19/4.35 Clause #52 (by superposition #[51, 1]): Or (Eq (more (pl x z) (pl y u)) True) (Or (Eq x y) (Eq False True)) % 4.19/4.35 Clause #58 (by clausification #[52]): Or (Eq (more (pl x z) (pl y u)) True) (Eq x y) % 4.19/4.35 Clause #59 (by superposition #[58, 13]): Or (Eq x y) (Eq True False) % 4.19/4.35 Clause #64 (by clausification #[59]): Eq x y % 4.19/4.35 Clause #66 (by backward demodulation #[64, 13]): Eq (more (pl y z) (pl y u)) False % 4.19/4.35 Clause #72 (by superposition #[66, 32]): Eq False True % 4.19/4.35 Clause #73 (by clausification #[72]): False % 4.19/4.35 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------