TSTP Solution File: SEU602^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU602^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n006.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 : Thu Aug 31 16:42:56 EDT 2023
% Result : Theorem 7.35s 7.55s
% Output : Proof 7.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU602^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.13 % Command : duper %s
% 0.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Aug 23 16:45:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 7.35/7.55 SZS status Theorem for theBenchmark.p
% 7.35/7.55 SZS output start Proof for theBenchmark.p
% 7.35/7.55 Clause #0 (by assumption #[]): Eq (Eq dsetconstrEL (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A fun Xy => Xphi Xy) → in Xx A))
% 7.35/7.55 True
% 7.35/7.55 Clause #1 (by assumption #[]): Eq (Eq setminus fun A B => dsetconstr A fun Xx => Not (in Xx B)) True
% 7.35/7.55 Clause #2 (by assumption #[]): Eq (Not (dsetconstrEL → ∀ (A B Xx : Iota), in Xx (setminus A B) → in Xx A)) True
% 7.35/7.55 Clause #3 (by clausification #[2]): Eq (dsetconstrEL → ∀ (A B Xx : Iota), in Xx (setminus A B) → in Xx A) False
% 7.35/7.55 Clause #4 (by clausification #[3]): Eq dsetconstrEL True
% 7.35/7.55 Clause #5 (by clausification #[3]): Eq (∀ (A B Xx : Iota), in Xx (setminus A B) → in Xx A) False
% 7.35/7.55 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (Not (∀ (B Xx : Iota), in Xx (setminus (skS.0 0 a) B) → in Xx (skS.0 0 a))) True
% 7.35/7.55 Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), in Xx (setminus (skS.0 0 a) B) → in Xx (skS.0 0 a)) False
% 7.35/7.55 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Eq (Not (∀ (Xx : Iota), in Xx (setminus (skS.0 0 a) (skS.0 1 a a_1)) → in Xx (skS.0 0 a))) True
% 7.35/7.55 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), in Xx (setminus (skS.0 0 a) (skS.0 1 a a_1)) → in Xx (skS.0 0 a)) False
% 7.35/7.55 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota),
% 7.35/7.55 Eq (Not (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1)) → in (skS.0 2 a a_1 a_2) (skS.0 0 a))) True
% 7.35/7.55 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota),
% 7.35/7.55 Eq (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1)) → in (skS.0 2 a a_1 a_2) (skS.0 0 a)) False
% 7.35/7.55 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (setminus (skS.0 0 a) (skS.0 1 a a_1))) True
% 7.35/7.55 Clause #13 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) False
% 7.35/7.55 Clause #14 (by betaEtaReduce #[0]): Eq (Eq dsetconstrEL (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → in Xx A)) True
% 7.35/7.55 Clause #15 (by clausification #[14]): Eq dsetconstrEL (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → in Xx A)
% 7.35/7.55 Clause #16 (by forward demodulation #[15, 4]): Eq True (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → in Xx A)
% 7.35/7.55 Clause #17 (by clausification #[16]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr a Xphi) → in Xx a) True
% 7.35/7.55 Clause #18 (by clausification #[17]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (dsetconstr a a_1) → in Xx a) True
% 7.35/7.55 Clause #19 (by clausification #[18]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (in a (dsetconstr a_1 a_2) → in a a_1) True
% 7.35/7.55 Clause #20 (by clausification #[19]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (dsetconstr a_1 a_2)) False) (Eq (in a a_1) True)
% 7.35/7.55 Clause #21 (by clausification #[1]): Eq setminus fun A B => dsetconstr A fun Xx => Not (in Xx B)
% 7.35/7.55 Clause #22 (by argument congruence #[21]): ∀ (a : Iota), Eq (setminus a) ((fun A B => dsetconstr A fun Xx => Not (in Xx B)) a)
% 7.35/7.55 Clause #24 (by betaEtaReduce #[22]): ∀ (a : Iota), Eq (setminus a) fun B => dsetconstr a fun Xx => Not (in Xx B)
% 7.35/7.55 Clause #25 (by argument congruence #[24]): ∀ (a a_1 : Iota), Eq (setminus a a_1) ((fun B => dsetconstr a fun Xx => Not (in Xx B)) a_1)
% 7.35/7.55 Clause #31 (by betaEtaReduce #[25]): ∀ (a a_1 : Iota), Eq (setminus a a_1) (dsetconstr a fun Xx => Not (in Xx a_1))
% 7.35/7.55 Clause #33 (by superposition #[31, 20]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (setminus a_1 a_2)) False) (Eq (in a a_1) True)
% 7.35/7.55 Clause #40 (by superposition #[33, 12]): ∀ (a a_1 a_2 : Iota), Or (Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True) (Eq False True)
% 7.35/7.55 Clause #1027 (by clausification #[40]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True
% 7.35/7.55 Clause #1028 (by superposition #[1027, 13]): Eq True False
% 7.35/7.55 Clause #1041 (by clausification #[1028]): False
% 7.35/7.55 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------