%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM703^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n025.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:08 PM UTC 2025 % Result : Theorem 3.45s 3.65s % Output : Proof 3.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM703^1 : TPTP v9.2.0. Released v3.7.0. % 0.06/0.13 % Command : duper %s % 0.13/0.34 % Computer : n025.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Fri Oct 3 08:41:53 EDT 2025 % 0.13/0.35 % CPUTime : % 3.45/3.65 SZS status Theorem for theBenchmark.p % 3.45/3.65 SZS output start Proof for theBenchmark.p % 3.45/3.65 Clause #0 (by assumption #[]): Eq (more (suc y) x) True % 3.45/3.65 Clause #1 (by assumption #[]): Eq (∀ (Xx Xy : nat), more (pl Xy n_1) Xx → moreis Xy Xx) True % 3.45/3.65 Clause #2 (by assumption #[]): Eq (∀ (Xx : nat), Eq (suc Xx) (pl Xx n_1)) True % 3.45/3.65 Clause #3 (by assumption #[]): Eq (Not (moreis y x)) True % 3.45/3.65 Clause #4 (by clausification #[3]): Eq (moreis y x) False % 3.45/3.65 Clause #5 (by clausification #[1]): ∀ (a : nat), Eq (∀ (Xy : nat), more (pl Xy n_1) a → moreis Xy a) True % 3.45/3.65 Clause #6 (by clausification #[5]): ∀ (a a_1 : nat), Eq (more (pl a n_1) a_1 → moreis a a_1) True % 3.45/3.65 Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Or (Eq (more (pl a n_1) a_1) False) (Eq (moreis a a_1) True) % 3.45/3.65 Clause #8 (by clausification #[2]): ∀ (a : nat), Eq (Eq (suc a) (pl a n_1)) True % 3.45/3.65 Clause #9 (by clausification #[8]): ∀ (a : nat), Eq (suc a) (pl a n_1) % 3.45/3.65 Clause #10 (by backward demodulation #[9, 7]): ∀ (a a_1 : nat), Or (Eq (more (suc a) a_1) False) (Eq (moreis a a_1) True) % 3.45/3.65 Clause #11 (by superposition #[10, 0]): Or (Eq (moreis y x) True) (Eq False True) % 3.45/3.65 Clause #12 (by clausification #[11]): Eq (moreis y x) True % 3.45/3.65 Clause #13 (by superposition #[12, 4]): Eq True False % 3.45/3.65 Clause #14 (by clausification #[13]): False % 3.45/3.65 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------