%------------------------------------------------------------------------------ % File : Duper---1.0 % Problem : SYN341+1 : TPTP v9.2.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : duper %s % Computer : n003.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 Oct 3 08:07:26 PM UTC 2025 % Result : Theorem 5.33s 5.56s % Output : Proof 5.33s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.10 % Problem : SYN341+1 : TPTP v9.2.0. Released v2.0.0. % 0.09/0.11 % Command : duper %s % 0.10/0.31 % Computer : n003.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Thu Oct 2 15:10:38 EDT 2025 % 0.10/0.31 % CPUTime : % 5.33/5.56 SZS status Theorem for theBenchmark.p % 5.33/5.56 SZS output start Proof for theBenchmark.p % 5.33/5.56 Clause #0 (by assumption #[]): Eq (Not (Exists fun X1 => ∀ (X2 : Iota), Exists fun X3 => ∀ (X4 : Iota), big_f X1 X2 X3 → big_f X2 X3 X4)) True % 5.33/5.56 Clause #1 (by clausification #[0]): Eq (Exists fun X1 => ∀ (X2 : Iota), Exists fun X3 => ∀ (X4 : Iota), big_f X1 X2 X3 → big_f X2 X3 X4) False % 5.33/5.56 Clause #2 (by clausification #[1]): ∀ (a : Iota), Eq (∀ (X2 : Iota), Exists fun X3 => ∀ (X4 : Iota), big_f a X2 X3 → big_f X2 X3 X4) False % 5.33/5.56 Clause #3 (by clausification #[2]): ∀ (a a_1 : Iota), % 5.33/5.56 Eq (Not (Exists fun X3 => ∀ (X4 : Iota), big_f a (skS.0 0 a a_1) X3 → big_f (skS.0 0 a a_1) X3 X4)) True % 5.33/5.56 Clause #4 (by clausification #[3]): ∀ (a a_1 : Iota), Eq (Exists fun X3 => ∀ (X4 : Iota), big_f a (skS.0 0 a a_1) X3 → big_f (skS.0 0 a a_1) X3 X4) False % 5.33/5.56 Clause #5 (by clausification #[4]): ∀ (a a_1 a_2 : Iota), Eq (∀ (X4 : Iota), big_f a (skS.0 0 a a_1) a_2 → big_f (skS.0 0 a a_1) a_2 X4) False % 5.33/5.56 Clause #6 (by clausification #[5]): ∀ (a a_1 a_2 a_3 : Iota), % 5.33/5.56 Eq (Not (big_f a (skS.0 0 a a_1) a_2 → big_f (skS.0 0 a a_1) a_2 (skS.0 1 a a_1 a_2 a_3))) True % 5.33/5.56 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 → big_f (skS.0 0 a a_1) a_2 (skS.0 1 a a_1 a_2 a_3)) False % 5.33/5.56 Clause #8 (by clausification #[7]): ∀ (a a_1 a_2 : Iota), Eq (big_f a (skS.0 0 a a_1) a_2) True % 5.33/5.56 Clause #9 (by clausification #[7]): ∀ (a a_1 a_2 a_3 : Iota), Eq (big_f (skS.0 0 a a_1) a_2 (skS.0 1 a a_1 a_2 a_3)) False % 5.33/5.56 Clause #10 (by superposition #[9, 8]): Eq False True % 5.33/5.56 Clause #11 (by clausification #[10]): False % 5.33/5.56 SZS output end Proof for theBenchmark.p %------------------------------------------------------------------------------