TSTP Solution File: NUM594+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM594+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:43 EDT 2022
% Result : Theorem 8.93s 2.55s
% Output : CNFRefutation 8.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 12 unt; 0 nHn; 26 RR)
% Number of literals : 58 ( 14 equ; 35 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_130,plain,
( sdtlpdtrp0(X1,esk14_4(X1,X2,X3,X4)) = X4
| X3 != sdtlcdtrc0(X1,X2)
| ~ aFunction0(X1)
| ~ aElementOf0(X4,X3)
| ~ aSubsetOf0(X2,szDzozmdt0(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_130) ).
cnf(i_0_188,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_188) ).
cnf(i_0_189,hypothesis,
aFunction0(xd),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_189) ).
cnf(i_0_131,plain,
( aElementOf0(esk14_4(X1,X2,X3,X4),X2)
| X3 != sdtlcdtrc0(X1,X2)
| ~ aFunction0(X1)
| ~ aElementOf0(X4,X3)
| ~ aSubsetOf0(X2,szDzozmdt0(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_131) ).
cnf(i_0_17,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_17) ).
cnf(i_0_45,plain,
aSet0(szNzAzT0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_45) ).
cnf(i_0_191,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_191) ).
cnf(i_0_192,negated_conjecture,
( sdtlpdtrp0(xd,X1) != xx
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x5ur4swp/lgb.p',i_0_192) ).
cnf(c_0_201,plain,
( sdtlpdtrp0(X1,esk14_4(X1,X2,X3,X4)) = X4
| X3 != sdtlcdtrc0(X1,X2)
| ~ aFunction0(X1)
| ~ aElementOf0(X4,X3)
| ~ aSubsetOf0(X2,szDzozmdt0(X1)) ),
i_0_130 ).
cnf(c_0_202,plain,
( sdtlpdtrp0(X1,esk14_4(X1,X2,sdtlcdtrc0(X1,X2),X3)) = X3
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1)
| ~ aElementOf0(X3,sdtlcdtrc0(X1,X2)) ),
inference(er,[status(thm)],[c_0_201]) ).
cnf(c_0_203,hypothesis,
szDzozmdt0(xd) = szNzAzT0,
i_0_188 ).
cnf(c_0_204,hypothesis,
aFunction0(xd),
i_0_189 ).
cnf(c_0_205,plain,
( aElementOf0(esk14_4(X1,X2,X3,X4),X2)
| X3 != sdtlcdtrc0(X1,X2)
| ~ aFunction0(X1)
| ~ aElementOf0(X4,X3)
| ~ aSubsetOf0(X2,szDzozmdt0(X1)) ),
i_0_131 ).
cnf(c_0_206,hypothesis,
( sdtlpdtrp0(xd,esk14_4(xd,X1,sdtlcdtrc0(xd,X1),X2)) = X2
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,sdtlcdtrc0(xd,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_204])]) ).
cnf(c_0_207,plain,
( aSubsetOf0(X1,X1)
| ~ aSet0(X1) ),
i_0_17 ).
cnf(c_0_208,plain,
aSet0(szNzAzT0),
i_0_45 ).
cnf(c_0_209,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szDzozmdt0(xd))),
i_0_191 ).
cnf(c_0_210,plain,
( aElementOf0(esk14_4(X1,X2,sdtlcdtrc0(X1,X2),X3),X2)
| ~ aSubsetOf0(X2,szDzozmdt0(X1))
| ~ aFunction0(X1)
| ~ aElementOf0(X3,sdtlcdtrc0(X1,X2)) ),
inference(er,[status(thm)],[c_0_205]) ).
cnf(c_0_211,plain,
( sdtlpdtrp0(xd,esk14_4(xd,szNzAzT0,sdtlcdtrc0(xd,szNzAzT0),X1)) = X1
| ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_206,c_0_207]),c_0_208])]) ).
cnf(c_0_212,hypothesis,
aElementOf0(xx,sdtlcdtrc0(xd,szNzAzT0)),
inference(rw,[status(thm)],[c_0_209,c_0_203]) ).
cnf(c_0_213,hypothesis,
( aElementOf0(esk14_4(xd,X1,sdtlcdtrc0(xd,X1),X2),X1)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,sdtlcdtrc0(xd,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_203]),c_0_204])]) ).
cnf(c_0_214,negated_conjecture,
( sdtlpdtrp0(xd,X1) != xx
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_192 ).
cnf(c_0_215,hypothesis,
sdtlpdtrp0(xd,esk14_4(xd,szNzAzT0,sdtlcdtrc0(xd,szNzAzT0),xx)) = xx,
inference(spm,[status(thm)],[c_0_211,c_0_212]) ).
cnf(c_0_216,plain,
( aElementOf0(esk14_4(xd,szNzAzT0,sdtlcdtrc0(xd,szNzAzT0),X1),szNzAzT0)
| ~ aElementOf0(X1,sdtlcdtrc0(xd,szNzAzT0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_213,c_0_207]),c_0_208])]) ).
cnf(c_0_217,negated_conjecture,
~ aElementOf0(esk14_4(xd,szNzAzT0,sdtlcdtrc0(xd,szNzAzT0),xx),szNzAzT0),
inference(spm,[status(thm)],[c_0_214,c_0_215]) ).
cnf(c_0_218,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_212]),c_0_217]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM594+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 10:33:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 8.93/2.55 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.93/2.55 # No SInE strategy applied
% 8.93/2.55 # Trying AutoSched0 for 150 seconds
% 8.93/2.55 # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 8.93/2.55 # and selection function SelectNewComplexAHPNS.
% 8.93/2.55 #
% 8.93/2.55 # Preprocessing time : 0.024 s
% 8.93/2.55
% 8.93/2.55 # Proof found!
% 8.93/2.55 # SZS status Theorem
% 8.93/2.55 # SZS output start CNFRefutation
% See solution above
% 8.93/2.55 # Training examples: 0 positive, 0 negative
% 8.93/2.55
% 8.93/2.55 # -------------------------------------------------
% 8.93/2.55 # User time : 0.037 s
% 8.93/2.55 # System time : 0.008 s
% 8.93/2.55 # Total time : 0.044 s
% 8.93/2.55 # Maximum resident set size: 7120 pages
% 8.93/2.55
%------------------------------------------------------------------------------