TSTP Solution File: NUM466+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM466+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:36:18 EDT 2022
% Result : Theorem 14.45s 3.10s
% Output : CNFRefutation 14.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 13 unt; 0 nHn; 29 RR)
% Number of literals : 83 ( 7 equ; 56 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_50,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_50) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_6) ).
cnf(i_0_51,plain,
( sdtasdt0(X1,esk2_2(X1,X2)) = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_51) ).
cnf(i_0_12,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_12) ).
cnf(i_0_52,plain,
( aNaturalNumber0(esk2_2(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_52) ).
cnf(i_0_60,negated_conjecture,
doDivides0(xm,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_60) ).
cnf(i_0_56,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_56) ).
cnf(i_0_57,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_57) ).
cnf(i_0_59,negated_conjecture,
~ doDivides0(xl,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_59) ).
cnf(i_0_61,negated_conjecture,
doDivides0(xl,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_61) ).
cnf(i_0_58,hypothesis,
aNaturalNumber0(xl),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-palqftcx/input.p',i_0_58) ).
cnf(c_0_73,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_74,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_75,plain,
( sdtasdt0(X1,esk2_2(X1,X2)) = X2
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
i_0_51 ).
cnf(c_0_76,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_12 ).
cnf(c_0_77,plain,
( aNaturalNumber0(esk2_2(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X1,X2) ),
i_0_52 ).
cnf(c_0_78,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_73]),c_0_74]) ).
cnf(c_0_79,plain,
( sdtasdt0(X1,sdtasdt0(X2,esk2_2(sdtasdt0(X1,X2),X3))) = X3
| ~ doDivides0(sdtasdt0(X1,X2),X3)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_74]) ).
cnf(c_0_80,plain,
( doDivides0(X1,X2)
| ~ doDivides0(sdtasdt0(X1,X3),X2)
| ~ aNaturalNumber0(sdtasdt0(X3,esk2_2(sdtasdt0(X1,X3),X2)))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_81,plain,
( doDivides0(X1,X2)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(sdtasdt0(esk2_2(X1,X3),esk2_2(X3,X2)))
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_75]),c_0_77]) ).
cnf(c_0_82,plain,
( doDivides0(X1,X2)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_74]),c_0_77]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
doDivides0(xm,xn),
i_0_60 ).
cnf(c_0_84,hypothesis,
aNaturalNumber0(xn),
i_0_56 ).
cnf(c_0_85,hypothesis,
aNaturalNumber0(xm),
i_0_57 ).
cnf(c_0_86,negated_conjecture,
~ doDivides0(xl,xn),
i_0_59 ).
cnf(c_0_87,negated_conjecture,
( doDivides0(X1,xn)
| ~ doDivides0(X1,xm)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84]),c_0_85])]) ).
cnf(c_0_88,negated_conjecture,
doDivides0(xl,xm),
i_0_61 ).
cnf(c_0_89,hypothesis,
aNaturalNumber0(xl),
i_0_58 ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_89])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM466+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jul 7 00:25:09 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 14.45/3.10 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 14.45/3.10 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 23; version: 991; iters: 150)
% 14.45/3.10 # Preprocessing time : 0.862 s
% 14.45/3.10
% 14.45/3.10 # Proof found!
% 14.45/3.10 # SZS status Theorem
% 14.45/3.10 # SZS output start CNFRefutation
% See solution above
% 14.45/3.10 # Training examples: 0 positive, 0 negative
% 14.45/3.10
% 14.45/3.10 # -------------------------------------------------
% 14.45/3.10 # User time : 0.785 s
% 14.45/3.10 # System time : 0.119 s
% 14.45/3.10 # Total time : 0.903 s
% 14.45/3.10 # ...preprocessing : 0.862 s
% 14.45/3.10 # ...main loop : 0.041 s
% 14.45/3.10 # Maximum resident set size: 168160 pages
% 14.45/3.10
%------------------------------------------------------------------------------