TSTP Solution File: SEV135^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEV135^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n010.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 19:24:20 EDT 2023
% Result : Theorem 3.31s 3.50s
% Output : Proof 3.31s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEV135^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : duper %s
% 0.14/0.36 % Computer : n010.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 : Thu Aug 24 02:35:51 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.31/3.50 SZS status Theorem for theBenchmark.p
% 3.31/3.50 SZS output start Proof for theBenchmark.p
% 3.31/3.50 Clause #0 (by assumption #[]): Eq
% 3.31/3.50 (Not
% 3.31/3.50 (∀ (Xr : a → a → Prop) (Xx Xy : a),
% 3.31/3.50 Xr Xx Xy →
% 3.31/3.50 ∀ (Xq : a → Prop), And (∀ (Xw : a), Xr Xx Xw → Xq Xw) (∀ (Xu Xv : a), And (Xq Xu) (Xr Xu Xv) → Xq Xv) → Xq Xy))
% 3.31/3.50 True
% 3.31/3.50 Clause #1 (by clausification #[0]): Eq
% 3.31/3.50 (∀ (Xr : a → a → Prop) (Xx Xy : a),
% 3.31/3.50 Xr Xx Xy →
% 3.31/3.50 ∀ (Xq : a → Prop), And (∀ (Xw : a), Xr Xx Xw → Xq Xw) (∀ (Xu Xv : a), And (Xq Xu) (Xr Xu Xv) → Xq Xv) → Xq Xy)
% 3.31/3.50 False
% 3.31/3.50 Clause #2 (by clausification #[1]): ∀ (a_1 : a → a → Prop),
% 3.31/3.50 Eq
% 3.31/3.50 (Not
% 3.31/3.50 (∀ (Xx Xy : a),
% 3.31/3.50 skS.0 0 a_1 Xx Xy →
% 3.31/3.50 ∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 Xx Xw → Xq Xw) (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) →
% 3.31/3.50 Xq Xy))
% 3.31/3.50 True
% 3.31/3.50 Clause #3 (by clausification #[2]): ∀ (a_1 : a → a → Prop),
% 3.31/3.50 Eq
% 3.31/3.50 (∀ (Xx Xy : a),
% 3.31/3.50 skS.0 0 a_1 Xx Xy →
% 3.31/3.50 ∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 Xx Xw → Xq Xw) (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) → Xq Xy)
% 3.31/3.50 False
% 3.31/3.50 Clause #4 (by clausification #[3]): ∀ (a_1 : a → a → Prop) (a_2 : a),
% 3.31/3.50 Eq
% 3.31/3.50 (Not
% 3.31/3.50 (∀ (Xy : a),
% 3.31/3.50 skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy →
% 3.31/3.50 ∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → Xq Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) →
% 3.31/3.50 Xq Xy))
% 3.31/3.50 True
% 3.31/3.50 Clause #5 (by clausification #[4]): ∀ (a_1 : a → a → Prop) (a_2 : a),
% 3.31/3.50 Eq
% 3.31/3.50 (∀ (Xy : a),
% 3.31/3.50 skS.0 0 a_1 (skS.0 1 a_1 a_2) Xy →
% 3.31/3.50 ∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → Xq Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) →
% 3.31/3.50 Xq Xy)
% 3.31/3.50 False
% 3.31/3.50 Clause #6 (by clausification #[5]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.31/3.50 Eq
% 3.31/3.50 (Not
% 3.31/3.50 (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) →
% 3.31/3.50 ∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → Xq Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) →
% 3.31/3.50 Xq (skS.0 2 a_1 a_2 a_3)))
% 3.31/3.50 True
% 3.31/3.50 Clause #7 (by clausification #[6]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.31/3.50 Eq
% 3.31/3.50 (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3) →
% 3.31/3.50 ∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → Xq Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) →
% 3.31/3.50 Xq (skS.0 2 a_1 a_2 a_3))
% 3.31/3.50 False
% 3.31/3.50 Clause #8 (by clausification #[7]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a), Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) (skS.0 2 a_1 a_2 a_3)) True
% 3.31/3.50 Clause #9 (by clausification #[7]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a),
% 3.31/3.50 Eq
% 3.31/3.50 (∀ (Xq : a → Prop),
% 3.31/3.50 And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → Xq Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (Xq Xu) (skS.0 0 a_1 Xu Xv) → Xq Xv) →
% 3.31/3.50 Xq (skS.0 2 a_1 a_2 a_3))
% 3.31/3.50 False
% 3.31/3.50 Clause #10 (by clausification #[9]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop),
% 3.31/3.50 Eq
% 3.31/3.50 (Not
% 3.31/3.50 (And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → skS.0 3 a_1 a_2 a_3 a_4 Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (skS.0 3 a_1 a_2 a_3 a_4 Xu) (skS.0 0 a_1 Xu Xv) → skS.0 3 a_1 a_2 a_3 a_4 Xv) →
% 3.31/3.50 skS.0 3 a_1 a_2 a_3 a_4 (skS.0 2 a_1 a_2 a_3)))
% 3.31/3.50 True
% 3.31/3.50 Clause #11 (by clausification #[10]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop),
% 3.31/3.50 Eq
% 3.31/3.50 (And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → skS.0 3 a_1 a_2 a_3 a_4 Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (skS.0 3 a_1 a_2 a_3 a_4 Xu) (skS.0 0 a_1 Xu Xv) → skS.0 3 a_1 a_2 a_3 a_4 Xv) →
% 3.31/3.50 skS.0 3 a_1 a_2 a_3 a_4 (skS.0 2 a_1 a_2 a_3))
% 3.31/3.50 False
% 3.31/3.50 Clause #12 (by clausification #[11]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop),
% 3.31/3.50 Eq
% 3.31/3.50 (And (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → skS.0 3 a_1 a_2 a_3 a_4 Xw)
% 3.31/3.50 (∀ (Xu Xv : a), And (skS.0 3 a_1 a_2 a_3 a_4 Xu) (skS.0 0 a_1 Xu Xv) → skS.0 3 a_1 a_2 a_3 a_4 Xv))
% 3.31/3.51 True
% 3.31/3.51 Clause #13 (by clausification #[11]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop), Eq (skS.0 3 a_1 a_2 a_3 a_4 (skS.0 2 a_1 a_2 a_3)) False
% 3.31/3.51 Clause #15 (by clausification #[12]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop),
% 3.31/3.51 Eq (∀ (Xw : a), skS.0 0 a_1 (skS.0 1 a_1 a_2) Xw → skS.0 3 a_1 a_2 a_3 a_4 Xw) True
% 3.31/3.51 Clause #20 (by clausification #[15]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a) (a_5 : a → Prop),
% 3.31/3.51 Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) a_3 → skS.0 3 a_1 a_2 a_4 a_5 a_3) True
% 3.31/3.51 Clause #21 (by clausification #[20]): ∀ (a_1 : a → a → Prop) (a_2 a_3 a_4 : a) (a_5 : a → Prop),
% 3.31/3.51 Or (Eq (skS.0 0 a_1 (skS.0 1 a_1 a_2) a_3) False) (Eq (skS.0 3 a_1 a_2 a_4 a_5 a_3) True)
% 3.31/3.51 Clause #22 (by superposition #[21, 8]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop) (a_5 : a),
% 3.31/3.51 Or (Eq (skS.0 3 (fun x x_1 => a_1 x x_1) a_2 a_3 a_4 (skS.0 2 a_1 a_2 a_5)) True) (Eq False True)
% 3.31/3.51 Clause #23 (by betaEtaReduce #[22]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop) (a_5 : a),
% 3.31/3.51 Or (Eq (skS.0 3 a_1 a_2 a_3 a_4 (skS.0 2 a_1 a_2 a_5)) True) (Eq False True)
% 3.31/3.51 Clause #24 (by clausification #[23]): ∀ (a_1 : a → a → Prop) (a_2 a_3 : a) (a_4 : a → Prop) (a_5 : a), Eq (skS.0 3 a_1 a_2 a_3 a_4 (skS.0 2 a_1 a_2 a_5)) True
% 3.31/3.51 Clause #25 (by superposition #[24, 13]): Eq True False
% 3.31/3.51 Clause #27 (by clausification #[25]): False
% 3.31/3.51 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------