%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : NLP265_17 : TPTP v9.2.0. Released v8.2.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n001.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:55:58 PM UTC 2025 % Result : Theorem 3.46s 3.69s % Output : Proof 3.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NLP265_17 : TPTP v9.2.0. Released v8.2.0. % 0.06/0.13 % Command : duper %s % 0.12/0.34 % Computer : n001.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Thu Oct 2 10:06:23 EDT 2025 % 0.12/0.34 % CPUTime : % 3.46/3.69 SZS status Theorem for theBenchmark.p % 3.46/3.69 SZS output start Proof for theBenchmark.p % 3.46/3.69 Clause #0 (by assumption #[]): Eq (∀ (W V : «$ki_world»), «$ki_accessible» #idx(b_alice) W V) True % 3.46/3.69 Clause #1 (by assumption #[]): Eq (∀ (W V : «$ki_world»), «$ki_accessible» #idx(b_bob) W V) True % 3.46/3.69 Clause #6 (by assumption #[]): Eq (∀ (W : «$ki_world»), «$ki_accessible» #idx(b_alice) «$ki_local_world» W → bigcity W portland) True % 3.46/3.69 Clause #7 (by assumption #[]): Eq % 3.46/3.69 (∀ (W : «$ki_world»), % 3.46/3.69 «$ki_accessible» #idx(b_alice) «$ki_local_world» W → % 3.46/3.69 ∀ (W0 : «$ki_world»), «$ki_accessible» #idx(b_bob) W W0 → Not (bigcity W0 portland)) % 3.46/3.69 True % 3.46/3.69 Clause #9 (by clausification #[6]): ∀ (a : «$ki_world»), Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a → bigcity a portland) True % 3.46/3.69 Clause #10 (by clausification #[9]): ∀ (a : «$ki_world»), Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) (Eq (bigcity a portland) True) % 3.46/3.69 Clause #15 (by clausification #[1]): ∀ (a : «$ki_world»), Eq (∀ (V : «$ki_world»), «$ki_accessible» #idx(b_bob) a V) True % 3.46/3.69 Clause #16 (by clausification #[15]): ∀ (a a_1 : «$ki_world»), Eq («$ki_accessible» #idx(b_bob) a a_1) True % 3.46/3.69 Clause #17 (by clausification #[0]): ∀ (a : «$ki_world»), Eq (∀ (V : «$ki_world»), «$ki_accessible» #idx(b_alice) a V) True % 3.46/3.69 Clause #18 (by clausification #[17]): ∀ (a a_1 : «$ki_world»), Eq («$ki_accessible» #idx(b_alice) a a_1) True % 3.46/3.69 Clause #19 (by superposition #[18, 10]): ∀ (a : «$ki_world»), Or (Eq True False) (Eq (bigcity a portland) True) % 3.46/3.69 Clause #34 (by clausification #[19]): ∀ (a : «$ki_world»), Eq (bigcity a portland) True % 3.46/3.69 Clause #36 (by clausification #[7]): ∀ (a : «$ki_world»), % 3.46/3.69 Eq % 3.46/3.69 («$ki_accessible» #idx(b_alice) «$ki_local_world» a → % 3.46/3.69 ∀ (W0 : «$ki_world»), «$ki_accessible» #idx(b_bob) a W0 → Not (bigcity W0 portland)) % 3.46/3.69 True % 3.46/3.69 Clause #37 (by clausification #[36]): ∀ (a : «$ki_world»), % 3.46/3.69 Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) % 3.46/3.69 (Eq (∀ (W0 : «$ki_world»), «$ki_accessible» #idx(b_bob) a W0 → Not (bigcity W0 portland)) True) % 3.46/3.69 Clause #38 (by clausification #[37]): ∀ (a a_1 : «$ki_world»), % 3.46/3.69 Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) % 3.46/3.69 (Eq («$ki_accessible» #idx(b_bob) a a_1 → Not (bigcity a_1 portland)) True) % 3.46/3.69 Clause #39 (by clausification #[38]): ∀ (a a_1 : «$ki_world»), % 3.46/3.69 Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) % 3.46/3.69 (Or (Eq («$ki_accessible» #idx(b_bob) a a_1) False) (Eq (Not (bigcity a_1 portland)) True)) % 3.46/3.69 Clause #40 (by clausification #[39]): ∀ (a a_1 : «$ki_world»), % 3.46/3.69 Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) % 3.46/3.69 (Or (Eq («$ki_accessible» #idx(b_bob) a a_1) False) (Eq (bigcity a_1 portland) False)) % 3.46/3.69 Clause #41 (by forward demodulation #[40, 34]): ∀ (a a_1 : «$ki_world»), % 3.46/3.69 Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) % 3.46/3.69 (Or (Eq («$ki_accessible» #idx(b_bob) a a_1) False) (Eq True False)) % 3.46/3.69 Clause #42 (by clausification #[41]): ∀ (a a_1 : «$ki_world»), % 3.46/3.69 Or (Eq («$ki_accessible» #idx(b_alice) «$ki_local_world» a) False) (Eq («$ki_accessible» #idx(b_bob) a a_1) False) % 3.46/3.69 Clause #43 (by superposition #[42, 18]): ∀ (a a_1 : «$ki_world»), Or (Eq («$ki_accessible» #idx(b_bob) a a_1) False) (Eq False True) % 3.46/3.69 Clause #44 (by clausification #[43]): ∀ (a a_1 : «$ki_world»), Eq («$ki_accessible» #idx(b_bob) a a_1) False % 3.46/3.69 Clause #45 (by superposition #[44, 16]): Eq False True % 3.46/3.69 Clause #46 (by clausification #[45]): False % 3.46/3.69 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------