TSTP Solution File: SYO092^5 by Duper---1.0

View Problem - Process Solution

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

% Computer : n008.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:29 EDT 2023

% Result   : Theorem 3.39s 3.68s
% Output   : Proof 3.39s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SYO092^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14  % Command    : duper %s
% 0.13/0.36  % Computer : n008.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Sat Aug 26 00:29:32 EDT 2023
% 0.13/0.36  % CPUTime    : 
% 3.39/3.68  SZS status Theorem for theBenchmark.p
% 3.39/3.68  SZS output start Proof for theBenchmark.p
% 3.39/3.68  Clause #0 (by assumption #[]): Eq (Not ((∀ (Xx : Iota), Exists fun Xy => And (cP Xx) (Or (cQ Xy) (cQ Xx))) → Exists fun Xz => And (cP Xz) (cQ Xz)))
% 3.39/3.68    True
% 3.39/3.68  Clause #1 (by clausification #[0]): Eq ((∀ (Xx : Iota), Exists fun Xy => And (cP Xx) (Or (cQ Xy) (cQ Xx))) → Exists fun Xz => And (cP Xz) (cQ Xz)) False
% 3.39/3.68  Clause #2 (by clausification #[1]): Eq (∀ (Xx : Iota), Exists fun Xy => And (cP Xx) (Or (cQ Xy) (cQ Xx))) True
% 3.39/3.68  Clause #3 (by clausification #[1]): Eq (Exists fun Xz => And (cP Xz) (cQ Xz)) False
% 3.39/3.68  Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Exists fun Xy => And (cP a) (Or (cQ Xy) (cQ a))) True
% 3.39/3.68  Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota), Eq (And (cP a) (Or (cQ (skS.0 0 a a_1)) (cQ a))) True
% 3.39/3.68  Clause #6 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Or (cQ (skS.0 0 a a_1)) (cQ a)) True
% 3.39/3.68  Clause #7 (by clausification #[5]): ∀ (a : Iota), Eq (cP a) True
% 3.39/3.68  Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (cQ (skS.0 0 a a_1)) True) (Eq (cQ a) True)
% 3.39/3.68  Clause #9 (by clausification #[3]): ∀ (a : Iota), Eq (And (cP a) (cQ a)) False
% 3.39/3.68  Clause #10 (by clausification #[9]): ∀ (a : Iota), Or (Eq (cP a) False) (Eq (cQ a) False)
% 3.39/3.68  Clause #11 (by superposition #[10, 7]): ∀ (a : Iota), Or (Eq (cQ a) False) (Eq False True)
% 3.39/3.68  Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (cQ a) False
% 3.39/3.68  Clause #13 (by backward demodulation #[12, 8]): ∀ (a a_1 : Iota), Or (Eq (cQ (skS.0 0 a a_1)) True) (Eq False True)
% 3.39/3.68  Clause #15 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (cQ (skS.0 0 a a_1)) True
% 3.39/3.68  Clause #16 (by superposition #[15, 12]): Eq True False
% 3.39/3.68  Clause #17 (by clausification #[16]): False
% 3.39/3.68  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------