TSTP Solution File: SYO899_8 by Duper---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO899_8 : TPTP v8.2.0. Released v8.2.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 Sep  1 04:23:57 EDT 2023

% Result   : Theorem 3.46s 3.78s
% Output   : Proof 3.46s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO899_8 : TPTP v8.2.0. Released v8.2.0.
% 0.00/0.14  % Command    : duper %s
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat Aug 26 05:10:55 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 3.46/3.78  SZS status Theorem for theBenchmark.p
% 3.46/3.78  SZS output start Proof for theBenchmark.p
% 3.46/3.78  Clause #0 (by assumption #[]): Eq (∀ (W : «$ki_world»), «$ki_accessible» W W) True
% 3.46/3.78  Clause #1 (by assumption #[]): Eq
% 3.46/3.78    (Not
% 3.46/3.78      ((Exists fun W =>
% 3.46/3.78          And («$ki_accessible» «$ki_local_world» W) (p W → ∀ (W0 : «$ki_world»), «$ki_accessible» W W0 → q W0)) →
% 3.46/3.78        (∀ (W : «$ki_world»), «$ki_accessible» «$ki_local_world» W → p W) →
% 3.46/3.78          Exists fun W => And («$ki_accessible» «$ki_local_world» W) (q W)))
% 3.46/3.78    True
% 3.46/3.78  Clause #2 (by clausification #[0]): ∀ (a : «$ki_world»), Eq («$ki_accessible» a a) True
% 3.46/3.78  Clause #3 (by clausification #[1]): Eq
% 3.46/3.78    ((Exists fun W =>
% 3.46/3.78        And («$ki_accessible» «$ki_local_world» W) (p W → ∀ (W0 : «$ki_world»), «$ki_accessible» W W0 → q W0)) →
% 3.46/3.78      (∀ (W : «$ki_world»), «$ki_accessible» «$ki_local_world» W → p W) →
% 3.46/3.78        Exists fun W => And («$ki_accessible» «$ki_local_world» W) (q W))
% 3.46/3.78    False
% 3.46/3.78  Clause #4 (by clausification #[3]): Eq
% 3.46/3.78    (Exists fun W =>
% 3.46/3.78      And («$ki_accessible» «$ki_local_world» W) (p W → ∀ (W0 : «$ki_world»), «$ki_accessible» W W0 → q W0))
% 3.46/3.78    True
% 3.46/3.78  Clause #5 (by clausification #[3]): Eq
% 3.46/3.78    ((∀ (W : «$ki_world»), «$ki_accessible» «$ki_local_world» W → p W) →
% 3.46/3.78      Exists fun W => And («$ki_accessible» «$ki_local_world» W) (q W))
% 3.46/3.78    False
% 3.46/3.78  Clause #6 (by clausification #[4]): ∀ (a : «$ki_world»),
% 3.46/3.78    Eq
% 3.46/3.78      (And («$ki_accessible» «$ki_local_world» (skS.0 0 a))
% 3.46/3.78        (p (skS.0 0 a) → ∀ (W0 : «$ki_world»), «$ki_accessible» (skS.0 0 a) W0 → q W0))
% 3.46/3.78      True
% 3.46/3.78  Clause #7 (by clausification #[6]): ∀ (a : «$ki_world»), Eq (p (skS.0 0 a) → ∀ (W0 : «$ki_world»), «$ki_accessible» (skS.0 0 a) W0 → q W0) True
% 3.46/3.78  Clause #8 (by clausification #[6]): ∀ (a : «$ki_world»), Eq («$ki_accessible» «$ki_local_world» (skS.0 0 a)) True
% 3.46/3.78  Clause #9 (by clausification #[7]): ∀ (a : «$ki_world»),
% 3.46/3.78    Or (Eq (p (skS.0 0 a)) False) (Eq (∀ (W0 : «$ki_world»), «$ki_accessible» (skS.0 0 a) W0 → q W0) True)
% 3.46/3.78  Clause #10 (by clausification #[9]): ∀ (a a_1 : «$ki_world»), Or (Eq (p (skS.0 0 a)) False) (Eq («$ki_accessible» (skS.0 0 a) a_1 → q a_1) True)
% 3.46/3.78  Clause #11 (by clausification #[10]): ∀ (a a_1 : «$ki_world»),
% 3.46/3.78    Or (Eq (p (skS.0 0 a)) False) (Or (Eq («$ki_accessible» (skS.0 0 a) a_1) False) (Eq (q a_1) True))
% 3.46/3.78  Clause #12 (by clausification #[5]): Eq (∀ (W : «$ki_world»), «$ki_accessible» «$ki_local_world» W → p W) True
% 3.46/3.78  Clause #13 (by clausification #[5]): Eq (Exists fun W => And («$ki_accessible» «$ki_local_world» W) (q W)) False
% 3.46/3.78  Clause #14 (by clausification #[12]): ∀ (a : «$ki_world»), Eq («$ki_accessible» «$ki_local_world» a → p a) True
% 3.46/3.78  Clause #15 (by clausification #[14]): ∀ (a : «$ki_world»), Or (Eq («$ki_accessible» «$ki_local_world» a) False) (Eq (p a) True)
% 3.46/3.78  Clause #16 (by superposition #[15, 8]): ∀ (a : «$ki_world»), Or (Eq (p (skS.0 0 a)) True) (Eq False True)
% 3.46/3.78  Clause #19 (by clausification #[13]): ∀ (a : «$ki_world»), Eq (And («$ki_accessible» «$ki_local_world» a) (q a)) False
% 3.46/3.78  Clause #20 (by clausification #[19]): ∀ (a : «$ki_world»), Or (Eq («$ki_accessible» «$ki_local_world» a) False) (Eq (q a) False)
% 3.46/3.78  Clause #21 (by superposition #[20, 8]): ∀ (a : «$ki_world»), Or (Eq (q (skS.0 0 a)) False) (Eq False True)
% 3.46/3.78  Clause #24 (by clausification #[21]): ∀ (a : «$ki_world»), Eq (q (skS.0 0 a)) False
% 3.46/3.78  Clause #25 (by clausification #[16]): ∀ (a : «$ki_world»), Eq (p (skS.0 0 a)) True
% 3.46/3.78  Clause #26 (by backward demodulation #[25, 11]): ∀ (a a_1 : «$ki_world»), Or (Eq True False) (Or (Eq («$ki_accessible» (skS.0 0 a) a_1) False) (Eq (q a_1) True))
% 3.46/3.78  Clause #27 (by clausification #[26]): ∀ (a a_1 : «$ki_world»), Or (Eq («$ki_accessible» (skS.0 0 a) a_1) False) (Eq (q a_1) True)
% 3.46/3.78  Clause #28 (by superposition #[27, 2]): ∀ (a : «$ki_world»), Or (Eq (q (skS.0 0 a)) True) (Eq False True)
% 3.46/3.78  Clause #29 (by clausification #[28]): ∀ (a : «$ki_world»), Eq (q (skS.0 0 a)) True
% 3.46/3.78  Clause #30 (by superposition #[29, 24]): Eq True False
% 3.46/3.78  Clause #31 (by clausification #[30]): False
% 3.46/3.78  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------