%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO898_9 : TPTP v8.2.0. Released v8.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n007.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.42s 3.61s
% Output   : Proof 3.42s
% Verified : 
% SZS Type : -

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