TSTP Solution File: NUM603+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : NUM603+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n014.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 : Wed May 31 12:29:53 EDT 2023
% Result : Theorem 5.66s 1.10s
% Output : CNFRefutation 5.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : NUM603+1 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue May 30 09:47:18 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.5.1
% 5.66/1.10 % Refutation found
% 5.66/1.10 % SZS status Theorem for theBenchmark: Theorem is valid
% 5.66/1.10 % SZS output start CNFRefutation for theBenchmark
% 5.66/1.10 fof(f5,definition,(
% 5.66/1.10 (! [W0] :( W0 = slcrc0<=> ( aSet0(W0)& ~ (? [W1] : aElementOf0(W1,W0) )) ) )),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f6,axiom,(
% 5.66/1.10 isFinite0(slcrc0) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f9,axiom,(
% 5.66/1.10 (! [W0] :( ( aSet0(W0)& isCountable0(W0) )=> W0 != slcrc0 ) )),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f24,axiom,(
% 5.66/1.10 aElementOf0(sz00,szNzAzT0) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f30,axiom,(
% 5.66/1.10 (! [W0] :( aElementOf0(W0,szNzAzT0)=> sdtlseqdt0(sz00,W0) ) )),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f73,hypothesis,(
% 5.66/1.10 ( aSet0(xT)& isFinite0(xT) ) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f74,hypothesis,(
% 5.66/1.10 aElementOf0(xK,szNzAzT0) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f75,hypothesis,(
% 5.66/1.10 ( aSubsetOf0(xS,szNzAzT0)& isCountable0(xS) ) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f80,hypothesis,(
% 5.66/1.10 ( aElementOf0(xk,szNzAzT0)& szszuzczcdt0(xk) = xK ) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f81,hypothesis,(
% 5.66/1.10 ( aFunction0(xN)& szDzozmdt0(xN) = szNzAzT0& sdtlpdtrp0(xN,sz00) = xS& (! [W0] :( aElementOf0(W0,szNzAzT0)=> ( ( aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)& isCountable0(sdtlpdtrp0(xN,W0)) )=> ( aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))& isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0))) ) ) ) )) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f83,hypothesis,(
% 5.66/1.10 (! [W0,W1] :( ( aElementOf0(W0,szNzAzT0)& aElementOf0(W1,szNzAzT0) )=> ( sdtlseqdt0(W1,W0)=> aSubsetOf0(sdtlpdtrp0(xN,W0),sdtlpdtrp0(xN,W1)) ) ) )),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f99,hypothesis,(
% 5.66/1.10 ( aElementOf0(xi,szNzAzT0)& sdtlpdtrp0(xe,xi) = xx ) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f100,conjecture,(
% 5.66/1.10 aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
% 5.66/1.10 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 5.66/1.10 fof(f101,negated_conjecture,(
% 5.66/1.10 ~(aSubsetOf0(sdtlpdtrp0(xN,xi),xS) )),
% 5.66/1.10 inference(negated_conjecture,[status(cth)],[f100])).
% 5.66/1.10 fof(f112,plain,(
% 5.66/1.10 ![W0]: (W0=slcrc0<=>(aSet0(W0)&(![W1]: ~aElementOf0(W1,W0))))),
% 5.66/1.10 inference(pre_NNF_transformation,[status(esa)],[f5])).
% 5.66/1.10 fof(f113,plain,(
% 5.66/1.10 ![W0]: ((~W0=slcrc0|(aSet0(W0)&(![W1]: ~aElementOf0(W1,W0))))&(W0=slcrc0|(~aSet0(W0)|(?[W1]: aElementOf0(W1,W0)))))),
% 5.66/1.10 inference(NNF_transformation,[status(esa)],[f112])).
% 5.66/1.10 fof(f114,plain,(
% 5.66/1.10 (![W0]: (~W0=slcrc0|(aSet0(W0)&(![W1]: ~aElementOf0(W1,W0)))))&(![W0]: (W0=slcrc0|(~aSet0(W0)|(?[W1]: aElementOf0(W1,W0)))))),
% 5.66/1.10 inference(miniscoping,[status(esa)],[f113])).
% 5.66/1.10 fof(f115,plain,(
% 5.66/1.10 (![W0]: (~W0=slcrc0|(aSet0(W0)&(![W1]: ~aElementOf0(W1,W0)))))&(![W0]: (W0=slcrc0|(~aSet0(W0)|aElementOf0(sk0_0(W0),W0))))),
% 5.66/1.10 inference(skolemization,[status(esa)],[f114])).
% 5.66/1.10 fof(f116,plain,(
% 5.66/1.10 ![X0]: (~X0=slcrc0|aSet0(X0))),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f115])).
% 5.66/1.10 fof(f119,plain,(
% 5.66/1.10 isFinite0(slcrc0)),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f6])).
% 5.66/1.10 fof(f124,plain,(
% 5.66/1.10 ![W0]: ((~aSet0(W0)|~isCountable0(W0))|~W0=slcrc0)),
% 5.66/1.10 inference(pre_NNF_transformation,[status(esa)],[f9])).
% 5.66/1.10 fof(f125,plain,(
% 5.66/1.10 ![X0]: (~aSet0(X0)|~isCountable0(X0)|~X0=slcrc0)),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f124])).
% 5.66/1.10 fof(f180,plain,(
% 5.66/1.10 aElementOf0(sz00,szNzAzT0)),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f24])).
% 5.66/1.10 fof(f194,plain,(
% 5.66/1.10 ![W0]: (~aElementOf0(W0,szNzAzT0)|sdtlseqdt0(sz00,W0))),
% 5.66/1.10 inference(pre_NNF_transformation,[status(esa)],[f30])).
% 5.66/1.10 fof(f195,plain,(
% 5.66/1.10 ![X0]: (~aElementOf0(X0,szNzAzT0)|sdtlseqdt0(sz00,X0))),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f194])).
% 5.66/1.10 fof(f358,plain,(
% 5.66/1.10 aSet0(xT)),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f73])).
% 5.66/1.10 fof(f360,plain,(
% 5.66/1.10 aElementOf0(xK,szNzAzT0)),
% 5.66/1.10 inference(cnf_transformation,[status(esa)],[f74])).
% 5.66/1.10 fof(f362,plain,(
% 5.66/1.10 isCountable0(xS)),
% 5.66/1.11 inference(cnf_transformation,[status(esa)],[f75])).
% 5.66/1.11 fof(f374,plain,(
% 5.66/1.11 aElementOf0(xk,szNzAzT0)),
% 5.66/1.11 inference(cnf_transformation,[status(esa)],[f80])).
% 5.66/1.11 fof(f376,plain,(
% 5.66/1.11 ((aFunction0(xN)&szDzozmdt0(xN)=szNzAzT0)&sdtlpdtrp0(xN,sz00)=xS)&(![W0]: (~aElementOf0(W0,szNzAzT0)|((~aSubsetOf0(sdtlpdtrp0(xN,W0),szNzAzT0)|~isCountable0(sdtlpdtrp0(xN,W0)))|(aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(W0)),sdtmndt0(sdtlpdtrp0(xN,W0),szmzizndt0(sdtlpdtrp0(xN,W0))))&isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(W0)))))))),
% 5.66/1.11 inference(pre_NNF_transformation,[status(esa)],[f81])).
% 5.66/1.11 fof(f379,plain,(
% 5.66/1.11 sdtlpdtrp0(xN,sz00)=xS),
% 5.66/1.11 inference(cnf_transformation,[status(esa)],[f376])).
% 5.66/1.11 fof(f385,plain,(
% 5.66/1.11 ![W0,W1]: ((~aElementOf0(W0,szNzAzT0)|~aElementOf0(W1,szNzAzT0))|(~sdtlseqdt0(W1,W0)|aSubsetOf0(sdtlpdtrp0(xN,W0),sdtlpdtrp0(xN,W1))))),
% 5.66/1.11 inference(pre_NNF_transformation,[status(esa)],[f83])).
% 5.66/1.11 fof(f386,plain,(
% 5.66/1.11 ![X0,X1]: (~aElementOf0(X0,szNzAzT0)|~aElementOf0(X1,szNzAzT0)|~sdtlseqdt0(X1,X0)|aSubsetOf0(sdtlpdtrp0(xN,X0),sdtlpdtrp0(xN,X1)))),
% 5.66/1.11 inference(cnf_transformation,[status(esa)],[f385])).
% 5.66/1.11 fof(f432,plain,(
% 5.66/1.11 aElementOf0(xi,szNzAzT0)),
% 5.66/1.11 inference(cnf_transformation,[status(esa)],[f99])).
% 5.66/1.11 fof(f434,plain,(
% 5.66/1.11 ~aSubsetOf0(sdtlpdtrp0(xN,xi),xS)),
% 5.66/1.11 inference(cnf_transformation,[status(esa)],[f101])).
% 5.66/1.11 fof(f441,plain,(
% 5.66/1.11 aSet0(slcrc0)),
% 5.66/1.11 inference(destructive_equality_resolution,[status(esa)],[f116])).
% 5.66/1.11 fof(f443,plain,(
% 5.66/1.11 ~aSet0(slcrc0)|~isCountable0(slcrc0)),
% 5.66/1.11 inference(destructive_equality_resolution,[status(esa)],[f125])).
% 5.66/1.11 fof(f530,plain,(
% 5.66/1.11 spl0_10 <=> aElementOf0(sz00,szNzAzT0)),
% 5.66/1.11 introduced(split_symbol_definition)).
% 5.66/1.11 fof(f532,plain,(
% 5.66/1.11 ~aElementOf0(sz00,szNzAzT0)|spl0_10),
% 5.66/1.11 inference(component_clause,[status(thm)],[f530])).
% 5.66/1.11 fof(f553,plain,(
% 5.66/1.11 $false|spl0_10),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f180,f532])).
% 5.66/1.11 fof(f554,plain,(
% 5.66/1.11 spl0_10),
% 5.66/1.11 inference(contradiction_clause,[status(thm)],[f553])).
% 5.66/1.11 fof(f655,plain,(
% 5.66/1.11 spl0_36 <=> xS=slcrc0),
% 5.66/1.11 introduced(split_symbol_definition)).
% 5.66/1.11 fof(f656,plain,(
% 5.66/1.11 xS=slcrc0|~spl0_36),
% 5.66/1.11 inference(component_clause,[status(thm)],[f655])).
% 5.66/1.11 fof(f681,plain,(
% 5.66/1.11 isCountable0(slcrc0)|~spl0_36),
% 5.66/1.11 inference(backward_demodulation,[status(thm)],[f656,f362])).
% 5.66/1.11 fof(f758,plain,(
% 5.66/1.11 spl0_46 <=> aElementOf0(xi,szNzAzT0)),
% 5.66/1.11 introduced(split_symbol_definition)).
% 5.66/1.11 fof(f760,plain,(
% 5.66/1.11 ~aElementOf0(xi,szNzAzT0)|spl0_46),
% 5.66/1.11 inference(component_clause,[status(thm)],[f758])).
% 5.66/1.11 fof(f777,plain,(
% 5.66/1.11 $false|spl0_46),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f760,f432])).
% 5.66/1.11 fof(f778,plain,(
% 5.66/1.11 spl0_46),
% 5.66/1.11 inference(contradiction_clause,[status(thm)],[f777])).
% 5.66/1.11 fof(f1010,plain,(
% 5.66/1.11 spl0_79 <=> aSet0(xT)),
% 5.66/1.11 introduced(split_symbol_definition)).
% 5.66/1.11 fof(f1012,plain,(
% 5.66/1.11 ~aSet0(xT)|spl0_79),
% 5.66/1.11 inference(component_clause,[status(thm)],[f1010])).
% 5.66/1.11 fof(f1023,plain,(
% 5.66/1.11 $false|spl0_79),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f1012,f358])).
% 5.66/1.11 fof(f1024,plain,(
% 5.66/1.11 spl0_79),
% 5.66/1.11 inference(contradiction_clause,[status(thm)],[f1023])).
% 5.66/1.11 fof(f1080,plain,(
% 5.66/1.11 spl0_92 <=> aElementOf0(xK,szNzAzT0)),
% 5.66/1.11 introduced(split_symbol_definition)).
% 5.66/1.11 fof(f1082,plain,(
% 5.66/1.11 ~aElementOf0(xK,szNzAzT0)|spl0_92),
% 5.66/1.11 inference(component_clause,[status(thm)],[f1080])).
% 5.66/1.11 fof(f1088,plain,(
% 5.66/1.11 spl0_94 <=> aElementOf0(xk,szNzAzT0)),
% 5.66/1.11 introduced(split_symbol_definition)).
% 5.66/1.11 fof(f1090,plain,(
% 5.66/1.11 ~aElementOf0(xk,szNzAzT0)|spl0_94),
% 5.66/1.11 inference(component_clause,[status(thm)],[f1088])).
% 5.66/1.11 fof(f1093,plain,(
% 5.66/1.11 $false|spl0_92),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f1082,f360])).
% 5.66/1.11 fof(f1094,plain,(
% 5.66/1.11 spl0_92),
% 5.66/1.11 inference(contradiction_clause,[status(thm)],[f1093])).
% 5.66/1.11 fof(f1095,plain,(
% 5.66/1.11 $false|spl0_94),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f1090,f374])).
% 5.66/1.11 fof(f1096,plain,(
% 5.66/1.11 spl0_94),
% 5.66/1.11 inference(contradiction_clause,[status(thm)],[f1095])).
% 5.66/1.11 fof(f1250,plain,(
% 5.66/1.11 ~isCountable0(slcrc0)),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f443,f441])).
% 5.66/1.11 fof(f1853,plain,(
% 5.66/1.11 $false|~spl0_36),
% 5.66/1.11 inference(forward_subsumption_resolution,[status(thm)],[f681,f1250])).
% 5.66/1.11 fof(f1854,plain,(
% 5.66/1.11 ~spl0_36),
% 5.66/1.11 inference(contradiction_clause,[status(thm)],[f1853])).
% 5.66/1.12 fof(f2022,plain,(
% 5.66/1.12 spl0_166 <=> isFinite0(slcrc0)),
% 5.66/1.12 introduced(split_symbol_definition)).
% 5.66/1.12 fof(f2024,plain,(
% 5.66/1.12 ~isFinite0(slcrc0)|spl0_166),
% 5.66/1.12 inference(component_clause,[status(thm)],[f2022])).
% 5.66/1.12 fof(f2028,plain,(
% 5.66/1.12 $false|spl0_166),
% 5.66/1.12 inference(forward_subsumption_resolution,[status(thm)],[f2024,f119])).
% 5.66/1.12 fof(f2029,plain,(
% 5.66/1.12 spl0_166),
% 5.66/1.12 inference(contradiction_clause,[status(thm)],[f2028])).
% 5.66/1.12 fof(f3123,plain,(
% 5.66/1.12 spl0_278 <=> ~aElementOf0(X0,szNzAzT0)|~sdtlseqdt0(sz00,X0)|aSubsetOf0(sdtlpdtrp0(xN,X0),xS)),
% 5.66/1.12 introduced(split_symbol_definition)).
% 5.66/1.12 fof(f3124,plain,(
% 5.66/1.12 ![X0]: (~aElementOf0(X0,szNzAzT0)|~sdtlseqdt0(sz00,X0)|aSubsetOf0(sdtlpdtrp0(xN,X0),xS)|~spl0_278)),
% 5.66/1.12 inference(component_clause,[status(thm)],[f3123])).
% 5.66/1.12 fof(f3126,plain,(
% 5.66/1.12 ![X0]: (~aElementOf0(X0,szNzAzT0)|~aElementOf0(sz00,szNzAzT0)|~sdtlseqdt0(sz00,X0)|aSubsetOf0(sdtlpdtrp0(xN,X0),xS))),
% 5.66/1.12 inference(paramodulation,[status(thm)],[f379,f386])).
% 5.66/1.12 fof(f3127,plain,(
% 5.66/1.12 spl0_278|~spl0_10),
% 5.66/1.12 inference(split_clause,[status(thm)],[f3126,f3123,f530])).
% 5.66/1.12 fof(f3128,plain,(
% 5.66/1.12 ![X0]: (~aElementOf0(X0,szNzAzT0)|aSubsetOf0(sdtlpdtrp0(xN,X0),xS)|~spl0_278)),
% 5.66/1.12 inference(forward_subsumption_resolution,[status(thm)],[f3124,f195])).
% 5.66/1.12 fof(f3129,plain,(
% 5.66/1.12 ~aElementOf0(xi,szNzAzT0)|~spl0_278),
% 5.66/1.12 inference(resolution,[status(thm)],[f3128,f434])).
% 5.66/1.12 fof(f3130,plain,(
% 5.66/1.12 ~spl0_46|~spl0_278),
% 5.66/1.12 inference(split_clause,[status(thm)],[f3129,f758,f3123])).
% 5.66/1.12 fof(f3158,plain,(
% 5.66/1.12 $false),
% 5.66/1.12 inference(sat_refutation,[status(thm)],[f554,f778,f1024,f1094,f1096,f1854,f2029,f3127,f3130])).
% 5.66/1.12 % SZS output end CNFRefutation for theBenchmark.p
% 5.66/1.12 % Elapsed time: 0.800692 seconds
% 5.66/1.12 % CPU time: 5.876961 seconds
% 5.66/1.12 % Memory used: 102.247 MB
%------------------------------------------------------------------------------