TSTP Solution File: NUM611+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM611+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 20:37:14 EST 2010
% Result : Theorem 14.87s
% Output : Solution 14.87s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP17314/NUM611+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17314/NUM611+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17314/NUM611+3.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 17410
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.55 CPU 2.02 WC
% PrfWatch: 3.20 CPU 4.02 WC
% PrfWatch: 5.19 CPU 6.03 WC
% PrfWatch: 7.18 CPU 8.03 WC
% PrfWatch: 9.18 CPU 10.04 WC
% # Preprocessing time : 0.623 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.17 CPU 12.04 WC
% PrfWatch: 13.16 CPU 14.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(7, axiom,![X1]:((aSet0(X1)&isFinite0(X1))=>![X2]:(aSubsetOf0(X2,X1)=>isFinite0(X2))),file('/tmp/SRASS.s.p', mSubFSet)).
% fof(13, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),file('/tmp/SRASS.s.p', mConsDiff)).
% fof(17, axiom,![X1]:(aElement0(X1)=>![X2]:((aSet0(X2)&isFinite0(X2))=>isFinite0(sdtpldt0(X2,X1)))),file('/tmp/SRASS.s.p', mFConsSet)).
% fof(22, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(szszuzczcdt0(X1)=szszuzczcdt0(X2)=>X1=X2)),file('/tmp/SRASS.s.p', mSuccEquSucc)).
% fof(35, axiom,![X1]:(aSet0(X1)=>(aElementOf0(sbrdtbr0(X1),szNzAzT0)<=>isFinite0(X1))),file('/tmp/SRASS.s.p', mCardNum)).
% fof(38, axiom,![X1]:(aSet0(X1)=>![X2]:((isFinite0(X1)&aElementOf0(X2,X1))=>szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),file('/tmp/SRASS.s.p', mCardDiff)).
% fof(58, axiom,aElementOf0(xK,szNzAzT0),file('/tmp/SRASS.s.p', m__3418)).
% fof(64, axiom,(aElementOf0(xk,szNzAzT0)&szszuzczcdt0(xk)=xK),file('/tmp/SRASS.s.p', m__3533)).
% fof(83, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),file('/tmp/SRASS.s.p', m__5078)).
% fof(87, axiom,((aElementOf0(xp,xQ)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),file('/tmp/SRASS.s.p', m__5147)).
% fof(88, axiom,(((aSet0(xP)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(szmzizndt0(xQ),X1)))&![X1]:(aElementOf0(X1,xP)<=>((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=szmzizndt0(xQ)))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(91, axiom,(![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xQ))&aSubsetOf0(xP,xQ)),file('/tmp/SRASS.s.p', m__5195)).
% fof(109, conjecture,sbrdtbr0(xP)=xk,file('/tmp/SRASS.s.p', m__)).
% fof(110, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(assume_negation,[status(cth)],[109])).
% fof(123, negated_conjecture,~(sbrdtbr0(xP)=xk),inference(fof_simplification,[status(thm)],[110,theory(equality)])).
% fof(132, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(133, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[132])).
% fof(134, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[133])).
% cnf(135,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[134])).
% fof(160, plain,![X1]:((~(aSet0(X1))|~(isFinite0(X1)))|![X2]:(~(aSubsetOf0(X2,X1))|isFinite0(X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(161, plain,![X3]:((~(aSet0(X3))|~(isFinite0(X3)))|![X4]:(~(aSubsetOf0(X4,X3))|isFinite0(X4))),inference(variable_rename,[status(thm)],[160])).
% fof(162, plain,![X3]:![X4]:((~(aSubsetOf0(X4,X3))|isFinite0(X4))|(~(aSet0(X3))|~(isFinite0(X3)))),inference(shift_quantors,[status(thm)],[161])).
% cnf(163,plain,(isFinite0(X2)|~isFinite0(X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[162])).
% fof(201, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|sdtpldt0(sdtmndt0(X1,X2),X2)=X1)),inference(fof_nnf,[status(thm)],[13])).
% fof(202, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)),inference(variable_rename,[status(thm)],[201])).
% fof(203, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|sdtpldt0(sdtmndt0(X3,X4),X4)=X3)|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[202])).
% cnf(204,plain,(sdtpldt0(sdtmndt0(X1,X2),X2)=X1|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[203])).
% fof(216, plain,![X1]:(~(aElement0(X1))|![X2]:((~(aSet0(X2))|~(isFinite0(X2)))|isFinite0(sdtpldt0(X2,X1)))),inference(fof_nnf,[status(thm)],[17])).
% fof(217, plain,![X3]:(~(aElement0(X3))|![X4]:((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtpldt0(X4,X3)))),inference(variable_rename,[status(thm)],[216])).
% fof(218, plain,![X3]:![X4]:(((~(aSet0(X4))|~(isFinite0(X4)))|isFinite0(sdtpldt0(X4,X3)))|~(aElement0(X3))),inference(shift_quantors,[status(thm)],[217])).
% cnf(219,plain,(isFinite0(sdtpldt0(X2,X1))|~aElement0(X1)|~isFinite0(X2)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[218])).
% fof(232, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(szszuzczcdt0(X1)=szszuzczcdt0(X2))|X1=X2)),inference(fof_nnf,[status(thm)],[22])).
% fof(233, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(szszuzczcdt0(X3)=szszuzczcdt0(X4))|X3=X4)),inference(variable_rename,[status(thm)],[232])).
% cnf(234,plain,(X1=X2|szszuzczcdt0(X1)!=szszuzczcdt0(X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[233])).
% fof(276, plain,![X1]:(~(aSet0(X1))|((~(aElementOf0(sbrdtbr0(X1),szNzAzT0))|isFinite0(X1))&(~(isFinite0(X1))|aElementOf0(sbrdtbr0(X1),szNzAzT0)))),inference(fof_nnf,[status(thm)],[35])).
% fof(277, plain,![X2]:(~(aSet0(X2))|((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))&(~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0)))),inference(variable_rename,[status(thm)],[276])).
% fof(278, plain,![X2]:(((~(aElementOf0(sbrdtbr0(X2),szNzAzT0))|isFinite0(X2))|~(aSet0(X2)))&((~(isFinite0(X2))|aElementOf0(sbrdtbr0(X2),szNzAzT0))|~(aSet0(X2)))),inference(distribute,[status(thm)],[277])).
% cnf(279,plain,(aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[278])).
% cnf(280,plain,(isFinite0(X1)|~aSet0(X1)|~aElementOf0(sbrdtbr0(X1),szNzAzT0)),inference(split_conjunct,[status(thm)],[278])).
% fof(290, plain,![X1]:(~(aSet0(X1))|![X2]:((~(isFinite0(X1))|~(aElementOf0(X2,X1)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1))),inference(fof_nnf,[status(thm)],[38])).
% fof(291, plain,![X3]:(~(aSet0(X3))|![X4]:((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))),inference(variable_rename,[status(thm)],[290])).
% fof(292, plain,![X3]:![X4]:(((~(isFinite0(X3))|~(aElementOf0(X4,X3)))|szszuzczcdt0(sbrdtbr0(sdtmndt0(X3,X4)))=sbrdtbr0(X3))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[291])).
% cnf(293,plain,(szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2)))=sbrdtbr0(X1)|~aSet0(X1)|~aElementOf0(X2,X1)|~isFinite0(X1)),inference(split_conjunct,[status(thm)],[292])).
% cnf(406,plain,(aElementOf0(xK,szNzAzT0)),inference(split_conjunct,[status(thm)],[58])).
% cnf(4410,plain,(szszuzczcdt0(xk)=xK),inference(split_conjunct,[status(thm)],[64])).
% cnf(4411,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[64])).
% fof(4587, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(fof_nnf,[status(thm)],[83])).
% fof(4588, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(variable_rename,[status(thm)],[4587])).
% fof(4589, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xO))&aSet0(xQ))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(shift_quantors,[status(thm)],[4588])).
% cnf(4591,plain,(sbrdtbr0(xQ)=xK),inference(split_conjunct,[status(thm)],[4589])).
% cnf(4593,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[4589])).
% fof(4615, plain,((aElementOf0(xp,xQ)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),inference(fof_nnf,[status(thm)],[87])).
% fof(4616, plain,((aElementOf0(xp,xQ)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2)))&xp=szmzizndt0(xQ)),inference(variable_rename,[status(thm)],[4615])).
% fof(4617, plain,![X2]:(((~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2))&aElementOf0(xp,xQ))&xp=szmzizndt0(xQ)),inference(shift_quantors,[status(thm)],[4616])).
% cnf(4618,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[4617])).
% cnf(4619,plain,(aElementOf0(xp,xQ)),inference(split_conjunct,[status(thm)],[4617])).
% fof(4621, plain,(((aSet0(xP)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(szmzizndt0(xQ),X1)))&![X1]:((~(aElementOf0(X1,xP))|((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=szmzizndt0(xQ))))&(((~(aElement0(X1))|~(aElementOf0(X1,xQ)))|X1=szmzizndt0(xQ))|aElementOf0(X1,xP))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(fof_nnf,[status(thm)],[88])).
% fof(4622, plain,(((aSet0(xP)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2)))&![X3]:((~(aElementOf0(X3,xP))|((aElement0(X3)&aElementOf0(X3,xQ))&~(X3=szmzizndt0(xQ))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(variable_rename,[status(thm)],[4621])).
% fof(4623, plain,![X2]:![X3]:((((~(aElementOf0(X3,xP))|((aElement0(X3)&aElementOf0(X3,xQ))&~(X3=szmzizndt0(xQ))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP)))&((~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2))&aSet0(xP)))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(shift_quantors,[status(thm)],[4622])).
% fof(4624, plain,![X2]:![X3]:((((((aElement0(X3)|~(aElementOf0(X3,xP)))&(aElementOf0(X3,xQ)|~(aElementOf0(X3,xP))))&(~(X3=szmzizndt0(xQ))|~(aElementOf0(X3,xP))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP)))&((~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2))&aSet0(xP)))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(distribute,[status(thm)],[4623])).
% cnf(4625,plain,(xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(split_conjunct,[status(thm)],[4624])).
% cnf(4626,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[4624])).
% fof(4637, plain,(![X1]:(~(aElementOf0(X1,xP))|aElementOf0(X1,xQ))&aSubsetOf0(xP,xQ)),inference(fof_nnf,[status(thm)],[91])).
% fof(4638, plain,(![X2]:(~(aElementOf0(X2,xP))|aElementOf0(X2,xQ))&aSubsetOf0(xP,xQ)),inference(variable_rename,[status(thm)],[4637])).
% fof(4639, plain,![X2]:((~(aElementOf0(X2,xP))|aElementOf0(X2,xQ))&aSubsetOf0(xP,xQ)),inference(shift_quantors,[status(thm)],[4638])).
% cnf(4640,plain,(aSubsetOf0(xP,xQ)),inference(split_conjunct,[status(thm)],[4639])).
% cnf(4716,negated_conjecture,(sbrdtbr0(xP)!=xk),inference(split_conjunct,[status(thm)],[123])).
% cnf(5370,plain,(sdtmndt0(xQ,xp)=xP),inference(rw,[status(thm)],[4625,4618,theory(equality)])).
% cnf(8594,plain,(aElement0(xp)|~aSet0(xQ)),inference(spm,[status(thm)],[135,4619,theory(equality)])).
% cnf(8613,plain,(aElement0(xp)|$false),inference(rw,[status(thm)],[8594,4593,theory(equality)])).
% cnf(8614,plain,(aElement0(xp)),inference(cn,[status(thm)],[8613,theory(equality)])).
% cnf(8755,plain,(sdtpldt0(xP,xp)=xQ|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[204,5370,theory(equality)])).
% cnf(8756,plain,(sdtpldt0(xP,xp)=xQ|$false|~aSet0(xQ)),inference(rw,[status(thm)],[8755,4619,theory(equality)])).
% cnf(8757,plain,(sdtpldt0(xP,xp)=xQ|$false|$false),inference(rw,[status(thm)],[8756,4593,theory(equality)])).
% cnf(8758,plain,(sdtpldt0(xP,xp)=xQ),inference(cn,[status(thm)],[8757,theory(equality)])).
% cnf(8774,plain,(isFinite0(xP)|~isFinite0(xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[163,4640,theory(equality)])).
% cnf(8785,plain,(isFinite0(xP)|~isFinite0(xQ)|$false),inference(rw,[status(thm)],[8774,4593,theory(equality)])).
% cnf(8786,plain,(isFinite0(xP)|~isFinite0(xQ)),inference(cn,[status(thm)],[8785,theory(equality)])).
% cnf(8904,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(xk,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(spm,[status(thm)],[234,4410,theory(equality)])).
% cnf(8907,plain,(X1=xk|szszuzczcdt0(X1)!=xK|$false|~aElementOf0(X1,szNzAzT0)),inference(rw,[status(thm)],[8904,4411,theory(equality)])).
% cnf(8908,plain,(X1=xk|szszuzczcdt0(X1)!=xK|~aElementOf0(X1,szNzAzT0)),inference(cn,[status(thm)],[8907,theory(equality)])).
% cnf(9019,plain,(szszuzczcdt0(sbrdtbr0(xP))=sbrdtbr0(xQ)|~isFinite0(xQ)|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(spm,[status(thm)],[293,5370,theory(equality)])).
% cnf(9022,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)|~aElementOf0(xp,xQ)|~aSet0(xQ)),inference(rw,[status(thm)],[9019,4591,theory(equality)])).
% cnf(9023,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[9022,4619,theory(equality)])).
% cnf(9024,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)|$false|$false),inference(rw,[status(thm)],[9023,4593,theory(equality)])).
% cnf(9025,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|~isFinite0(xQ)),inference(cn,[status(thm)],[9024,theory(equality)])).
% cnf(82165,plain,(isFinite0(xQ)|~isFinite0(xP)|~aElement0(xp)|~aSet0(xP)),inference(spm,[status(thm)],[219,8758,theory(equality)])).
% cnf(82178,plain,(isFinite0(xQ)|~isFinite0(xP)|$false|~aSet0(xP)),inference(rw,[status(thm)],[82165,8614,theory(equality)])).
% cnf(82179,plain,(isFinite0(xQ)|~isFinite0(xP)|$false|$false),inference(rw,[status(thm)],[82178,4626,theory(equality)])).
% cnf(82180,plain,(isFinite0(xQ)|~isFinite0(xP)),inference(cn,[status(thm)],[82179,theory(equality)])).
% cnf(83954,plain,(isFinite0(xP)|~aElementOf0(sbrdtbr0(xQ),szNzAzT0)|~aSet0(xQ)),inference(spm,[status(thm)],[8786,280,theory(equality)])).
% cnf(83955,plain,(isFinite0(xP)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[83954,4591,theory(equality)]),406,theory(equality)])).
% cnf(83956,plain,(isFinite0(xP)|$false|$false),inference(rw,[status(thm)],[83955,4593,theory(equality)])).
% cnf(83957,plain,(isFinite0(xP)),inference(cn,[status(thm)],[83956,theory(equality)])).
% cnf(83960,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)|~aSet0(xP)),inference(spm,[status(thm)],[279,83957,theory(equality)])).
% cnf(83963,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)|$false),inference(rw,[status(thm)],[83960,4626,theory(equality)])).
% cnf(83964,plain,(aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(cn,[status(thm)],[83963,theory(equality)])).
% cnf(85434,plain,(isFinite0(xQ)|$false),inference(rw,[status(thm)],[82180,83957,theory(equality)])).
% cnf(85435,plain,(isFinite0(xQ)),inference(cn,[status(thm)],[85434,theory(equality)])).
% cnf(85438,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK|$false),inference(rw,[status(thm)],[9025,85435,theory(equality)])).
% cnf(85439,plain,(szszuzczcdt0(sbrdtbr0(xP))=xK),inference(cn,[status(thm)],[85438,theory(equality)])).
% cnf(86340,plain,(sbrdtbr0(xP)=xk|~aElementOf0(sbrdtbr0(xP),szNzAzT0)),inference(spm,[status(thm)],[8908,85439,theory(equality)])).
% cnf(86344,plain,(sbrdtbr0(xP)=xk|$false),inference(rw,[status(thm)],[86340,83964,theory(equality)])).
% cnf(86345,plain,(sbrdtbr0(xP)=xk),inference(cn,[status(thm)],[86344,theory(equality)])).
% cnf(86346,plain,($false),inference(sr,[status(thm)],[86345,4716,theory(equality)])).
% cnf(86347,plain,($false),86346,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6864
% # ...of these trivial : 14
% # ...subsumed : 614
% # ...remaining for further processing: 6236
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 18
% # Generated clauses : 59531
% # ...of the previous two non-trivial : 50763
% # Contextual simplify-reflections : 3077
% # Paramodulations : 59480
% # Factorizations : 0
% # Equation resolutions : 46
% # Current number of processed clauses: 3165
% # Positive orientable unit clauses: 93
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 22
% # Non-unit-clauses : 3050
% # Current number of unprocessed clauses: 50202
% # ...number of literals in the above : 738844
% # Clause-clause subsumption calls (NU) : 1959334
% # Rec. Clause-clause subsumption calls : 46425
% # Unit Clause-clause subsumption calls : 39015
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 455 leaves, 2.03+/-2.673 terms/leaf
% # Paramod-from index: 218 leaves, 1.02+/-0.150 terms/leaf
% # Paramod-into index: 409 leaves, 1.50+/-1.426 terms/leaf
% # -------------------------------------------------
% # User time : 10.291 s
% # System time : 0.198 s
% # Total time : 10.489 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.78 CPU 14.78 WC
% FINAL PrfWatch: 13.78 CPU 14.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP17314/NUM611+3.tptp
%
%------------------------------------------------------------------------------