TSTP Solution File: SYN380+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN380+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n029.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:11:31 EDT 2023
% Result : Theorem 3.35s 3.69s
% Output : Proof 3.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN380+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 21:07:40 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.35/3.69 SZS status Theorem for theBenchmark.p
% 3.35/3.69 SZS output start Proof for theBenchmark.p
% 3.35/3.69 Clause #0 (by assumption #[]): Eq
% 3.35/3.69 (Not
% 3.35/3.69 ((∀ (W : Iota), Not (big_r W W)) →
% 3.35/3.69 Exists fun X => Exists fun Y => And (Not (big_r X Y)) (big_q Y X → ∀ (Z : Iota), big_q Z Z)))
% 3.35/3.69 True
% 3.35/3.69 Clause #1 (by clausification #[0]): Eq
% 3.35/3.69 ((∀ (W : Iota), Not (big_r W W)) →
% 3.35/3.69 Exists fun X => Exists fun Y => And (Not (big_r X Y)) (big_q Y X → ∀ (Z : Iota), big_q Z Z))
% 3.35/3.69 False
% 3.35/3.69 Clause #2 (by clausification #[1]): Eq (∀ (W : Iota), Not (big_r W W)) True
% 3.35/3.69 Clause #3 (by clausification #[1]): Eq (Exists fun X => Exists fun Y => And (Not (big_r X Y)) (big_q Y X → ∀ (Z : Iota), big_q Z Z)) False
% 3.35/3.69 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (Not (big_r a a)) True
% 3.35/3.69 Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (big_r a a) False
% 3.35/3.69 Clause #6 (by clausification #[3]): ∀ (a : Iota), Eq (Exists fun Y => And (Not (big_r a Y)) (big_q Y a → ∀ (Z : Iota), big_q Z Z)) False
% 3.35/3.69 Clause #7 (by clausification #[6]): ∀ (a a_1 : Iota), Eq (And (Not (big_r a a_1)) (big_q a_1 a → ∀ (Z : Iota), big_q Z Z)) False
% 3.35/3.69 Clause #8 (by clausification #[7]): ∀ (a a_1 : Iota), Or (Eq (Not (big_r a a_1)) False) (Eq (big_q a_1 a → ∀ (Z : Iota), big_q Z Z) False)
% 3.35/3.69 Clause #9 (by clausification #[8]): ∀ (a a_1 : Iota), Or (Eq (big_q a a_1 → ∀ (Z : Iota), big_q Z Z) False) (Eq (big_r a_1 a) True)
% 3.35/3.69 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (big_r a a_1) True) (Eq (big_q a_1 a) True)
% 3.35/3.69 Clause #11 (by clausification #[9]): ∀ (a a_1 : Iota), Or (Eq (big_r a a_1) True) (Eq (∀ (Z : Iota), big_q Z Z) False)
% 3.35/3.69 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Or (Eq (big_r a a_1) True) (Eq (Not (big_q (skS.0 0 a_2) (skS.0 0 a_2))) True)
% 3.35/3.69 Clause #13 (by clausification #[12]): ∀ (a a_1 a_2 : Iota), Or (Eq (big_r a a_1) True) (Eq (big_q (skS.0 0 a_2) (skS.0 0 a_2)) False)
% 3.35/3.69 Clause #14 (by superposition #[13, 10]): ∀ (a a_1 a_2 : Iota), Or (Eq (big_r a a_1) True) (Or (Eq (big_r (skS.0 0 a_2) (skS.0 0 a_2)) True) (Eq False True))
% 3.35/3.69 Clause #15 (by clausification #[14]): ∀ (a a_1 a_2 : Iota), Or (Eq (big_r a a_1) True) (Eq (big_r (skS.0 0 a_2) (skS.0 0 a_2)) True)
% 3.35/3.69 Clause #17 (by superposition #[15, 5]): ∀ (a a_1 : Iota), Or (Eq (big_r a a_1) True) (Eq True False)
% 3.35/3.69 Clause #19 (by clausification #[17]): ∀ (a a_1 : Iota), Eq (big_r a a_1) True
% 3.35/3.69 Clause #21 (by superposition #[19, 5]): Eq True False
% 3.35/3.69 Clause #23 (by clausification #[21]): False
% 3.35/3.69 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------