TSTP Solution File: SEU771^2 by Duper---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Duper---1.0
% Problem : SEU771^2 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : duper %s
% Computer : n015.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:49 EDT 2023
% Result : Theorem 3.85s 4.05s
% Output : Proof 3.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU771^2 : TPTP v8.1.2. Released v3.7.0.
% 0.00/0.15 % Command : duper %s
% 0.14/0.35 % Computer : n015.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 : Wed Aug 23 14:36:05 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.85/4.05 SZS status Theorem for theBenchmark.p
% 3.85/4.05 SZS output start Proof for theBenchmark.p
% 3.85/4.05 Clause #1 (by assumption #[]): Eq
% 3.85/4.05 (Eq setOfPairsIsBReln
% 3.85/4.05 (∀ (A B : Iota) (Xphi : Iota → Iota → Prop), breln A B (dpsetconstr A B fun Xx Xy => Xphi Xx Xy)))
% 3.85/4.05 True
% 3.85/4.05 Clause #2 (by assumption #[]): Eq (Eq breln1 fun A R => breln A A R) True
% 3.85/4.05 Clause #3 (by assumption #[]): Eq
% 3.85/4.05 (Not
% 3.85/4.05 (setOfPairsIsBReln → ∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A fun Xx Xy => Xphi Xx Xy)))
% 3.85/4.05 True
% 3.85/4.05 Clause #4 (by clausification #[2]): Eq breln1 fun A R => breln A A R
% 3.85/4.05 Clause #5 (by argument congruence #[4]): ∀ (a : Iota), Eq (breln1 a) ((fun A R => breln A A R) a)
% 3.85/4.05 Clause #7 (by betaEtaReduce #[5]): ∀ (a : Iota), Eq (breln1 a) (breln a a)
% 3.85/4.05 Clause #8 (by argument congruence #[7]): ∀ (a a_1 : Iota), Eq (breln1 a a_1) (breln a a a_1)
% 3.85/4.05 Clause #33 (by betaEtaReduce #[1]): Eq (Eq setOfPairsIsBReln (∀ (A B : Iota) (Xphi : Iota → Iota → Prop), breln A B (dpsetconstr A B Xphi))) True
% 3.85/4.05 Clause #34 (by clausification #[33]): Eq setOfPairsIsBReln (∀ (A B : Iota) (Xphi : Iota → Iota → Prop), breln A B (dpsetconstr A B Xphi))
% 3.85/4.05 Clause #56 (by betaEtaReduce #[3]): Eq (Not (setOfPairsIsBReln → ∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A Xphi))) True
% 3.85/4.05 Clause #57 (by clausification #[56]): Eq (setOfPairsIsBReln → ∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A Xphi)) False
% 3.85/4.05 Clause #58 (by clausification #[57]): Eq setOfPairsIsBReln True
% 3.85/4.05 Clause #59 (by clausification #[57]): Eq (∀ (A : Iota) (Xphi : Iota → Iota → Prop), breln1 A (dpsetconstr A A Xphi)) False
% 3.85/4.05 Clause #60 (by backward demodulation #[58, 34]): Eq True (∀ (A B : Iota) (Xphi : Iota → Iota → Prop), breln A B (dpsetconstr A B Xphi))
% 3.85/4.05 Clause #64 (by clausification #[59]): ∀ (a : Iota),
% 3.85/4.05 Eq (Not (∀ (Xphi : Iota → Iota → Prop), breln1 (skS.0 0 a) (dpsetconstr (skS.0 0 a) (skS.0 0 a) Xphi))) True
% 3.85/4.05 Clause #65 (by clausification #[64]): ∀ (a : Iota), Eq (∀ (Xphi : Iota → Iota → Prop), breln1 (skS.0 0 a) (dpsetconstr (skS.0 0 a) (skS.0 0 a) Xphi)) False
% 3.85/4.05 Clause #66 (by clausification #[65]): ∀ (a : Iota) (a_1 : Iota → Iota → Prop),
% 3.85/4.05 Eq (Not (breln1 (skS.0 0 a) (dpsetconstr (skS.0 0 a) (skS.0 0 a) (skS.0 1 a a_1)))) True
% 3.85/4.05 Clause #67 (by clausification #[66]): ∀ (a : Iota) (a_1 : Iota → Iota → Prop),
% 3.85/4.05 Eq (breln1 (skS.0 0 a) (dpsetconstr (skS.0 0 a) (skS.0 0 a) (skS.0 1 a a_1))) False
% 3.85/4.05 Clause #71 (by clausification #[60]): ∀ (a : Iota), Eq (∀ (B : Iota) (Xphi : Iota → Iota → Prop), breln a B (dpsetconstr a B Xphi)) True
% 3.85/4.05 Clause #72 (by clausification #[71]): ∀ (a a_1 : Iota), Eq (∀ (Xphi : Iota → Iota → Prop), breln a a_1 (dpsetconstr a a_1 Xphi)) True
% 3.85/4.05 Clause #73 (by clausification #[72]): ∀ (a a_1 : Iota) (a_2 : Iota → Iota → Prop), Eq (breln a a_1 (dpsetconstr a a_1 a_2)) True
% 3.85/4.05 Clause #74 (by superposition #[73, 8]): ∀ (a : Iota) (a_1 : Iota → Iota → Prop), Eq (breln1 a (dpsetconstr a a a_1)) True
% 3.85/4.05 Clause #79 (by superposition #[74, 67]): Eq True False
% 3.85/4.05 Clause #84 (by clausification #[79]): False
% 3.85/4.05 SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------