TSTP Solution File: SYN407+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN407+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n017.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:40 EDT 2023
% Result : Theorem 3.52s 3.72s
% Output : Proof 3.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN407+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13 % Command : duper %s
% 0.12/0.34 % Computer : n017.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 18:16:26 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.52/3.72 SZS status Theorem for theBenchmark.p
% 3.52/3.72 SZS output start Proof for theBenchmark.p
% 3.52/3.72 Clause #0 (by assumption #[]): Eq (Not ((∀ (X : Iota), f X → Or (g X) (h X)) → Or (∀ (Y : Iota), f Y → g Y) (Exists fun Z => And (f Z) (h Z)))) True
% 3.52/3.72 Clause #1 (by clausification #[0]): Eq ((∀ (X : Iota), f X → Or (g X) (h X)) → Or (∀ (Y : Iota), f Y → g Y) (Exists fun Z => And (f Z) (h Z))) False
% 3.52/3.72 Clause #2 (by clausification #[1]): Eq (∀ (X : Iota), f X → Or (g X) (h X)) True
% 3.52/3.72 Clause #3 (by clausification #[1]): Eq (Or (∀ (Y : Iota), f Y → g Y) (Exists fun Z => And (f Z) (h Z))) False
% 3.52/3.72 Clause #4 (by clausification #[2]): ∀ (a : Iota), Eq (f a → Or (g a) (h a)) True
% 3.52/3.72 Clause #5 (by clausification #[4]): ∀ (a : Iota), Or (Eq (f a) False) (Eq (Or (g a) (h a)) True)
% 3.52/3.72 Clause #6 (by clausification #[5]): ∀ (a : Iota), Or (Eq (f a) False) (Or (Eq (g a) True) (Eq (h a) True))
% 3.52/3.72 Clause #7 (by clausification #[3]): Eq (Exists fun Z => And (f Z) (h Z)) False
% 3.52/3.72 Clause #8 (by clausification #[3]): Eq (∀ (Y : Iota), f Y → g Y) False
% 3.52/3.72 Clause #9 (by clausification #[7]): ∀ (a : Iota), Eq (And (f a) (h a)) False
% 3.52/3.72 Clause #10 (by clausification #[9]): ∀ (a : Iota), Or (Eq (f a) False) (Eq (h a) False)
% 3.52/3.72 Clause #11 (by clausification #[8]): ∀ (a : Iota), Eq (Not (f (skS.0 0 a) → g (skS.0 0 a))) True
% 3.52/3.72 Clause #12 (by clausification #[11]): ∀ (a : Iota), Eq (f (skS.0 0 a) → g (skS.0 0 a)) False
% 3.52/3.72 Clause #13 (by clausification #[12]): ∀ (a : Iota), Eq (f (skS.0 0 a)) True
% 3.52/3.72 Clause #14 (by clausification #[12]): ∀ (a : Iota), Eq (g (skS.0 0 a)) False
% 3.52/3.72 Clause #15 (by superposition #[13, 6]): ∀ (a : Iota), Or (Eq True False) (Or (Eq (g (skS.0 0 a)) True) (Eq (h (skS.0 0 a)) True))
% 3.52/3.72 Clause #16 (by superposition #[13, 10]): ∀ (a : Iota), Or (Eq True False) (Eq (h (skS.0 0 a)) False)
% 3.52/3.72 Clause #17 (by clausification #[16]): ∀ (a : Iota), Eq (h (skS.0 0 a)) False
% 3.52/3.72 Clause #18 (by clausification #[15]): ∀ (a : Iota), Or (Eq (g (skS.0 0 a)) True) (Eq (h (skS.0 0 a)) True)
% 3.52/3.72 Clause #19 (by forward demodulation #[18, 17]): ∀ (a : Iota), Or (Eq (g (skS.0 0 a)) True) (Eq False True)
% 3.52/3.72 Clause #20 (by clausification #[19]): ∀ (a : Iota), Eq (g (skS.0 0 a)) True
% 3.52/3.72 Clause #21 (by superposition #[20, 14]): Eq True False
% 3.52/3.72 Clause #22 (by clausification #[21]): False
% 3.52/3.72 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------