TSTP Solution File: SEU537^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU537^2 : TPTP v8.1.2. Released v3.7.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 : Thu Aug 31 16:42:35 EDT 2023
% Result : Theorem 3.44s 3.64s
% Output : Proof 3.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU537^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/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.20/0.34 % DateTime : Wed Aug 23 17:22:23 EDT 2023
% 0.20/0.34 % CPUTime :
% 3.44/3.64 SZS status Theorem for theBenchmark.p
% 3.44/3.64 SZS output start Proof for theBenchmark.p
% 3.44/3.64 Clause #0 (by assumption #[]): Eq
% 3.44/3.64 (Not
% 3.44/3.64 (∀ (A : Iota) (Xphi : Iota → Prop),
% 3.44/3.64 (∀ (Xx : Iota), in Xx A → Not (Xphi Xx)) → Not (Exists fun Xx => And (in Xx A) (Xphi Xx))))
% 3.44/3.64 True
% 3.44/3.64 Clause #1 (by clausification #[0]): Eq
% 3.44/3.64 (∀ (A : Iota) (Xphi : Iota → Prop),
% 3.44/3.64 (∀ (Xx : Iota), in Xx A → Not (Xphi Xx)) → Not (Exists fun Xx => And (in Xx A) (Xphi Xx)))
% 3.44/3.64 False
% 3.44/3.64 Clause #2 (by clausification #[1]): ∀ (a : Iota),
% 3.44/3.64 Eq
% 3.44/3.64 (Not
% 3.44/3.64 (∀ (Xphi : Iota → Prop),
% 3.44/3.64 (∀ (Xx : Iota), in Xx (skS.0 0 a) → Not (Xphi Xx)) → Not (Exists fun Xx => And (in Xx (skS.0 0 a)) (Xphi Xx))))
% 3.44/3.64 True
% 3.44/3.64 Clause #3 (by clausification #[2]): ∀ (a : Iota),
% 3.44/3.64 Eq
% 3.44/3.64 (∀ (Xphi : Iota → Prop),
% 3.44/3.64 (∀ (Xx : Iota), in Xx (skS.0 0 a) → Not (Xphi Xx)) → Not (Exists fun Xx => And (in Xx (skS.0 0 a)) (Xphi Xx)))
% 3.44/3.64 False
% 3.44/3.64 Clause #4 (by clausification #[3]): ∀ (a : Iota) (a_1 : Iota → Prop),
% 3.44/3.64 Eq
% 3.44/3.64 (Not
% 3.44/3.64 ((∀ (Xx : Iota), in Xx (skS.0 0 a) → Not (skS.0 1 a a_1 Xx)) →
% 3.44/3.64 Not (Exists fun Xx => And (in Xx (skS.0 0 a)) (skS.0 1 a a_1 Xx))))
% 3.44/3.64 True
% 3.44/3.64 Clause #5 (by clausification #[4]): ∀ (a : Iota) (a_1 : Iota → Prop),
% 3.44/3.64 Eq
% 3.44/3.64 ((∀ (Xx : Iota), in Xx (skS.0 0 a) → Not (skS.0 1 a a_1 Xx)) →
% 3.44/3.64 Not (Exists fun Xx => And (in Xx (skS.0 0 a)) (skS.0 1 a a_1 Xx)))
% 3.44/3.64 False
% 3.44/3.64 Clause #6 (by clausification #[5]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (∀ (Xx : Iota), in Xx (skS.0 0 a) → Not (skS.0 1 a a_1 Xx)) True
% 3.44/3.64 Clause #7 (by clausification #[5]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (Not (Exists fun Xx => And (in Xx (skS.0 0 a)) (skS.0 1 a a_1 Xx))) False
% 3.44/3.64 Clause #8 (by clausification #[6]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Eq (in a (skS.0 0 a_1) → Not (skS.0 1 a_1 a_2 a)) True
% 3.44/3.64 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (skS.0 0 a_1)) False) (Eq (Not (skS.0 1 a_1 a_2 a)) True)
% 3.44/3.64 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota) (a_2 : Iota → Prop), Or (Eq (in a (skS.0 0 a_1)) False) (Eq (skS.0 1 a_1 a_2 a) False)
% 3.44/3.64 Clause #11 (by clausification #[7]): ∀ (a : Iota) (a_1 : Iota → Prop), Eq (Exists fun Xx => And (in Xx (skS.0 0 a)) (skS.0 1 a a_1 Xx)) True
% 3.44/3.64 Clause #12 (by clausification #[11]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota),
% 3.44/3.64 Eq (And (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) (skS.0 1 a a_1 (skS.0 2 a a_1 a_2))) True
% 3.44/3.64 Clause #13 (by clausification #[12]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota), Eq (skS.0 1 a a_1 (skS.0 2 a a_1 a_2)) True
% 3.44/3.64 Clause #14 (by clausification #[12]): ∀ (a : Iota) (a_1 : Iota → Prop) (a_2 : Iota), Eq (in (skS.0 2 a a_1 a_2) (skS.0 0 a)) True
% 3.44/3.64 Clause #15 (by superposition #[14, 10]): ∀ (a : Iota) (a_1 a_2 : Iota → Prop) (a_3 : Iota), Or (Eq True False) (Eq (skS.0 1 a a_1 (skS.0 2 a a_2 a_3)) False)
% 3.44/3.64 Clause #16 (by clausification #[15]): ∀ (a : Iota) (a_1 a_2 : Iota → Prop) (a_3 : Iota), Eq (skS.0 1 a a_1 (skS.0 2 a a_2 a_3)) False
% 3.44/3.64 Clause #17 (by superposition #[16, 13]): Eq False True
% 3.44/3.64 Clause #18 (by clausification #[17]): False
% 3.44/3.64 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------