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

% Computer : n004.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:22:04 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYO292^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.13  % Command    : duper %s
% 0.13/0.35  % Computer : n004.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 04:09:08 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 3.44/3.63  SZS status Theorem for theBenchmark.p
% 3.44/3.63  SZS output start Proof for theBenchmark.p
% 3.44/3.63  Clause #0 (by assumption #[]): Eq (Not (Exists fun A => ∀ (Xx Xy : Iota), Or (A Xx) (A Xy) → cP Xx Xy)) True
% 3.44/3.63  Clause #1 (by clausification #[0]): Eq (Exists fun A => ∀ (Xx Xy : Iota), Or (A Xx) (A Xy) → cP Xx Xy) False
% 3.44/3.63  Clause #2 (by clausification #[1]): ∀ (a : Iota → Prop), Eq (∀ (Xx Xy : Iota), Or (a Xx) (a Xy) → cP Xx Xy) False
% 3.44/3.63  Clause #3 (by clausification #[2]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Not (∀ (Xy : Iota), Or (a (skS.0 0 a a_1)) (a Xy) → cP (skS.0 0 a a_1) Xy)) True
% 3.44/3.63  Clause #4 (by clausification #[3]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (∀ (Xy : Iota), Or (a (skS.0 0 a a_1)) (a Xy) → cP (skS.0 0 a a_1) Xy) False
% 3.44/3.63  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota),
% 3.44/3.63    Eq (Not (Or (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) → cP (skS.0 0 a a_1) (skS.0 1 a a_1 a_2))) True
% 3.44/3.63  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota),
% 3.44/3.63    Eq (Or (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2)) → cP (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) False
% 3.44/3.63  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Eq (Or (a (skS.0 0 a a_1)) (a (skS.0 1 a a_1 a_2))) True
% 3.44/3.63  Clause #9 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a (skS.0 0 a a_1)) True) (Eq (a (skS.0 1 a a_1 a_2)) True)
% 3.44/3.63  Clause #16 (by equality factoring #[9]): ∀ (a : Prop) (a_1 : Iota), Or (Ne True True) (Eq ((fun x => a) (skS.0 0 (fun x => a) a_1)) True)
% 3.44/3.63  Clause #42 (by betaEtaReduce #[16]): ∀ (a : Prop), Or (Ne True True) (Eq a True)
% 3.44/3.63  Clause #43 (by clausification #[42]): ∀ (a : Prop), Or (Eq a True) (Or (Eq True False) (Eq True False))
% 3.44/3.63  Clause #45 (by clausification #[43]): ∀ (a : Prop), Or (Eq a True) (Eq True False)
% 3.44/3.63  Clause #46 (by clausification #[45]): ∀ (a : Prop), Eq a True
% 3.44/3.63  Clause #47 (by falseElim #[46]): False
% 3.44/3.63  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------