TSTP Solution File: SET940+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SET940+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n032.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:07 EDT 2023
% Result : Theorem 3.63s 3.83s
% Output : Proof 3.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET940+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.11 % Command : duper %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sat Aug 26 12:52:58 EDT 2023
% 0.10/0.30 % CPUTime :
% 3.63/3.83 SZS status Theorem for theBenchmark.p
% 3.63/3.83 SZS output start Proof for theBenchmark.p
% 3.63/3.83 Clause #7 (by assumption #[]): Eq (Not (∀ (A B : Iota), Eq (union (unordered_pair A B)) (set_union2 A B))) True
% 3.63/3.83 Clause #8 (by assumption #[]): Eq (∀ (A B : Iota), Eq (union (unordered_pair A B)) (set_union2 A B)) True
% 3.63/3.83 Clause #33 (by clausification #[8]): ∀ (a : Iota), Eq (∀ (B : Iota), Eq (union (unordered_pair a B)) (set_union2 a B)) True
% 3.63/3.83 Clause #34 (by clausification #[33]): ∀ (a a_1 : Iota), Eq (Eq (union (unordered_pair a a_1)) (set_union2 a a_1)) True
% 3.63/3.83 Clause #35 (by clausification #[34]): ∀ (a a_1 : Iota), Eq (union (unordered_pair a a_1)) (set_union2 a a_1)
% 3.63/3.83 Clause #37 (by clausification #[7]): Eq (∀ (A B : Iota), Eq (union (unordered_pair A B)) (set_union2 A B)) False
% 3.63/3.83 Clause #38 (by clausification #[37]): ∀ (a : Iota), Eq (Not (∀ (B : Iota), Eq (union (unordered_pair (skS.0 2 a) B)) (set_union2 (skS.0 2 a) B))) True
% 3.63/3.83 Clause #39 (by clausification #[38]): ∀ (a : Iota), Eq (∀ (B : Iota), Eq (union (unordered_pair (skS.0 2 a) B)) (set_union2 (skS.0 2 a) B)) False
% 3.63/3.83 Clause #40 (by clausification #[39]): ∀ (a a_1 : Iota),
% 3.63/3.83 Eq (Not (Eq (union (unordered_pair (skS.0 2 a) (skS.0 3 a a_1))) (set_union2 (skS.0 2 a) (skS.0 3 a a_1)))) True
% 3.63/3.83 Clause #41 (by clausification #[40]): ∀ (a a_1 : Iota),
% 3.63/3.83 Eq (Eq (union (unordered_pair (skS.0 2 a) (skS.0 3 a a_1))) (set_union2 (skS.0 2 a) (skS.0 3 a a_1))) False
% 3.63/3.83 Clause #42 (by clausification #[41]): ∀ (a a_1 : Iota), Ne (union (unordered_pair (skS.0 2 a) (skS.0 3 a a_1))) (set_union2 (skS.0 2 a) (skS.0 3 a a_1))
% 3.63/3.83 Clause #43 (by forward demodulation #[42, 35]): ∀ (a a_1 : Iota), Ne (set_union2 (skS.0 2 a) (skS.0 3 a a_1)) (set_union2 (skS.0 2 a) (skS.0 3 a a_1))
% 3.63/3.83 Clause #44 (by eliminate resolved literals #[43]): False
% 3.63/3.83 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------