TSTP Solution File: SYN370+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN370+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n024.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:28 EDT 2023
% Result : Theorem 3.46s 3.63s
% Output : Proof 3.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN370+1 : TPTP v8.1.2. Released v2.0.0.
% 0.13/0.14 % Command : duper %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 18:24:38 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.46/3.63 SZS status Theorem for theBenchmark.p
% 3.46/3.63 SZS output start Proof for theBenchmark.p
% 3.46/3.63 Clause #0 (by assumption #[]): Eq (Not (Exists fun V => ∀ (Y : Iota), Exists fun Z => Or (big_p a Y (h Y)) (big_p V Y (f Y)) → big_p V Y Z)) True
% 3.46/3.63 Clause #1 (by clausification #[0]): Eq (Exists fun V => ∀ (Y : Iota), Exists fun Z => Or (big_p a Y (h Y)) (big_p V Y (f Y)) → big_p V Y Z) False
% 3.46/3.63 Clause #2 (by clausification #[1]): ∀ (a_1 : Iota), Eq (∀ (Y : Iota), Exists fun Z => Or (big_p a Y (h Y)) (big_p a_1 Y (f Y)) → big_p a_1 Y Z) False
% 3.46/3.63 Clause #3 (by clausification #[2]): ∀ (a_1 a_2 : Iota),
% 3.46/3.63 Eq
% 3.46/3.63 (Not
% 3.46/3.63 (Exists fun Z =>
% 3.46/3.63 Or (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (big_p a_1 (skS.0 0 a_1 a_2) (f (skS.0 0 a_1 a_2))) →
% 3.46/3.63 big_p a_1 (skS.0 0 a_1 a_2) Z))
% 3.46/3.63 True
% 3.46/3.63 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : Iota),
% 3.46/3.63 Eq
% 3.46/3.63 (Exists fun Z =>
% 3.46/3.63 Or (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (big_p a_1 (skS.0 0 a_1 a_2) (f (skS.0 0 a_1 a_2))) →
% 3.46/3.63 big_p a_1 (skS.0 0 a_1 a_2) Z)
% 3.46/3.64 False
% 3.46/3.64 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 a_3 : Iota),
% 3.46/3.64 Eq
% 3.46/3.64 (Or (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (big_p a_1 (skS.0 0 a_1 a_2) (f (skS.0 0 a_1 a_2))) →
% 3.46/3.64 big_p a_1 (skS.0 0 a_1 a_2) a_3)
% 3.46/3.64 False
% 3.46/3.64 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 : Iota),
% 3.46/3.64 Eq (Or (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) (big_p a_1 (skS.0 0 a_1 a_2) (f (skS.0 0 a_1 a_2)))) True
% 3.46/3.64 Clause #7 (by clausification #[5]): ∀ (a a_1 a_2 : Iota), Eq (big_p a (skS.0 0 a a_1) a_2) False
% 3.46/3.64 Clause #8 (by clausification #[6]): ∀ (a_1 a_2 : Iota),
% 3.46/3.64 Or (Eq (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) True)
% 3.46/3.64 (Eq (big_p a_1 (skS.0 0 a_1 a_2) (f (skS.0 0 a_1 a_2))) True)
% 3.46/3.64 Clause #9 (by superposition #[7, 8]): ∀ (a_1 a_2 : Iota), Or (Eq (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) True) (Eq True False)
% 3.46/3.64 Clause #10 (by clausification #[9]): ∀ (a_1 a_2 : Iota), Eq (big_p a (skS.0 0 a_1 a_2) (h (skS.0 0 a_1 a_2))) True
% 3.46/3.64 Clause #12 (by superposition #[10, 7]): Eq True False
% 3.46/3.64 Clause #13 (by clausification #[12]): False
% 3.46/3.64 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------