TSTP Solution File: LCL460+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : LCL460+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n021.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 07:09:51 EDT 2023
% Result : Theorem 3.51s 3.70s
% Output : Proof 3.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL460+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : duper %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 03:30:26 EDT 2023
% 0.13/0.36 % CPUTime :
% 3.51/3.70 SZS status Theorem for theBenchmark.p
% 3.51/3.70 SZS output start Proof for theBenchmark.p
% 3.51/3.70 Clause #6 (by assumption #[]): Eq (Iff and_1 (∀ (X Y : Iota), is_a_theorem (implies (and X Y) X))) True
% 3.51/3.70 Clause #16 (by assumption #[]): Eq (Iff kn2 (∀ (P Q : Iota), is_a_theorem (implies (and P Q) P))) True
% 3.51/3.70 Clause #39 (by assumption #[]): Eq and_1 True
% 3.51/3.70 Clause #49 (by assumption #[]): Eq (Not kn2) True
% 3.51/3.70 Clause #77 (by clausification #[49]): Eq kn2 False
% 3.51/3.70 Clause #128 (by clausification #[6]): Or (Eq and_1 False) (Eq (∀ (X Y : Iota), is_a_theorem (implies (and X Y) X)) True)
% 3.51/3.70 Clause #134 (by clausification #[128]): ∀ (a : Iota), Or (Eq and_1 False) (Eq (∀ (Y : Iota), is_a_theorem (implies (and a Y) a)) True)
% 3.51/3.70 Clause #135 (by clausification #[134]): ∀ (a a_1 : Iota), Or (Eq and_1 False) (Eq (is_a_theorem (implies (and a a_1) a)) True)
% 3.51/3.70 Clause #136 (by forward demodulation #[135, 39]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (is_a_theorem (implies (and a a_1) a)) True)
% 3.51/3.70 Clause #137 (by clausification #[136]): ∀ (a a_1 : Iota), Eq (is_a_theorem (implies (and a a_1) a)) True
% 3.51/3.70 Clause #148 (by clausification #[16]): Or (Eq kn2 True) (Eq (∀ (P Q : Iota), is_a_theorem (implies (and P Q) P)) False)
% 3.51/3.70 Clause #150 (by clausification #[148]): ∀ (a : Iota), Or (Eq kn2 True) (Eq (Not (∀ (Q : Iota), is_a_theorem (implies (and (skS.0 19 a) Q) (skS.0 19 a)))) True)
% 3.51/3.70 Clause #151 (by clausification #[150]): ∀ (a : Iota), Or (Eq kn2 True) (Eq (∀ (Q : Iota), is_a_theorem (implies (and (skS.0 19 a) Q) (skS.0 19 a))) False)
% 3.51/3.70 Clause #152 (by clausification #[151]): ∀ (a a_1 : Iota),
% 3.51/3.70 Or (Eq kn2 True) (Eq (Not (is_a_theorem (implies (and (skS.0 19 a) (skS.0 20 a a_1)) (skS.0 19 a)))) True)
% 3.51/3.70 Clause #153 (by clausification #[152]): ∀ (a a_1 : Iota), Or (Eq kn2 True) (Eq (is_a_theorem (implies (and (skS.0 19 a) (skS.0 20 a a_1)) (skS.0 19 a))) False)
% 3.51/3.70 Clause #154 (by forward demodulation #[153, 77]): ∀ (a a_1 : Iota),
% 3.51/3.70 Or (Eq False True) (Eq (is_a_theorem (implies (and (skS.0 19 a) (skS.0 20 a a_1)) (skS.0 19 a))) False)
% 3.51/3.70 Clause #155 (by clausification #[154]): ∀ (a a_1 : Iota), Eq (is_a_theorem (implies (and (skS.0 19 a) (skS.0 20 a a_1)) (skS.0 19 a))) False
% 3.51/3.70 Clause #156 (by superposition #[155, 137]): Eq False True
% 3.51/3.70 Clause #157 (by clausification #[156]): False
% 3.51/3.70 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------