↑ Up

Duper---1.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : SEU140+1 : TPTP v9.2.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n004.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 : Fri Oct  3 08:00:56 PM UTC 2025

% Result   : Theorem 3.99s 4.16s
% Output   : Proof 3.99s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU140+1 : TPTP v9.2.0. Released v3.3.0.
% 0.07/0.13  % Command    : duper %s
% 0.14/0.34  % Computer : n004.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   : Fri Oct  3 04:30:08 EDT 2025
% 0.14/0.34  % CPUTime    : 
% 3.99/4.16  SZS status Theorem for theBenchmark.p
% 3.99/4.16  SZS output start Proof for theBenchmark.p
% 3.99/4.16  Clause #2 (by assumption #[]): Eq (∀ (A B : Iota), Iff (disjoint A B) (Eq (set_intersection2 A B) empty_set)) True
% 3.99/4.16  Clause #10 (by assumption #[]): Eq (∀ (A B C : Iota), subset A B → subset (set_intersection2 A C) (set_intersection2 B C)) True
% 3.99/4.16  Clause #12 (by assumption #[]): Eq (∀ (A : Iota), subset A empty_set → Eq A empty_set) True
% 3.99/4.16  Clause #13 (by assumption #[]): Eq (Not (∀ (A B C : Iota), And (subset A B) (disjoint B C) → disjoint A C)) True
% 3.99/4.16  Clause #36 (by clausification #[12]): ∀ (a : Iota), Eq (subset a empty_set → Eq a empty_set) True
% 3.99/4.16  Clause #37 (by clausification #[36]): ∀ (a : Iota), Or (Eq (subset a empty_set) False) (Eq (Eq a empty_set) True)
% 3.99/4.16  Clause #38 (by clausification #[37]): ∀ (a : Iota), Or (Eq (subset a empty_set) False) (Eq a empty_set)
% 3.99/4.16  Clause #46 (by clausification #[13]): Eq (∀ (A B C : Iota), And (subset A B) (disjoint B C) → disjoint A C) False
% 3.99/4.16  Clause #47 (by clausification #[46]): ∀ (a : Iota), Eq (Not (∀ (B C : Iota), And (subset (skS.0 2 a) B) (disjoint B C) → disjoint (skS.0 2 a) C)) True
% 3.99/4.16  Clause #48 (by clausification #[47]): ∀ (a : Iota), Eq (∀ (B C : Iota), And (subset (skS.0 2 a) B) (disjoint B C) → disjoint (skS.0 2 a) C) False
% 3.99/4.16  Clause #49 (by clausification #[48]): ∀ (a a_1 : Iota),
% 3.99/4.16    Eq
% 3.99/4.16      (Not (∀ (C : Iota), And (subset (skS.0 2 a) (skS.0 3 a a_1)) (disjoint (skS.0 3 a a_1) C) → disjoint (skS.0 2 a) C))
% 3.99/4.16      True
% 3.99/4.16  Clause #50 (by clausification #[49]): ∀ (a a_1 : Iota),
% 3.99/4.16    Eq (∀ (C : Iota), And (subset (skS.0 2 a) (skS.0 3 a a_1)) (disjoint (skS.0 3 a a_1) C) → disjoint (skS.0 2 a) C)
% 3.99/4.16      False
% 3.99/4.16  Clause #51 (by clausification #[50]): ∀ (a a_1 a_2 : Iota),
% 3.99/4.16    Eq
% 3.99/4.16      (Not
% 3.99/4.16        (And (subset (skS.0 2 a) (skS.0 3 a a_1)) (disjoint (skS.0 3 a a_1) (skS.0 4 a a_1 a_2)) →
% 3.99/4.16          disjoint (skS.0 2 a) (skS.0 4 a a_1 a_2)))
% 3.99/4.16      True
% 3.99/4.16  Clause #52 (by clausification #[51]): ∀ (a a_1 a_2 : Iota),
% 3.99/4.16    Eq
% 3.99/4.16      (And (subset (skS.0 2 a) (skS.0 3 a a_1)) (disjoint (skS.0 3 a a_1) (skS.0 4 a a_1 a_2)) →
% 3.99/4.16        disjoint (skS.0 2 a) (skS.0 4 a a_1 a_2))
% 3.99/4.16      False
% 3.99/4.16  Clause #53 (by clausification #[52]): ∀ (a a_1 a_2 : Iota), Eq (And (subset (skS.0 2 a) (skS.0 3 a a_1)) (disjoint (skS.0 3 a a_1) (skS.0 4 a a_1 a_2))) True
% 3.99/4.16  Clause #54 (by clausification #[52]): ∀ (a a_1 a_2 : Iota), Eq (disjoint (skS.0 2 a) (skS.0 4 a a_1 a_2)) False
% 3.99/4.16  Clause #55 (by clausification #[53]): ∀ (a a_1 a_2 : Iota), Eq (disjoint (skS.0 3 a a_1) (skS.0 4 a a_1 a_2)) True
% 3.99/4.16  Clause #56 (by clausification #[53]): ∀ (a a_1 : Iota), Eq (subset (skS.0 2 a) (skS.0 3 a a_1)) True
% 3.99/4.16  Clause #62 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (B : Iota), Iff (disjoint a B) (Eq (set_intersection2 a B) empty_set)) True
% 3.99/4.16  Clause #63 (by clausification #[62]): ∀ (a a_1 : Iota), Eq (Iff (disjoint a a_1) (Eq (set_intersection2 a a_1) empty_set)) True
% 3.99/4.16  Clause #64 (by clausification #[63]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) True) (Eq (Eq (set_intersection2 a a_1) empty_set) False)
% 3.99/4.16  Clause #65 (by clausification #[63]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) False) (Eq (Eq (set_intersection2 a a_1) empty_set) True)
% 3.99/4.16  Clause #66 (by clausification #[64]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) True) (Ne (set_intersection2 a a_1) empty_set)
% 3.99/4.16  Clause #76 (by clausification #[10]): ∀ (a : Iota), Eq (∀ (B C : Iota), subset a B → subset (set_intersection2 a C) (set_intersection2 B C)) True
% 3.99/4.16  Clause #77 (by clausification #[76]): ∀ (a a_1 : Iota), Eq (∀ (C : Iota), subset a a_1 → subset (set_intersection2 a C) (set_intersection2 a_1 C)) True
% 3.99/4.16  Clause #78 (by clausification #[77]): ∀ (a a_1 a_2 : Iota), Eq (subset a a_1 → subset (set_intersection2 a a_2) (set_intersection2 a_1 a_2)) True
% 3.99/4.16  Clause #79 (by clausification #[78]): ∀ (a a_1 a_2 : Iota),
% 3.99/4.16    Or (Eq (subset a a_1) False) (Eq (subset (set_intersection2 a a_2) (set_intersection2 a_1 a_2)) True)
% 3.99/4.16  Clause #86 (by clausification #[65]): ∀ (a a_1 : Iota), Or (Eq (disjoint a a_1) False) (Eq (set_intersection2 a a_1) empty_set)
% 3.99/4.16  Clause #87 (by superposition #[86, 55]): ∀ (a a_1 a_2 : Iota), Or (Eq (set_intersection2 (skS.0 3 a a_1) (skS.0 4 a a_1 a_2)) empty_set) (Eq False True)
% 3.99/4.17  Clause #97 (by superposition #[56, 79]): ∀ (a a_1 a_2 : Iota),
% 3.99/4.17    Or (Eq (subset (set_intersection2 (skS.0 2 a) a_1) (set_intersection2 (skS.0 3 a a_2) a_1)) True) (Eq False True)
% 3.99/4.17  Clause #98 (by clausification #[97]): ∀ (a a_1 a_2 : Iota), Eq (subset (set_intersection2 (skS.0 2 a) a_1) (set_intersection2 (skS.0 3 a a_2) a_1)) True
% 3.99/4.17  Clause #117 (by clausification #[87]): ∀ (a a_1 a_2 : Iota), Eq (set_intersection2 (skS.0 3 a a_1) (skS.0 4 a a_1 a_2)) empty_set
% 3.99/4.17  Clause #118 (by superposition #[117, 98]): ∀ (a a_1 a_2 : Iota), Eq (subset (set_intersection2 (skS.0 2 a) (skS.0 4 a a_1 a_2)) empty_set) True
% 3.99/4.17  Clause #123 (by superposition #[118, 38]): ∀ (a a_1 a_2 : Iota), Or (Eq True False) (Eq (set_intersection2 (skS.0 2 a) (skS.0 4 a a_1 a_2)) empty_set)
% 3.99/4.17  Clause #125 (by clausification #[123]): ∀ (a a_1 a_2 : Iota), Eq (set_intersection2 (skS.0 2 a) (skS.0 4 a a_1 a_2)) empty_set
% 3.99/4.17  Clause #128 (by superposition #[125, 66]): ∀ (a a_1 a_2 : Iota), Or (Eq (disjoint (skS.0 2 a) (skS.0 4 a a_1 a_2)) True) (Ne empty_set empty_set)
% 3.99/4.17  Clause #152 (by eliminate resolved literals #[128]): ∀ (a a_1 a_2 : Iota), Eq (disjoint (skS.0 2 a) (skS.0 4 a a_1 a_2)) True
% 3.99/4.17  Clause #153 (by superposition #[152, 54]): Eq True False
% 3.99/4.17  Clause #156 (by clausification #[153]): False
% 3.99/4.17  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------