TSTP Solution File: SYO207^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SYO207^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n031.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:51 EDT 2023
% Result : Theorem 3.93s 4.15s
% Output : Proof 3.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYO207^5 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : duper %s
% 0.14/0.36 % Computer : n031.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 : Sat Aug 26 07:42:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.93/4.15 SZS status Theorem for theBenchmark.p
% 3.93/4.15 SZS output start Proof for theBenchmark.p
% 3.93/4.15 Clause #0 (by assumption #[]): Eq (Not (∀ (Xx Xy : Prop), Eq (Eq Xx Xy) (Eq Xy Xx))) True
% 3.93/4.15 Clause #1 (by clausification #[0]): Eq (∀ (Xx Xy : Prop), Eq (Eq Xx Xy) (Eq Xy Xx)) False
% 3.93/4.15 Clause #2 (by clausification #[1]): ∀ (a : Prop), Eq (Not (∀ (Xy : Prop), Eq (Eq (skS.0 0 a) Xy) (Eq Xy (skS.0 0 a)))) True
% 3.93/4.15 Clause #3 (by clausification #[2]): ∀ (a : Prop), Eq (∀ (Xy : Prop), Eq (Eq (skS.0 0 a) Xy) (Eq Xy (skS.0 0 a))) False
% 3.93/4.15 Clause #4 (by clausification #[3]): ∀ (a a_1 : Prop), Eq (Not (Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) (Eq (skS.0 1 a a_1) (skS.0 0 a)))) True
% 3.93/4.15 Clause #5 (by clausification #[4]): ∀ (a a_1 : Prop), Eq (Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) (Eq (skS.0 1 a a_1) (skS.0 0 a))) False
% 3.93/4.15 Clause #6 (by clausification #[5]): ∀ (a a_1 : Prop), Ne (Eq (skS.0 0 a) (skS.0 1 a a_1)) (Eq (skS.0 1 a a_1) (skS.0 0 a))
% 3.93/4.15 Clause #7 (by clausification #[6]): ∀ (a a_1 : Prop), Or (Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) False) (Eq (Eq (skS.0 1 a a_1) (skS.0 0 a)) False)
% 3.93/4.15 Clause #8 (by clausification #[6]): ∀ (a a_1 : Prop), Or (Eq (Eq (skS.0 0 a) (skS.0 1 a a_1)) True) (Eq (Eq (skS.0 1 a a_1) (skS.0 0 a)) True)
% 3.93/4.15 Clause #9 (by clausification #[7]): ∀ (a a_1 : Prop), Or (Eq (Eq (skS.0 1 a a_1) (skS.0 0 a)) False) (Ne (skS.0 0 a) (skS.0 1 a a_1))
% 3.93/4.15 Clause #10 (by clausification #[9]): ∀ (a a_1 : Prop), Or (Ne (skS.0 0 a) (skS.0 1 a a_1)) (Ne (skS.0 1 a a_1) (skS.0 0 a))
% 3.93/4.15 Clause #11 (by clausification #[10]): ∀ (a a_1 : Prop), Or (Ne (skS.0 1 a a_1) (skS.0 0 a)) (Or (Eq (skS.0 0 a) False) (Eq (skS.0 1 a a_1) False))
% 3.93/4.15 Clause #12 (by clausification #[10]): ∀ (a a_1 : Prop), Or (Ne (skS.0 1 a a_1) (skS.0 0 a)) (Or (Eq (skS.0 0 a) True) (Eq (skS.0 1 a a_1) True))
% 3.93/4.15 Clause #13 (by clausification #[11]): ∀ (a a_1 : Prop),
% 3.93/4.15 Or (Eq (skS.0 0 a) False) (Or (Eq (skS.0 1 a a_1) False) (Or (Eq (skS.0 1 a a_1) False) (Eq (skS.0 0 a) False)))
% 3.93/4.15 Clause #15 (by eliminate duplicate literals #[13]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 a) False) (Eq (skS.0 1 a a_1) False)
% 3.93/4.15 Clause #16 (by identity loobHoist #[15]): ∀ (a a_1 : Prop), Or (Eq (skS.0 1 a a_1) False) (Or (Eq (skS.0 0 True) False) (Eq a False))
% 3.93/4.15 Clause #18 (by identity loobHoist #[16]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 True) False) (Or (Eq a False) (Or (Eq (skS.0 1 a True) False) (Eq a_1 False)))
% 3.93/4.15 Clause #20 (by identity loobHoist #[18]): ∀ (a a_1 : Prop),
% 3.93/4.15 Or (Eq (skS.0 0 True) False) (Or (Eq a False) (Or (Eq a_1 False) (Or (Eq (skS.0 1 True True) False) (Eq a False))))
% 3.93/4.15 Clause #22 (by eliminate duplicate literals #[20]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 True) False) (Or (Eq a False) (Or (Eq a_1 False) (Eq (skS.0 1 True True) False)))
% 3.93/4.15 Clause #33 (by clausification #[8]): ∀ (a a_1 : Prop), Or (Eq (Eq (skS.0 1 a a_1) (skS.0 0 a)) True) (Eq (skS.0 0 a) (skS.0 1 a a_1))
% 3.93/4.15 Clause #34 (by clausification #[33]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 a) (skS.0 1 a a_1)) (Eq (skS.0 1 a a_1) (skS.0 0 a))
% 3.93/4.15 Clause #35 (by eliminate duplicate literals #[34]): ∀ (a a_1 : Prop), Eq (skS.0 0 a) (skS.0 1 a a_1)
% 3.93/4.15 Clause #36 (by identity loobHoist #[35]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 True) (skS.0 1 a a_1)) (Eq a False)
% 3.93/4.15 Clause #38 (by identity loobHoist #[36]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq (skS.0 0 True) (skS.0 1 a True)) (Eq a_1 False))
% 3.93/4.15 Clause #40 (by identity loobHoist #[38]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 False) (Or (Eq (skS.0 0 True) (skS.0 1 True True)) (Eq a False)))
% 3.93/4.15 Clause #42 (by eliminate duplicate literals #[40]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 False) (Eq (skS.0 0 True) (skS.0 1 True True)))
% 3.93/4.15 Clause #43 (by falseElim #[42]): ∀ (a : Prop), Or (Eq a False) (Eq (skS.0 0 True) (skS.0 1 True True))
% 3.93/4.15 Clause #44 (by falseElim #[43]): Eq (skS.0 0 True) (skS.0 1 True True)
% 3.93/4.15 Clause #49 (by clausification #[12]): ∀ (a a_1 : Prop),
% 3.93/4.15 Or (Eq (skS.0 0 a) True) (Or (Eq (skS.0 1 a a_1) True) (Or (Eq (skS.0 1 a a_1) True) (Eq (skS.0 0 a) True)))
% 3.93/4.15 Clause #108 (by eliminate duplicate literals #[49]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 a) True) (Eq (skS.0 1 a a_1) True)
% 3.93/4.16 Clause #109 (by identity loobHoist #[108]): ∀ (a a_1 : Prop), Or (Eq (skS.0 1 a a_1) True) (Or (Eq (skS.0 0 True) True) (Eq a False))
% 3.93/4.16 Clause #111 (by identity loobHoist #[109]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 True) True) (Or (Eq a False) (Or (Eq (skS.0 1 a True) True) (Eq a_1 False)))
% 3.93/4.16 Clause #113 (by identity loobHoist #[111]): ∀ (a a_1 : Prop),
% 3.93/4.16 Or (Eq (skS.0 0 True) True) (Or (Eq a False) (Or (Eq a_1 False) (Or (Eq (skS.0 1 True True) True) (Eq a False))))
% 3.93/4.16 Clause #115 (by eliminate duplicate literals #[113]): ∀ (a a_1 : Prop), Or (Eq (skS.0 0 True) True) (Or (Eq a False) (Or (Eq a_1 False) (Eq (skS.0 1 True True) True)))
% 3.93/4.16 Clause #120 (by falseElim #[115]): ∀ (a : Prop), Or (Eq (skS.0 0 True) True) (Or (Eq a False) (Eq (skS.0 1 True True) True))
% 3.93/4.16 Clause #129 (by falseElim #[120]): Or (Eq (skS.0 0 True) True) (Eq (skS.0 1 True True) True)
% 3.93/4.16 Clause #130 (by superposition #[129, 44]): Or (Eq (skS.0 0 True) True) (Eq (skS.0 0 True) True)
% 3.93/4.16 Clause #132 (by eliminate duplicate literals #[130]): Eq (skS.0 0 True) True
% 3.93/4.16 Clause #133 (by backward demodulation #[132, 22]): ∀ (a a_1 : Prop), Or (Eq True False) (Or (Eq a False) (Or (Eq a_1 False) (Eq (skS.0 1 True True) False)))
% 3.93/4.16 Clause #135 (by backward demodulation #[132, 44]): Eq True (skS.0 1 True True)
% 3.93/4.16 Clause #160 (by clausification #[133]): ∀ (a a_1 : Prop), Or (Eq a False) (Or (Eq a_1 False) (Eq (skS.0 1 True True) False))
% 3.93/4.16 Clause #165 (by falseElim #[160]): ∀ (a : Prop), Or (Eq a False) (Eq (skS.0 1 True True) False)
% 3.93/4.16 Clause #170 (by falseElim #[165]): Eq (skS.0 1 True True) False
% 3.93/4.16 Clause #171 (by superposition #[170, 135]): Eq True False
% 3.93/4.16 Clause #172 (by clausification #[171]): False
% 3.93/4.16 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------