TSTP Solution File: SEU603^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU603^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n018.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.61s 7.81s
% Output : Proof 7.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU603^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Aug 23 13:16:41 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.61/7.81 SZS status Theorem for theBenchmark.p
% 7.61/7.81 SZS output start Proof for theBenchmark.p
% 7.61/7.81 Clause #0 (by assumption #[]): Eq (Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A fun Xy => Xphi Xy) → Xphi Xx))
% 7.61/7.81 True
% 7.61/7.81 Clause #1 (by assumption #[]): Eq (Eq setminus fun A B => dsetconstr A fun Xx => Not (in Xx B)) True
% 7.61/7.81 Clause #2 (by assumption #[]): Eq (Not (dsetconstrER → ∀ (A B Xx : Iota), in Xx (setminus A B) → Not (in Xx B))) True
% 7.61/7.81 Clause #3 (by betaEtaReduce #[0]): Eq (Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)) True
% 7.61/7.81 Clause #4 (by clausification #[3]): Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)
% 7.61/7.81 Clause #20 (by clausification #[2]): Eq (dsetconstrER → ∀ (A B Xx : Iota), in Xx (setminus A B) → Not (in Xx B)) False
% 7.61/7.81 Clause #21 (by clausification #[20]): Eq dsetconstrER True
% 7.61/7.81 Clause #22 (by clausification #[20]): Eq (∀ (A B Xx : Iota), in Xx (setminus A B) → Not (in Xx B)) False
% 7.61/7.81 Clause #23 (by backward demodulation #[21, 4]): Eq True (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)
% 7.61/7.81 Clause #26 (by clausification #[1]): Eq setminus fun A B => dsetconstr A fun Xx => Not (in Xx B)
% 7.61/7.81 Clause #27 (by argument congruence #[26]): ∀ (a : Iota), Eq (setminus a) ((fun A B => dsetconstr A fun Xx => Not (in Xx B)) a)
% 7.61/7.81 Clause #29 (by clausification #[23]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr a Xphi) → Xphi Xx) True
% 7.61/7.81 Clause #30 (by clausification #[29]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (dsetconstr a a_1) → a_1 Xx) True
% 7.61/7.81 Clause #31 (by clausification #[30]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (in a (dsetconstr a_1 a_2) → a_2 a) True
% 7.61/7.81 Clause #32 (by clausification #[31]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (dsetconstr a_1 a_2)) False) (Eq (a_2 a) True)
% 7.61/7.81 Clause #35 (by clausification #[22]): ∀ (a : Iota), Eq (Not (∀ (B Xx : Iota), in Xx (setminus (skS.0 3 a) B) → Not (in Xx B))) True
% 7.61/7.81 Clause #36 (by clausification #[35]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), in Xx (setminus (skS.0 3 a) B) → Not (in Xx B)) False
% 7.61/7.81 Clause #37 (by clausification #[36]): ∀ (a a_1 : Iota),
% 7.61/7.81 Eq (Not (∀ (Xx : Iota), in Xx (setminus (skS.0 3 a) (skS.0 4 a a_1)) → Not (in Xx (skS.0 4 a a_1)))) True
% 7.61/7.81 Clause #38 (by clausification #[37]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), in Xx (setminus (skS.0 3 a) (skS.0 4 a a_1)) → Not (in Xx (skS.0 4 a a_1))) False
% 7.61/7.81 Clause #39 (by clausification #[38]): ∀ (a a_1 a_2 : Iota),
% 7.61/7.81 Eq
% 7.61/7.81 (Not (in (skS.0 5 a a_1 a_2) (setminus (skS.0 3 a) (skS.0 4 a a_1)) → Not (in (skS.0 5 a a_1 a_2) (skS.0 4 a a_1))))
% 7.61/7.81 True
% 7.61/7.81 Clause #40 (by clausification #[39]): ∀ (a a_1 a_2 : Iota),
% 7.61/7.81 Eq (in (skS.0 5 a a_1 a_2) (setminus (skS.0 3 a) (skS.0 4 a a_1)) → Not (in (skS.0 5 a a_1 a_2) (skS.0 4 a a_1)))
% 7.61/7.81 False
% 7.61/7.81 Clause #41 (by clausification #[40]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 5 a a_1 a_2) (setminus (skS.0 3 a) (skS.0 4 a a_1))) True
% 7.61/7.81 Clause #42 (by clausification #[40]): ∀ (a a_1 a_2 : Iota), Eq (Not (in (skS.0 5 a a_1 a_2) (skS.0 4 a a_1))) False
% 7.61/7.81 Clause #49 (by betaEtaReduce #[27]): ∀ (a : Iota), Eq (setminus a) fun B => dsetconstr a fun Xx => Not (in Xx B)
% 7.61/7.81 Clause #50 (by argument congruence #[49]): ∀ (a a_1 : Iota), Eq (setminus a a_1) ((fun B => dsetconstr a fun Xx => Not (in Xx B)) a_1)
% 7.61/7.81 Clause #58 (by betaEtaReduce #[50]): ∀ (a a_1 : Iota), Eq (setminus a a_1) (dsetconstr a fun Xx => Not (in Xx a_1))
% 7.61/7.81 Clause #60 (by superposition #[58, 32]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (setminus a_1 a_2)) False) (Eq (Not (in a a_2)) True)
% 7.61/7.81 Clause #72 (by clausification #[60]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (setminus a_1 a_2)) False) (Eq (in a a_2) False)
% 7.61/7.81 Clause #73 (by superposition #[72, 41]): ∀ (a a_1 a_2 : Iota), Or (Eq (in (skS.0 5 a a_1 a_2) (skS.0 4 a a_1)) False) (Eq False True)
% 7.61/7.81 Clause #152 (by clausification #[42]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 5 a a_1 a_2) (skS.0 4 a a_1)) True
% 7.61/7.81 Clause #976 (by clausification #[73]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 5 a a_1 a_2) (skS.0 4 a a_1)) False
% 7.61/7.86 Clause #977 (by superposition #[976, 152]): Eq False True
% 7.61/7.86 Clause #978 (by clausification #[977]): False
% 7.61/7.86 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------