TSTP Solution File: DAT324^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : DAT324^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n016.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 : Wed Aug 30 22:12:48 EDT 2023
% Result : Theorem 3.67s 3.86s
% Output : Proof 3.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.16 % Problem : DAT324^1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.16 % Command : duper %s
% 0.16/0.37 % Computer : n016.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Thu Aug 24 14:35:24 EDT 2023
% 0.16/0.37 % CPUTime :
% 3.67/3.86 SZS status Theorem for theBenchmark.p
% 3.67/3.86 SZS output start Proof for theBenchmark.p
% 3.67/3.86 Clause #0 (by assumption #[]): Eq
% 3.67/3.86 (∀ (A : Type) (A0 : A → Prop),
% 3.67/3.86 «const/sets/FINITE» A A0 →
% 3.67/3.86 And (Eq («const/sets/set_of_list» A («const/sets/list_of_set» A A0)) A0)
% 3.67/3.86 (Eq («const/lists/LENGTH» A («const/sets/list_of_set» A A0)) («const/sets/CARD» A A0)))
% 3.67/3.86 True
% 3.67/3.86 Clause #1 (by assumption #[]): Eq
% 3.67/3.86 (Not
% 3.67/3.86 (∀ (A : Type) (A0 : A → Prop),
% 3.67/3.86 «const/sets/FINITE» A A0 → Eq («const/lists/LENGTH» A («const/sets/list_of_set» A A0)) («const/sets/CARD» A A0)))
% 3.67/3.86 True
% 3.67/3.86 Clause #2 (by clausification #[1]): Eq
% 3.67/3.86 (∀ (A : Type) (A0 : A → Prop),
% 3.67/3.86 «const/sets/FINITE» A A0 → Eq («const/lists/LENGTH» A («const/sets/list_of_set» A A0)) («const/sets/CARD» A A0))
% 3.67/3.86 False
% 3.67/3.86 Clause #3 (by clausification #[2]): ∀ (a : Type),
% 3.67/3.86 Eq
% 3.67/3.86 (Not
% 3.67/3.86 (∀ (A0 : skS.0 0 a → Prop),
% 3.67/3.86 «const/sets/FINITE» (skS.0 0 a) A0 →
% 3.67/3.86 Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) A0))
% 3.67/3.86 («const/sets/CARD» (skS.0 0 a) A0)))
% 3.67/3.86 True
% 3.67/3.86 Clause #4 (by clausification #[3]): ∀ (a : Type),
% 3.67/3.86 Eq
% 3.67/3.86 (∀ (A0 : skS.0 0 a → Prop),
% 3.67/3.86 «const/sets/FINITE» (skS.0 0 a) A0 →
% 3.67/3.86 Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) A0))
% 3.67/3.86 («const/sets/CARD» (skS.0 0 a) A0))
% 3.67/3.86 False
% 3.67/3.86 Clause #5 (by clausification #[4]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.86 Eq
% 3.67/3.86 (Not
% 3.67/3.86 («const/sets/FINITE» (skS.0 0 a) (skS.0 1 a a_1) →
% 3.67/3.86 Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.86 («const/sets/CARD» (skS.0 0 a) (skS.0 1 a a_1))))
% 3.67/3.86 True
% 3.67/3.86 Clause #6 (by clausification #[5]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.86 Eq
% 3.67/3.86 («const/sets/FINITE» (skS.0 0 a) (skS.0 1 a a_1) →
% 3.67/3.86 Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.86 («const/sets/CARD» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.86 False
% 3.67/3.86 Clause #7 (by clausification #[6]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop), Eq («const/sets/FINITE» (skS.0 0 a) (skS.0 1 a a_1)) True
% 3.67/3.86 Clause #8 (by clausification #[6]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.86 Eq
% 3.67/3.86 (Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.86 («const/sets/CARD» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.86 False
% 3.67/3.86 Clause #9 (by clausification #[0]): ∀ (a : Type),
% 3.67/3.86 Eq
% 3.67/3.86 (∀ (A0 : a → Prop),
% 3.67/3.86 «const/sets/FINITE» a A0 →
% 3.67/3.86 And (Eq («const/sets/set_of_list» a («const/sets/list_of_set» a A0)) A0)
% 3.67/3.86 (Eq («const/lists/LENGTH» a («const/sets/list_of_set» a A0)) («const/sets/CARD» a A0)))
% 3.67/3.86 True
% 3.67/3.86 Clause #10 (by clausification #[9]): ∀ (a : Type) (a_1 : a → Prop),
% 3.67/3.86 Eq
% 3.67/3.86 («const/sets/FINITE» a a_1 →
% 3.67/3.86 And (Eq («const/sets/set_of_list» a («const/sets/list_of_set» a a_1)) a_1)
% 3.67/3.86 (Eq («const/lists/LENGTH» a («const/sets/list_of_set» a a_1)) («const/sets/CARD» a a_1)))
% 3.67/3.86 True
% 3.67/3.86 Clause #11 (by clausification #[10]): ∀ (a : Type) (a_1 : a → Prop),
% 3.67/3.86 Or (Eq («const/sets/FINITE» a a_1) False)
% 3.67/3.86 (Eq
% 3.67/3.86 (And (Eq («const/sets/set_of_list» a («const/sets/list_of_set» a a_1)) a_1)
% 3.67/3.86 (Eq («const/lists/LENGTH» a («const/sets/list_of_set» a a_1)) («const/sets/CARD» a a_1)))
% 3.67/3.86 True)
% 3.67/3.86 Clause #12 (by clausification #[11]): ∀ (a : Type) (a_1 : a → Prop),
% 3.67/3.86 Or (Eq («const/sets/FINITE» a a_1) False)
% 3.67/3.86 (Eq (Eq («const/lists/LENGTH» a («const/sets/list_of_set» a a_1)) («const/sets/CARD» a a_1)) True)
% 3.67/3.86 Clause #14 (by clausification #[12]): ∀ (a : Type) (a_1 : a → Prop),
% 3.67/3.86 Or (Eq («const/sets/FINITE» a a_1) False)
% 3.67/3.86 (Eq («const/lists/LENGTH» a («const/sets/list_of_set» a a_1)) («const/sets/CARD» a a_1))
% 3.67/3.86 Clause #15 (by superposition #[14, 7]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.86 Or
% 3.67/3.86 (Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) fun x => skS.0 1 a a_1 x))
% 3.67/3.86 («const/sets/CARD» (skS.0 0 a) fun x => skS.0 1 a a_1 x))
% 3.67/3.87 (Eq False True)
% 3.67/3.87 Clause #23 (by clausification #[8]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.87 Ne («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.87 («const/sets/CARD» (skS.0 0 a) (skS.0 1 a a_1))
% 3.67/3.87 Clause #26 (by betaEtaReduce #[15]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.87 Or
% 3.67/3.87 (Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.87 («const/sets/CARD» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.87 (Eq False True)
% 3.67/3.87 Clause #27 (by clausification #[26]): ∀ (a : Type) (a_1 : skS.0 0 a → Prop),
% 3.67/3.87 Eq («const/lists/LENGTH» (skS.0 0 a) («const/sets/list_of_set» (skS.0 0 a) (skS.0 1 a a_1)))
% 3.67/3.87 («const/sets/CARD» (skS.0 0 a) (skS.0 1 a a_1))
% 3.67/3.87 Clause #28 (by forward contextual literal cutting #[27, 23]): False
% 3.67/3.87 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------