TSTP Solution File: SYN980+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN980+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n014.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 Sep 1 02:13:31 EDT 2023
% Result : Theorem 3.44s 3.69s
% Output : Proof 3.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN980+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 17:18:17 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.44/3.69 SZS status Theorem for theBenchmark.p
% 3.44/3.69 SZS output start Proof for theBenchmark.p
% 3.44/3.69 Clause #0 (by assumption #[]): Eq
% 3.44/3.69 (Not
% 3.44/3.69 (∀ (B : Iota),
% 3.44/3.69 (∀ (Y : Iota), (r B → r Y) → p (f Y) Y) → Exists fun X => Exists fun Y => And (p X Y) (q (f B) B → q X Y)))
% 3.44/3.69 True
% 3.44/3.69 Clause #1 (by clausification #[0]): Eq
% 3.44/3.69 (∀ (B : Iota),
% 3.44/3.69 (∀ (Y : Iota), (r B → r Y) → p (f Y) Y) → Exists fun X => Exists fun Y => And (p X Y) (q (f B) B → q X Y))
% 3.44/3.69 False
% 3.44/3.69 Clause #2 (by clausification #[1]): ∀ (a : Iota),
% 3.44/3.69 Eq
% 3.44/3.69 (Not
% 3.44/3.69 ((∀ (Y : Iota), (r (skS.0 0 a) → r Y) → p (f Y) Y) →
% 3.44/3.69 Exists fun X => Exists fun Y => And (p X Y) (q (f (skS.0 0 a)) (skS.0 0 a) → q X Y)))
% 3.44/3.69 True
% 3.44/3.69 Clause #3 (by clausification #[2]): ∀ (a : Iota),
% 3.44/3.69 Eq
% 3.44/3.69 ((∀ (Y : Iota), (r (skS.0 0 a) → r Y) → p (f Y) Y) →
% 3.44/3.69 Exists fun X => Exists fun Y => And (p X Y) (q (f (skS.0 0 a)) (skS.0 0 a) → q X Y))
% 3.44/3.69 False
% 3.44/3.69 Clause #4 (by clausification #[3]): ∀ (a : Iota), Eq (∀ (Y : Iota), (r (skS.0 0 a) → r Y) → p (f Y) Y) True
% 3.44/3.69 Clause #5 (by clausification #[3]): ∀ (a : Iota), Eq (Exists fun X => Exists fun Y => And (p X Y) (q (f (skS.0 0 a)) (skS.0 0 a) → q X Y)) False
% 3.44/3.69 Clause #6 (by clausification #[4]): ∀ (a a_1 : Iota), Eq ((r (skS.0 0 a) → r a_1) → p (f a_1) a_1) True
% 3.44/3.69 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Or (Eq (r (skS.0 0 a) → r a_1) False) (Eq (p (f a_1) a_1) True)
% 3.44/3.69 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (p (f a) a) True) (Eq (r (skS.0 0 a_1)) True)
% 3.44/3.69 Clause #9 (by clausification #[7]): ∀ (a : Iota), Or (Eq (p (f a) a) True) (Eq (r a) False)
% 3.44/3.69 Clause #10 (by superposition #[9, 8]): ∀ (a a_1 : Iota), Or (Eq (p (f (skS.0 0 a)) (skS.0 0 a)) True) (Or (Eq (p (f a_1) a_1) True) (Eq False True))
% 3.44/3.69 Clause #11 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Exists fun Y => And (p a Y) (q (f (skS.0 0 a_1)) (skS.0 0 a_1) → q a Y)) False
% 3.44/3.69 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Eq (And (p a a_1) (q (f (skS.0 0 a_2)) (skS.0 0 a_2) → q a a_1)) False
% 3.44/3.69 Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a a_1) False) (Eq (q (f (skS.0 0 a_2)) (skS.0 0 a_2) → q a a_1) False)
% 3.44/3.69 Clause #14 (by clausification #[13]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a a_1) False) (Eq (q (f (skS.0 0 a_2)) (skS.0 0 a_2)) True)
% 3.44/3.69 Clause #15 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (p a a_1) False) (Eq (q a a_1) False)
% 3.44/3.69 Clause #19 (by clausification #[10]): ∀ (a a_1 : Iota), Or (Eq (p (f (skS.0 0 a)) (skS.0 0 a)) True) (Eq (p (f a_1) a_1) True)
% 3.44/3.69 Clause #24 (by equality factoring #[19]): ∀ (a : Iota), Or (Ne True True) (Eq (p (f (skS.0 0 a)) (skS.0 0 a)) True)
% 3.44/3.69 Clause #25 (by clausification #[24]): ∀ (a : Iota), Or (Eq (p (f (skS.0 0 a)) (skS.0 0 a)) True) (Or (Eq True False) (Eq True False))
% 3.44/3.69 Clause #27 (by clausification #[25]): ∀ (a : Iota), Or (Eq (p (f (skS.0 0 a)) (skS.0 0 a)) True) (Eq True False)
% 3.44/3.69 Clause #28 (by clausification #[27]): ∀ (a : Iota), Eq (p (f (skS.0 0 a)) (skS.0 0 a)) True
% 3.44/3.69 Clause #29 (by superposition #[28, 14]): ∀ (a : Iota), Or (Eq True False) (Eq (q (f (skS.0 0 a)) (skS.0 0 a)) True)
% 3.44/3.69 Clause #30 (by superposition #[28, 15]): ∀ (a : Iota), Or (Eq True False) (Eq (q (f (skS.0 0 a)) (skS.0 0 a)) False)
% 3.44/3.69 Clause #31 (by clausification #[30]): ∀ (a : Iota), Eq (q (f (skS.0 0 a)) (skS.0 0 a)) False
% 3.44/3.69 Clause #32 (by clausification #[29]): ∀ (a : Iota), Eq (q (f (skS.0 0 a)) (skS.0 0 a)) True
% 3.44/3.69 Clause #33 (by superposition #[32, 31]): Eq True False
% 3.44/3.69 Clause #35 (by clausification #[33]): False
% 3.44/3.69 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------