TSTP Solution File: SYN965+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN965+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n015.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:27 EDT 2023
% Result : Theorem 3.73s 3.89s
% Output : Proof 3.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN965+1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.13 % Command : duper %s
% 0.14/0.34 % Computer : n015.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 18:42:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.73/3.89 SZS status Theorem for theBenchmark.p
% 3.73/3.89 SZS output start Proof for theBenchmark.p
% 3.73/3.89 Clause #0 (by assumption #[]): Eq
% 3.73/3.89 (Not
% 3.73/3.89 (Exists fun Z => ∀ (X : Iota), Exists fun Y => And (p Y X → Exists fun W => p W Y) (And (p Z Y) (p Y Z) → p Y X)))
% 3.73/3.89 True
% 3.73/3.89 Clause #1 (by clausification #[0]): Eq (Exists fun Z => ∀ (X : Iota), Exists fun Y => And (p Y X → Exists fun W => p W Y) (And (p Z Y) (p Y Z) → p Y X))
% 3.73/3.89 False
% 3.73/3.89 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (X : Iota), Exists fun Y => And (p Y X → Exists fun W => p W Y) (And (p a Y) (p Y a) → p Y X)) False
% 3.73/3.89 Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota),
% 3.73/3.89 Eq
% 3.73/3.89 (Not
% 3.73/3.89 (Exists fun Y => And (p Y (skS.0 0 a a_1) → Exists fun W => p W Y) (And (p a Y) (p Y a) → p Y (skS.0 0 a a_1))))
% 3.73/3.89 True
% 3.73/3.89 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota),
% 3.73/3.89 Eq (Exists fun Y => And (p Y (skS.0 0 a a_1) → Exists fun W => p W Y) (And (p a Y) (p Y a) → p Y (skS.0 0 a a_1)))
% 3.73/3.89 False
% 3.73/3.89 Clause #5 (by clausification #[4]): ∀ (a a_1 a_2 : Iota),
% 3.73/3.89 Eq (And (p a (skS.0 0 a_1 a_2) → Exists fun W => p W a) (And (p a_1 a) (p a a_1) → p a (skS.0 0 a_1 a_2))) False
% 3.73/3.89 Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 : Iota),
% 3.73/3.89 Or (Eq (p a (skS.0 0 a_1 a_2) → Exists fun W => p W a) False)
% 3.73/3.89 (Eq (And (p a_1 a) (p a a_1) → p a (skS.0 0 a_1 a_2)) False)
% 3.73/3.89 Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 : Iota), Or (Eq (And (p a a_1) (p a_1 a) → p a_1 (skS.0 0 a a_2)) False) (Eq (p a_1 (skS.0 0 a a_2)) True)
% 3.73/3.89 Clause #8 (by clausification #[6]): ∀ (a a_1 a_2 : Iota),
% 3.73/3.89 Or (Eq (And (p a a_1) (p a_1 a) → p a_1 (skS.0 0 a a_2)) False) (Eq (Exists fun W => p W a_1) False)
% 3.73/3.89 Clause #9 (by clausification #[7]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) True) (Eq (And (p a_1 a) (p a a_1)) True)
% 3.73/3.89 Clause #11 (by clausification #[9]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) True) (Eq (p a a_1) True)
% 3.73/3.89 Clause #13 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (Exists fun W => p W a) False) (Eq (And (p a_1 a) (p a a_1)) True)
% 3.73/3.89 Clause #14 (by clausification #[8]): ∀ (a a_1 a_2 : Iota), Or (Eq (Exists fun W => p W a) False) (Eq (p a (skS.0 0 a_1 a_2)) False)
% 3.73/3.89 Clause #15 (by clausification #[13]): ∀ (a a_1 a_2 : Iota), Or (Eq (And (p a a_1) (p a_1 a)) True) (Eq (p a_2 a_1) False)
% 3.73/3.89 Clause #16 (by clausification #[15]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a a_1) False) (Eq (p a_1 a_2) True)
% 3.73/3.89 Clause #17 (by clausification #[15]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a a_1) False) (Eq (p a_2 a_1) True)
% 3.73/3.89 Clause #20 (by superposition #[17, 11]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) True) (Or (Eq False True) (Eq (p a_3 a_1) True))
% 3.73/3.89 Clause #22 (by clausification #[20]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) True) (Eq (p a_3 a_1) True)
% 3.73/3.89 Clause #25 (by superposition #[22, 16]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) True) (Or (Eq True False) (Eq (p a_1 a_3) True))
% 3.73/3.89 Clause #27 (by clausification #[25]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) True) (Eq (p a_1 a_3) True)
% 3.73/3.89 Clause #31 (by equality factoring #[27]): ∀ (a a_1 : Iota), Or (Ne True True) (Eq (p a (skS.0 0 a a_1)) True)
% 3.73/3.89 Clause #32 (by clausification #[31]): ∀ (a a_1 : Iota), Or (Eq (p a (skS.0 0 a a_1)) True) (Or (Eq True False) (Eq True False))
% 3.73/3.89 Clause #34 (by clausification #[32]): ∀ (a a_1 : Iota), Or (Eq (p a (skS.0 0 a a_1)) True) (Eq True False)
% 3.73/3.89 Clause #35 (by clausification #[34]): ∀ (a a_1 : Iota), Eq (p a (skS.0 0 a a_1)) True
% 3.73/3.89 Clause #37 (by superposition #[35, 17]): ∀ (a a_1 a_2 : Iota), Or (Eq True False) (Eq (p a (skS.0 0 a_1 a_2)) True)
% 3.73/3.89 Clause #38 (by clausification #[37]): ∀ (a a_1 a_2 : Iota), Eq (p a (skS.0 0 a_1 a_2)) True
% 3.73/3.89 Clause #41 (by clausification #[14]): ∀ (a a_1 a_2 a_3 : Iota), Or (Eq (p a (skS.0 0 a_1 a_2)) False) (Eq (p a_3 a) False)
% 3.73/3.89 Clause #42 (by superposition #[41, 38]): ∀ (a a_1 : Iota), Or (Eq (p a a_1) False) (Eq False True)
% 3.73/3.89 Clause #44 (by clausification #[42]): ∀ (a a_1 : Iota), Eq (p a a_1) False
% 3.73/3.89 Clause #45 (by superposition #[44, 38]): Eq False True
% 3.73/3.89 Clause #46 (by clausification #[45]): False
% 3.73/3.89 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------