TSTP Solution File: NUM571+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM571+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:37:28 EDT 2022
% Result : Theorem 6.61s 2.12s
% Output : CNFRefutation 6.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 14 unt; 6 nHn; 27 RR)
% Number of literals : 42 ( 17 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( aSet0(X1)
| X1 != slcrc0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_7) ).
cnf(i_0_68,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_68) ).
cnf(i_0_169,hypothesis,
( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_169) ).
cnf(i_0_170,hypothesis,
( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_170) ).
cnf(i_0_173,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_173) ).
cnf(i_0_149,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_149) ).
cnf(i_0_163,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_163) ).
cnf(i_0_148,hypothesis,
isCountable0(xS),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ppxe_n58/input.p',i_0_148) ).
cnf(c_0_182,plain,
( aSet0(X1)
| X1 != slcrc0 ),
i_0_7 ).
cnf(c_0_183,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
i_0_68 ).
cnf(c_0_184,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_182]) ).
cnf(c_0_185,hypothesis,
( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) ),
i_0_169 ).
cnf(c_0_186,plain,
sz00 = sbrdtbr0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_183]),c_0_184])]) ).
cnf(c_0_187,hypothesis,
( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
i_0_170 ).
cnf(c_0_188,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
i_0_173 ).
cnf(c_0_189,hypothesis,
( xi = sbrdtbr0(slcrc0)
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(rw,[status(thm)],[c_0_185,c_0_186]) ).
cnf(c_0_190,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_149 ).
cnf(c_0_191,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
i_0_163 ).
cnf(c_0_192,hypothesis,
isCountable0(xS),
i_0_148 ).
cnf(c_0_193,hypothesis,
( xi = sbrdtbr0(slcrc0)
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(rw,[status(thm)],[c_0_187,c_0_186]) ).
cnf(c_0_194,negated_conjecture,
( xi = sbrdtbr0(slcrc0)
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_188,c_0_189]) ).
cnf(c_0_195,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,sz00),szNzAzT0),
inference(rw,[status(thm)],[c_0_190,c_0_191]) ).
cnf(c_0_196,hypothesis,
isCountable0(sdtlpdtrp0(xN,sz00)),
inference(rw,[status(thm)],[c_0_192,c_0_191]) ).
cnf(c_0_197,hypothesis,
xi = sbrdtbr0(slcrc0),
inference(csr,[status(thm)],[c_0_193,c_0_194]) ).
cnf(c_0_198,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,sbrdtbr0(slcrc0)),szNzAzT0),
inference(rw,[status(thm)],[c_0_195,c_0_186]) ).
cnf(c_0_199,hypothesis,
isCountable0(sdtlpdtrp0(xN,sbrdtbr0(slcrc0))),
inference(rw,[status(thm)],[c_0_196,c_0_186]) ).
cnf(c_0_200,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_197]),c_0_197]),c_0_198]),c_0_199])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM571+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jul 6 15:06:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 6.61/2.12 # ENIGMATIC: Solved by autoschedule:
% 6.61/2.12 # No SInE strategy applied
% 6.61/2.12 # Trying AutoSched0 for 150 seconds
% 6.61/2.12 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
% 6.61/2.12 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.61/2.12 #
% 6.61/2.12 # Preprocessing time : 0.015 s
% 6.61/2.12 # Presaturation interreduction done
% 6.61/2.12
% 6.61/2.12 # Proof found!
% 6.61/2.12 # SZS status Theorem
% 6.61/2.12 # SZS output start CNFRefutation
% See solution above
% 6.61/2.12 # Training examples: 0 positive, 0 negative
% 6.61/2.12
% 6.61/2.12 # -------------------------------------------------
% 6.61/2.12 # User time : 0.028 s
% 6.61/2.12 # System time : 0.001 s
% 6.61/2.12 # Total time : 0.029 s
% 6.61/2.12 # Maximum resident set size: 7124 pages
% 6.61/2.12
%------------------------------------------------------------------------------