TSTP Solution File: LCL483+1 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : LCL483+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n022.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:55 EDT 2023
% Result : Theorem 17.28s 17.44s
% Output : Proof 17.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : LCL483+1 : TPTP v8.1.2. Released v3.3.0.
% 0.13/0.15 % Command : duper %s
% 0.16/0.36 % Computer : n022.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 24 18:59:40 EDT 2023
% 0.16/0.36 % CPUTime :
% 17.28/17.44 SZS status Theorem for theBenchmark.p
% 17.28/17.44 SZS output start Proof for theBenchmark.p
% 17.28/17.44 Clause #2 (by assumption #[]): Eq (Iff modus_tollens (∀ (X Y : Iota), is_a_theorem (implies (implies (not Y) (not X)) (implies X Y)))) True
% 17.28/17.44 Clause #23 (by assumption #[]): Eq (Iff r3 (∀ (P Q : Iota), is_a_theorem (implies (or P Q) (or Q P)))) True
% 17.28/17.44 Clause #26 (by assumption #[]): Eq (op_or → ∀ (X Y : Iota), Eq (or X Y) (not (and (not X) (not Y)))) True
% 17.28/17.44 Clause #28 (by assumption #[]): Eq (op_implies_and → ∀ (X Y : Iota), Eq (implies X Y) (not (and X (not Y)))) True
% 17.28/17.44 Clause #29 (by assumption #[]): Eq (op_implies_or → ∀ (X Y : Iota), Eq (implies X Y) (or (not X) Y)) True
% 17.28/17.44 Clause #31 (by assumption #[]): Eq op_implies_or True
% 17.28/17.44 Clause #37 (by assumption #[]): Eq r3 True
% 17.28/17.44 Clause #41 (by assumption #[]): Eq op_or True
% 17.28/17.44 Clause #42 (by assumption #[]): Eq op_implies_and True
% 17.28/17.44 Clause #43 (by assumption #[]): Eq (Not modus_tollens) True
% 17.28/17.44 Clause #64 (by clausification #[43]): Eq modus_tollens False
% 17.28/17.44 Clause #77 (by clausification #[2]): Or (Eq modus_tollens True) (Eq (∀ (X Y : Iota), is_a_theorem (implies (implies (not Y) (not X)) (implies X Y))) False)
% 17.28/17.44 Clause #79 (by clausification #[77]): ∀ (a : Iota),
% 17.28/17.44 Or (Eq modus_tollens True)
% 17.28/17.44 (Eq (Not (∀ (Y : Iota), is_a_theorem (implies (implies (not Y) (not (skS.0 4 a))) (implies (skS.0 4 a) Y)))) True)
% 17.28/17.44 Clause #80 (by clausification #[79]): ∀ (a : Iota),
% 17.28/17.44 Or (Eq modus_tollens True)
% 17.28/17.44 (Eq (∀ (Y : Iota), is_a_theorem (implies (implies (not Y) (not (skS.0 4 a))) (implies (skS.0 4 a) Y))) False)
% 17.28/17.44 Clause #81 (by clausification #[80]): ∀ (a a_1 : Iota),
% 17.28/17.44 Or (Eq modus_tollens True)
% 17.28/17.44 (Eq
% 17.28/17.44 (Not
% 17.28/17.44 (is_a_theorem
% 17.28/17.44 (implies (implies (not (skS.0 5 a a_1)) (not (skS.0 4 a))) (implies (skS.0 4 a) (skS.0 5 a a_1)))))
% 17.28/17.44 True)
% 17.28/17.44 Clause #82 (by clausification #[81]): ∀ (a a_1 : Iota),
% 17.28/17.44 Or (Eq modus_tollens True)
% 17.28/17.44 (Eq (is_a_theorem (implies (implies (not (skS.0 5 a a_1)) (not (skS.0 4 a))) (implies (skS.0 4 a) (skS.0 5 a a_1))))
% 17.28/17.44 False)
% 17.28/17.44 Clause #83 (by forward demodulation #[82, 64]): ∀ (a a_1 : Iota),
% 17.28/17.44 Or (Eq False True)
% 17.28/17.44 (Eq (is_a_theorem (implies (implies (not (skS.0 5 a a_1)) (not (skS.0 4 a))) (implies (skS.0 4 a) (skS.0 5 a a_1))))
% 17.28/17.44 False)
% 17.28/17.44 Clause #84 (by clausification #[83]): ∀ (a a_1 : Iota),
% 17.28/17.44 Eq (is_a_theorem (implies (implies (not (skS.0 5 a a_1)) (not (skS.0 4 a))) (implies (skS.0 4 a) (skS.0 5 a a_1))))
% 17.28/17.44 False
% 17.28/17.44 Clause #223 (by clausification #[29]): Or (Eq op_implies_or False) (Eq (∀ (X Y : Iota), Eq (implies X Y) (or (not X) Y)) True)
% 17.28/17.44 Clause #224 (by clausification #[223]): ∀ (a : Iota), Or (Eq op_implies_or False) (Eq (∀ (Y : Iota), Eq (implies a Y) (or (not a) Y)) True)
% 17.28/17.44 Clause #225 (by clausification #[224]): ∀ (a a_1 : Iota), Or (Eq op_implies_or False) (Eq (Eq (implies a a_1) (or (not a) a_1)) True)
% 17.28/17.44 Clause #226 (by clausification #[225]): ∀ (a a_1 : Iota), Or (Eq op_implies_or False) (Eq (implies a a_1) (or (not a) a_1))
% 17.28/17.44 Clause #227 (by forward demodulation #[226, 31]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (implies a a_1) (or (not a) a_1))
% 17.28/17.44 Clause #228 (by clausification #[227]): ∀ (a a_1 : Iota), Eq (implies a a_1) (or (not a) a_1)
% 17.28/17.44 Clause #243 (by clausification #[23]): Or (Eq r3 False) (Eq (∀ (P Q : Iota), is_a_theorem (implies (or P Q) (or Q P))) True)
% 17.28/17.44 Clause #249 (by clausification #[243]): ∀ (a : Iota), Or (Eq r3 False) (Eq (∀ (Q : Iota), is_a_theorem (implies (or a Q) (or Q a))) True)
% 17.28/17.44 Clause #250 (by clausification #[249]): ∀ (a a_1 : Iota), Or (Eq r3 False) (Eq (is_a_theorem (implies (or a a_1) (or a_1 a))) True)
% 17.28/17.44 Clause #251 (by forward demodulation #[250, 37]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (is_a_theorem (implies (or a a_1) (or a_1 a))) True)
% 17.28/17.44 Clause #252 (by clausification #[251]): ∀ (a a_1 : Iota), Eq (is_a_theorem (implies (or a a_1) (or a_1 a))) True
% 17.28/17.44 Clause #254 (by superposition #[252, 228]): ∀ (a a_1 : Iota), Eq (is_a_theorem (implies (or a (not a_1)) (implies a_1 a))) True
% 17.28/17.44 Clause #268 (by clausification #[28]): Or (Eq op_implies_and False) (Eq (∀ (X Y : Iota), Eq (implies X Y) (not (and X (not Y)))) True)
% 17.31/17.48 Clause #269 (by clausification #[268]): ∀ (a : Iota), Or (Eq op_implies_and False) (Eq (∀ (Y : Iota), Eq (implies a Y) (not (and a (not Y)))) True)
% 17.31/17.48 Clause #270 (by clausification #[269]): ∀ (a a_1 : Iota), Or (Eq op_implies_and False) (Eq (Eq (implies a a_1) (not (and a (not a_1)))) True)
% 17.31/17.48 Clause #271 (by clausification #[270]): ∀ (a a_1 : Iota), Or (Eq op_implies_and False) (Eq (implies a a_1) (not (and a (not a_1))))
% 17.31/17.48 Clause #272 (by forward demodulation #[271, 42]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (implies a a_1) (not (and a (not a_1))))
% 17.31/17.48 Clause #273 (by clausification #[272]): ∀ (a a_1 : Iota), Eq (implies a a_1) (not (and a (not a_1)))
% 17.31/17.48 Clause #364 (by clausification #[26]): Or (Eq op_or False) (Eq (∀ (X Y : Iota), Eq (or X Y) (not (and (not X) (not Y)))) True)
% 17.31/17.48 Clause #365 (by clausification #[364]): ∀ (a : Iota), Or (Eq op_or False) (Eq (∀ (Y : Iota), Eq (or a Y) (not (and (not a) (not Y)))) True)
% 17.31/17.48 Clause #366 (by clausification #[365]): ∀ (a a_1 : Iota), Or (Eq op_or False) (Eq (Eq (or a a_1) (not (and (not a) (not a_1)))) True)
% 17.31/17.48 Clause #367 (by clausification #[366]): ∀ (a a_1 : Iota), Or (Eq op_or False) (Eq (or a a_1) (not (and (not a) (not a_1))))
% 17.31/17.48 Clause #368 (by forward demodulation #[367, 41]): ∀ (a a_1 : Iota), Or (Eq True False) (Eq (or a a_1) (not (and (not a) (not a_1))))
% 17.31/17.48 Clause #369 (by clausification #[368]): ∀ (a a_1 : Iota), Eq (or a a_1) (not (and (not a) (not a_1)))
% 17.31/17.48 Clause #370 (by superposition #[369, 273]): ∀ (a a_1 : Iota), Eq (implies (not a) a_1) (or a a_1)
% 17.31/17.48 Clause #389 (by backward demodulation #[370, 84]): ∀ (a a_1 : Iota),
% 17.31/17.48 Eq (is_a_theorem (implies (or (skS.0 5 a a_1) (not (skS.0 4 a))) (implies (skS.0 4 a) (skS.0 5 a a_1)))) False
% 17.31/17.48 Clause #5619 (by superposition #[389, 254]): Eq False True
% 17.31/17.48 Clause #5620 (by clausification #[5619]): False
% 17.31/17.48 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------