TSTP Solution File: SEU565^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU565^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n023.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:44 EDT 2023
% Result : Theorem 3.41s 3.60s
% Output : Proof 3.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU565^2 : TPTP v8.1.2. Released v3.7.0.
% 0.11/0.13 % Command : duper %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 23 20:18:12 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.41/3.60 SZS status Theorem for theBenchmark.p
% 3.41/3.60 SZS output start Proof for theBenchmark.p
% 3.41/3.60 Clause #0 (by assumption #[]): Eq (Eq subsetE (∀ (A B Xx : Iota), subset A B → in Xx A → in Xx B)) True
% 3.41/3.60 Clause #1 (by assumption #[]): Eq (Not (subsetE → ∀ (A B Xx : Iota), subset A B → Not (in Xx B) → Not (in Xx A))) True
% 3.41/3.60 Clause #2 (by clausification #[1]): Eq (subsetE → ∀ (A B Xx : Iota), subset A B → Not (in Xx B) → Not (in Xx A)) False
% 3.41/3.60 Clause #3 (by clausification #[2]): Eq subsetE True
% 3.41/3.60 Clause #4 (by clausification #[2]): Eq (∀ (A B Xx : Iota), subset A B → Not (in Xx B) → Not (in Xx A)) False
% 3.41/3.60 Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (∀ (B Xx : Iota), subset (skS.0 0 a) B → Not (in Xx B) → Not (in Xx (skS.0 0 a)))) True
% 3.41/3.60 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), subset (skS.0 0 a) B → Not (in Xx B) → Not (in Xx (skS.0 0 a))) False
% 3.41/3.60 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota),
% 3.41/3.60 Eq (Not (∀ (Xx : Iota), subset (skS.0 0 a) (skS.0 1 a a_1) → Not (in Xx (skS.0 1 a a_1)) → Not (in Xx (skS.0 0 a))))
% 3.41/3.60 True
% 3.41/3.60 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota),
% 3.41/3.60 Eq (∀ (Xx : Iota), subset (skS.0 0 a) (skS.0 1 a a_1) → Not (in Xx (skS.0 1 a a_1)) → Not (in Xx (skS.0 0 a))) False
% 3.41/3.60 Clause #9 (by clausification #[8]): ∀ (a a_1 a_2 : Iota),
% 3.41/3.60 Eq
% 3.41/3.60 (Not
% 3.41/3.60 (subset (skS.0 0 a) (skS.0 1 a a_1) →
% 3.41/3.60 Not (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) → Not (in (skS.0 2 a a_1 a_2) (skS.0 0 a))))
% 3.41/3.60 True
% 3.41/3.60 Clause #10 (by clausification #[9]): ∀ (a a_1 a_2 : Iota),
% 3.41/3.60 Eq
% 3.41/3.60 (subset (skS.0 0 a) (skS.0 1 a a_1) →
% 3.41/3.60 Not (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) → Not (in (skS.0 2 a a_1 a_2) (skS.0 0 a)))
% 3.41/3.60 False
% 3.41/3.60 Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Eq (subset (skS.0 0 a) (skS.0 1 a a_1)) True
% 3.41/3.60 Clause #12 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Eq (Not (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) → Not (in (skS.0 2 a a_1 a_2) (skS.0 0 a))) False
% 3.41/3.60 Clause #13 (by clausification #[0]): Eq subsetE (∀ (A B Xx : Iota), subset A B → in Xx A → in Xx B)
% 3.41/3.60 Clause #14 (by forward demodulation #[13, 3]): Eq True (∀ (A B Xx : Iota), subset A B → in Xx A → in Xx B)
% 3.41/3.60 Clause #15 (by clausification #[14]): ∀ (a : Iota), Eq (∀ (B Xx : Iota), subset a B → in Xx a → in Xx B) True
% 3.41/3.60 Clause #16 (by clausification #[15]): ∀ (a a_1 : Iota), Eq (∀ (Xx : Iota), subset a a_1 → in Xx a → in Xx a_1) True
% 3.41/3.60 Clause #17 (by clausification #[16]): ∀ (a a_1 a_2 : Iota), Eq (subset a a_1 → in a_2 a → in a_2 a_1) True
% 3.41/3.60 Clause #18 (by clausification #[17]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) False) (Eq (in a_2 a → in a_2 a_1) True)
% 3.41/3.60 Clause #19 (by clausification #[18]): ∀ (a a_1 a_2 : Iota), Or (Eq (subset a a_1) False) (Or (Eq (in a_2 a) False) (Eq (in a_2 a_1) True))
% 3.41/3.60 Clause #20 (by superposition #[19, 11]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (skS.0 0 a_1)) False) (Or (Eq (in a (skS.0 1 a_1 a_2)) True) (Eq False True))
% 3.41/3.60 Clause #21 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (Not (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1))) True
% 3.41/3.60 Clause #22 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (Not (in (skS.0 2 a a_1 a_2) (skS.0 0 a))) False
% 3.41/3.60 Clause #23 (by clausification #[21]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_1)) False
% 3.41/3.60 Clause #24 (by clausification #[22]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True
% 3.41/3.60 Clause #25 (by clausification #[20]): ∀ (a a_1 a_2 : Iota), Or (Eq (in a (skS.0 0 a_1)) False) (Eq (in a (skS.0 1 a_1 a_2)) True)
% 3.41/3.60 Clause #26 (by superposition #[25, 24]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_3)) True) (Eq False True)
% 3.41/3.60 Clause #27 (by clausification #[26]): ∀ (a a_1 a_2 a_3 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 1 a a_3)) True
% 3.41/3.60 Clause #28 (by superposition #[27, 23]): Eq True False
% 3.41/3.60 Clause #29 (by clausification #[28]): False
% 3.41/3.60 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------