TSTP Solution File: SEV048^5 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEV048^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n016.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:07 EDT 2023
% Result : Theorem 203.65s 204.07s
% Output : Proof 204.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEV048^5 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % Command : duper %s
% 0.14/0.36 % Computer : n016.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:36:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 203.65/204.07 SZS status Theorem for theBenchmark.p
% 203.65/204.07 SZS output start Proof for theBenchmark.p
% 203.65/204.07 Clause #0 (by assumption #[]): Eq (Not (Exists fun R => ∀ (Xx Xy Xz : Iota → Prop), And (R Xx Xy) (R Xy Xz) → R Xx Xz)) True
% 203.65/204.07 Clause #1 (by clausification #[0]): Eq (Exists fun R => ∀ (Xx Xy Xz : Iota → Prop), And (R Xx Xy) (R Xy Xz) → R Xx Xz) False
% 203.65/204.07 Clause #2 (by clausification #[1]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop), Eq (∀ (Xx Xy Xz : Iota → Prop), And (a Xx Xy) (a Xy Xz) → a Xx Xz) False
% 203.65/204.07 Clause #3 (by clausification #[2]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 : Iota → Prop),
% 203.65/204.07 Eq (Not (∀ (Xy Xz : Iota → Prop), And (a (skS.0 0 a a_1) Xy) (a Xy Xz) → a (skS.0 0 a a_1) Xz)) True
% 203.65/204.07 Clause #4 (by clausification #[3]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 : Iota → Prop),
% 203.65/204.07 Eq (∀ (Xy Xz : Iota → Prop), And (a (skS.0 0 a a_1) Xy) (a Xy Xz) → a (skS.0 0 a a_1) Xz) False
% 203.65/204.07 Clause #5 (by clausification #[4]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 a_2 : Iota → Prop),
% 203.65/204.07 Eq
% 203.65/204.07 (Not
% 203.65/204.07 (∀ (Xz : Iota → Prop),
% 203.65/204.07 And (a (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) (a (skS.0 1 a a_1 a_2) Xz) → a (skS.0 0 a a_1) Xz))
% 203.65/204.07 True
% 203.65/204.07 Clause #6 (by clausification #[5]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 a_2 : Iota → Prop),
% 203.65/204.07 Eq
% 203.65/204.07 (∀ (Xz : Iota → Prop),
% 203.65/204.07 And (a (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) (a (skS.0 1 a a_1 a_2) Xz) → a (skS.0 0 a a_1) Xz)
% 203.65/204.07 False
% 203.65/204.07 Clause #7 (by clausification #[6]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 a_2 a_3 : Iota → Prop),
% 203.65/204.07 Eq
% 203.65/204.07 (Not
% 203.65/204.07 (And (a (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) (a (skS.0 1 a a_1 a_2) (skS.0 2 a a_1 a_2 a_3)) →
% 203.65/204.07 a (skS.0 0 a a_1) (skS.0 2 a a_1 a_2 a_3)))
% 203.65/204.07 True
% 203.65/204.07 Clause #8 (by clausification #[7]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 a_2 a_3 : Iota → Prop),
% 203.65/204.07 Eq
% 203.65/204.07 (And (a (skS.0 0 a a_1) (skS.0 1 a a_1 a_2)) (a (skS.0 1 a a_1 a_2) (skS.0 2 a a_1 a_2 a_3)) →
% 203.65/204.07 a (skS.0 0 a a_1) (skS.0 2 a a_1 a_2 a_3))
% 203.65/204.07 False
% 203.65/204.07 Clause #10 (by clausification #[8]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Prop) (a_1 a_2 a_3 : Iota → Prop),
% 203.65/204.07 Eq (a (skS.0 0 a a_1) (skS.0 2 a a_1 a_2 a_3)) False
% 203.65/204.07 Clause #75 (by existsHoist #[10]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Sort _abstMVar.0) (a_1 : (x x_1 : Iota → Prop) → a x x_1 → Prop)
% 203.65/204.07 (a_2 a_3 a_4 : Iota → Prop)
% 203.65/204.07 (a_5 : a (skS.0 0 (fun x x_1 => Exists (a_1 x x_1)) a_2) (skS.0 2 (fun x x_1 => Exists (a_1 x x_1)) a_2 a_3 a_4)),
% 203.65/204.07 Or (Eq True False)
% 203.65/204.07 (Eq
% 203.65/204.07 ((fun x =>
% 203.65/204.07 a_1 (skS.0 0 (fun x x_1 => Exists (a_1 x x_1)) a_2) (skS.0 2 (fun x x_1 => Exists (a_1 x x_1)) a_2 a_3 a_4) x)
% 203.65/204.07 a_5)
% 203.65/204.07 False)
% 203.65/204.07 Clause #1007 (by betaEtaReduce #[75]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Sort _abstMVar.0) (a_1 : (x x_1 : Iota → Prop) → a x x_1 → Prop)
% 203.65/204.07 (a_2 a_3 a_4 : Iota → Prop)
% 203.65/204.07 (a_5 : a (skS.0 0 (fun x x_1 => Exists (a_1 x x_1)) a_2) (skS.0 2 (fun x x_1 => Exists (a_1 x x_1)) a_2 a_3 a_4)),
% 203.65/204.07 Or (Eq True False)
% 203.65/204.07 (Eq
% 203.65/204.07 (a_1 (skS.0 0 (fun x x_1 => Exists (a_1 x x_1)) a_2) (skS.0 2 (fun x x_1 => Exists (a_1 x x_1)) a_2 a_3 a_4) a_5)
% 203.65/204.07 False)
% 203.65/204.07 Clause #1008 (by clausification #[1007]): ∀ (a : (Iota → Prop) → (Iota → Prop) → Sort _abstMVar.0) (a_1 : (x x_1 : Iota → Prop) → a x x_1 → Prop)
% 203.65/204.07 (a_2 a_3 a_4 : Iota → Prop)
% 203.65/204.07 (a_5 : a (skS.0 0 (fun x x_1 => Exists (a_1 x x_1)) a_2) (skS.0 2 (fun x x_1 => Exists (a_1 x x_1)) a_2 a_3 a_4)),
% 203.65/204.07 Eq (a_1 (skS.0 0 (fun x x_1 => Exists (a_1 x x_1)) a_2) (skS.0 2 (fun x x_1 => Exists (a_1 x x_1)) a_2 a_3 a_4) a_5)
% 203.65/204.07 False
% 203.65/204.07 Clause #1075 (by fluidBoolHoist #[1008]): ∀ (a : Prop → Prop) (a_1 : Prop), Or (Eq (a False) False) (Eq a_1 True)
% 203.65/204.07 Clause #1077 (by neHoist #[1075]): ∀ (a : Prop) (a_1 : Prop → Sort _abstMVar.0) (a_2 a_3 : (_ : Prop) → a_1 _),
% 203.65/204.07 Or (Eq a True) (Or (Eq True False) (Eq (a_2 False) (a_3 False)))
% 203.65/204.07 Clause #11452 (by clausification #[1077]): ∀ (a : Prop) (a_1 : Prop → Sort _abstMVar.0) (a_2 a_3 : (_ : Prop) → a_1 _), Or (Eq a True) (Eq (a_2 False) (a_3 False))
% 204.40/205.02 Clause #11458 (by equality factoring #[11452]): ∀ (a : (_ : Prop) → (fun _ => Prop) _) (a_1 : Prop), Or (Ne (a False) a_1) (Eq a_1 True)
% 204.40/205.02 Clause #12365 (by betaEtaReduce #[11458]): ∀ (a : (_ : Prop) → (fun _ => Prop) _) (a_1 : Prop), Or (Ne (a False) a_1) (Eq a_1 True)
% 204.40/205.02 Clause #12367 (by clausification #[12365]): ∀ (a : Prop) (a_1 : (_ : Prop) → (fun _ => Prop) _), Or (Eq a True) (Or (Eq (a_1 False) True) (Eq a True))
% 204.40/205.02 Clause #12693 (by eliminate duplicate literals #[12367]): ∀ (a : Prop) (a_1 : (_ : Prop) → (fun _ => Prop) _), Or (Eq a True) (Eq (a_1 False) True)
% 204.40/205.02 Clause #12699 (by falseElim #[12693]): ∀ (a : (_ : Prop) → (fun _ => Prop) _), Eq (a False) True
% 204.40/205.02 Clause #13537 (by fluidSup #[12699, 12699]): Eq ((fun _ => False) True) True
% 204.40/205.02 Clause #13540 (by betaEtaReduce #[13537]): Eq False True
% 204.40/205.02 Clause #13541 (by clausification #[13540]): False
% 204.40/205.02 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------