TSTP Solution File: SYO377^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYO377^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n012.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:22:18 EDT 2023
% Result : Theorem 3.30s 3.59s
% Output : Proof 3.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO377^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.33 % Computer : n012.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Sat Aug 26 02:01:56 EDT 2023
% 0.14/0.33 % CPUTime :
% 3.30/3.59 SZS status Theorem for theBenchmark.p
% 3.30/3.59 SZS output start Proof for theBenchmark.p
% 3.30/3.59 Clause #0 (by assumption #[]): Eq
% 3.30/3.59 (Not
% 3.30/3.59 ((∀ (Xx Xy : Prop), Iff Xx Xy → ∀ (Xq : Prop → Prop), Xq Xx → Xq Xy) →
% 3.30/3.59 ∀ (Xp : Prop → Prop), And (Xp a) (Xp b) → Xp (And a b)))
% 3.30/3.59 True
% 3.30/3.59 Clause #1 (by clausification #[0]): Eq
% 3.30/3.59 ((∀ (Xx Xy : Prop), Iff Xx Xy → ∀ (Xq : Prop → Prop), Xq Xx → Xq Xy) →
% 3.30/3.59 ∀ (Xp : Prop → Prop), And (Xp a) (Xp b) → Xp (And a b))
% 3.30/3.59 False
% 3.30/3.59 Clause #3 (by clausification #[1]): Eq (∀ (Xp : Prop → Prop), And (Xp a) (Xp b) → Xp (And a b)) False
% 3.30/3.59 Clause #16 (by clausification #[3]): ∀ (a_1 : Prop → Prop), Eq (Not (And (skS.0 0 a_1 a) (skS.0 0 a_1 b) → skS.0 0 a_1 (And a b))) True
% 3.30/3.59 Clause #17 (by clausification #[16]): ∀ (a_1 : Prop → Prop), Eq (And (skS.0 0 a_1 a) (skS.0 0 a_1 b) → skS.0 0 a_1 (And a b)) False
% 3.30/3.59 Clause #18 (by clausification #[17]): ∀ (a_1 : Prop → Prop), Eq (And (skS.0 0 a_1 a) (skS.0 0 a_1 b)) True
% 3.30/3.59 Clause #19 (by clausification #[17]): ∀ (a_1 : Prop → Prop), Eq (skS.0 0 a_1 (And a b)) False
% 3.30/3.59 Clause #20 (by clausification #[18]): ∀ (a : Prop → Prop), Eq (skS.0 0 a b) True
% 3.30/3.59 Clause #21 (by clausification #[18]): ∀ (a_1 : Prop → Prop), Eq (skS.0 0 a_1 a) True
% 3.30/3.59 Clause #22 (by identity loobHoist #[20]): ∀ (a : Prop → Prop), Or (Eq (skS.0 0 a True) True) (Eq b False)
% 3.30/3.59 Clause #23 (by identity boolHoist #[20]): ∀ (a : Prop → Prop), Or (Eq (skS.0 0 a False) True) (Eq b True)
% 3.30/3.59 Clause #29 (by identity boolHoist #[21]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 False) True) (Eq a True)
% 3.30/3.59 Clause #30 (by identity loobHoist #[19]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 True) False) (Eq (And a b) False)
% 3.30/3.59 Clause #31 (by identity boolHoist #[19]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 False) False) (Eq (And a b) True)
% 3.30/3.59 Clause #32 (by clausification #[30]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 True) False) (Or (Eq a False) (Eq b False))
% 3.30/3.59 Clause #36 (by clausification #[31]): ∀ (a : Prop → Prop), Or (Eq (skS.0 0 a False) False) (Eq b True)
% 3.30/3.59 Clause #37 (by clausification #[31]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 False) False) (Eq a True)
% 3.30/3.59 Clause #38 (by superposition #[36, 23]): Or (Eq b True) (Or (Eq False True) (Eq b True))
% 3.30/3.59 Clause #42 (by clausification #[38]): Or (Eq b True) (Eq b True)
% 3.30/3.59 Clause #43 (by eliminate duplicate literals #[42]): Eq b True
% 3.30/3.59 Clause #44 (by backward demodulation #[43, 22]): ∀ (a : Prop → Prop), Or (Eq (skS.0 0 a True) True) (Eq True False)
% 3.30/3.59 Clause #46 (by backward demodulation #[43, 32]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 True) False) (Or (Eq a False) (Eq True False))
% 3.30/3.59 Clause #48 (by clausification #[44]): ∀ (a : Prop → Prop), Eq (skS.0 0 a True) True
% 3.30/3.59 Clause #49 (by superposition #[37, 29]): Or (Eq a True) (Or (Eq False True) (Eq a True))
% 3.30/3.59 Clause #51 (by clausification #[49]): Or (Eq a True) (Eq a True)
% 3.30/3.59 Clause #52 (by eliminate duplicate literals #[51]): Eq a True
% 3.30/3.59 Clause #53 (by clausification #[46]): ∀ (a_1 : Prop → Prop), Or (Eq (skS.0 0 a_1 True) False) (Eq a False)
% 3.30/3.59 Clause #54 (by forward demodulation #[53, 52]): ∀ (a : Prop → Prop), Or (Eq (skS.0 0 a True) False) (Eq True False)
% 3.30/3.59 Clause #55 (by clausification #[54]): ∀ (a : Prop → Prop), Eq (skS.0 0 a True) False
% 3.30/3.59 Clause #56 (by superposition #[55, 48]): Eq False True
% 3.30/3.59 Clause #57 (by clausification #[56]): False
% 3.30/3.59 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------