%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYP117^1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n029.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 : Tue May 5 07:11:05 PM UTC 2026 % Result : Theorem 3.35s 3.53s % Output : Proof 3.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SYP117^1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.13 % Command : duper %s % 0.17/0.34 % Computer : n029.cluster.edu % 0.17/0.34 % Model : x86_64 x86_64 % 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.17/0.34 % Memory : 8042.1875MB % 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.17/0.34 % CPULimit : 300 % 0.17/0.34 % WCLimit : 300 % 0.17/0.34 % DateTime : Mon May 4 17:51:14 EDT 2026 % 0.17/0.34 % CPUTime : % 3.35/3.53 SZS status Theorem for theBenchmark.p % 3.35/3.53 SZS output start Proof for theBenchmark.p % 3.35/3.53 Clause #0 (by assumption #[]): Eq (∀ (A : Type), Eq (i A) fun X => X) True % 3.35/3.53 Clause #1 (by assumption #[]): Eq (Not (∀ (A : Type) (X : A), Eq (i A X) X)) True % 3.35/3.53 Clause #2 (by clausification #[0]): ∀ (a : Type), Eq (Eq (i a) fun X => X) True % 3.35/3.53 Clause #3 (by clausification #[2]): ∀ (a : Type), Eq (i a) fun X => X % 3.35/3.53 Clause #4 (by argument congruence #[3]): ∀ (a : Type) (a_1 : a), Eq (i a a_1) ((fun X => X) a_1) % 3.35/3.53 Clause #7 (by betaEtaReduce #[4]): ∀ (a : Type) (a_1 : a), Eq (i a a_1) a_1 % 3.35/3.53 Clause #14 (by clausification #[1]): Eq (∀ (A : Type) (X : A), Eq (i A X) X) False % 3.35/3.53 Clause #15 (by clausification #[14]): ∀ (a : Type), Eq (Not (∀ (X : skS.0 0 a), Eq (i (skS.0 0 a) X) X)) True % 3.35/3.53 Clause #16 (by clausification #[15]): ∀ (a : Type), Eq (∀ (X : skS.0 0 a), Eq (i (skS.0 0 a) X) X) False % 3.35/3.53 Clause #17 (by clausification #[16]): ∀ (a : Type) (a_1 : skS.0 0 a), Eq (Not (Eq (i (skS.0 0 a) (skS.0 1 a a_1)) (skS.0 1 a a_1))) True % 3.35/3.53 Clause #18 (by clausification #[17]): ∀ (a : Type) (a_1 : skS.0 0 a), Eq (Eq (i (skS.0 0 a) (skS.0 1 a a_1)) (skS.0 1 a a_1)) False % 3.35/3.53 Clause #19 (by clausification #[18]): ∀ (a : Type) (a_1 : skS.0 0 a), Ne (i (skS.0 0 a) (skS.0 1 a a_1)) (skS.0 1 a a_1) % 3.35/3.53 Clause #20 (by forward demodulation #[19, 7]): ∀ (a : Type) (a_1 : skS.0 0 a), Ne (skS.0 1 a a_1) (skS.0 1 a a_1) % 3.35/3.53 Clause #21 (by eliminate resolved literals #[20]): False % 3.35/3.53 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------