TSTP Solution File: SYN340+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYN340+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n020.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:16 EDT 2023
% Result : Theorem 3.51s 3.74s
% Output : Proof 3.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYN340+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : duper %s
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat Aug 26 16:52:14 EDT 2023
% 0.22/0.36 % CPUTime :
% 3.51/3.74 SZS status Theorem for theBenchmark.p
% 3.51/3.74 SZS output start Proof for theBenchmark.p
% 3.51/3.74 Clause #0 (by assumption #[]): Eq (Not (Exists fun X => ∀ (Y : Iota), Exists fun Z1 => Exists fun Z2 => big_f X Y Z1 Z2 Z1 → big_f Z1 X Y Z1 Z2)) True
% 3.51/3.74 Clause #1 (by clausification #[0]): Eq (Exists fun X => ∀ (Y : Iota), Exists fun Z1 => Exists fun Z2 => big_f X Y Z1 Z2 Z1 → big_f Z1 X Y Z1 Z2) False
% 3.51/3.74 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (Y : Iota), Exists fun Z1 => Exists fun Z2 => big_f a Y Z1 Z2 Z1 → big_f Z1 a Y Z1 Z2) False
% 3.51/3.74 Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota),
% 3.51/3.74 Eq (Not (Exists fun Z1 => Exists fun Z2 => big_f a (skS.0 0 a a_1) Z1 Z2 Z1 → big_f Z1 a (skS.0 0 a a_1) Z1 Z2)) True
% 3.51/3.74 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota),
% 3.51/3.74 Eq (Exists fun Z1 => Exists fun Z2 => big_f a (skS.0 0 a a_1) Z1 Z2 Z1 → big_f Z1 a (skS.0 0 a a_1) Z1 Z2) False
% 3.51/3.74 Clause #5 (by clausification #[4]): ∀ (a a_1 a_2 : Iota),
% 3.51/3.74 Eq (Exists fun Z2 => big_f a (skS.0 0 a a_1) a_2 Z2 a_2 → big_f a_2 a (skS.0 0 a a_1) a_2 Z2) False
% 3.51/3.74 Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 a_3 : Iota), Eq (big_f a (skS.0 0 a a_1) a_2 a_3 a_2 → big_f a_2 a (skS.0 0 a a_1) a_2 a_3) False
% 3.51/3.74 Clause #7 (by clausification #[6]): ∀ (a a_1 a_2 a_3 : Iota), Eq (big_f a (skS.0 0 a a_1) a_2 a_3 a_2) True
% 3.51/3.74 Clause #8 (by clausification #[6]): ∀ (a a_1 a_2 a_3 : Iota), Eq (big_f a a_1 (skS.0 0 a_1 a_2) a a_3) False
% 3.51/3.74 Clause #9 (by superposition #[8, 7]): Eq False True
% 3.51/3.74 Clause #10 (by clausification #[9]): False
% 3.51/3.74 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------