%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM700^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n005.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:07 PM UTC 2025 % Result : Theorem 3.51s 3.68s % Output : Proof 3.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM700^1 : TPTP v9.2.0. Released v3.7.0. % 0.03/0.13 % Command : duper %s % 0.14/0.34 % Computer : n005.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 07:40:53 EDT 2025 % 0.14/0.34 % CPUTime : % 3.51/3.68 SZS status Theorem for theBenchmark.p % 3.51/3.68 SZS output start Proof for theBenchmark.p % 3.51/3.68 Clause #0 (by assumption #[]): Eq (less y (pl x n_1)) True % 3.51/3.68 Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), Not (more Xx Xy) → lessis Xx Xy) True % 3.51/3.68 Clause #2 (by assumption #[]): Eq (∀ (Xx Xy : nat), less Xx Xy → Not (moreis Xx Xy)) True % 3.51/3.68 Clause #3 (by assumption #[]): Eq (∀ (Xx Xy : nat), more Xy Xx → moreis Xy (pl Xx n_1)) True % 3.51/3.68 Clause #4 (by assumption #[]): Eq (Not (lessis y x)) True % 3.51/3.68 Clause #5 (by clausification #[4]): Eq (lessis y x) False % 3.51/3.68 Clause #6 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), Not (more a Xy) → lessis a Xy) True % 3.51/3.68 Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Eq (Not (more a a_1) → lessis a a_1) True % 3.51/3.68 Clause #8 (by clausification #[7]): ∀ (a a_1 : nat), Or (Eq (Not (more a a_1)) False) (Eq (lessis a a_1) True) % 3.51/3.68 Clause #9 (by clausification #[8]): ∀ (a a_1 : nat), Or (Eq (lessis a a_1) True) (Eq (more a a_1) True) % 3.51/3.68 Clause #10 (by superposition #[9, 5]): Or (Eq (more y x) True) (Eq True False) % 3.51/3.68 Clause #11 (by clausification #[10]): Eq (more y x) True % 3.51/3.68 Clause #12 (by clausification #[2]): ∀ (a : nat), Eq (∀ (Xy : nat), less a Xy → Not (moreis a Xy)) True % 3.51/3.68 Clause #13 (by clausification #[12]): ∀ (a a_1 : nat), Eq (less a a_1 → Not (moreis a a_1)) True % 3.51/3.68 Clause #14 (by clausification #[13]): ∀ (a a_1 : nat), Or (Eq (less a a_1) False) (Eq (Not (moreis a a_1)) True) % 3.51/3.68 Clause #15 (by clausification #[14]): ∀ (a a_1 : nat), Or (Eq (less a a_1) False) (Eq (moreis a a_1) False) % 3.51/3.68 Clause #16 (by superposition #[15, 0]): Or (Eq (moreis y (pl x n_1)) False) (Eq False True) % 3.51/3.68 Clause #17 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy : nat), more Xy a → moreis Xy (pl a n_1)) True % 3.51/3.68 Clause #18 (by clausification #[17]): ∀ (a a_1 : nat), Eq (more a a_1 → moreis a (pl a_1 n_1)) True % 3.51/3.68 Clause #19 (by clausification #[18]): ∀ (a a_1 : nat), Or (Eq (more a a_1) False) (Eq (moreis a (pl a_1 n_1)) True) % 3.51/3.68 Clause #20 (by superposition #[19, 11]): Or (Eq (moreis y (pl x n_1)) True) (Eq False True) % 3.51/3.68 Clause #21 (by clausification #[20]): Eq (moreis y (pl x n_1)) True % 3.51/3.68 Clause #22 (by clausification #[16]): Eq (moreis y (pl x n_1)) False % 3.51/3.68 Clause #23 (by superposition #[22, 21]): Eq False True % 3.51/3.68 Clause #24 (by clausification #[23]): False % 3.51/3.68 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------