TSTP Solution File: RNG126+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : RNG126+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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 20:25:04 EDT 2022
% Result : Theorem 15.37s 3.41s
% Output : CNFRefutation 15.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of clauses : 38 ( 23 unt; 0 nHn; 38 RR)
% Number of literals : 81 ( 6 equ; 46 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_52,plain,
( aElementOf0(sdtasdt0(X1,X2),X3)
| ~ aElement0(X1)
| ~ aIdeal0(X3)
| ~ aElementOf0(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_52) ).
cnf(i_0_13,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_13) ).
cnf(i_0_82,plain,
( aDivisorOf0(X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aGcdOfAnd0(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_82) ).
cnf(i_0_97,hypothesis,
aGcdOfAnd0(xc,xa,xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_97) ).
cnf(i_0_95,hypothesis,
aElement0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_95) ).
cnf(i_0_94,hypothesis,
aElement0(xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_94) ).
cnf(i_0_73,plain,
( sdtasdt0(X1,esk16_2(X1,X2)) = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_73) ).
cnf(i_0_74,plain,
( aElement0(esk16_2(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_74) ).
cnf(i_0_77,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aDivisorOf0(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_77) ).
cnf(i_0_109,hypothesis,
aDivisorOf0(xu,xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_109) ).
cnf(i_0_111,hypothesis,
doDivides0(xu,xc),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_111) ).
cnf(i_0_112,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_112) ).
cnf(i_0_98,hypothesis,
sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_98) ).
cnf(i_0_99,hypothesis,
aIdeal0(xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_99) ).
cnf(i_0_108,hypothesis,
aElementOf0(xu,xI),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-r4_ri6zg/input.p',i_0_108) ).
cnf(c_0_128,plain,
( aElementOf0(sdtasdt0(X1,X2),X3)
| ~ aElement0(X1)
| ~ aIdeal0(X3)
| ~ aElementOf0(X2,X3) ),
i_0_52 ).
cnf(c_0_129,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
i_0_13 ).
cnf(c_0_130,plain,
( aDivisorOf0(X1,X2)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aGcdOfAnd0(X1,X3,X2) ),
i_0_82 ).
cnf(c_0_131,hypothesis,
aGcdOfAnd0(xc,xa,xb),
i_0_97 ).
cnf(c_0_132,hypothesis,
aElement0(xa),
i_0_95 ).
cnf(c_0_133,hypothesis,
aElement0(xb),
i_0_94 ).
cnf(c_0_134,plain,
( aElementOf0(sdtasdt0(X1,X2),X3)
| ~ aElementOf0(X1,X3)
| ~ aIdeal0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_135,plain,
( sdtasdt0(X1,esk16_2(X1,X2)) = X2
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2) ),
i_0_73 ).
cnf(c_0_136,plain,
( aElement0(esk16_2(X1,X2))
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ doDivides0(X1,X2) ),
i_0_74 ).
cnf(c_0_137,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aDivisorOf0(X1,X2) ),
i_0_77 ).
cnf(c_0_138,hypothesis,
aDivisorOf0(xu,xb),
i_0_109 ).
cnf(c_0_139,hypothesis,
aDivisorOf0(xc,xb),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132]),c_0_133])]) ).
cnf(c_0_140,plain,
( aElementOf0(X1,X2)
| ~ doDivides0(X3,X1)
| ~ aElementOf0(X3,X2)
| ~ aIdeal0(X2)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]) ).
cnf(c_0_141,hypothesis,
doDivides0(xu,xc),
i_0_111 ).
cnf(c_0_142,hypothesis,
aElement0(xu),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_133])]) ).
cnf(c_0_143,plain,
aElement0(xc),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_139]),c_0_133])]) ).
cnf(c_0_144,negated_conjecture,
~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
i_0_112 ).
cnf(c_0_145,hypothesis,
sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
i_0_98 ).
cnf(c_0_146,hypothesis,
( aElementOf0(xc,X1)
| ~ aElementOf0(xu,X1)
| ~ aIdeal0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_142]),c_0_143])]) ).
cnf(c_0_147,hypothesis,
aIdeal0(xI),
i_0_99 ).
cnf(c_0_148,hypothesis,
aElementOf0(xu,xI),
i_0_108 ).
cnf(c_0_149,negated_conjecture,
~ aElementOf0(xc,xI),
inference(rw,[status(thm)],[c_0_144,c_0_145]) ).
cnf(c_0_150,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148])]),c_0_149]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG126+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 05:25:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 15.37/3.41 # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 15.37/3.41 # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 27; version: 991; iters: 150)
% 15.37/3.41 # Preprocessing time : 0.829 s
% 15.37/3.41
% 15.37/3.41 # Proof found!
% 15.37/3.41 # SZS status Theorem
% 15.37/3.41 # SZS output start CNFRefutation
% See solution above
% 15.37/3.41 # Training examples: 0 positive, 0 negative
% 15.37/3.41
% 15.37/3.41 # -------------------------------------------------
% 15.37/3.41 # User time : 0.887 s
% 15.37/3.41 # System time : 0.110 s
% 15.37/3.41 # Total time : 0.997 s
% 15.37/3.41 # ...preprocessing : 0.829 s
% 15.37/3.41 # ...main loop : 0.168 s
% 15.37/3.41 # Maximum resident set size: 168508 pages
% 15.37/3.41
%------------------------------------------------------------------------------