TSTP Solution File: SYO200^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYO200^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n008.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 04:21:49 EDT 2023
% Result : Theorem 3.67s 3.87s
% Output : Proof 3.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO200^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : duper %s
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 07:33:32 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.67/3.87 SZS status Theorem for theBenchmark.p
% 3.67/3.87 SZS output start Proof for theBenchmark.p
% 3.67/3.87 Clause #0 (by assumption #[]): Eq (Not (∀ (Xx Xy : Prop), Exists fun Xp => Xp Xx → Xp Xy)) True
% 3.67/3.87 Clause #1 (by clausification #[0]): Eq (∀ (Xx Xy : Prop), Exists fun Xp => Xp Xx → Xp Xy) False
% 3.67/3.87 Clause #2 (by clausification #[1]): ∀ (a : Prop), Eq (Not (∀ (Xy : Prop), Exists fun Xp => Xp (skS.0 0 a) → Xp Xy)) True
% 3.67/3.87 Clause #3 (by clausification #[2]): ∀ (a : Prop), Eq (∀ (Xy : Prop), Exists fun Xp => Xp (skS.0 0 a) → Xp Xy) False
% 3.67/3.87 Clause #4 (by clausification #[3]): ∀ (a a_1 : Prop), Eq (Not (Exists fun Xp => Xp (skS.0 0 a) → Xp (skS.0 1 a a_1))) True
% 3.67/3.87 Clause #5 (by clausification #[4]): ∀ (a a_1 : Prop), Eq (Exists fun Xp => Xp (skS.0 0 a) → Xp (skS.0 1 a a_1)) False
% 3.67/3.87 Clause #6 (by clausification #[5]): ∀ (a : Prop → Prop) (a_1 a_2 : Prop), Eq (a (skS.0 0 a_1) → a (skS.0 1 a_1 a_2)) False
% 3.67/3.87 Clause #7 (by clausification #[6]): ∀ (a : Prop → Prop) (a_1 : Prop), Eq (a (skS.0 0 a_1)) True
% 3.67/3.87 Clause #9 (by identity loobHoist #[7]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a True) True) (Eq (skS.0 0 a_1) False)
% 3.67/3.87 Clause #10 (by identity boolHoist #[7]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a False) True) (Eq (skS.0 0 a_1) True)
% 3.67/3.87 Clause #11 (by identity loobHoist #[9]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a True) True) (Or (Eq (skS.0 0 True) False) (Eq a_1 False))
% 3.67/3.87 Clause #13 (by identity loobHoist #[10]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a False) True) (Or (Eq (skS.0 0 True) True) (Eq a_1 False))
% 3.67/3.87 Clause #15 (by falseElim #[13]): ∀ (a : Prop → Prop), Or (Eq (a False) True) (Eq (skS.0 0 True) True)
% 3.67/3.87 Clause #16 (by superposition #[15, 11]): ∀ (a a_1 : Prop → Prop) (a_2 : Prop),
% 3.67/3.87 Or (Eq (a False) True) (Or (Eq (a_1 True) True) (Or (Eq True False) (Eq a_2 False)))
% 3.67/3.87 Clause #23 (by clausification #[16]): ∀ (a a_1 : Prop → Prop) (a_2 : Prop), Or (Eq (a False) True) (Or (Eq (a_1 True) True) (Eq a_2 False))
% 3.67/3.87 Clause #25 (by falseElim #[23]): ∀ (a a_1 : Prop → Prop), Or (Eq (a False) True) (Eq (a_1 True) True)
% 3.67/3.87 Clause #59 (by equality factoring #[25]): Or (Ne True True) (Eq ((fun x => x) False) True)
% 3.67/3.87 Clause #60 (by betaEtaReduce #[59]): Or (Ne True True) (Eq False True)
% 3.67/3.87 Clause #61 (by clausification #[60]): Or (Eq False True) (Or (Eq True False) (Eq True False))
% 3.67/3.87 Clause #63 (by clausification #[61]): Or (Eq True False) (Eq True False)
% 3.67/3.87 Clause #64 (by clausification #[63]): Eq True False
% 3.67/3.87 Clause #65 (by clausification #[64]): False
% 3.67/3.87 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------