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