TSTP Solution File: SET925+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n002.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:48:04 EDT 2023
% Result : Theorem 3.17s 3.38s
% Output : Proof 3.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET925+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.08 % Command : duper %s
% 0.07/0.26 % Computer : n002.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sat Aug 26 15:36:17 EDT 2023
% 0.07/0.27 % CPUTime :
% 3.17/3.38 SZS status Theorem for theBenchmark.p
% 3.17/3.38 SZS output start Proof for theBenchmark.p
% 3.17/3.38 Clause #4 (by assumption #[]): Eq (Not (∀ (A B : Iota), Iff (Eq (set_difference (singleton A) B) empty_set) (in A B))) True
% 3.17/3.38 Clause #5 (by assumption #[]): Eq (∀ (A B : Iota), Iff (Eq (set_difference (singleton A) B) empty_set) (in A B)) True
% 3.17/3.38 Clause #14 (by clausification #[5]): ∀ (a : Iota), Eq (∀ (B : Iota), Iff (Eq (set_difference (singleton a) B) empty_set) (in a B)) True
% 3.17/3.38 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Eq (Iff (Eq (set_difference (singleton a) a_1) empty_set) (in a a_1)) True
% 3.17/3.38 Clause #16 (by clausification #[15]): ∀ (a a_1 : Iota), Or (Eq (Eq (set_difference (singleton a) a_1) empty_set) True) (Eq (in a a_1) False)
% 3.17/3.38 Clause #17 (by clausification #[15]): ∀ (a a_1 : Iota), Or (Eq (Eq (set_difference (singleton a) a_1) empty_set) False) (Eq (in a a_1) True)
% 3.17/3.38 Clause #18 (by clausification #[16]): ∀ (a a_1 : Iota), Or (Eq (in a a_1) False) (Eq (set_difference (singleton a) a_1) empty_set)
% 3.17/3.38 Clause #19 (by clausification #[4]): Eq (∀ (A B : Iota), Iff (Eq (set_difference (singleton A) B) empty_set) (in A B)) False
% 3.17/3.38 Clause #20 (by clausification #[19]): ∀ (a : Iota),
% 3.17/3.38 Eq (Not (∀ (B : Iota), Iff (Eq (set_difference (singleton (skS.0 2 a)) B) empty_set) (in (skS.0 2 a) B))) True
% 3.17/3.38 Clause #21 (by clausification #[20]): ∀ (a : Iota), Eq (∀ (B : Iota), Iff (Eq (set_difference (singleton (skS.0 2 a)) B) empty_set) (in (skS.0 2 a) B)) False
% 3.17/3.38 Clause #22 (by clausification #[21]): ∀ (a a_1 : Iota),
% 3.17/3.38 Eq
% 3.17/3.38 (Not (Iff (Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set) (in (skS.0 2 a) (skS.0 3 a a_1))))
% 3.17/3.38 True
% 3.17/3.38 Clause #23 (by clausification #[22]): ∀ (a a_1 : Iota),
% 3.17/3.38 Eq (Iff (Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set) (in (skS.0 2 a) (skS.0 3 a a_1)))
% 3.17/3.38 False
% 3.17/3.38 Clause #24 (by clausification #[23]): ∀ (a a_1 : Iota),
% 3.17/3.38 Or (Eq (Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set) False)
% 3.17/3.38 (Eq (in (skS.0 2 a) (skS.0 3 a a_1)) False)
% 3.17/3.38 Clause #25 (by clausification #[23]): ∀ (a a_1 : Iota),
% 3.17/3.38 Or (Eq (Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set) True)
% 3.17/3.38 (Eq (in (skS.0 2 a) (skS.0 3 a a_1)) True)
% 3.17/3.38 Clause #26 (by clausification #[24]): ∀ (a a_1 : Iota),
% 3.17/3.38 Or (Eq (in (skS.0 2 a) (skS.0 3 a a_1)) False) (Ne (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set)
% 3.17/3.38 Clause #27 (by forward contextual literal cutting #[26, 18]): ∀ (a a_1 : Iota), Eq (in (skS.0 2 a) (skS.0 3 a a_1)) False
% 3.17/3.38 Clause #28 (by clausification #[17]): ∀ (a a_1 : Iota), Or (Eq (in a a_1) True) (Ne (set_difference (singleton a) a_1) empty_set)
% 3.17/3.38 Clause #29 (by clausification #[25]): ∀ (a a_1 : Iota),
% 3.17/3.38 Or (Eq (in (skS.0 2 a) (skS.0 3 a a_1)) True) (Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set)
% 3.17/3.38 Clause #30 (by forward demodulation #[29, 27]): ∀ (a a_1 : Iota), Or (Eq False True) (Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set)
% 3.17/3.38 Clause #31 (by clausification #[30]): ∀ (a a_1 : Iota), Eq (set_difference (singleton (skS.0 2 a)) (skS.0 3 a a_1)) empty_set
% 3.17/3.38 Clause #32 (by superposition #[31, 28]): ∀ (a a_1 : Iota), Or (Eq (in (skS.0 2 a) (skS.0 3 a a_1)) True) (Ne empty_set empty_set)
% 3.17/3.38 Clause #33 (by eliminate resolved literals #[32]): ∀ (a a_1 : Iota), Eq (in (skS.0 2 a) (skS.0 3 a a_1)) True
% 3.17/3.38 Clause #34 (by superposition #[33, 27]): Eq True False
% 3.17/3.38 Clause #37 (by clausification #[34]): False
% 3.17/3.38 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------