TSTP Solution File: SEU802^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU802^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n009.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:43:58 EDT 2023
% Result : Theorem 5.11s 5.29s
% Output : Proof 5.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU802^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.36 % Computer : n009.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 20:08:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.11/5.29 SZS status Theorem for theBenchmark.p
% 5.11/5.29 SZS output start Proof for theBenchmark.p
% 5.11/5.29 Clause #0 (by assumption #[]): Eq (Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A fun Xy => Xphi Xy) → Xphi Xx))
% 5.11/5.29 True
% 5.11/5.29 Clause #2 (by assumption #[]): Eq (Eq surjFuncSet fun A B => dsetconstr (funcSet A B) fun Xf => surjective A B Xf) True
% 5.11/5.29 Clause #3 (by assumption #[]): Eq (Not (dsetconstrER → ∀ (Xx Xy Xf : Iota), in Xf (surjFuncSet Xx Xy) → surjective Xx Xy Xf)) True
% 5.11/5.29 Clause #4 (by betaEtaReduce #[0]): Eq (Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)) True
% 5.11/5.29 Clause #5 (by clausification #[4]): Eq dsetconstrER (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)
% 5.11/5.29 Clause #21 (by clausification #[3]): Eq (dsetconstrER → ∀ (Xx Xy Xf : Iota), in Xf (surjFuncSet Xx Xy) → surjective Xx Xy Xf) False
% 5.11/5.29 Clause #22 (by clausification #[21]): Eq dsetconstrER True
% 5.11/5.29 Clause #23 (by clausification #[21]): Eq (∀ (Xx Xy Xf : Iota), in Xf (surjFuncSet Xx Xy) → surjective Xx Xy Xf) False
% 5.11/5.29 Clause #24 (by backward demodulation #[22, 5]): Eq True (∀ (A : Iota) (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr A Xphi) → Xphi Xx)
% 5.11/5.29 Clause #31 (by clausification #[24]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Prop) (Xx : Iota), in Xx (dsetconstr a Xphi) → Xphi Xx) True
% 5.11/5.29 Clause #32 (by clausification #[31]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (dsetconstr a a_1) → a_1 Xx) True
% 5.11/5.29 Clause #33 (by clausification #[32]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (in a (dsetconstr a_1 a_2) → a_2 a) True
% 5.11/5.29 Clause #34 (by clausification #[33]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (dsetconstr a_1 a_2)) False) (Eq (a_2 a) True)
% 5.11/5.29 Clause #37 (by clausification #[23]): ∀ (a : Iota), Eq (Not (∀ (Xy Xf : Iota), in Xf (surjFuncSet (skS.0 3 a) Xy) → surjective (skS.0 3 a) Xy Xf)) True
% 5.11/5.29 Clause #38 (by clausification #[37]): ∀ (a : Iota), Eq (∀ (Xy Xf : Iota), in Xf (surjFuncSet (skS.0 3 a) Xy) → surjective (skS.0 3 a) Xy Xf) False
% 5.11/5.29 Clause #39 (by clausification #[38]): ∀ (a a_1 : Iota),
% 5.11/5.29 Eq (Not (∀ (Xf : Iota), in Xf (surjFuncSet (skS.0 3 a) (skS.0 4 a a_1)) → surjective (skS.0 3 a) (skS.0 4 a a_1) Xf))
% 5.11/5.29 True
% 5.11/5.29 Clause #40 (by clausification #[39]): ∀ (a a_1 : Iota),
% 5.11/5.29 Eq (∀ (Xf : Iota), in Xf (surjFuncSet (skS.0 3 a) (skS.0 4 a a_1)) → surjective (skS.0 3 a) (skS.0 4 a a_1) Xf) False
% 5.11/5.29 Clause #41 (by clausification #[40]): ∀ (a a_1 a_2 : Iota),
% 5.11/5.29 Eq
% 5.11/5.29 (Not
% 5.11/5.29 (in (skS.0 5 a a_1 a_2) (surjFuncSet (skS.0 3 a) (skS.0 4 a a_1)) →
% 5.11/5.29 surjective (skS.0 3 a) (skS.0 4 a a_1) (skS.0 5 a a_1 a_2)))
% 5.11/5.29 True
% 5.11/5.29 Clause #42 (by clausification #[41]): ∀ (a a_1 a_2 : Iota),
% 5.11/5.29 Eq
% 5.11/5.29 (in (skS.0 5 a a_1 a_2) (surjFuncSet (skS.0 3 a) (skS.0 4 a a_1)) →
% 5.11/5.29 surjective (skS.0 3 a) (skS.0 4 a a_1) (skS.0 5 a a_1 a_2))
% 5.11/5.29 False
% 5.11/5.29 Clause #43 (by clausification #[42]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 5 a a_1 a_2) (surjFuncSet (skS.0 3 a) (skS.0 4 a a_1))) True
% 5.11/5.29 Clause #44 (by clausification #[42]): ∀ (a a_1 a_2 : Iota), Eq (surjective (skS.0 3 a) (skS.0 4 a a_1) (skS.0 5 a a_1 a_2)) False
% 5.11/5.29 Clause #51 (by betaEtaReduce #[2]): Eq (Eq surjFuncSet fun A B => dsetconstr (funcSet A B) (surjective A B)) True
% 5.11/5.29 Clause #52 (by clausification #[51]): Eq surjFuncSet fun A B => dsetconstr (funcSet A B) (surjective A B)
% 5.11/5.29 Clause #53 (by argument congruence #[52]): ∀ (a : Iota), Eq (surjFuncSet a) ((fun A B => dsetconstr (funcSet A B) (surjective A B)) a)
% 5.11/5.29 Clause #59 (by betaEtaReduce #[53]): ∀ (a : Iota), Eq (surjFuncSet a) fun B => dsetconstr (funcSet a B) (surjective a B)
% 5.11/5.29 Clause #60 (by argument congruence #[59]): ∀ (a a_1 : Iota), Eq (surjFuncSet a a_1) ((fun B => dsetconstr (funcSet a B) (surjective a B)) a_1)
% 5.11/5.29 Clause #67 (by betaEtaReduce #[60]): ∀ (a a_1 : Iota), Eq (surjFuncSet a a_1) (dsetconstr (funcSet a a_1) (surjective a a_1))
% 5.11/5.29 Clause #68 (by superposition #[67, 34]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (surjFuncSet a_1 a_2)) False) (Eq (surjective a_1 a_2 a) True)
% 5.11/5.31 Clause #72 (by superposition #[68, 43]): ∀ (a a_1 a_2 : Iota), Or (Eq (surjective (skS.0 3 a) (skS.0 4 a a_1) (skS.0 5 a a_1 a_2)) True) (Eq False True)
% 5.11/5.31 Clause #282 (by clausification #[72]): ∀ (a a_1 a_2 : Iota), Eq (surjective (skS.0 3 a) (skS.0 4 a a_1) (skS.0 5 a a_1 a_2)) True
% 5.11/5.31 Clause #283 (by superposition #[282, 44]): Eq True False
% 5.11/5.31 Clause #293 (by clausification #[283]): False
% 5.11/5.31 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------