TSTP Solution File: SET588^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SET588^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n002.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 14:46:55 EDT 2023
% Result : Theorem 3.45s 3.64s
% Output : Proof 3.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET588^5 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : duper %s
% 0.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 10:58:18 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.45/3.64 SZS status Theorem for theBenchmark.p
% 3.45/3.64 SZS output start Proof for theBenchmark.p
% 3.45/3.64 Clause #0 (by assumption #[]): Eq
% 3.45/3.64 (Not
% 3.45/3.64 (∀ (X Y Z : a → Prop), (∀ (Xx : a), X Xx → Y Xx) → ∀ (Xx : a), And (X Xx) (Not (Z Xx)) → And (Y Xx) (Not (Z Xx))))
% 3.45/3.64 True
% 3.45/3.64 Clause #1 (by clausification #[0]): Eq (∀ (X Y Z : a → Prop), (∀ (Xx : a), X Xx → Y Xx) → ∀ (Xx : a), And (X Xx) (Not (Z Xx)) → And (Y Xx) (Not (Z Xx)))
% 3.45/3.64 False
% 3.45/3.64 Clause #2 (by clausification #[1]): ∀ (a_1 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 (Not
% 3.45/3.64 (∀ (Y Z : a → Prop),
% 3.45/3.64 (∀ (Xx : a), skS.0 0 a_1 Xx → Y Xx) → ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Not (Z Xx)) → And (Y Xx) (Not (Z Xx))))
% 3.45/3.64 True
% 3.45/3.64 Clause #3 (by clausification #[2]): ∀ (a_1 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 (∀ (Y Z : a → Prop),
% 3.45/3.64 (∀ (Xx : a), skS.0 0 a_1 Xx → Y Xx) → ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Not (Z Xx)) → And (Y Xx) (Not (Z Xx)))
% 3.45/3.64 False
% 3.45/3.64 Clause #4 (by clausification #[3]): ∀ (a_1 a_2 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 (Not
% 3.45/3.64 (∀ (Z : a → Prop),
% 3.45/3.64 (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) →
% 3.45/3.64 ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Not (Z Xx)) → And (skS.0 1 a_1 a_2 Xx) (Not (Z Xx))))
% 3.45/3.64 True
% 3.45/3.64 Clause #5 (by clausification #[4]): ∀ (a_1 a_2 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 (∀ (Z : a → Prop),
% 3.45/3.64 (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) →
% 3.45/3.64 ∀ (Xx : a), And (skS.0 0 a_1 Xx) (Not (Z Xx)) → And (skS.0 1 a_1 a_2 Xx) (Not (Z Xx)))
% 3.45/3.64 False
% 3.45/3.64 Clause #6 (by clausification #[5]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 (Not
% 3.45/3.64 ((∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) →
% 3.45/3.64 ∀ (Xx : a),
% 3.45/3.64 And (skS.0 0 a_1 Xx) (Not (skS.0 2 a_1 a_2 a_3 Xx)) →
% 3.45/3.64 And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 2 a_1 a_2 a_3 Xx))))
% 3.45/3.64 True
% 3.45/3.64 Clause #7 (by clausification #[6]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 ((∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) →
% 3.45/3.64 ∀ (Xx : a),
% 3.45/3.64 And (skS.0 0 a_1 Xx) (Not (skS.0 2 a_1 a_2 a_3 Xx)) → And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 2 a_1 a_2 a_3 Xx)))
% 3.45/3.64 False
% 3.45/3.64 Clause #8 (by clausification #[7]): ∀ (a_1 a_2 : a → Prop), Eq (∀ (Xx : a), skS.0 0 a_1 Xx → skS.0 1 a_1 a_2 Xx) True
% 3.45/3.64 Clause #9 (by clausification #[7]): ∀ (a_1 a_2 a_3 : a → Prop),
% 3.45/3.64 Eq
% 3.45/3.64 (∀ (Xx : a),
% 3.45/3.64 And (skS.0 0 a_1 Xx) (Not (skS.0 2 a_1 a_2 a_3 Xx)) → And (skS.0 1 a_1 a_2 Xx) (Not (skS.0 2 a_1 a_2 a_3 Xx)))
% 3.45/3.64 False
% 3.45/3.64 Clause #10 (by clausification #[8]): ∀ (a_1 : a → Prop) (a_2 : a) (a_3 : a → Prop), Eq (skS.0 0 a_1 a_2 → skS.0 1 a_1 a_3 a_2) True
% 3.45/3.64 Clause #11 (by clausification #[10]): ∀ (a_1 : a → Prop) (a_2 : a) (a_3 : a → Prop), Or (Eq (skS.0 0 a_1 a_2) False) (Eq (skS.0 1 a_1 a_3 a_2) True)
% 3.45/3.64 Clause #12 (by clausification #[9]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.45/3.64 Eq
% 3.45/3.64 (Not
% 3.45/3.64 (And (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4))) →
% 3.45/3.64 And (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)))))
% 3.45/3.64 True
% 3.45/3.64 Clause #13 (by clausification #[12]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.45/3.64 Eq
% 3.45/3.64 (And (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4))) →
% 3.45/3.64 And (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4))))
% 3.45/3.64 False
% 3.45/3.64 Clause #14 (by clausification #[13]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.45/3.64 Eq (And (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)))) True
% 3.45/3.64 Clause #15 (by clausification #[13]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.45/3.64 Eq (And (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)))) False
% 3.45/3.64 Clause #16 (by clausification #[14]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4))) True
% 3.45/3.64 Clause #17 (by clausification #[14]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 0 a_1 (skS.0 3 a_1 a_2 a_3 a_4)) True
% 3.45/3.64 Clause #18 (by clausification #[16]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) False
% 3.48/3.64 Clause #19 (by superposition #[17, 11]): ∀ (a_1 a_2 a_3 a_4 : a → Prop) (a_5 : a), Or (Eq True False) (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_3 a_4 a_5)) True)
% 3.48/3.64 Clause #20 (by clausification #[19]): ∀ (a_1 a_2 a_3 a_4 : a → Prop) (a_5 : a), Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_3 a_4 a_5)) True
% 3.48/3.64 Clause #21 (by clausification #[15]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.48/3.64 Or (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) False)
% 3.48/3.64 (Eq (Not (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4))) False)
% 3.48/3.64 Clause #22 (by clausification #[21]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a),
% 3.48/3.64 Or (Eq (skS.0 1 a_1 a_2 (skS.0 3 a_1 a_2 a_3 a_4)) False) (Eq (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) True)
% 3.48/3.64 Clause #23 (by forward demodulation #[22, 20]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Or (Eq True False) (Eq (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) True)
% 3.48/3.64 Clause #24 (by clausification #[23]): ∀ (a_1 a_2 a_3 : a → Prop) (a_4 : a), Eq (skS.0 2 a_1 a_2 a_3 (skS.0 3 a_1 a_2 a_3 a_4)) True
% 3.48/3.64 Clause #25 (by superposition #[24, 18]): Eq True False
% 3.48/3.64 Clause #26 (by clausification #[25]): False
% 3.48/3.64 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------