%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SWW469^1 : TPTP v9.2.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n003.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:06:12 PM UTC 2025 % Result : Theorem 4.09s 4.29s % Output : Proof 4.09s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SWW469^1 : TPTP v9.2.0. Released v5.3.0. % 0.11/0.14 % Command : duper %s % 0.13/0.36 % Computer : n003.cluster.edu % 0.13/0.36 % Model : x86_64 x86_64 % 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.36 % Memory : 8042.1875MB % 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.37 % CPULimit : 300 % 0.13/0.37 % WCLimit : 300 % 0.13/0.37 % DateTime : Thu Oct 2 10:27:38 EDT 2025 % 0.13/0.37 % CPUTime : % 4.09/4.29 SZS status Theorem for theBenchmark.p % 4.09/4.29 SZS output start Proof for theBenchmark.p % 4.09/4.29 Clause #0 (by assumption #[]): Eq (Iff hoare_1821564147gleton (Exists fun S => Exists fun T => Ne S T)) True % 4.09/4.29 Clause #3 (by assumption #[]): Eq hoare_1821564147gleton True % 4.09/4.29 Clause #4 (by assumption #[]): Eq (Not (∀ (T : state), Not (∀ (S : state), Eq S T))) True % 4.09/4.29 Clause #6 (by clausification #[4]): Eq (∀ (T : state), Not (∀ (S : state), Eq S T)) False % 4.09/4.29 Clause #7 (by clausification #[6]): ∀ (a : state), Eq (Not (Not (∀ (S : state), Eq S (skS.0 0 a)))) True % 4.09/4.29 Clause #8 (by clausification #[7]): ∀ (a : state), Eq (Not (∀ (S : state), Eq S (skS.0 0 a))) False % 4.09/4.29 Clause #9 (by clausification #[8]): ∀ (a : state), Eq (∀ (S : state), Eq S (skS.0 0 a)) True % 4.09/4.29 Clause #10 (by clausification #[9]): ∀ (a a_1 : state), Eq (Eq a (skS.0 0 a_1)) True % 4.09/4.29 Clause #11 (by clausification #[10]): ∀ (a a_1 : state), Eq a (skS.0 0 a_1) % 4.09/4.29 Clause #12 (by superposition #[11, 11]): ∀ (a a_1 : state), Eq a a_1 % 4.09/4.29 Clause #13 (by betaEtaReduce #[0]): Eq (Iff hoare_1821564147gleton (Exists fun S => Exists (Ne S))) True % 4.09/4.29 Clause #15 (by clausification #[13]): Or (Eq hoare_1821564147gleton False) (Eq (Exists fun S => Exists (Ne S)) True) % 4.09/4.29 Clause #19 (by clausification #[15]): ∀ (a : state), Or (Eq hoare_1821564147gleton False) (Eq (Exists (Ne (skS.0 1 a))) True) % 4.09/4.29 Clause #20 (by clausification #[19]): ∀ (a a_1 : state), Or (Eq hoare_1821564147gleton False) (Eq (Ne (skS.0 1 a) (skS.0 2 a a_1)) True) % 4.09/4.29 Clause #21 (by clausification #[20]): ∀ (a a_1 : state), Or (Eq hoare_1821564147gleton False) (Ne (skS.0 1 a) (skS.0 2 a a_1)) % 4.09/4.29 Clause #22 (by forward demodulation #[21, 3]): ∀ (a a_1 : state), Or (Eq True False) (Ne (skS.0 1 a) (skS.0 2 a a_1)) % 4.09/4.29 Clause #23 (by clausification #[22]): ∀ (a a_1 : state), Ne (skS.0 1 a) (skS.0 2 a a_1) % 4.09/4.29 Clause #24 (by forward contextual literal cutting #[23, 12]): False % 4.09/4.29 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------