%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYO282^5 : TPTP v9.2.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n012.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 08:08:50 PM UTC 2025 % Result : Theorem 3.60s 3.76s % Output : Proof 3.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SYO282^5 : TPTP v9.2.0. Released v4.0.0. % 0.04/0.16 % Command : duper %s % 0.15/0.38 % Computer : n012.cluster.edu % 0.15/0.38 % Model : x86_64 x86_64 % 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.38 % Memory : 8042.1875MB % 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.38 % CPULimit : 300 % 0.15/0.38 % WCLimit : 300 % 0.15/0.38 % DateTime : Fri Oct 3 14:30:53 EDT 2025 % 0.24/0.38 % CPUTime : % 3.60/3.76 SZS status Theorem for theBenchmark.p % 3.60/3.76 SZS output start Proof for theBenchmark.p % 3.60/3.76 Clause #0 (by assumption #[]): Eq (Not (∀ (Xx : b → Prop), Exists fun Xy => (Exists fun Xx0 => Xx Xx0) → Xx Xy)) True % 3.60/3.76 Clause #1 (by betaEtaReduce #[0]): Eq (Not (∀ (Xx : b → Prop), Exists fun Xy => Exists Xx → Xx Xy)) True % 3.60/3.76 Clause #2 (by clausification #[1]): Eq (∀ (Xx : b → Prop), Exists fun Xy => Exists Xx → Xx Xy) False % 3.60/3.76 Clause #3 (by clausification #[2]): ∀ (a : b → Prop), Eq (Not (Exists fun Xy => Exists (skS.0 0 a) → skS.0 0 a Xy)) True % 3.60/3.76 Clause #4 (by clausification #[3]): ∀ (a : b → Prop), Eq (Exists fun Xy => Exists (skS.0 0 a) → skS.0 0 a Xy) False % 3.60/3.76 Clause #5 (by clausification #[4]): ∀ (a : b → Prop) (a_1 : b), Eq (Exists (skS.0 0 a) → skS.0 0 a a_1) False % 3.60/3.76 Clause #6 (by clausification #[5]): ∀ (a : b → Prop), Eq (Exists (skS.0 0 a)) True % 3.60/3.76 Clause #7 (by clausification #[5]): ∀ (a : b → Prop) (a_1 : b), Eq (skS.0 0 a a_1) False % 3.60/3.76 Clause #8 (by clausification #[6]): ∀ (a : b → Prop) (a_1 : b), Eq (skS.0 0 a (skS.0 1 a a_1)) True % 3.60/3.76 Clause #9 (by superposition #[7, 8]): Eq True False % 3.60/3.76 Clause #10 (by clausification #[9]): False % 3.60/3.76 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------