%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM622+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:38:01 EDT 2022
% Result : Theorem 8.66s 2.51s
% Output : CNFRefutation 8.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of clauses : 37 ( 16 unt; 4 nHn; 37 RR)
% Number of literals : 73 ( 15 equ; 37 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 : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_14) ).
cnf(i_0_226,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_226) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_15) ).
cnf(i_0_167,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_167) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.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-hb1yi5du/input.p',i_0_78) ).
cnf(i_0_223,hypothesis,
aElementOf0(xm,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_223) ).
cnf(i_0_184,hypothesis,
( szmzizndt0(sdtlpdtrp0(xN,X1)) = sdtlpdtrp0(xe,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_184) ).
cnf(i_0_7,plain,
( aSet0(X1)
| X1 != slcrc0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_7) ).
cnf(i_0_215,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_215) ).
cnf(i_0_216,hypothesis,
aElementOf0(xn,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_216) ).
cnf(i_0_227,negated_conjecture,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_227) ).
cnf(i_0_11,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_11) ).
cnf(i_0_166,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hb1yi5du/input.p',i_0_166) ).
cnf(c_0_242,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
i_0_14 ).
cnf(c_0_243,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
i_0_226 ).
cnf(c_0_244,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_245,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_167 ).
cnf(c_0_246,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_247,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| X2 != szmzizndt0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
i_0_78 ).
cnf(c_0_248,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xn))
| ~ aSet0(sdtlpdtrp0(xN,xm)) ),
inference(spm,[status(thm)],[c_0_242,c_0_243]) ).
cnf(c_0_249,plain,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_246])]) ).
cnf(c_0_250,hypothesis,
aElementOf0(xm,szNzAzT0),
i_0_223 ).
cnf(c_0_251,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_247]) ).
cnf(c_0_252,hypothesis,
( szmzizndt0(sdtlpdtrp0(xN,X1)) = sdtlpdtrp0(xe,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_184 ).
cnf(c_0_253,plain,
( aSet0(X1)
| X1 != slcrc0 ),
i_0_7 ).
cnf(c_0_254,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_250])]) ).
cnf(c_0_255,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_251,c_0_252]),c_0_245]) ).
cnf(c_0_256,hypothesis,
sdtlpdtrp0(xe,xn) = xp,
i_0_215 ).
cnf(c_0_257,hypothesis,
aElementOf0(xn,szNzAzT0),
i_0_216 ).
cnf(c_0_258,negated_conjecture,
~ aElementOf0(xp,sdtlpdtrp0(xN,xm)),
i_0_227 ).
cnf(c_0_259,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
i_0_11 ).
cnf(c_0_260,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_253]) ).
cnf(c_0_261,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_166 ).
cnf(c_0_262,hypothesis,
sdtlpdtrp0(xN,xn) = slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_256]),c_0_257])]),c_0_258]) ).
cnf(c_0_263,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_259]),c_0_260])]) ).
cnf(c_0_264,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_261,c_0_262]),c_0_257])]),c_0_263]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM622+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n021.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 : Wed Jul 6 12:18:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.66/2.51 # ENIGMATIC: Solved by autoschedule:
% 8.66/2.51 # No SInE strategy applied
% 8.66/2.51 # Trying AutoSched0 for 150 seconds
% 8.66/2.51 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 8.66/2.51 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.66/2.51 #
% 8.66/2.51 # Preprocessing time : 0.031 s
% 8.66/2.51 # Presaturation interreduction done
% 8.66/2.51
% 8.66/2.51 # Proof found!
% 8.66/2.51 # SZS status Theorem
% 8.66/2.51 # SZS output start CNFRefutation
% See solution above
% 8.66/2.51 # Training examples: 0 positive, 0 negative
% 8.66/2.51
% 8.66/2.51 # -------------------------------------------------
% 8.66/2.51 # User time : 0.096 s
% 8.66/2.51 # System time : 0.011 s
% 8.66/2.51 # Total time : 0.107 s
% 8.66/2.51 # Maximum resident set size: 7120 pages
% 8.66/2.51
%------------------------------------------------------------------------------