TSTP Solution File: SEU935^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU935^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n025.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 : Thu Aug 31 16:44:21 EDT 2023
% Result : Theorem 3.59s 3.79s
% Output : Proof 3.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SEU935^5 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.14 % Command : duper %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Wed Aug 23 16:41:36 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.59/3.79 SZS status Theorem for theBenchmark.p
% 3.59/3.79 SZS output start Proof for theBenchmark.p
% 3.59/3.79 Clause #0 (by assumption #[]): Eq
% 3.59/3.79 (Not
% 3.59/3.79 (∀ (F : a → b) (G : b → c),
% 3.59/3.79 And (∀ (Y : b), Exists fun X => Eq (F X) Y) (∀ (Y : c), Exists fun X => Eq (G X) Y) →
% 3.59/3.79 ∀ (Y : c), Exists fun X => Eq (G (F X)) Y))
% 3.59/3.79 True
% 3.59/3.79 Clause #1 (by clausification #[0]): Eq
% 3.59/3.79 (∀ (F : a → b) (G : b → c),
% 3.59/3.79 And (∀ (Y : b), Exists fun X => Eq (F X) Y) (∀ (Y : c), Exists fun X => Eq (G X) Y) →
% 3.59/3.79 ∀ (Y : c), Exists fun X => Eq (G (F X)) Y)
% 3.59/3.79 False
% 3.59/3.79 Clause #2 (by clausification #[1]): ∀ (a_1 : a → b),
% 3.59/3.79 Eq
% 3.59/3.79 (Not
% 3.59/3.79 (∀ (G : b → c),
% 3.59/3.79 And (∀ (Y : b), Exists fun X => Eq (skS.0 0 a_1 X) Y) (∀ (Y : c), Exists fun X => Eq (G X) Y) →
% 3.59/3.79 ∀ (Y : c), Exists fun X => Eq (G (skS.0 0 a_1 X)) Y))
% 3.59/3.79 True
% 3.59/3.79 Clause #3 (by clausification #[2]): ∀ (a_1 : a → b),
% 3.59/3.79 Eq
% 3.59/3.79 (∀ (G : b → c),
% 3.59/3.79 And (∀ (Y : b), Exists fun X => Eq (skS.0 0 a_1 X) Y) (∀ (Y : c), Exists fun X => Eq (G X) Y) →
% 3.59/3.79 ∀ (Y : c), Exists fun X => Eq (G (skS.0 0 a_1 X)) Y)
% 3.59/3.79 False
% 3.59/3.79 Clause #4 (by clausification #[3]): ∀ (a_1 : a → b) (a_2 : b → c),
% 3.59/3.79 Eq
% 3.59/3.79 (Not
% 3.59/3.79 (And (∀ (Y : b), Exists fun X => Eq (skS.0 0 a_1 X) Y) (∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 X) Y) →
% 3.59/3.79 ∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 (skS.0 0 a_1 X)) Y))
% 3.59/3.79 True
% 3.59/3.79 Clause #5 (by clausification #[4]): ∀ (a_1 : a → b) (a_2 : b → c),
% 3.59/3.79 Eq
% 3.59/3.79 (And (∀ (Y : b), Exists fun X => Eq (skS.0 0 a_1 X) Y) (∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 X) Y) →
% 3.59/3.79 ∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 (skS.0 0 a_1 X)) Y)
% 3.59/3.79 False
% 3.59/3.79 Clause #6 (by clausification #[5]): ∀ (a_1 : a → b) (a_2 : b → c),
% 3.59/3.79 Eq (And (∀ (Y : b), Exists fun X => Eq (skS.0 0 a_1 X) Y) (∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 X) Y)) True
% 3.59/3.79 Clause #7 (by clausification #[5]): ∀ (a_1 : a → b) (a_2 : b → c), Eq (∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 (skS.0 0 a_1 X)) Y) False
% 3.59/3.79 Clause #8 (by clausification #[6]): ∀ (a_1 : a → b) (a_2 : b → c), Eq (∀ (Y : c), Exists fun X => Eq (skS.0 1 a_1 a_2 X) Y) True
% 3.59/3.79 Clause #9 (by clausification #[6]): ∀ (a_1 : a → b), Eq (∀ (Y : b), Exists fun X => Eq (skS.0 0 a_1 X) Y) True
% 3.59/3.79 Clause #10 (by clausification #[8]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : c), Eq (Exists fun X => Eq (skS.0 1 a_1 a_2 X) a_3) True
% 3.59/3.79 Clause #11 (by clausification #[10]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : c) (a_4 : b), Eq (Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3 a_4)) a_3) True
% 3.59/3.79 Clause #12 (by clausification #[11]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : c) (a_4 : b), Eq (skS.0 1 a_1 a_2 (skS.0 2 a_1 a_2 a_3 a_4)) a_3
% 3.59/3.79 Clause #13 (by clausification #[9]): ∀ (a_1 : a → b) (a_2 : b), Eq (Exists fun X => Eq (skS.0 0 a_1 X) a_2) True
% 3.59/3.79 Clause #14 (by clausification #[13]): ∀ (a_1 : a → b) (a_2 : b) (a_3 : a), Eq (Eq (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3)) a_2) True
% 3.59/3.79 Clause #15 (by clausification #[14]): ∀ (a_1 : a → b) (a_2 : b) (a_3 : a), Eq (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3)) a_2
% 3.59/3.79 Clause #16 (by clausification #[7]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : c),
% 3.59/3.79 Eq (Not (Exists fun X => Eq (skS.0 1 a_1 a_2 (skS.0 0 a_1 X)) (skS.0 4 a_1 a_2 a_3))) True
% 3.59/3.79 Clause #17 (by clausification #[16]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : c),
% 3.59/3.79 Eq (Exists fun X => Eq (skS.0 1 a_1 a_2 (skS.0 0 a_1 X)) (skS.0 4 a_1 a_2 a_3)) False
% 3.59/3.79 Clause #18 (by clausification #[17]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : a) (a_4 : c),
% 3.59/3.79 Eq (Eq (skS.0 1 a_1 a_2 (skS.0 0 a_1 a_3)) (skS.0 4 a_1 a_2 a_4)) False
% 3.59/3.79 Clause #19 (by clausification #[18]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : a) (a_4 : c), Ne (skS.0 1 a_1 a_2 (skS.0 0 a_1 a_3)) (skS.0 4 a_1 a_2 a_4)
% 3.59/3.79 Clause #20 (by superposition #[19, 15]): ∀ (a_1 : a → b) (a_2 : b → c) (a_3 : b) (a_4 : c), Ne (skS.0 1 a_1 a_2 a_3) (skS.0 4 a_1 a_2 a_4)
% 3.59/3.79 Clause #21 (by superposition #[20, 12]): ∀ (a_1 : c) (a_2 : a → b) (a_3 : b → c) (a_4 : c), Ne a_1 (skS.0 4 a_2 a_3 a_4)
% 3.59/3.79 Clause #22 (by destructive equality resolution #[21]): False
% 3.59/3.79 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------