TSTP Solution File: NUM574+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM574+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:30 EDT 2022
% Result : Theorem 7.91s 2.31s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 20 unt; 4 nHn; 38 RR)
% Number of literals : 73 ( 19 equ; 36 neg)
% Maximal clause size : 5 ( 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_171,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(xj,xi) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_171) ).
cnf(i_0_173,negated_conjecture,
sdtlseqdt0(xj,xi),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_173) ).
cnf(i_0_172,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_172) ).
cnf(i_0_51,plain,
( X1 = sz00
| aElementOf0(esk5_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_51) ).
cnf(i_0_60,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_60) ).
cnf(i_0_169,hypothesis,
aElementOf0(xj,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_169) ).
cnf(i_0_168,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_168) ).
cnf(i_0_50,plain,
( X1 = sz00
| szszuzczcdt0(esk5_1(X1)) = X1
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_50) ).
cnf(i_0_163,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_163) ).
cnf(i_0_54,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_54) ).
cnf(i_0_15,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_15) ).
cnf(i_0_149,hypothesis,
aSubsetOf0(xS,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_149) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_45) ).
cnf(i_0_17,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2x76dkib/lgb.p',i_0_17) ).
cnf(c_0_188,hypothesis,
( aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj))
| szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(xj,xi) ),
i_0_171 ).
cnf(c_0_189,negated_conjecture,
sdtlseqdt0(xj,xi),
i_0_173 ).
cnf(c_0_190,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),sdtlpdtrp0(xN,xj)),
i_0_172 ).
cnf(c_0_191,hypothesis,
( szszuzczcdt0(X1) != xi
| ~ aElementOf0(X1,szNzAzT0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_189])]),c_0_190]) ).
cnf(c_0_192,plain,
( X1 = sz00
| aElementOf0(esk5_1(X1),szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_51 ).
cnf(c_0_193,plain,
( X1 = X2
| ~ sdtlseqdt0(X2,X1)
| ~ sdtlseqdt0(X1,X2)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_60 ).
cnf(c_0_194,hypothesis,
aElementOf0(xj,szNzAzT0),
i_0_169 ).
cnf(c_0_195,hypothesis,
aElementOf0(xi,szNzAzT0),
i_0_168 ).
cnf(c_0_196,hypothesis,
( X1 = sz00
| szszuzczcdt0(esk5_1(X1)) != xi
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_191,c_0_192]) ).
cnf(c_0_197,plain,
( X1 = sz00
| szszuzczcdt0(esk5_1(X1)) = X1
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_50 ).
cnf(c_0_198,negated_conjecture,
( xj = xi
| ~ sdtlseqdt0(xi,xj) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_193,c_0_189]),c_0_194]),c_0_195])]) ).
cnf(c_0_199,plain,
xi = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_196,c_0_197])]),c_0_195])]) ).
cnf(c_0_200,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
i_0_163 ).
cnf(c_0_201,negated_conjecture,
( xj = sz00
| ~ sdtlseqdt0(sz00,xj) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_199]),c_0_199]) ).
cnf(c_0_202,plain,
( sdtlseqdt0(sz00,X1)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_54 ).
cnf(c_0_203,negated_conjecture,
~ aSubsetOf0(xS,sdtlpdtrp0(xN,xj)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_190,c_0_199]),c_0_200]) ).
cnf(c_0_204,plain,
xj = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_201,c_0_202]),c_0_194])]) ).
cnf(c_0_205,plain,
( aSet0(X1)
| ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2) ),
i_0_15 ).
cnf(c_0_206,hypothesis,
aSubsetOf0(xS,szNzAzT0),
i_0_149 ).
cnf(c_0_207,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_208,negated_conjecture,
~ aSubsetOf0(xS,xS),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_203,c_0_204]),c_0_200]) ).
cnf(c_0_209,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
i_0_17 ).
cnf(c_0_210,hypothesis,
aSet0(xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_206]),c_0_207])]) ).
cnf(c_0_211,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_208,c_0_209]),c_0_210])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM574+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n028.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 : Thu Jul 7 07:34:25 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.91/2.31 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.31 # No SInE strategy applied
% 7.91/2.31 # Trying AutoSched0 for 150 seconds
% 7.91/2.31 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.91/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.91/2.31 #
% 7.91/2.31 # Preprocessing time : 0.025 s
% 7.91/2.31
% 7.91/2.31 # Proof found!
% 7.91/2.31 # SZS status Theorem
% 7.91/2.31 # SZS output start CNFRefutation
% See solution above
% 7.91/2.31 # Training examples: 0 positive, 0 negative
% 7.91/2.31
% 7.91/2.31 # -------------------------------------------------
% 7.91/2.31 # User time : 0.038 s
% 7.91/2.31 # System time : 0.007 s
% 7.91/2.31 # Total time : 0.045 s
% 7.91/2.31 # Maximum resident set size: 7128 pages
% 7.91/2.31
%------------------------------------------------------------------------------