TSTP Solution File: NUM620+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM620+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:59 EDT 2022
% Result : Theorem 9.77s 2.60s
% Output : CNFRefutation 9.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 40 ( 17 unt; 5 nHn; 40 RR)
% Number of literals : 79 ( 14 equ; 41 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; 6 con; 0-2 aty)
% Number of variables : 28 ( 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-a7yfeof0/input.p',i_0_14) ).
cnf(i_0_226,negated_conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/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-a7yfeof0/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-a7yfeof0/input.p',i_0_167) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/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-a7yfeof0/input.p',i_0_78) ).
cnf(i_0_224,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xx,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/input.p',i_0_224) ).
cnf(i_0_225,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/input.p',i_0_225) ).
cnf(i_0_223,hypothesis,
aElementOf0(xm,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/input.p',i_0_223) ).
cnf(i_0_48,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/input.p',i_0_48) ).
cnf(i_0_216,hypothesis,
aElementOf0(xn,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/input.p',i_0_216) ).
cnf(i_0_7,plain,
( aSet0(X1)
| X1 != slcrc0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/input.p',i_0_7) ).
cnf(i_0_11,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-a7yfeof0/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-a7yfeof0/input.p',i_0_166) ).
cnf(c_0_241,plain,
( aElementOf0(X1,X2)
| ~ aSet0(X2)
| ~ aElementOf0(X1,X3)
| ~ aSubsetOf0(X3,X2) ),
i_0_14 ).
cnf(c_0_242,negated_conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
i_0_226 ).
cnf(c_0_243,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_244,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_167 ).
cnf(c_0_245,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_246,plain,
( X1 = slcrc0
| aElementOf0(X2,X1)
| X2 != szmzizndt0(X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
i_0_78 ).
cnf(c_0_247,negated_conjecture,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aSet0(sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(spm,[status(thm)],[c_0_241,c_0_242]) ).
cnf(c_0_248,plain,
( aSet0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_245])]) ).
cnf(c_0_249,plain,
( X1 = slcrc0
| aElementOf0(szmzizndt0(X1),X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(er,[status(thm)],[c_0_246]) ).
cnf(c_0_250,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xx,
i_0_224 ).
cnf(c_0_251,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
i_0_225 ).
cnf(c_0_252,plain,
( aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_247,c_0_248]) ).
cnf(c_0_253,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_249,c_0_250]) ).
cnf(c_0_254,hypothesis,
aElementOf0(xm,szNzAzT0),
i_0_223 ).
cnf(c_0_255,negated_conjecture,
( ~ aElementOf0(xx,sdtlpdtrp0(xN,xm))
| ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
inference(spm,[status(thm)],[c_0_251,c_0_252]) ).
cnf(c_0_256,plain,
( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_48 ).
cnf(c_0_257,hypothesis,
aElementOf0(xn,szNzAzT0),
i_0_216 ).
cnf(c_0_258,plain,
( aSet0(X1)
| X1 != slcrc0 ),
i_0_7 ).
cnf(c_0_259,hypothesis,
( sdtlpdtrp0(xN,xm) = slcrc0
| aElementOf0(xx,sdtlpdtrp0(xN,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_253,c_0_244]),c_0_254])]) ).
cnf(c_0_260,plain,
~ aElementOf0(xx,sdtlpdtrp0(xN,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_255,c_0_256]),c_0_257])]) ).
cnf(c_0_261,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
i_0_11 ).
cnf(c_0_262,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_258]) ).
cnf(c_0_263,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_166 ).
cnf(c_0_264,hypothesis,
sdtlpdtrp0(xN,xm) = slcrc0,
inference(sr,[status(thm)],[c_0_259,c_0_260]) ).
cnf(c_0_265,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_261]),c_0_262])]) ).
cnf(c_0_266,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_263,c_0_264]),c_0_254])]),c_0_265]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM620+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jul 6 17:44:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 9.77/2.60 # ENIGMATIC: Solved by autoschedule:
% 9.77/2.60 # No SInE strategy applied
% 9.77/2.60 # Trying AutoSched0 for 150 seconds
% 9.77/2.60 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 9.77/2.60 # and selection function SelectMaxLComplexAvoidPosPred.
% 9.77/2.60 #
% 9.77/2.60 # Preprocessing time : 0.031 s
% 9.77/2.60 # Presaturation interreduction done
% 9.77/2.60
% 9.77/2.60 # Proof found!
% 9.77/2.60 # SZS status Theorem
% 9.77/2.60 # SZS output start CNFRefutation
% See solution above
% 9.77/2.60 # Training examples: 0 positive, 0 negative
% 9.77/2.60
% 9.77/2.60 # -------------------------------------------------
% 9.77/2.60 # User time : 0.081 s
% 9.77/2.60 # System time : 0.013 s
% 9.77/2.60 # Total time : 0.094 s
% 9.77/2.60 # Maximum resident set size: 7120 pages
% 9.77/2.60
%------------------------------------------------------------------------------