%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SYN727+1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n031.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 02:12:46 EDT 2023

% Result   : Theorem 3.32s 3.55s
% Output   : Proof 3.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : SYN727+1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.14  % Command    : duper %s
% 0.13/0.35  % Computer : n031.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 20:14:53 EDT 2023
% 0.20/0.35  % CPUTime    : 
% 3.32/3.55  SZS status Theorem for theBenchmark.p
% 3.32/3.55  SZS output start Proof for theBenchmark.p
% 3.32/3.55  Clause #0 (by assumption #[]): Eq
% 3.32/3.55    (Not
% 3.32/3.55      (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), (Exists fun Z => likes Y Z) → likes lyle Y) →
% 3.32/3.55        Exists fun U => ∀ (V : Iota), likes U V))
% 3.32/3.55    True
% 3.32/3.55  Clause #1 (by betaEtaReduce #[0]): Eq
% 3.32/3.55    (Not
% 3.32/3.55      (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), Exists (likes Y) → likes lyle Y) →
% 3.32/3.55        Exists fun U => ∀ (V : Iota), likes U V))
% 3.32/3.55    True
% 3.32/3.55  Clause #2 (by clausification #[1]): Eq
% 3.32/3.55    (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), Exists (likes Y) → likes lyle Y) →
% 3.32/3.55      Exists fun U => ∀ (V : Iota), likes U V)
% 3.32/3.55    False
% 3.32/3.55  Clause #3 (by clausification #[2]): Eq (And (∀ (X : Iota), likes X bruce) (∀ (Y : Iota), Exists (likes Y) → likes lyle Y)) True
% 3.32/3.55  Clause #4 (by clausification #[2]): Eq (Exists fun U => ∀ (V : Iota), likes U V) False
% 3.32/3.55  Clause #5 (by clausification #[3]): Eq (∀ (Y : Iota), Exists (likes Y) → likes lyle Y) True
% 3.32/3.55  Clause #6 (by clausification #[3]): Eq (∀ (X : Iota), likes X bruce) True
% 3.32/3.55  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (Exists (likes a) → likes lyle a) True
% 3.32/3.55  Clause #8 (by clausification #[7]): ∀ (a : Iota), Or (Eq (Exists (likes a)) False) (Eq (likes lyle a) True)
% 3.32/3.55  Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (likes lyle a) True) (Eq (likes a a_1) False)
% 3.32/3.55  Clause #10 (by clausification #[6]): ∀ (a : Iota), Eq (likes a bruce) True
% 3.32/3.55  Clause #11 (by superposition #[10, 9]): ∀ (a : Iota), Or (Eq (likes lyle a) True) (Eq True False)
% 3.32/3.55  Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (likes lyle a) True
% 3.32/3.55  Clause #13 (by clausification #[4]): ∀ (a : Iota), Eq (∀ (V : Iota), likes a V) False
% 3.32/3.55  Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (Not (likes a (skS.0 0 a a_1))) True
% 3.32/3.55  Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (likes a (skS.0 0 a a_1)) False
% 3.32/3.55  Clause #16 (by superposition #[15, 12]): Eq False True
% 3.32/3.55  Clause #17 (by clausification #[16]): False
% 3.32/3.55  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------