%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : CSR140^1 : TPTP v9.2.0. Released v4.1.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n022.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:46:52 PM UTC 2025 % Result : Theorem 3.63s 3.81s % Output : Proof 3.63s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.14 % Problem : CSR140^1 : TPTP v9.2.0. Released v4.1.0. % 0.07/0.15 % Command : duper %s % 0.13/0.36 % Computer : n022.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.36 % CPULimit : 300 % 0.13/0.36 % WCLimit : 300 % 0.13/0.36 % DateTime : Thu Oct 2 20:39:53 EDT 2025 % 0.13/0.36 % CPUTime : % 3.63/3.81 SZS status Theorem for theBenchmark.p % 3.63/3.81 SZS output start Proof for theBenchmark.p % 3.63/3.81 Clause #0 (by assumption #[]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lBill_THFTYPE_i) True % 3.63/3.81 Clause #1 (by assumption #[]): Eq (Not (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i)) True % 3.63/3.81 Clause #10 (by assumption #[]): Eq (Not (Exists fun R => Exists fun X => Exists fun Y => And (R X lAnna_THFTYPE_i) (Not (R Y lAnna_THFTYPE_i)))) True % 3.63/3.81 Clause #13 (by clausification #[1]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i) False % 3.63/3.81 Clause #14 (by clausification #[10]): Eq (Exists fun R => Exists fun X => Exists fun Y => And (R X lAnna_THFTYPE_i) (Not (R Y lAnna_THFTYPE_i))) False % 3.63/3.81 Clause #15 (by clausification #[14]): ∀ (a : Iota → Iota → Prop), % 3.63/3.81 Eq (Exists fun X => Exists fun Y => And (a X lAnna_THFTYPE_i) (Not (a Y lAnna_THFTYPE_i))) False % 3.63/3.81 Clause #16 (by clausification #[15]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota), % 3.63/3.81 Eq (Exists fun Y => And (a a_1 lAnna_THFTYPE_i) (Not (a Y lAnna_THFTYPE_i))) False % 3.63/3.81 Clause #17 (by clausification #[16]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota), Eq (And (a a_1 lAnna_THFTYPE_i) (Not (a a_2 lAnna_THFTYPE_i))) False % 3.63/3.81 Clause #18 (by clausification #[17]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota), % 3.63/3.81 Or (Eq (a a_1 lAnna_THFTYPE_i) False) (Eq (Not (a a_2 lAnna_THFTYPE_i)) False) % 3.63/3.81 Clause #19 (by clausification #[18]): ∀ (a : Iota → Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a a_1 lAnna_THFTYPE_i) False) (Eq (a a_2 lAnna_THFTYPE_i) True) % 3.63/3.81 Clause #33 (by superposition #[19, 0]): ∀ (a : Iota), Or (Eq ((fun x x_1 => likes_THFTYPE_IiioI lSue_THFTYPE_i x) a lAnna_THFTYPE_i) True) (Eq False True) % 3.63/3.81 Clause #47 (by betaEtaReduce #[33]): ∀ (a : Iota), Or (Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True) (Eq False True) % 3.63/3.81 Clause #48 (by clausification #[47]): ∀ (a : Iota), Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i a) True % 3.63/3.81 Clause #49 (by superposition #[48, 13]): Eq True False % 3.63/3.81 Clause #52 (by clausification #[49]): False % 3.63/3.81 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------