%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NUM760^1 : TPTP v9.2.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n018.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:16 PM UTC 2025 % Result : Theorem 3.95s 4.11s % Output : Proof 3.95s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM760^1 : TPTP v9.2.0. Released v3.7.0. % 0.06/0.13 % Command : duper %s % 0.13/0.34 % Computer : n018.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Fri Oct 3 06:51:08 EDT 2025 % 0.13/0.34 % CPUTime : % 3.95/4.11 SZS status Theorem for theBenchmark.p % 3.95/4.11 SZS output start Proof for theBenchmark.p % 3.95/4.11 Clause #0 (by assumption #[]): Eq (moref x y) True % 3.95/4.11 Clause #1 (by assumption #[]): Eq (moref z u) True % 3.95/4.11 Clause #2 (by assumption #[]): Eq (∀ (Xx Xy : frac), lessf Xx Xy → moref Xy Xx) True % 3.95/4.11 Clause #3 (by assumption #[]): Eq (∀ (Xx Xy Xz : frac), lessf Xx Xy → lessf Xy Xz → lessf Xx Xz) True % 3.95/4.11 Clause #4 (by assumption #[]): Eq (∀ (Xx Xy : frac), moref Xx Xy → lessf Xy Xx) True % 3.95/4.11 Clause #5 (by assumption #[]): Eq (∀ (Xx Xy Xz Xu : frac), moref Xx Xy → eq Xx Xz → eq Xy Xu → moref Xz Xu) True % 3.95/4.11 Clause #6 (by assumption #[]): Eq (∀ (Xx Xy Xz : frac), moref Xx Xy → moref (pf Xx Xz) (pf Xy Xz)) True % 3.95/4.11 Clause #7 (by assumption #[]): Eq (∀ (Xx Xy : frac), eq (pf Xx Xy) (pf Xy Xx)) True % 3.95/4.11 Clause #8 (by assumption #[]): Eq (Not (moref (pf x z) (pf y u))) True % 3.95/4.11 Clause #9 (by clausification #[2]): ∀ (a : frac), Eq (∀ (Xy : frac), lessf a Xy → moref Xy a) True % 3.95/4.11 Clause #10 (by clausification #[9]): ∀ (a a_1 : frac), Eq (lessf a a_1 → moref a_1 a) True % 3.95/4.11 Clause #11 (by clausification #[10]): ∀ (a a_1 : frac), Or (Eq (lessf a a_1) False) (Eq (moref a_1 a) True) % 3.95/4.11 Clause #12 (by clausification #[4]): ∀ (a : frac), Eq (∀ (Xy : frac), moref a Xy → lessf Xy a) True % 3.95/4.11 Clause #13 (by clausification #[12]): ∀ (a a_1 : frac), Eq (moref a a_1 → lessf a_1 a) True % 3.95/4.11 Clause #14 (by clausification #[13]): ∀ (a a_1 : frac), Or (Eq (moref a a_1) False) (Eq (lessf a_1 a) True) % 3.95/4.11 Clause #19 (by clausification #[3]): ∀ (a : frac), Eq (∀ (Xy Xz : frac), lessf a Xy → lessf Xy Xz → lessf a Xz) True % 3.95/4.11 Clause #20 (by clausification #[19]): ∀ (a a_1 : frac), Eq (∀ (Xz : frac), lessf a a_1 → lessf a_1 Xz → lessf a Xz) True % 3.95/4.11 Clause #21 (by clausification #[20]): ∀ (a a_1 a_2 : frac), Eq (lessf a a_1 → lessf a_1 a_2 → lessf a a_2) True % 3.95/4.11 Clause #22 (by clausification #[21]): ∀ (a a_1 a_2 : frac), Or (Eq (lessf a a_1) False) (Eq (lessf a_1 a_2 → lessf a a_2) True) % 3.95/4.11 Clause #23 (by clausification #[22]): ∀ (a a_1 a_2 : frac), Or (Eq (lessf a a_1) False) (Or (Eq (lessf a_1 a_2) False) (Eq (lessf a a_2) True)) % 3.95/4.11 Clause #28 (by clausification #[8]): Eq (moref (pf x z) (pf y u)) False % 3.95/4.11 Clause #30 (by clausification #[5]): ∀ (a : frac), Eq (∀ (Xy Xz Xu : frac), moref a Xy → eq a Xz → eq Xy Xu → moref Xz Xu) True % 3.95/4.11 Clause #31 (by clausification #[30]): ∀ (a a_1 : frac), Eq (∀ (Xz Xu : frac), moref a a_1 → eq a Xz → eq a_1 Xu → moref Xz Xu) True % 3.95/4.11 Clause #32 (by clausification #[31]): ∀ (a a_1 a_2 : frac), Eq (∀ (Xu : frac), moref a a_1 → eq a a_2 → eq a_1 Xu → moref a_2 Xu) True % 3.95/4.11 Clause #33 (by clausification #[32]): ∀ (a a_1 a_2 a_3 : frac), Eq (moref a a_1 → eq a a_2 → eq a_1 a_3 → moref a_2 a_3) True % 3.95/4.11 Clause #34 (by clausification #[33]): ∀ (a a_1 a_2 a_3 : frac), Or (Eq (moref a a_1) False) (Eq (eq a a_2 → eq a_1 a_3 → moref a_2 a_3) True) % 3.95/4.11 Clause #35 (by clausification #[34]): ∀ (a a_1 a_2 a_3 : frac), Or (Eq (moref a a_1) False) (Or (Eq (eq a a_2) False) (Eq (eq a_1 a_3 → moref a_2 a_3) True)) % 3.95/4.11 Clause #36 (by clausification #[35]): ∀ (a a_1 a_2 a_3 : frac), % 3.95/4.11 Or (Eq (moref a a_1) False) (Or (Eq (eq a a_2) False) (Or (Eq (eq a_1 a_3) False) (Eq (moref a_2 a_3) True))) % 3.95/4.11 Clause #40 (by clausification #[7]): ∀ (a : frac), Eq (∀ (Xy : frac), eq (pf a Xy) (pf Xy a)) True % 3.95/4.11 Clause #41 (by clausification #[40]): ∀ (a a_1 : frac), Eq (eq (pf a a_1) (pf a_1 a)) True % 3.95/4.11 Clause #42 (by clausification #[6]): ∀ (a : frac), Eq (∀ (Xy Xz : frac), moref a Xy → moref (pf a Xz) (pf Xy Xz)) True % 3.95/4.11 Clause #43 (by clausification #[42]): ∀ (a a_1 : frac), Eq (∀ (Xz : frac), moref a a_1 → moref (pf a Xz) (pf a_1 Xz)) True % 3.95/4.11 Clause #44 (by clausification #[43]): ∀ (a a_1 a_2 : frac), Eq (moref a a_1 → moref (pf a a_2) (pf a_1 a_2)) True % 3.95/4.11 Clause #45 (by clausification #[44]): ∀ (a a_1 a_2 : frac), Or (Eq (moref a a_1) False) (Eq (moref (pf a a_2) (pf a_1 a_2)) True) % 3.95/4.11 Clause #46 (by superposition #[45, 1]): ∀ (a : frac), Or (Eq (moref (pf z a) (pf u a)) True) (Eq False True) % 3.95/4.11 Clause #47 (by superposition #[45, 0]): ∀ (a : frac), Or (Eq (moref (pf x a) (pf y a)) True) (Eq False True) % 3.95/4.13 Clause #48 (by clausification #[47]): ∀ (a : frac), Eq (moref (pf x a) (pf y a)) True % 3.95/4.13 Clause #49 (by superposition #[48, 14]): ∀ (a : frac), Or (Eq True False) (Eq (lessf (pf y a) (pf x a)) True) % 3.95/4.13 Clause #52 (by clausification #[49]): ∀ (a : frac), Eq (lessf (pf y a) (pf x a)) True % 3.95/4.13 Clause #54 (by superposition #[52, 23]): ∀ (a a_1 : frac), Or (Eq True False) (Or (Eq (lessf (pf x a) a_1) False) (Eq (lessf (pf y a) a_1) True)) % 3.95/4.13 Clause #56 (by clausification #[46]): ∀ (a : frac), Eq (moref (pf z a) (pf u a)) True % 3.95/4.13 Clause #58 (by superposition #[56, 36]): ∀ (a a_1 a_2 : frac), % 3.95/4.13 Or (Eq True False) (Or (Eq (eq (pf z a) a_1) False) (Or (Eq (eq (pf u a) a_2) False) (Eq (moref a_1 a_2) True))) % 3.95/4.13 Clause #76 (by clausification #[54]): ∀ (a a_1 : frac), Or (Eq (lessf (pf x a) a_1) False) (Eq (lessf (pf y a) a_1) True) % 3.95/4.13 Clause #94 (by clausification #[58]): ∀ (a a_1 a_2 : frac), Or (Eq (eq (pf z a) a_1) False) (Or (Eq (eq (pf u a) a_2) False) (Eq (moref a_1 a_2) True)) % 3.95/4.13 Clause #95 (by superposition #[94, 41]): ∀ (a a_1 : frac), Or (Eq (eq (pf u a) a_1) False) (Or (Eq (moref (pf a z) a_1) True) (Eq False True)) % 3.95/4.13 Clause #113 (by clausification #[95]): ∀ (a a_1 : frac), Or (Eq (eq (pf u a) a_1) False) (Eq (moref (pf a z) a_1) True) % 3.95/4.13 Clause #114 (by superposition #[113, 41]): ∀ (a : frac), Or (Eq (moref (pf a z) (pf a u)) True) (Eq False True) % 3.95/4.13 Clause #115 (by clausification #[114]): ∀ (a : frac), Eq (moref (pf a z) (pf a u)) True % 3.95/4.13 Clause #116 (by superposition #[115, 14]): ∀ (a : frac), Or (Eq True False) (Eq (lessf (pf a u) (pf a z)) True) % 3.95/4.13 Clause #119 (by clausification #[116]): ∀ (a : frac), Eq (lessf (pf a u) (pf a z)) True % 3.95/4.13 Clause #120 (by superposition #[119, 76]): Or (Eq True False) (Eq (lessf (pf y u) (pf x z)) True) % 3.95/4.13 Clause #124 (by clausification #[120]): Eq (lessf (pf y u) (pf x z)) True % 3.95/4.13 Clause #125 (by superposition #[124, 11]): Or (Eq True False) (Eq (moref (pf x z) (pf y u)) True) % 3.95/4.13 Clause #131 (by clausification #[125]): Eq (moref (pf x z) (pf y u)) True % 3.95/4.13 Clause #132 (by superposition #[131, 28]): Eq True False % 3.95/4.13 Clause #135 (by clausification #[132]): False % 3.95/4.13 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------