TSTP Solution File: SET574+3 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SET574+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n010.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 14:46:50 EDT 2023
% Result : Theorem 5.35s 5.64s
% Output : Proof 5.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET574+3 : TPTP v8.1.2. Released v2.2.0.
% 0.14/0.14 % Command : duper %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 09:30:05 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.35/5.64 SZS status Theorem for theBenchmark.p
% 5.35/5.64 SZS output start Proof for theBenchmark.p
% 5.35/5.64 Clause #0 (by assumption #[]): Eq (∀ (B C : Iota), Iff (intersect B C) (Exists fun D => And (member D B) (member D C))) True
% 5.35/5.64 Clause #2 (by assumption #[]): Eq (Not (∀ (B C D : Iota), And (member B C) (member B D) → intersect C D)) True
% 5.35/5.64 Clause #6 (by clausification #[2]): Eq (∀ (B C D : Iota), And (member B C) (member B D) → intersect C D) False
% 5.35/5.64 Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (Not (∀ (C D : Iota), And (member (skS.0 0 a) C) (member (skS.0 0 a) D) → intersect C D)) True
% 5.35/5.64 Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (∀ (C D : Iota), And (member (skS.0 0 a) C) (member (skS.0 0 a) D) → intersect C D) False
% 5.35/5.64 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota),
% 5.35/5.64 Eq (Not (∀ (D : Iota), And (member (skS.0 0 a) (skS.0 1 a a_1)) (member (skS.0 0 a) D) → intersect (skS.0 1 a a_1) D))
% 5.35/5.64 True
% 5.35/5.64 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota),
% 5.35/5.64 Eq (∀ (D : Iota), And (member (skS.0 0 a) (skS.0 1 a a_1)) (member (skS.0 0 a) D) → intersect (skS.0 1 a a_1) D) False
% 5.35/5.64 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota),
% 5.35/5.64 Eq
% 5.35/5.64 (Not
% 5.35/5.64 (And (member (skS.0 0 a) (skS.0 1 a a_1)) (member (skS.0 0 a) (skS.0 2 a a_1 a_2)) →
% 5.35/5.64 intersect (skS.0 1 a a_1) (skS.0 2 a a_1 a_2)))
% 5.35/5.64 True
% 5.35/5.64 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota),
% 5.35/5.64 Eq
% 5.35/5.64 (And (member (skS.0 0 a) (skS.0 1 a a_1)) (member (skS.0 0 a) (skS.0 2 a a_1 a_2)) →
% 5.35/5.64 intersect (skS.0 1 a a_1) (skS.0 2 a a_1 a_2))
% 5.35/5.64 False
% 5.35/5.64 Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (And (member (skS.0 0 a) (skS.0 1 a a_1)) (member (skS.0 0 a) (skS.0 2 a a_1 a_2))) True
% 5.35/5.64 Clause #14 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Eq (intersect (skS.0 1 a a_1) (skS.0 2 a a_1 a_2)) False
% 5.35/5.64 Clause #15 (by clausification #[13]): ∀ (a a_1 a_2 : Iota), Eq (member (skS.0 0 a) (skS.0 2 a a_1 a_2)) True
% 5.35/5.64 Clause #16 (by clausification #[13]): ∀ (a a_1 : Iota), Eq (member (skS.0 0 a) (skS.0 1 a a_1)) True
% 5.35/5.64 Clause #17 (by clausification #[0]): ∀ (a : Iota), Eq (∀ (C : Iota), Iff (intersect a C) (Exists fun D => And (member D a) (member D C))) True
% 5.35/5.64 Clause #18 (by clausification #[17]): ∀ (a a_1 : Iota), Eq (Iff (intersect a a_1) (Exists fun D => And (member D a) (member D a_1))) True
% 5.35/5.64 Clause #19 (by clausification #[18]): ∀ (a a_1 : Iota), Or (Eq (intersect a a_1) True) (Eq (Exists fun D => And (member D a) (member D a_1)) False)
% 5.35/5.64 Clause #21 (by clausification #[19]): ∀ (a a_1 a_2 : Iota), Or (Eq (intersect a a_1) True) (Eq (And (member a_2 a) (member a_2 a_1)) False)
% 5.35/5.64 Clause #22 (by clausification #[21]): ∀ (a a_1 a_2 : Iota), Or (Eq (intersect a a_1) True) (Or (Eq (member a_2 a) False) (Eq (member a_2 a_1) False))
% 5.35/5.64 Clause #24 (by superposition #[22, 16]): ∀ (a a_1 a_2 : Iota),
% 5.35/5.64 Or (Eq (intersect (skS.0 1 a a_1) a_2) True) (Or (Eq (member (skS.0 0 a) a_2) False) (Eq False True))
% 5.35/5.64 Clause #28 (by clausification #[24]): ∀ (a a_1 a_2 : Iota), Or (Eq (intersect (skS.0 1 a a_1) a_2) True) (Eq (member (skS.0 0 a) a_2) False)
% 5.35/5.64 Clause #29 (by superposition #[28, 15]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (intersect (skS.0 1 a a_1) (skS.0 2 a a_2 a_3)) True) (Eq False True)
% 5.35/5.64 Clause #35 (by clausification #[29]): ∀ (a a_1 a_2 a_3 : Iota), Eq (intersect (skS.0 1 a a_1) (skS.0 2 a a_2 a_3)) True
% 5.35/5.64 Clause #36 (by superposition #[35, 14]): Eq True False
% 5.35/5.64 Clause #43 (by clausification #[36]): False
% 5.35/5.64 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------