%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN727+1 : TPTP v9.2.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n009.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:03 PM UTC 2025 % Result : Theorem 5.64s 5.82s % Output : Proof 5.64s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN727+1 : TPTP v9.2.0. Released v2.5.0. % 0.03/0.12 % Command : duper %s % 0.12/0.33 % Computer : n009.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Thu Oct 2 15:20:23 EDT 2025 % 0.12/0.33 % CPUTime : % 5.64/5.82 SZS status Theorem for theBenchmark.p % 5.64/5.82 SZS output start Proof for theBenchmark.p % 5.64/5.82 Clause #0 (by assumption #[]): Eq % 5.64/5.82 (Not % 5.64/5.82 (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), (Exists fun Z => likes Y Z) → likes lyle Y) → % 5.64/5.82 Exists fun U => ∀ (V : Iota), likes U V)) % 5.64/5.82 True % 5.64/5.82 Clause #1 (by betaEtaReduce #[0]): Eq % 5.64/5.82 (Not % 5.64/5.82 (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), Exists (likes Y) → likes lyle Y) → % 5.64/5.82 Exists fun U => ∀ (V : Iota), likes U V)) % 5.64/5.82 True % 5.64/5.82 Clause #2 (by clausification #[1]): Eq % 5.64/5.82 (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), Exists (likes Y) → likes lyle Y) → % 5.64/5.82 Exists fun U => ∀ (V : Iota), likes U V) % 5.64/5.82 False % 5.64/5.82 Clause #3 (by clausification #[2]): Eq (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), Exists (likes Y) → likes lyle Y)) True % 5.64/5.82 Clause #4 (by clausification #[2]): Eq (Exists fun U => ∀ (V : Iota), likes U V) False % 5.64/5.82 Clause #5 (by clausification #[3]): Eq (∀ (Y : Iota), Exists (likes Y) → likes lyle Y) True % 5.64/5.82 Clause #6 (by clausification #[3]): Eq (∀ (X : Iota), likes X bruce) True % 5.64/5.82 Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (Exists (likes a) → likes lyle a) True % 5.64/5.82 Clause #8 (by clausification #[7]): ∀ (a : Iota), Or (Eq (Exists (likes a)) False) (Eq (likes lyle a) True) % 5.64/5.82 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (likes lyle a) True) (Eq (likes a a_1) False) % 5.64/5.82 Clause #10 (by clausification #[6]): ∀ (a : Iota), Eq (likes a bruce) True % 5.64/5.82 Clause #11 (by superposition #[10, 9]): ∀ (a : Iota), Or (Eq (likes lyle a) True) (Eq True False) % 5.64/5.82 Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (likes lyle a) True % 5.64/5.82 Clause #13 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (V : Iota), likes a V) False % 5.64/5.82 Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (Not (likes a (skS.0 0 a a_1))) True % 5.64/5.82 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (likes a (skS.0 0 a a_1)) False % 5.64/5.82 Clause #16 (by superposition #[15, 12]): Eq False True % 5.64/5.82 Clause #17 (by clausification #[16]): False % 5.64/5.82 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------