TSTP Solution File: SYN058+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN058+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n026.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:10:22 EDT 2023
% Result : Theorem 5.23s 5.41s
% Output : Proof 5.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN058+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.13 % Command : duper %s
% 0.14/0.34 % Computer : n026.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.14/0.34 % DateTime : Sat Aug 26 21:17:03 EDT 2023
% 0.14/0.34 % CPUTime :
% 5.23/5.41 SZS status Theorem for theBenchmark.p
% 5.23/5.41 SZS output start Proof for theBenchmark.p
% 5.23/5.41 Clause #0 (by assumption #[]): Eq (∀ (X : Iota), big_p X → ∀ (Z : Iota), big_q Z) True
% 5.23/5.41 Clause #1 (by assumption #[]): Eq ((∀ (X : Iota), Or (big_q X) (big_r X)) → Exists fun X1 => And (big_q X1) (big_s X1)) True
% 5.23/5.41 Clause #2 (by assumption #[]): Eq ((Exists fun X => big_s X) → ∀ (X1 : Iota), big_f X1 → big_g X1) True
% 5.23/5.41 Clause #3 (by assumption #[]): Eq (Not (∀ (X : Iota), And (big_p X) (big_f X) → big_g X)) True
% 5.23/5.41 Clause #4 (by clausification #[3]): Eq (∀ (X : Iota), And (big_p X) (big_f X) → big_g X) False
% 5.23/5.41 Clause #5 (by clausification #[4]): ∀ (a : Iota), Eq (Not (And (big_p (skS.0 0 a)) (big_f (skS.0 0 a)) → big_g (skS.0 0 a))) True
% 5.23/5.41 Clause #6 (by clausification #[5]): ∀ (a : Iota), Eq (And (big_p (skS.0 0 a)) (big_f (skS.0 0 a)) → big_g (skS.0 0 a)) False
% 5.23/5.41 Clause #7 (by clausification #[6]): ∀ (a : Iota), Eq (And (big_p (skS.0 0 a)) (big_f (skS.0 0 a))) True
% 5.23/5.41 Clause #8 (by clausification #[6]): ∀ (a : Iota), Eq (big_g (skS.0 0 a)) False
% 5.23/5.41 Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (big_f (skS.0 0 a)) True
% 5.23/5.41 Clause #10 (by clausification #[7]): ∀ (a : Iota), Eq (big_p (skS.0 0 a)) True
% 5.23/5.41 Clause #11 (by betaEtaReduce #[2]): Eq (Exists big_s → ∀ (X1 : Iota), big_f X1 → big_g X1) True
% 5.23/5.41 Clause #12 (by clausification #[11]): Or (Eq (Exists big_s) False) (Eq (∀ (X1 : Iota), big_f X1 → big_g X1) True)
% 5.23/5.41 Clause #13 (by clausification #[12]): ∀ (a : Iota), Or (Eq (∀ (X1 : Iota), big_f X1 → big_g X1) True) (Eq (big_s a) False)
% 5.23/5.41 Clause #14 (by clausification #[13]): ∀ (a a_1 : Iota), Or (Eq (big_s a) False) (Eq (big_f a_1 → big_g a_1) True)
% 5.23/5.41 Clause #15 (by clausification #[14]): ∀ (a a_1 : Iota), Or (Eq (big_s a) False) (Or (Eq (big_f a_1) False) (Eq (big_g a_1) True))
% 5.23/5.41 Clause #16 (by clausification #[0]): ∀ (a : Iota), Eq (big_p a → ∀ (Z : Iota), big_q Z) True
% 5.23/5.41 Clause #17 (by clausification #[16]): ∀ (a : Iota), Or (Eq (big_p a) False) (Eq (∀ (Z : Iota), big_q Z) True)
% 5.23/5.41 Clause #18 (by clausification #[17]): ∀ (a a_1 : Iota), Or (Eq (big_p a) False) (Eq (big_q a_1) True)
% 5.23/5.41 Clause #19 (by superposition #[10, 18]): ∀ (a : Iota), Or (Eq (big_q a) True) (Eq False True)
% 5.23/5.41 Clause #20 (by clausification #[19]): ∀ (a : Iota), Eq (big_q a) True
% 5.23/5.41 Clause #21 (by clausification #[1]): Or (Eq (∀ (X : Iota), Or (big_q X) (big_r X)) False) (Eq (Exists fun X1 => And (big_q X1) (big_s X1)) True)
% 5.23/5.41 Clause #22 (by clausification #[21]): ∀ (a : Iota),
% 5.23/5.41 Or (Eq (Exists fun X1 => And (big_q X1) (big_s X1)) True) (Eq (Not (Or (big_q (skS.0 1 a)) (big_r (skS.0 1 a)))) True)
% 5.23/5.41 Clause #23 (by clausification #[22]): ∀ (a a_1 : Iota),
% 5.23/5.41 Or (Eq (Not (Or (big_q (skS.0 1 a)) (big_r (skS.0 1 a)))) True)
% 5.23/5.41 (Eq (And (big_q (skS.0 2 a_1)) (big_s (skS.0 2 a_1))) True)
% 5.23/5.41 Clause #24 (by clausification #[23]): ∀ (a a_1 : Iota),
% 5.23/5.41 Or (Eq (And (big_q (skS.0 2 a)) (big_s (skS.0 2 a))) True) (Eq (Or (big_q (skS.0 1 a_1)) (big_r (skS.0 1 a_1))) False)
% 5.23/5.41 Clause #25 (by clausification #[24]): ∀ (a a_1 : Iota), Or (Eq (Or (big_q (skS.0 1 a)) (big_r (skS.0 1 a))) False) (Eq (big_s (skS.0 2 a_1)) True)
% 5.23/5.41 Clause #28 (by clausification #[25]): ∀ (a a_1 : Iota), Or (Eq (big_s (skS.0 2 a)) True) (Eq (big_q (skS.0 1 a_1)) False)
% 5.23/5.41 Clause #29 (by superposition #[28, 20]): ∀ (a : Iota), Or (Eq (big_s (skS.0 2 a)) True) (Eq False True)
% 5.23/5.41 Clause #30 (by clausification #[29]): ∀ (a : Iota), Eq (big_s (skS.0 2 a)) True
% 5.23/5.41 Clause #31 (by superposition #[30, 15]): ∀ (a : Iota), Or (Eq True False) (Or (Eq (big_f a) False) (Eq (big_g a) True))
% 5.23/5.41 Clause #32 (by clausification #[31]): ∀ (a : Iota), Or (Eq (big_f a) False) (Eq (big_g a) True)
% 5.23/5.41 Clause #33 (by superposition #[32, 9]): ∀ (a : Iota), Or (Eq (big_g (skS.0 0 a)) True) (Eq False True)
% 5.23/5.41 Clause #34 (by clausification #[33]): ∀ (a : Iota), Eq (big_g (skS.0 0 a)) True
% 5.23/5.41 Clause #35 (by superposition #[34, 8]): Eq True False
% 5.23/5.41 Clause #38 (by clausification #[35]): False
% 5.23/5.41 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------