TSTP Solution File: NUM452+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM452+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:09 EDT 2022
% Result : Theorem 17.23s 3.66s
% Output : CNFRefutation 17.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of clauses : 48 ( 8 unt; 10 nHn; 48 RR)
% Number of literals : 150 ( 33 equ; 103 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_29,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_29) ).
cnf(i_0_8,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_8) ).
cnf(i_0_4,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_4) ).
cnf(i_0_7,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_7) ).
cnf(i_0_11,plain,
( sdtpldt0(smndt0(X1),X1) = sz00
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_11) ).
cnf(i_0_5,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_5) ).
cnf(i_0_9,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_9) ).
cnf(i_0_28,plain,
( aInteger0(X1)
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_28) ).
cnf(i_0_27,plain,
( X1 != sz00
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_27) ).
cnf(i_0_94,plain,
( X1 = sz00
| aElementOf0(X2,X3)
| X3 != szAzrzSzezqlpdtcmdtrp0(X4,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X4)
| ~ aInteger0(X2)
| ~ sdteqdtlpzmzozddtrp0(X2,X4,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_94) ).
cnf(i_0_121,negated_conjecture,
( ~ aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_121) ).
cnf(i_0_3,plain,
aInteger0(sz10),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_3) ).
cnf(i_0_24,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_24) ).
cnf(i_0_21,plain,
( sdtasdt0(X1,smndt0(sz10)) = smndt0(X1)
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_21) ).
cnf(i_0_120,hypothesis,
aInteger0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_120) ).
cnf(i_0_119,hypothesis,
xp != sz00,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_119) ).
cnf(i_0_16,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cijkzvt3/input.p',i_0_16) ).
cnf(c_0_139,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3))) ),
i_0_29 ).
cnf(c_0_140,plain,
( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_8 ).
cnf(c_0_141,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
i_0_4 ).
cnf(c_0_142,plain,
( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_7 ).
cnf(c_0_143,plain,
( sdtpldt0(smndt0(X1),X1) = sz00
| ~ aInteger0(X1) ),
i_0_11 ).
cnf(c_0_144,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(X2,X3,X1)
| ~ aDivisorOf0(X1,sdtpldt0(smndt0(X3),X2))
| ~ aInteger0(X3)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141]) ).
cnf(c_0_145,plain,
( sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2)
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_141]) ).
cnf(c_0_146,plain,
( aInteger0(sdtpldt0(X1,X2))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
i_0_5 ).
cnf(c_0_147,plain,
( X1 = sz00
| sdteqdtlpzmzozddtrp0(sdtpldt0(X2,X3),X2,X1)
| ~ aDivisorOf0(X1,sdtpldt0(sz00,X3))
| ~ aInteger0(X2)
| ~ aInteger0(X1)
| ~ aInteger0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_146]) ).
cnf(c_0_148,plain,
( sdtpldt0(sz00,X1) = X1
| ~ aInteger0(X1) ),
i_0_9 ).
cnf(c_0_149,plain,
( aInteger0(X1)
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2) ),
i_0_28 ).
cnf(c_0_150,plain,
( X1 != sz00
| ~ aInteger0(X2)
| ~ aDivisorOf0(X1,X2) ),
i_0_27 ).
cnf(c_0_151,plain,
( X1 = sz00
| aElementOf0(X2,X3)
| X3 != szAzrzSzezqlpdtcmdtrp0(X4,X1)
| ~ aInteger0(X1)
| ~ aInteger0(X4)
| ~ aInteger0(X2)
| ~ sdteqdtlpzmzozddtrp0(X2,X4,X1) ),
i_0_94 ).
cnf(c_0_152,plain,
( sdteqdtlpzmzozddtrp0(sdtpldt0(X1,X2),X1,X3)
| ~ aDivisorOf0(X3,X2)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_149]),c_0_150]) ).
cnf(c_0_153,plain,
( aElementOf0(sdtpldt0(X1,X2),X3)
| X3 != szAzrzSzezqlpdtcmdtrp0(X1,X4)
| ~ aDivisorOf0(X4,X2)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_149]),c_0_146]),c_0_150]) ).
cnf(c_0_154,negated_conjecture,
( ~ aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aElementOf0(sdtpldt0(sz10,smndt0(xp)),szAzrzSzezqlpdtcmdtrp0(sz10,xp)) ),
i_0_121 ).
cnf(c_0_155,plain,
( aElementOf0(sdtpldt0(X1,X2),szAzrzSzezqlpdtcmdtrp0(X1,X3))
| ~ aDivisorOf0(X3,X2)
| ~ aInteger0(X1)
| ~ aInteger0(X2) ),
inference(er,[status(thm)],[c_0_153]) ).
cnf(c_0_156,plain,
aInteger0(sz10),
i_0_3 ).
cnf(c_0_157,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| sdtasdt0(X1,X3) != X2
| ~ aInteger0(X2)
| ~ aInteger0(X3)
| ~ aInteger0(X1) ),
i_0_24 ).
cnf(c_0_158,plain,
( sdtasdt0(X1,smndt0(sz10)) = smndt0(X1)
| ~ aInteger0(X1) ),
i_0_21 ).
cnf(c_0_159,negated_conjecture,
( ~ aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aDivisorOf0(xp,smndt0(xp))
| ~ aInteger0(smndt0(xp)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_156])]) ).
cnf(c_0_160,plain,
( X1 = sz00
| aDivisorOf0(X1,X2)
| smndt0(X1) != X2
| ~ aInteger0(smndt0(sz10))
| ~ aInteger0(X2)
| ~ aInteger0(X1) ),
inference(spm,[status(thm)],[c_0_157,c_0_158]) ).
cnf(c_0_161,hypothesis,
aInteger0(xp),
i_0_120 ).
cnf(c_0_162,hypothesis,
xp != sz00,
i_0_119 ).
cnf(c_0_163,plain,
( ~ aElementOf0(sdtpldt0(sz10,xp),szAzrzSzezqlpdtcmdtrp0(sz10,xp))
| ~ aInteger0(smndt0(xp))
| ~ aInteger0(smndt0(sz10)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_161])]),c_0_162]) ).
cnf(c_0_164,plain,
( sdtasdt0(X1,sz10) = X1
| ~ aInteger0(X1) ),
i_0_16 ).
cnf(c_0_165,plain,
( ~ aDivisorOf0(xp,xp)
| ~ aInteger0(smndt0(xp))
| ~ aInteger0(smndt0(sz10)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_155]),c_0_156]),c_0_161])]) ).
cnf(c_0_166,plain,
( X1 = sz00
| aDivisorOf0(X1,X1)
| ~ aInteger0(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_164]),c_0_156])])]) ).
cnf(c_0_167,plain,
( ~ aInteger0(smndt0(xp))
| ~ aInteger0(smndt0(sz10)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_161])]),c_0_162]) ).
cnf(c_0_168,plain,
~ aInteger0(smndt0(sz10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_141]),c_0_161])]) ).
cnf(c_0_169,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_141]),c_0_156])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM452+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Thu Jul 7 01:20:31 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 17.23/3.66 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 17.23/3.66 # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d45-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 28; version: 991; iters: 150)
% 17.23/3.66 # Preprocessing time : 1.152 s
% 17.23/3.66
% 17.23/3.66 # Proof found!
% 17.23/3.66 # SZS status Theorem
% 17.23/3.66 # SZS output start CNFRefutation
% See solution above
% 17.23/3.66 # Training examples: 0 positive, 0 negative
% 17.23/3.66
% 17.23/3.66 # -------------------------------------------------
% 17.23/3.66 # User time : 1.050 s
% 17.23/3.66 # System time : 0.160 s
% 17.23/3.66 # Total time : 1.210 s
% 17.23/3.66 # ...preprocessing : 1.152 s
% 17.23/3.66 # ...main loop : 0.058 s
% 17.23/3.66 # Maximum resident set size: 177072 pages
% 17.23/3.66
%------------------------------------------------------------------------------