TSTP Solution File: SEU775^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU775^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n005.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 16:43:50 EDT 2023
% Result : Theorem 13.14s 13.30s
% Output : Proof 13.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU775^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.15 % Command : duper %s
% 0.16/0.37 % Computer : n005.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Wed Aug 23 20:23:09 EDT 2023
% 0.16/0.37 % CPUTime :
% 13.14/13.30 SZS status Theorem for theBenchmark.p
% 13.14/13.30 SZS output start Proof for theBenchmark.p
% 13.14/13.30 Clause #2 (by assumption #[]): Eq
% 13.14/13.30 (Eq setOfPairsIsBReln1 (∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A fun Xx Xy => Xphi Xx Xy)))
% 13.14/13.30 True
% 13.14/13.30 Clause #3 (by assumption #[]): Eq (Eq breln1invset fun A R => dpsetconstr A A fun Xx Xy => in (kpair Xy Xx) R) True
% 13.14/13.30 Clause #4 (by assumption #[]): Eq (Not (setOfPairsIsBReln1 → ∀ (A R : Iota), breln1 A R → breln1 A (breln1invset A R))) True
% 13.14/13.30 Clause #5 (by clausification #[4]): Eq (setOfPairsIsBReln1 → ∀ (A R : Iota), breln1 A R → breln1 A (breln1invset A R)) False
% 13.14/13.30 Clause #6 (by clausification #[5]): Eq setOfPairsIsBReln1 True
% 13.14/13.30 Clause #7 (by clausification #[5]): Eq (∀ (A R : Iota), breln1 A R → breln1 A (breln1invset A R)) False
% 13.14/13.30 Clause #8 (by clausification #[7]): ∀ (a : Iota), Eq (Not (∀ (R : Iota), breln1 (skS.0 0 a) R → breln1 (skS.0 0 a) (breln1invset (skS.0 0 a) R))) True
% 13.14/13.30 Clause #9 (by clausification #[8]): ∀ (a : Iota), Eq (∀ (R : Iota), breln1 (skS.0 0 a) R → breln1 (skS.0 0 a) (breln1invset (skS.0 0 a) R)) False
% 13.14/13.30 Clause #10 (by clausification #[9]): ∀ (a a_1 : Iota),
% 13.14/13.30 Eq (Not (breln1 (skS.0 0 a) (skS.0 1 a a_1) → breln1 (skS.0 0 a) (breln1invset (skS.0 0 a) (skS.0 1 a a_1)))) True
% 13.14/13.30 Clause #11 (by clausification #[10]): ∀ (a a_1 : Iota),
% 13.14/13.30 Eq (breln1 (skS.0 0 a) (skS.0 1 a a_1) → breln1 (skS.0 0 a) (breln1invset (skS.0 0 a) (skS.0 1 a a_1))) False
% 13.14/13.30 Clause #13 (by clausification #[11]): ∀ (a a_1 : Iota), Eq (breln1 (skS.0 0 a) (breln1invset (skS.0 0 a) (skS.0 1 a a_1))) False
% 13.14/13.30 Clause #55 (by betaEtaReduce #[2]): Eq (Eq setOfPairsIsBReln1 (∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A Xphi))) True
% 13.14/13.30 Clause #56 (by clausification #[55]): Eq setOfPairsIsBReln1 (∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A Xphi))
% 13.14/13.30 Clause #57 (by forward demodulation #[56, 6]): Eq True (∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A Xphi))
% 13.14/13.30 Clause #58 (by clausification #[57]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Iota → Prop), breln1 a (dpsetconstr a a Xphi)) True
% 13.14/13.30 Clause #59 (by clausification #[58]): ∀ (a : Iota) (a_1 : Iota → Iota → Prop), Eq (breln1 a (dpsetconstr a a a_1)) True
% 13.14/13.30 Clause #80 (by clausification #[3]): Eq breln1invset fun A R => dpsetconstr A A fun Xx Xy => in (kpair Xy Xx) R
% 13.14/13.30 Clause #82 (by argument congruence #[80]): ∀ (a a_1 : Iota), Eq (breln1invset a a_1) ((fun A R => dpsetconstr A A fun Xx Xy => in (kpair Xy Xx) R) a a_1)
% 13.14/13.30 Clause #3153 (by betaEtaReduce #[82]): ∀ (a a_1 : Iota), Eq (breln1invset a a_1) (dpsetconstr a a fun Xx Xy => in (kpair Xy Xx) a_1)
% 13.14/13.30 Clause #3155 (by superposition #[3153, 59]): ∀ (a a_1 : Iota), Eq (breln1 a (breln1invset a a_1)) True
% 13.14/13.30 Clause #3326 (by superposition #[3155, 13]): Eq True False
% 13.14/13.30 Clause #3349 (by clausification #[3326]): False
% 13.14/13.30 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------