TSTP Solution File: SEU595^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU595^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n002.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:54 EDT 2023
% Result : Theorem 13.73s 14.10s
% Output : Proof 13.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.16 % Problem : SEU595^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.17 % Command : duper %s
% 0.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8042.1875MB
% 0.12/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Wed Aug 23 15:56:31 EDT 2023
% 0.12/0.37 % CPUTime :
% 13.73/14.10 SZS status Theorem for theBenchmark.p
% 13.73/14.10 SZS output start Proof for theBenchmark.p
% 13.73/14.10 Clause #0 (by assumption #[]): Eq (Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A fun Xy => Xphi Xy) → Xphi Xx))
% 13.73/14.10 True
% 13.73/14.10 Clause #1 (by assumption #[]): Eq (Eq binintersect fun A B => dsetconstr A fun Xx => in Xx B) True
% 13.73/14.10 Clause #2 (by assumption #[]): Eq (Not (dsetconstrER → ∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx B)) True
% 13.73/14.10 Clause #3 (by clausification #[2]): Eq (dsetconstrER → ∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx B) False
% 13.73/14.10 Clause #4 (by clausification #[3]): Eq dsetconstrER True
% 13.73/14.10 Clause #5 (by clausification #[3]): Eq (∀ (A B Xx : Iota), in Xx (binintersect A B) → in Xx B) False
% 13.73/14.10 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (Not (∀ (B Xx : Iota), in Xx (binintersect (skS.0 0 a) B) → in Xx B)) True
% 13.73/14.10 Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), in Xx (binintersect (skS.0 0 a) B) → in Xx B) False
% 13.73/14.10 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota),
% 13.73/14.10 Eq (Not (∀ (Xx : Iota), in Xx (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in Xx (skS.0 1 a a_1))) True
% 13.73/14.10 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), in Xx (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in Xx (skS.0 1 a a_1)) False
% 13.73/14.10 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota),
% 13.73/14.10 Eq (Not (in (skS.0 2 a a_1 a_2) (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)))
% 13.73/14.10 True
% 13.73/14.10 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota),
% 13.73/14.10 Eq (in (skS.0 2 a a_1 a_2) (binintersect (skS.0 0 a) (skS.0 1 a a_1)) → in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) False
% 13.73/14.10 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (binintersect (skS.0 0 a) (skS.0 1 a a_1))) True
% 13.73/14.10 Clause #13 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) False
% 13.73/14.10 Clause #14 (by betaEtaReduce #[0]): Eq (Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)) True
% 13.73/14.10 Clause #15 (by clausification #[14]): Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)
% 13.73/14.10 Clause #16 (by forward demodulation #[15, 4]): Eq True (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)
% 13.73/14.10 Clause #17 (by clausification #[16]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr a Xphi) → Xphi Xx) True
% 13.73/14.10 Clause #18 (by clausification #[17]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (dsetconstr a a_1) → a_1 Xx) True
% 13.73/14.10 Clause #19 (by clausification #[18]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (in a (dsetconstr a_1 a_2) → a_2 a) True
% 13.73/14.10 Clause #20 (by clausification #[19]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (dsetconstr a_1 a_2)) False) (Eq (a_2 a) True)
% 13.73/14.10 Clause #29 (by clausification #[1]): Eq binintersect fun A B => dsetconstr A fun Xx => in Xx B
% 13.73/14.10 Clause #30 (by argument congruence #[29]): ∀ (a : Iota), Eq (binintersect a) ((fun A B => dsetconstr A fun Xx => in Xx B) a)
% 13.73/14.10 Clause #35 (by betaEtaReduce #[30]): ∀ (a : Iota), Eq (binintersect a) fun B => dsetconstr a fun Xx => in Xx B
% 13.73/14.10 Clause #36 (by argument congruence #[35]): ∀ (a a_1 : Iota), Eq (binintersect a a_1) ((fun B => dsetconstr a fun Xx => in Xx B) a_1)
% 13.73/14.10 Clause #44 (by betaEtaReduce #[36]): ∀ (a a_1 : Iota), Eq (binintersect a a_1) (dsetconstr a fun Xx => in Xx a_1)
% 13.73/14.10 Clause #46 (by superposition #[44, 20]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (binintersect a_1 a_2)) False) (Eq (in a a_2) True)
% 13.73/14.10 Clause #59 (by superposition #[46, 12]): ∀ (a a_1 a_2 : Iota), Or (Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) True) (Eq False True)
% 13.73/14.10 Clause #1641 (by clausification #[59]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) True
% 13.73/14.10 Clause #1642 (by superposition #[1641, 13]): Eq True False
% 13.73/14.10 Clause #1664 (by clausification #[1642]): False
% 13.73/14.10 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------