%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYO098^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n016.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:21:30 EDT 2023

% Result   : Theorem 3.63s 3.85s
% Output   : Proof 3.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO098^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13  % Command    : duper %s
% 0.17/0.34  % Computer : n016.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit   : 300
% 0.17/0.34  % WCLimit    : 300
% 0.17/0.34  % DateTime   : Sat Aug 26 03:26:56 EDT 2023
% 0.17/0.35  % CPUTime    : 
% 3.63/3.85  SZS status Theorem for theBenchmark.p
% 3.63/3.85  SZS output start Proof for theBenchmark.p
% 3.63/3.85  Clause #0 (by assumption #[]): Eq
% 3.63/3.85    (Not
% 3.63/3.85      ((∀ (W : Iota), Not (cR W W)) → Exists fun X => Exists fun Y => And (Not (cR X Y)) (cQ Y X → ∀ (Z : Iota), cQ Z Z)))
% 3.63/3.85    True
% 3.63/3.85  Clause #1 (by clausification #[0]): Eq ((∀ (W : Iota), Not (cR W W)) → Exists fun X => Exists fun Y => And (Not (cR X Y)) (cQ Y X → ∀ (Z : Iota), cQ Z Z))
% 3.63/3.85    False
% 3.63/3.85  Clause #2 (by clausification #[1]): Eq (∀ (W : Iota), Not (cR W W)) True
% 3.63/3.85  Clause #3 (by clausification #[1]): Eq (Exists fun X => Exists fun Y => And (Not (cR X Y)) (cQ Y X → ∀ (Z : Iota), cQ Z Z)) False
% 3.63/3.85  Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Not (cR a a)) True
% 3.63/3.85  Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (cR a a) False
% 3.63/3.85  Clause #6 (by clausification #[3]): ∀ (a : Iota), Eq (Exists fun Y => And (Not (cR a Y)) (cQ Y a → ∀ (Z : Iota), cQ Z Z)) False
% 3.63/3.85  Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (And (Not (cR a a_1)) (cQ a_1 a → ∀ (Z : Iota), cQ Z Z)) False
% 3.63/3.85  Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (Not (cR a a_1)) False) (Eq (cQ a_1 a → ∀ (Z : Iota), cQ Z Z) False)
% 3.63/3.85  Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (cQ a a_1 → ∀ (Z : Iota), cQ Z Z) False) (Eq (cR a_1 a) True)
% 3.63/3.85  Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (cR a a_1) True) (Eq (cQ a_1 a) True)
% 3.63/3.85  Clause #11 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (cR a a_1) True) (Eq (∀ (Z : Iota), cQ Z Z) False)
% 3.63/3.85  Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Or (Eq (cR a a_1) True) (Eq (Not (cQ (skS.0 0 a_2) (skS.0 0 a_2))) True)
% 3.63/3.85  Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Or (Eq (cR a a_1) True) (Eq (cQ (skS.0 0 a_2) (skS.0 0 a_2)) False)
% 3.63/3.85  Clause #14 (by superposition #[13, 10]): ∀ (a a_1 a_2 : Iota), Or (Eq (cR a a_1) True) (Or (Eq (cR (skS.0 0 a_2) (skS.0 0 a_2)) True) (Eq False True))
% 3.63/3.85  Clause #15 (by clausification #[14]): ∀ (a a_1 a_2 : Iota), Or (Eq (cR a a_1) True) (Eq (cR (skS.0 0 a_2) (skS.0 0 a_2)) True)
% 3.63/3.85  Clause #17 (by superposition #[15, 5]): ∀ (a a_1 : Iota), Or (Eq (cR a a_1) True) (Eq True False)
% 3.63/3.85  Clause #19 (by clausification #[17]): ∀ (a a_1 : Iota), Eq (cR a a_1) True
% 3.63/3.85  Clause #21 (by superposition #[19, 5]): Eq True False
% 3.63/3.85  Clause #23 (by clausification #[21]): False
% 3.63/3.85  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------