TSTP Solution File: SEU120+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.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 16:40:16 EDT 2023
% Result : Theorem 9.60s 9.77s
% Output : Proof 9.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : duper %s
% 0.13/0.34 % Computer : n010.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 19:12:51 EDT 2023
% 0.13/0.34 % CPUTime :
% 9.60/9.77 SZS status Theorem for theBenchmark.p
% 9.60/9.77 SZS output start Proof for theBenchmark.p
% 9.60/9.77 Clause #2 (by assumption #[]): Eq (∀ (A : Iota), Iff (Eq A empty_set) (∀ (B : Iota), Not (in B A))) True
% 9.60/9.77 Clause #3 (by assumption #[]): Eq (∀ (A B : Iota), Iff (disjoint A B) (Eq (set_intersection2 A B) empty_set)) True
% 9.60/9.77 Clause #10 (by assumption #[]): Eq
% 9.60/9.77 (Not
% 9.60/9.77 (∀ (A B : Iota),
% 9.60/9.77 And (Not (And (Not (disjoint A B)) (∀ (C : Iota), Not (in C (set_intersection2 A B)))))
% 9.60/9.77 (Not (And (Exists fun C => in C (set_intersection2 A B)) (disjoint A B)))))
% 9.60/9.77 True
% 9.60/9.77 Clause #28 (by clausification #[2]): ∀ (a : Iota), Eq (Iff (Eq a empty_set) (∀ (B : Iota), Not (in B a))) True
% 9.60/9.77 Clause #29 (by clausification #[28]): ∀ (a : Iota), Or (Eq (Eq a empty_set) True) (Eq (∀ (B : Iota), Not (in B a)) False)
% 9.60/9.77 Clause #30 (by clausification #[28]): ∀ (a : Iota), Or (Eq (Eq a empty_set) False) (Eq (∀ (B : Iota), Not (in B a)) True)
% 9.60/9.77 Clause #31 (by clausification #[29]): ∀ (a : Iota), Or (Eq (∀ (B : Iota), Not (in B a)) False) (Eq a empty_set)
% 9.60/9.77 Clause #32 (by clausification #[31]): ∀ (a a_1 : Iota), Or (Eq a empty_set) (Eq (Not (Not (in (skS.0 2 a a_1) a))) True)
% 9.60/9.77 Clause #33 (by clausification #[32]): ∀ (a a_1 : Iota), Or (Eq a empty_set) (Eq (Not (in (skS.0 2 a a_1) a)) False)
% 9.60/9.77 Clause #34 (by clausification #[33]): ∀ (a a_1 : Iota), Or (Eq a empty_set) (Eq (in (skS.0 2 a a_1) a) True)
% 9.60/9.77 Clause #38 (by clausification #[30]): ∀ (a : Iota), Or (Eq (∀ (B : Iota), Not (in B a)) True) (Ne a empty_set)
% 9.60/9.77 Clause #39 (by clausification #[38]): ∀ (a a_1 : Iota), Or (Ne a empty_set) (Eq (Not (in a_1 a)) True)
% 9.60/9.77 Clause #40 (by clausification #[39]): ∀ (a a_1 : Iota), Or (Ne a empty_set) (Eq (in a_1 a) False)
% 9.60/9.77 Clause #41 (by destructive equality resolution #[40]): ∀ (a : Iota), Eq (in a empty_set) False
% 9.60/9.77 Clause #43 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (B : Iota), Iff (disjoint a B) (Eq (set_intersection2 a B) empty_set)) True
% 9.60/9.77 Clause #44 (by clausification #[43]): ∀ (a a_1 : Iota), Eq (Iff (disjoint a a_1) (Eq (set_intersection2 a a_1) empty_set)) True
% 9.60/9.77 Clause #45 (by clausification #[44]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) True) (Eq (Eq (set_intersection2 a a_1) empty_set) False)
% 9.60/9.77 Clause #46 (by clausification #[44]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) False) (Eq (Eq (set_intersection2 a a_1) empty_set) True)
% 9.60/9.77 Clause #47 (by clausification #[45]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) True) (Ne (set_intersection2 a a_1) empty_set)
% 9.60/9.77 Clause #50 (by clausification #[10]): Eq
% 9.60/9.77 (∀ (A B : Iota),
% 9.60/9.77 And (Not (And (Not (disjoint A B)) (∀ (C : Iota), Not (in C (set_intersection2 A B)))))
% 9.60/9.77 (Not (And (Exists fun C => in C (set_intersection2 A B)) (disjoint A B))))
% 9.60/9.77 False
% 9.60/9.77 Clause #51 (by clausification #[50]): ∀ (a : Iota),
% 9.60/9.77 Eq
% 9.60/9.77 (Not
% 9.60/9.77 (∀ (B : Iota),
% 9.60/9.77 And (Not (And (Not (disjoint (skS.0 3 a) B)) (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) B)))))
% 9.60/9.77 (Not (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) B)) (disjoint (skS.0 3 a) B)))))
% 9.60/9.77 True
% 9.60/9.77 Clause #52 (by clausification #[51]): ∀ (a : Iota),
% 9.60/9.77 Eq
% 9.60/9.77 (∀ (B : Iota),
% 9.60/9.77 And (Not (And (Not (disjoint (skS.0 3 a) B)) (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) B)))))
% 9.60/9.77 (Not (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) B)) (disjoint (skS.0 3 a) B))))
% 9.60/9.77 False
% 9.60/9.77 Clause #53 (by clausification #[52]): ∀ (a a_1 : Iota),
% 9.60/9.77 Eq
% 9.60/9.77 (Not
% 9.60/9.77 (And
% 9.60/9.77 (Not
% 9.60/9.77 (And (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.77 (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))))))
% 9.60/9.77 (Not
% 9.60/9.77 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.77 (disjoint (skS.0 3 a) (skS.0 4 a a_1))))))
% 9.60/9.77 True
% 9.60/9.77 Clause #54 (by clausification #[53]): ∀ (a a_1 : Iota),
% 9.60/9.77 Eq
% 9.60/9.77 (And
% 9.60/9.77 (Not
% 9.60/9.77 (And (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.77 (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))))))
% 9.60/9.77 (Not
% 9.60/9.77 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (disjoint (skS.0 3 a) (skS.0 4 a a_1)))))
% 9.60/9.79 False
% 9.60/9.79 Clause #55 (by clausification #[54]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or
% 9.60/9.79 (Eq
% 9.60/9.79 (Not
% 9.60/9.79 (And (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))))))
% 9.60/9.79 False)
% 9.60/9.79 (Eq
% 9.60/9.79 (Not
% 9.60/9.79 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (disjoint (skS.0 3 a) (skS.0 4 a a_1))))
% 9.60/9.79 False)
% 9.60/9.79 Clause #56 (by clausification #[55]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or
% 9.60/9.79 (Eq
% 9.60/9.79 (Not
% 9.60/9.79 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (disjoint (skS.0 3 a) (skS.0 4 a a_1))))
% 9.60/9.79 False)
% 9.60/9.79 (Eq
% 9.60/9.79 (And (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))))
% 9.60/9.79 True)
% 9.60/9.79 Clause #57 (by clausification #[56]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or
% 9.60/9.79 (Eq
% 9.60/9.79 (And (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))))
% 9.60/9.79 True)
% 9.60/9.79 (Eq
% 9.60/9.79 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 True)
% 9.60/9.79 Clause #58 (by clausification #[57]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or
% 9.60/9.79 (Eq
% 9.60/9.79 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 True)
% 9.60/9.79 (Eq (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))) True)
% 9.60/9.79 Clause #59 (by clausification #[57]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or
% 9.60/9.79 (Eq
% 9.60/9.79 (And (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 (disjoint (skS.0 3 a) (skS.0 4 a a_1)))
% 9.60/9.79 True)
% 9.60/9.79 (Eq (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1))) True)
% 9.60/9.79 Clause #60 (by clausification #[58]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or (Eq (∀ (C : Iota), Not (in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))) True)
% 9.60/9.79 (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) True)
% 9.60/9.79 Clause #62 (by clausification #[60]): ∀ (a a_1 a_2 : Iota),
% 9.60/9.79 Or (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) True)
% 9.60/9.79 (Eq (Not (in a_2 (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)))) True)
% 9.60/9.79 Clause #63 (by clausification #[62]): ∀ (a a_1 a_2 : Iota),
% 9.60/9.79 Or (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) True)
% 9.60/9.79 (Eq (in a_2 (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))) False)
% 9.60/9.79 Clause #64 (by superposition #[63, 34]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) True)
% 9.60/9.79 (Or (Eq (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)) empty_set) (Eq False True))
% 9.60/9.79 Clause #67 (by clausification #[46]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) False) (Eq (set_intersection2 a a_1) empty_set)
% 9.60/9.79 Clause #129 (by clausification #[59]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or (Eq (Not (disjoint (skS.0 3 a) (skS.0 4 a a_1))) True)
% 9.60/9.79 (Eq (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))) True)
% 9.60/9.79 Clause #159 (by clausification #[64]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) True) (Eq (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)) empty_set)
% 9.60/9.79 Clause #160 (by forward contextual literal cutting #[159, 47]): ∀ (a a_1 : Iota), Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) True
% 9.60/9.79 Clause #163 (by superposition #[160, 67]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)) empty_set)
% 9.60/9.79 Clause #168 (by clausification #[163]): ∀ (a a_1 : Iota), Eq (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1)) empty_set
% 9.60/9.79 Clause #1376 (by clausification #[129]): ∀ (a a_1 : Iota),
% 9.60/9.79 Or (Eq (Exists fun C => in C (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))) True)
% 9.60/9.79 (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) False)
% 9.60/9.79 Clause #1377 (by clausification #[1376]): ∀ (a a_1 a_2 : Iota),
% 9.60/9.79 Or (Eq (disjoint (skS.0 3 a) (skS.0 4 a a_1)) False)
% 9.60/9.79 (Eq (in (skS.0 6 a a_1 a_2) (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))) True)
% 9.60/9.79 Clause #1378 (by forward demodulation #[1377, 160]): ∀ (a a_1 a_2 : Iota),
% 9.60/9.79 Or (Eq True False) (Eq (in (skS.0 6 a a_1 a_2) (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))) True)
% 9.60/9.80 Clause #1379 (by clausification #[1378]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 6 a a_1 a_2) (set_intersection2 (skS.0 3 a) (skS.0 4 a a_1))) True
% 9.60/9.80 Clause #1380 (by forward demodulation #[1379, 168]): ∀ (a a_1 a_2 : Iota), Eq (in (skS.0 6 a a_1 a_2) empty_set) True
% 9.60/9.80 Clause #1381 (by superposition #[1380, 41]): Eq True False
% 9.60/9.80 Clause #1397 (by clausification #[1381]): False
% 9.60/9.80 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------