TSTP Solution File: NUM604+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM604+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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 : 600s
% DateTime : Mon Jul 18 08:37:49 EDT 2022
% Result : Theorem 8.85s 2.38s
% Output : CNFRefutation 8.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 36 ( 17 unt; 4 nHn; 36 RR)
% Number of literals : 69 ( 15 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_15) ).
cnf(i_0_149,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_149) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_45) ).
cnf(i_0_78,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| X2 != szmzizndt0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_78) ).
cnf(i_0_14,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_14) ).
cnf(i_0_203,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_203) ).
cnf(i_0_184,hypothesis,
( szmzizndt0(sdtlpdtrp0(xN,X1)) = sdtlpdtrp0(xe,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_184) ).
cnf(i_0_167,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_167) ).
cnf(i_0_7,plain,
( aSet0(X1)
| X1 != slcrc0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_7) ).
cnf(i_0_201,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_201) ).
cnf(i_0_202,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_202) ).
cnf(i_0_204,negated_conjecture,
~ aElementOf0(xx,xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_204) ).
cnf(i_0_11,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_11) ).
cnf(i_0_166,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_axgi_f8/lgb.p',i_0_166) ).
cnf(c_0_219,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_220,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_149 ).
cnf(c_0_221,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_222,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| X2 != szmzizndt0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
i_0_78 ).
cnf(c_0_223,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
i_0_14 ).
cnf(c_0_224,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
i_0_203 ).
cnf(c_0_225,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]) ).
cnf(c_0_226,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_222]) ).
cnf(c_0_227,hypothesis,
( szmzizndt0(sdtlpdtrp0(xN,X1)) = sdtlpdtrp0(xe,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_184 ).
cnf(c_0_228,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_167 ).
cnf(c_0_229,plain,
( aSet0(X1)
| X1 != slcrc0 ),
i_0_7 ).
cnf(c_0_230,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_225])]) ).
cnf(c_0_231,hypothesis,
( sdtlpdtrp0(xN,X1) = slcrc0
| aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_227]),c_0_228]) ).
cnf(c_0_232,hypothesis,
sdtlpdtrp0(xe,xi) = xx,
i_0_201 ).
cnf(c_0_233,hypothesis,
aElementOf0(xi,szNzAzT0),
i_0_202 ).
cnf(c_0_234,negated_conjecture,
~ aElementOf0(xx,xS),
i_0_204 ).
cnf(c_0_235,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
i_0_11 ).
cnf(c_0_236,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_229]) ).
cnf(c_0_237,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_166 ).
cnf(c_0_238,hypothesis,
sdtlpdtrp0(xN,xi) = slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_230,c_0_231]),c_0_232]),c_0_233])]),c_0_234]) ).
cnf(c_0_239,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_235]),c_0_236])]) ).
cnf(c_0_240,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_233])]),c_0_239]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM604+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jul 7 09:42:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.85/2.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.85/2.38 # No SInE strategy applied
% 8.85/2.38 # Trying AutoSched0 for 150 seconds
% 8.85/2.38 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.85/2.38 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.85/2.38 #
% 8.85/2.38 # Preprocessing time : 0.024 s
% 8.85/2.38
% 8.85/2.38 # Proof found!
% 8.85/2.38 # SZS status Theorem
% 8.85/2.38 # SZS output start CNFRefutation
% See solution above
% 8.85/2.38 # Training examples: 0 positive, 0 negative
% 8.85/2.38
% 8.85/2.38 # -------------------------------------------------
% 8.85/2.38 # User time : 0.085 s
% 8.85/2.38 # System time : 0.011 s
% 8.85/2.38 # Total time : 0.096 s
% 8.85/2.38 # Maximum resident set size: 7128 pages
% 8.85/2.38
%------------------------------------------------------------------------------