TSTP Solution File: SYN068+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN068+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n005.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:26 EDT 2023
% Result : Theorem 3.46s 3.67s
% Output : Proof 3.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN068+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13 % Command : duper %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 19:51:38 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.46/3.67 SZS status Theorem for theBenchmark.p
% 3.46/3.67 SZS output start Proof for theBenchmark.p
% 3.46/3.67 Clause #0 (by assumption #[]): Eq
% 3.46/3.67 (∀ (X : Iota),
% 3.46/3.67 big_f X → And (Exists fun Y => And (big_g Y) (big_h X Y)) (Exists fun Y1 => And (big_g Y1) (Not (big_h X Y1))))
% 3.46/3.67 True
% 3.46/3.67 Clause #1 (by assumption #[]): Eq (Exists fun X => And (big_j X) (∀ (Y : Iota), big_g Y → big_h X Y)) True
% 3.46/3.67 Clause #2 (by assumption #[]): Eq (Not (Exists fun X => And (big_j X) (Not (big_f X)))) True
% 3.46/3.67 Clause #3 (by clausification #[2]): Eq (Exists fun X => And (big_j X) (Not (big_f X))) False
% 3.46/3.67 Clause #4 (by clausification #[3]): ∀ (a : Iota), Eq (And (big_j a) (Not (big_f a))) False
% 3.46/3.67 Clause #5 (by clausification #[4]): ∀ (a : Iota), Or (Eq (big_j a) False) (Eq (Not (big_f a)) False)
% 3.46/3.67 Clause #6 (by clausification #[5]): ∀ (a : Iota), Or (Eq (big_j a) False) (Eq (big_f a) True)
% 3.46/3.67 Clause #7 (by clausification #[1]): ∀ (a : Iota), Eq (And (big_j (skS.0 0 a)) (∀ (Y : Iota), big_g Y → big_h (skS.0 0 a) Y)) True
% 3.46/3.67 Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (∀ (Y : Iota), big_g Y → big_h (skS.0 0 a) Y) True
% 3.46/3.67 Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (big_j (skS.0 0 a)) True
% 3.46/3.67 Clause #10 (by clausification #[8]): ∀ (a a_1 : Iota), Eq (big_g a → big_h (skS.0 0 a_1) a) True
% 3.46/3.67 Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota), Or (Eq (big_g a) False) (Eq (big_h (skS.0 0 a_1) a) True)
% 3.46/3.67 Clause #12 (by superposition #[9, 6]): ∀ (a : Iota), Or (Eq True False) (Eq (big_f (skS.0 0 a)) True)
% 3.46/3.67 Clause #13 (by clausification #[12]): ∀ (a : Iota), Eq (big_f (skS.0 0 a)) True
% 3.46/3.67 Clause #14 (by clausification #[0]): ∀ (a : Iota),
% 3.46/3.67 Eq (big_f a → And (Exists fun Y => And (big_g Y) (big_h a Y)) (Exists fun Y1 => And (big_g Y1) (Not (big_h a Y1))))
% 3.46/3.67 True
% 3.46/3.67 Clause #15 (by clausification #[14]): ∀ (a : Iota),
% 3.46/3.67 Or (Eq (big_f a) False)
% 3.46/3.67 (Eq (And (Exists fun Y => And (big_g Y) (big_h a Y)) (Exists fun Y1 => And (big_g Y1) (Not (big_h a Y1)))) True)
% 3.46/3.67 Clause #16 (by clausification #[15]): ∀ (a : Iota), Or (Eq (big_f a) False) (Eq (Exists fun Y1 => And (big_g Y1) (Not (big_h a Y1))) True)
% 3.46/3.67 Clause #18 (by clausification #[16]): ∀ (a a_1 : Iota), Or (Eq (big_f a) False) (Eq (And (big_g (skS.0 1 a a_1)) (Not (big_h a (skS.0 1 a a_1)))) True)
% 3.46/3.67 Clause #19 (by clausification #[18]): ∀ (a a_1 : Iota), Or (Eq (big_f a) False) (Eq (Not (big_h a (skS.0 1 a a_1))) True)
% 3.46/3.67 Clause #20 (by clausification #[18]): ∀ (a a_1 : Iota), Or (Eq (big_f a) False) (Eq (big_g (skS.0 1 a a_1)) True)
% 3.46/3.67 Clause #21 (by clausification #[19]): ∀ (a a_1 : Iota), Or (Eq (big_f a) False) (Eq (big_h a (skS.0 1 a a_1)) False)
% 3.46/3.67 Clause #22 (by superposition #[21, 13]): ∀ (a a_1 : Iota), Or (Eq (big_h (skS.0 0 a) (skS.0 1 (skS.0 0 a) a_1)) False) (Eq False True)
% 3.46/3.67 Clause #28 (by superposition #[20, 13]): ∀ (a a_1 : Iota), Or (Eq (big_g (skS.0 1 (skS.0 0 a) a_1)) True) (Eq False True)
% 3.46/3.67 Clause #31 (by clausification #[28]): ∀ (a a_1 : Iota), Eq (big_g (skS.0 1 (skS.0 0 a) a_1)) True
% 3.46/3.67 Clause #32 (by superposition #[31, 11]): ∀ (a a_1 a_2 : Iota), Or (Eq True False) (Eq (big_h (skS.0 0 a) (skS.0 1 (skS.0 0 a_1) a_2)) True)
% 3.46/3.67 Clause #33 (by clausification #[22]): ∀ (a a_1 : Iota), Eq (big_h (skS.0 0 a) (skS.0 1 (skS.0 0 a) a_1)) False
% 3.46/3.67 Clause #36 (by clausification #[32]): ∀ (a a_1 a_2 : Iota), Eq (big_h (skS.0 0 a) (skS.0 1 (skS.0 0 a_1) a_2)) True
% 3.46/3.67 Clause #37 (by superposition #[36, 33]): Eq True False
% 3.46/3.67 Clause #38 (by clausification #[37]): False
% 3.46/3.67 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------