TSTP Solution File: SYN954+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN954+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n031.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:25 EDT 2023
% Result : Theorem 3.59s 3.73s
% Output : Proof 3.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN954+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/0.14 % Command : duper %s
% 0.14/0.36 % Computer : n031.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 18:34:53 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.59/3.73 SZS status Theorem for theBenchmark.p
% 3.59/3.73 SZS output start Proof for theBenchmark.p
% 3.59/3.73 Clause #0 (by assumption #[]): Eq (Not (∀ (A B : Iota), (∀ (Z : Iota), q Z → p Z) → Exists fun X => And (p X → p A) (q X → p B))) True
% 3.59/3.73 Clause #1 (by clausification #[0]): Eq (∀ (A B : Iota), (∀ (Z : Iota), q Z → p Z) → Exists fun X => And (p X → p A) (q X → p B)) False
% 3.59/3.73 Clause #2 (by clausification #[1]): ∀ (a : Iota),
% 3.59/3.73 Eq (Not (∀ (B : Iota), (∀ (Z : Iota), q Z → p Z) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p B))) True
% 3.59/3.73 Clause #3 (by clausification #[2]): ∀ (a : Iota), Eq (∀ (B : Iota), (∀ (Z : Iota), q Z → p Z) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p B)) False
% 3.59/3.73 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota),
% 3.59/3.73 Eq (Not ((∀ (Z : Iota), q Z → p Z) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p (skS.0 1 a a_1)))) True
% 3.59/3.73 Clause #5 (by clausification #[4]): ∀ (a a_1 : Iota),
% 3.59/3.73 Eq ((∀ (Z : Iota), q Z → p Z) → Exists fun X => And (p X → p (skS.0 0 a)) (q X → p (skS.0 1 a a_1))) False
% 3.59/3.73 Clause #6 (by clausification #[5]): Eq (∀ (Z : Iota), q Z → p Z) True
% 3.59/3.73 Clause #7 (by clausification #[5]): ∀ (a a_1 : Iota), Eq (Exists fun X => And (p X → p (skS.0 0 a)) (q X → p (skS.0 1 a a_1))) False
% 3.59/3.73 Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (q a → p a) True
% 3.59/3.73 Clause #9 (by clausification #[8]): ∀ (a : Iota), Or (Eq (q a) False) (Eq (p a) True)
% 3.59/3.73 Clause #10 (by clausification #[7]): ∀ (a a_1 a_2 : Iota), Eq (And (p a → p (skS.0 0 a_1)) (q a → p (skS.0 1 a_1 a_2))) False
% 3.59/3.73 Clause #11 (by clausification #[10]): ∀ (a a_1 a_2 : Iota), Or (Eq (p a → p (skS.0 0 a_1)) False) (Eq (q a → p (skS.0 1 a_1 a_2)) False)
% 3.59/3.73 Clause #12 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Or (Eq (q a → p (skS.0 1 a_1 a_2)) False) (Eq (p a) True)
% 3.59/3.73 Clause #13 (by clausification #[11]): ∀ (a a_1 a_2 : Iota), Or (Eq (q a → p (skS.0 1 a_1 a_2)) False) (Eq (p (skS.0 0 a_1)) False)
% 3.59/3.73 Clause #14 (by clausification #[12]): ∀ (a : Iota), Or (Eq (p a) True) (Eq (q a) True)
% 3.59/3.73 Clause #16 (by superposition #[14, 9]): ∀ (a : Iota), Or (Eq (p a) True) (Or (Eq True False) (Eq (p a) True))
% 3.59/3.73 Clause #17 (by clausification #[16]): ∀ (a : Iota), Or (Eq (p a) True) (Eq (p a) True)
% 3.59/3.73 Clause #18 (by eliminate duplicate literals #[17]): ∀ (a : Iota), Eq (p a) True
% 3.59/3.73 Clause #22 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (p (skS.0 0 a)) False) (Eq (p (skS.0 1 a a_1)) False)
% 3.59/3.73 Clause #25 (by forward demodulation #[22, 18]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (p (skS.0 1 a a_1)) False)
% 3.59/3.73 Clause #26 (by clausification #[25]): ∀ (a a_1 : Iota), Eq (p (skS.0 1 a a_1)) False
% 3.59/3.73 Clause #27 (by superposition #[26, 18]): Eq False True
% 3.59/3.73 Clause #28 (by clausification #[27]): False
% 3.59/3.73 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------