%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : ITP033^1 : TPTP v9.2.0. Released v7.5.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n027.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:51:04 PM UTC 2025 % Result : Theorem 5.16s 5.38s % Output : Proof 5.16s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : ITP033^1 : TPTP v9.2.0. Released v7.5.0. % 0.12/0.13 % Command : duper %s % 0.13/0.35 % Computer : n027.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % 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 : Thu Oct 2 22:34:23 EDT 2025 % 0.13/0.35 % CPUTime : % 5.16/5.38 SZS status Theorem for theBenchmark.p % 5.16/5.38 SZS output start Proof for theBenchmark.p % 5.16/5.38 Clause #1 (by assumption #[]): Eq (binary1721989714Tree_a h (binary717961607le_T_a t1 x t2)) True % 5.16/5.38 Clause #3 (by assumption #[]): Eq % 5.16/5.38 (∀ (H : a → int) (T1 : binary1439146945Tree_a) (X : a) (T2 : binary1439146945Tree_a), % 5.16/5.38 binary1721989714Tree_a H (binary717961607le_T_a T1 X T2) → binary1721989714Tree_a H T1) % 5.16/5.38 True % 5.16/5.38 Clause #272 (by assumption #[]): Eq (Not (binary1721989714Tree_a h t1)) True % 5.16/5.38 Clause #273 (by clausification #[272]): Eq (binary1721989714Tree_a h t1) False % 5.16/5.38 Clause #340 (by clausification #[3]): ∀ (a_1 : a → int), % 5.16/5.38 Eq % 5.16/5.38 (∀ (T1 : binary1439146945Tree_a) (X : a) (T2 : binary1439146945Tree_a), % 5.16/5.38 binary1721989714Tree_a a_1 (binary717961607le_T_a T1 X T2) → binary1721989714Tree_a a_1 T1) % 5.16/5.38 True % 5.16/5.38 Clause #341 (by clausification #[340]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a), % 5.16/5.38 Eq % 5.16/5.38 (∀ (X : a) (T2 : binary1439146945Tree_a), % 5.16/5.38 binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 X T2) → binary1721989714Tree_a a_1 a_2) % 5.16/5.38 True % 5.16/5.38 Clause #342 (by clausification #[341]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a) (a : a), % 5.16/5.38 Eq % 5.16/5.38 (∀ (T2 : binary1439146945Tree_a), % 5.16/5.38 binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 a T2) → binary1721989714Tree_a a_1 a_2) % 5.16/5.38 True % 5.16/5.38 Clause #343 (by clausification #[342]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a) (a : a) (a_3 : binary1439146945Tree_a), % 5.16/5.38 Eq (binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 a a_3) → binary1721989714Tree_a a_1 a_2) True % 5.16/5.38 Clause #344 (by clausification #[343]): ∀ (a_1 : a → int) (a_2 : binary1439146945Tree_a) (a : a) (a_3 : binary1439146945Tree_a), % 5.16/5.38 Or (Eq (binary1721989714Tree_a a_1 (binary717961607le_T_a a_2 a a_3)) False) % 5.16/5.38 (Eq (binary1721989714Tree_a a_1 a_2) True) % 5.16/5.38 Clause #345 (by superposition #[344, 1]): Or (Eq (binary1721989714Tree_a (fun x => h x) t1) True) (Eq False True) % 5.16/5.38 Clause #1019 (by betaEtaReduce #[345]): Or (Eq (binary1721989714Tree_a h t1) True) (Eq False True) % 5.16/5.38 Clause #1020 (by clausification #[1019]): Eq (binary1721989714Tree_a h t1) True % 5.16/5.38 Clause #1021 (by superposition #[1020, 273]): Eq True False % 5.16/5.38 Clause #1031 (by clausification #[1021]): False % 5.16/5.38 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------