TSTP Solution File: NUM478+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM478+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:36:26 EDT 2022
% Result : Theorem 23.18s 4.39s
% Output : CNFRefutation 23.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 42 ( 15 unt; 13 nHn; 42 RR)
% Number of literals : 162 ( 40 equ; 115 neg)
% Maximal clause size : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_54,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_54) ).
cnf(i_0_53,plain,
( X1 = sz00
| X2 = sdtsldt0(X3,X1)
| X3 != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_53) ).
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-b9owgceq/input.p',i_0_12) ).
cnf(i_0_11,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_11) ).
cnf(i_0_65,negated_conjecture,
sdtsldt0(sdtasdt0(xn,xm),xl) != sdtasdt0(xn,sdtsldt0(xm,xl)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_65) ).
cnf(i_0_64,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_64) ).
cnf(i_0_60,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_60) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_6) ).
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-b9owgceq/input.p',i_0_50) ).
cnf(i_0_62,hypothesis,
doDivides0(xl,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_62) ).
cnf(i_0_61,hypothesis,
aNaturalNumber0(xl),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_61) ).
cnf(i_0_63,hypothesis,
sz00 != xl,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_63) ).
cnf(i_0_56,plain,
( doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_56) ).
cnf(i_0_55,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b9owgceq/input.p',i_0_55) ).
cnf(c_0_80,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
i_0_54 ).
cnf(c_0_81,plain,
( X1 = sz00
| X2 = sdtsldt0(X3,X1)
| X3 != sdtasdt0(X1,X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X3) ),
i_0_53 ).
cnf(c_0_82,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_12 ).
cnf(c_0_83,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_80]) ).
cnf(c_0_84,plain,
( sdtsldt0(sdtasdt0(X1,X2),X1) = X2
| X1 = sz00
| ~ doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_85,plain,
( sdtasdt0(X1,sdtasdt0(sdtsldt0(X2,X1),X3)) = sdtasdt0(X2,X3)
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(sdtsldt0(X2,X1))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,plain,
( sdtsldt0(sdtasdt0(X1,X2),X3) = sdtasdt0(sdtsldt0(X1,X3),X2)
| X3 = sz00
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ doDivides0(X3,X1)
| ~ aNaturalNumber0(sdtasdt0(sdtsldt0(X1,X3),X2))
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(sdtsldt0(X1,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_85]) ).
cnf(c_0_87,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_11 ).
cnf(c_0_88,negated_conjecture,
sdtsldt0(sdtasdt0(xn,xm),xl) != sdtasdt0(xn,sdtsldt0(xm,xl)),
i_0_65 ).
cnf(c_0_89,hypothesis,
aNaturalNumber0(xn),
i_0_64 ).
cnf(c_0_90,hypothesis,
aNaturalNumber0(xm),
i_0_60 ).
cnf(c_0_91,plain,
( sdtsldt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X2,sdtsldt0(X1,X3))
| X3 = sz00
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ doDivides0(X3,X1)
| ~ aNaturalNumber0(sdtasdt0(X2,sdtsldt0(X1,X3)))
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(sdtsldt0(X1,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_92,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_93,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_94,negated_conjecture,
sdtsldt0(sdtasdt0(xm,xn),xl) != sdtasdt0(xn,sdtsldt0(xm,xl)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_87]),c_0_89]),c_0_90])]) ).
cnf(c_0_95,plain,
( sdtsldt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X2,sdtsldt0(X1,X3))
| X3 = sz00
| ~ doDivides0(X3,sdtasdt0(X1,X2))
| ~ doDivides0(X3,X1)
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(sdtsldt0(X1,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,hypothesis,
doDivides0(xl,xm),
i_0_62 ).
cnf(c_0_97,hypothesis,
aNaturalNumber0(xl),
i_0_61 ).
cnf(c_0_98,hypothesis,
sz00 != xl,
i_0_63 ).
cnf(c_0_99,plain,
( doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3) ),
i_0_56 ).
cnf(c_0_100,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_93]) ).
cnf(c_0_101,negated_conjecture,
( ~ doDivides0(xl,sdtasdt0(xm,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xn))
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
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_94,c_0_95]),c_0_96]),c_0_97]),c_0_89]),c_0_90])]),c_0_98]) ).
cnf(c_0_102,plain,
( doDivides0(X1,sdtasdt0(X2,X3))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_103,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_104,plain,
( ~ aNaturalNumber0(sdtasdt0(xm,xn))
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
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_101,c_0_102]),c_0_96]),c_0_90]),c_0_97]),c_0_89])]) ).
cnf(c_0_105,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_103]) ).
cnf(c_0_106,plain,
~ aNaturalNumber0(sdtasdt0(xm,xn)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_96]),c_0_90]),c_0_97])]),c_0_98]) ).
cnf(c_0_107,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_92]),c_0_89]),c_0_90])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM478+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Fri Jul 8 00:16:21 EDT 2022
% 0.11/0.34 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 23.18/4.39 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 23.18/4.39 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 23; version: 991; iters: 150)
% 23.18/4.39 # Preprocessing time : 1.692 s
% 23.18/4.39 # Presaturation interreduction done
% 23.18/4.39
% 23.18/4.39 # Proof found!
% 23.18/4.39 # SZS status Theorem
% 23.18/4.39 # SZS output start CNFRefutation
% See solution above
% 23.18/4.39 # Training examples: 0 positive, 0 negative
% 23.18/4.39
% 23.18/4.39 # -------------------------------------------------
% 23.18/4.39 # User time : 1.583 s
% 23.18/4.39 # System time : 0.172 s
% 23.18/4.39 # Total time : 1.755 s
% 23.18/4.39 # ...preprocessing : 1.692 s
% 23.18/4.39 # ...main loop : 0.063 s
% 23.18/4.39 # Maximum resident set size: 188000 pages
% 23.18/4.39
%------------------------------------------------------------------------------