TSTP Solution File: SEV445^1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEV445^1 : TPTP v8.1.2. Released v7.0.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 19:25:00 EDT 2023
% Result : Theorem 3.71s 3.91s
% Output : Proof 3.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEV445^1 : TPTP v8.1.2. Released v7.0.0.
% 0.00/0.13 % Command : duper %s
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 24 03:12:12 EDT 2023
% 0.14/0.34 % CPUTime :
% 3.71/3.91 SZS status Theorem for theBenchmark.p
% 3.71/3.91 SZS output start Proof for theBenchmark.p
% 3.71/3.91 Clause #0 (by assumption #[]): Eq (∀ (A : Type), Eq («const/sets/UNIV» A) fun A0 => True) True
% 3.71/3.91 Clause #1 (by assumption #[]): Eq (∀ (A : Type) (P : A → Prop) (A0 : A), Eq («const/sets/IN» A A0 P) (P A0)) True
% 3.71/3.91 Clause #2 (by assumption #[]): Eq (Not (∀ (A : Type) (A0 : A), «const/sets/IN» A A0 («const/sets/UNIV» A))) True
% 3.71/3.91 Clause #3 (by clausification #[2]): Eq (∀ (A : Type) (A0 : A), «const/sets/IN» A A0 («const/sets/UNIV» A)) False
% 3.71/3.91 Clause #4 (by clausification #[3]): ∀ (a : Type), Eq (Not (∀ (A0 : skS.0 0 a), «const/sets/IN» (skS.0 0 a) A0 («const/sets/UNIV» (skS.0 0 a)))) True
% 3.71/3.91 Clause #5 (by clausification #[4]): ∀ (a : Type), Eq (∀ (A0 : skS.0 0 a), «const/sets/IN» (skS.0 0 a) A0 («const/sets/UNIV» (skS.0 0 a))) False
% 3.71/3.91 Clause #6 (by clausification #[5]): ∀ (a : Type) (a_1 : skS.0 0 a),
% 3.71/3.91 Eq (Not («const/sets/IN» (skS.0 0 a) (skS.0 1 a a_1) («const/sets/UNIV» (skS.0 0 a)))) True
% 3.71/3.91 Clause #7 (by clausification #[6]): ∀ (a : Type) (a_1 : skS.0 0 a), Eq («const/sets/IN» (skS.0 0 a) (skS.0 1 a a_1) («const/sets/UNIV» (skS.0 0 a))) False
% 3.71/3.91 Clause #8 (by clausification #[0]): ∀ (a : Type), Eq (Eq («const/sets/UNIV» a) fun A0 => True) True
% 3.71/3.91 Clause #9 (by clausification #[8]): ∀ (a : Type), Eq («const/sets/UNIV» a) fun A0 => True
% 3.71/3.91 Clause #10 (by argument congruence #[9]): ∀ (a : Type) (a_1 : a), Eq («const/sets/UNIV» a a_1) ((fun A0 => True) a_1)
% 3.71/3.91 Clause #13 (by betaEtaReduce #[10]): ∀ (a : Type) (a_1 : a), Eq («const/sets/UNIV» a a_1) True
% 3.71/3.91 Clause #18 (by clausification #[1]): ∀ (a : Type), Eq (∀ (P : a → Prop) (A0 : a), Eq («const/sets/IN» a A0 P) (P A0)) True
% 3.71/3.91 Clause #19 (by clausification #[18]): ∀ (a : Type) (a_1 : a → Prop), Eq (∀ (A0 : a), Eq («const/sets/IN» a A0 a_1) (a_1 A0)) True
% 3.71/3.91 Clause #20 (by clausification #[19]): ∀ (a : Type) (a_1 : a) (a_2 : a → Prop), Eq (Eq («const/sets/IN» a a_1 a_2) (a_2 a_1)) True
% 3.71/3.91 Clause #21 (by clausification #[20]): ∀ (a : Type) (a_1 : a) (a_2 : a → Prop), Eq («const/sets/IN» a a_1 a_2) (a_2 a_1)
% 3.71/3.91 Clause #25 (by superposition #[21, 13]): ∀ (a : Type) (a_1 : a) (a_2 : a → Type) (a_3 : (x : a) → a_2 x),
% 3.71/3.91 Eq («const/sets/IN» a a_1 fun x => «const/sets/UNIV» (a_2 x) (a_3 x)) True
% 3.71/3.91 Clause #78 (by superposition #[25, 7]): Eq True False
% 3.71/3.91 Clause #99 (by clausification #[78]): False
% 3.71/3.91 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------