TSTP Solution File: NUM623+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM623+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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.11s 2.36s
% Output : CNFRefutation 8.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of clauses : 34 ( 22 unt; 3 nHn; 34 RR)
% Number of literals : 61 ( 21 equ; 30 neg)
% Maximal clause size : 7 ( 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_83,plain,
( X1 = slcrc0
| X2 = slcrc0
| szmzizndt0(X2) = szmzizndt0(X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aElementOf0(szmzizndt0(X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_83) ).
cnf(i_0_204,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_204) ).
cnf(i_0_206,hypothesis,
szmzizndt0(xQ) = xp,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_206) ).
cnf(i_0_202,hypothesis,
slcrc0 != xQ,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_202) ).
cnf(i_0_167,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_167) ).
cnf(i_0_223,hypothesis,
aElementOf0(xm,szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_223) ).
cnf(i_0_11,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_11) ).
cnf(i_0_7,plain,
( aSet0(X1)
| X1 != slcrc0 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_7) ).
cnf(i_0_166,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_166) ).
cnf(i_0_228,hypothesis,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_228) ).
cnf(i_0_224,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xx,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_224) ).
cnf(i_0_227,hypothesis,
aElementOf0(xx,xQ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_227) ).
cnf(i_0_229,negated_conjecture,
xp != xx,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-m45ninhr/lgb.p',i_0_229) ).
cnf(c_0_243,plain,
( X1 = slcrc0
| X2 = slcrc0
| szmzizndt0(X2) = szmzizndt0(X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ aElementOf0(szmzizndt0(X1),X2)
| ~ aElementOf0(szmzizndt0(X2),X1) ),
i_0_83 ).
cnf(c_0_244,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
i_0_204 ).
cnf(c_0_245,hypothesis,
szmzizndt0(xQ) = xp,
i_0_206 ).
cnf(c_0_246,hypothesis,
slcrc0 != xQ,
i_0_202 ).
cnf(c_0_247,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_167 ).
cnf(c_0_248,hypothesis,
aElementOf0(xm,szNzAzT0),
i_0_223 ).
cnf(c_0_249,plain,
( X1 != slcrc0
| ~ aSet0(X1)
| ~ isCountable0(X1) ),
i_0_11 ).
cnf(c_0_250,plain,
( aSet0(X1)
| X1 != slcrc0 ),
i_0_7 ).
cnf(c_0_251,hypothesis,
( isCountable0(sdtlpdtrp0(xN,X1))
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_166 ).
cnf(c_0_252,hypothesis,
( szmzizndt0(X1) = xp
| X1 = slcrc0
| ~ aElementOf0(szmzizndt0(X1),xQ)
| ~ aElementOf0(xp,X1)
| ~ aSubsetOf0(X1,szNzAzT0) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_243,c_0_244]),c_0_245]),c_0_245]),c_0_246]) ).
cnf(c_0_253,hypothesis,
aElementOf0(xp,sdtlpdtrp0(xN,xm)),
i_0_228 ).
cnf(c_0_254,hypothesis,
szmzizndt0(sdtlpdtrp0(xN,xm)) = xx,
i_0_224 ).
cnf(c_0_255,hypothesis,
aElementOf0(xx,xQ),
i_0_227 ).
cnf(c_0_256,hypothesis,
aSubsetOf0(sdtlpdtrp0(xN,xm),szNzAzT0),
inference(spm,[status(thm)],[c_0_247,c_0_248]) ).
cnf(c_0_257,negated_conjecture,
xp != xx,
i_0_229 ).
cnf(c_0_258,plain,
( ~ isCountable0(slcrc0)
| ~ aSet0(slcrc0) ),
inference(er,[status(thm)],[c_0_249]) ).
cnf(c_0_259,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_250]) ).
cnf(c_0_260,hypothesis,
isCountable0(sdtlpdtrp0(xN,xm)),
inference(spm,[status(thm)],[c_0_251,c_0_248]) ).
cnf(c_0_261,hypothesis,
sdtlpdtrp0(xN,xm) = slcrc0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_254]),c_0_254]),c_0_255]),c_0_256])]),c_0_257]) ).
cnf(c_0_262,plain,
~ isCountable0(slcrc0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_258,c_0_259])]) ).
cnf(c_0_263,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_260,c_0_261]),c_0_262]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM623+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n026.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 : Fri Jul 8 02:05:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 8.11/2.36 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.11/2.36 # No SInE strategy applied
% 8.11/2.36 # Trying AutoSched0 for 150 seconds
% 8.11/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.11/2.36 # and selection function SelectNewComplexAHP.
% 8.11/2.36 #
% 8.11/2.36 # Preprocessing time : 0.018 s
% 8.11/2.36 # Presaturation interreduction done
% 8.11/2.36
% 8.11/2.36 # Proof found!
% 8.11/2.36 # SZS status Theorem
% 8.11/2.36 # SZS output start CNFRefutation
% See solution above
% 8.11/2.36 # Training examples: 0 positive, 0 negative
% 8.11/2.36
% 8.11/2.36 # -------------------------------------------------
% 8.11/2.36 # User time : 0.072 s
% 8.11/2.36 # System time : 0.013 s
% 8.11/2.36 # Total time : 0.085 s
% 8.11/2.36 # Maximum resident set size: 7124 pages
% 8.11/2.36
%------------------------------------------------------------------------------