%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM690^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n024.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 3.77s 3.93s % Output : Proof 3.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM690^1 : TPTP v9.2.0. Released v3.7.0. % 0.07/0.13 % Command : duper %s % 0.12/0.34 % Computer : n024.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:32:08 EDT 2025 % 0.12/0.34 % CPUTime : % 3.77/3.93 SZS status Theorem for theBenchmark.p % 3.77/3.93 SZS output start Proof for theBenchmark.p % 3.77/3.93 Clause #0 (by assumption #[]): Eq (some fun Xv => diffprop y x Xv) True % 3.77/3.93 Clause #1 (by assumption #[]): Eq (lessis z u) True % 3.77/3.93 Clause #2 (by assumption #[]): Eq % 3.77/3.93 (∀ (Xx Xy Xz Xu : nat), % 3.77/3.93 (some fun Xu => diffprop Xx Xy Xu) → moreis Xz Xu → some fun Xu_0 => diffprop (pl Xx Xz) (pl Xy Xu) Xu_0) % 3.77/3.93 True % 3.77/3.93 Clause #3 (by assumption #[]): Eq (∀ (Xx Xy : nat), lessis Xx Xy → moreis Xy Xx) True % 3.77/3.93 Clause #4 (by assumption #[]): Eq (Not (some fun Xv => diffprop (pl y u) (pl x z) Xv)) True % 3.77/3.93 Clause #5 (by clausification #[3]): ∀ (a : nat), Eq (∀ (Xy : nat), lessis a Xy → moreis Xy a) True % 3.77/3.93 Clause #6 (by clausification #[5]): ∀ (a a_1 : nat), Eq (lessis a a_1 → moreis a_1 a) True % 3.77/3.93 Clause #7 (by clausification #[6]): ∀ (a a_1 : nat), Or (Eq (lessis a a_1) False) (Eq (moreis a_1 a) True) % 3.77/3.93 Clause #8 (by superposition #[7, 1]): Or (Eq (moreis u z) True) (Eq False True) % 3.77/3.93 Clause #9 (by clausification #[8]): Eq (moreis u z) True % 3.77/3.93 Clause #10 (by betaEtaReduce #[0]): Eq (some (diffprop y x)) True % 3.77/3.93 Clause #11 (by betaEtaReduce #[4]): Eq (Not (some (diffprop (pl y u) (pl x z)))) True % 3.77/3.93 Clause #12 (by clausification #[11]): Eq (some (diffprop (pl y u) (pl x z))) False % 3.77/3.93 Clause #13 (by betaEtaReduce #[2]): Eq (∀ (Xx Xy Xz Xu : nat), some (diffprop Xx Xy) → moreis Xz Xu → some (diffprop (pl Xx Xz) (pl Xy Xu))) True % 3.77/3.93 Clause #14 (by clausification #[13]): ∀ (a : nat), Eq (∀ (Xy Xz Xu : nat), some (diffprop a Xy) → moreis Xz Xu → some (diffprop (pl a Xz) (pl Xy Xu))) True % 3.77/3.93 Clause #15 (by clausification #[14]): ∀ (a a_1 : nat), Eq (∀ (Xz Xu : nat), some (diffprop a a_1) → moreis Xz Xu → some (diffprop (pl a Xz) (pl a_1 Xu))) True % 3.77/3.93 Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 : nat), % 3.77/3.93 Eq (∀ (Xu : nat), some (diffprop a a_1) → moreis a_2 Xu → some (diffprop (pl a a_2) (pl a_1 Xu))) True % 3.77/3.93 Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 a_3 : nat), Eq (some (diffprop a a_1) → moreis a_2 a_3 → some (diffprop (pl a a_2) (pl a_1 a_3))) True % 3.77/3.93 Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 a_3 : nat), % 3.77/3.93 Or (Eq (some (diffprop a a_1)) False) (Eq (moreis a_2 a_3 → some (diffprop (pl a a_2) (pl a_1 a_3))) True) % 3.77/3.93 Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 a_3 : nat), % 3.77/3.93 Or (Eq (some (diffprop a a_1)) False) % 3.77/3.93 (Or (Eq (moreis a_2 a_3) False) (Eq (some (diffprop (pl a a_2) (pl a_1 a_3))) True)) % 3.77/3.93 Clause #20 (by superposition #[19, 10]): ∀ (a a_1 : nat), Or (Eq (moreis a a_1) False) (Or (Eq (some (diffprop (pl y a) (pl x a_1))) True) (Eq False True)) % 3.77/3.93 Clause #21 (by clausification #[20]): ∀ (a a_1 : nat), Or (Eq (moreis a a_1) False) (Eq (some (diffprop (pl y a) (pl x a_1))) True) % 3.77/3.93 Clause #22 (by superposition #[21, 9]): Or (Eq (some (diffprop (pl y u) (pl x z))) True) (Eq False True) % 3.77/3.93 Clause #23 (by clausification #[22]): Eq (some (diffprop (pl y u) (pl x z))) True % 3.77/3.93 Clause #24 (by superposition #[23, 12]): Eq True False % 3.77/3.93 Clause #26 (by clausification #[24]): False % 3.77/3.93 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------