TSTP Solution File: NUM630+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM630+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:38:06 EDT 2022
% Result : Theorem 27.76s 5.76s
% Output : CNFRefutation 27.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 14 unt; 0 nHn; 20 RR)
% Number of literals : 35 ( 12 equ; 19 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4434,plain,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2)))) = sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1)
| sbrdtbr0(X1) != xk
| ~ aSet0(X1)
| ~ epred2_1(X2)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2)))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4434) ).
cnf(i_0_4289,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))) = xD,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4289) ).
cnf(i_0_4299,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4299) ).
cnf(i_0_4279,hypothesis,
sbrdtbr0(xP) = xk,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4279) ).
cnf(i_0_4271,hypothesis,
aSet0(xP),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4271) ).
cnf(i_0_4297,hypothesis,
aSubsetOf0(xP,xD),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4297) ).
cnf(i_0_4188,hypothesis,
( epred2_1(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4188) ).
cnf(i_0_4282,hypothesis,
aElementOf0(xn,szNzAzT0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-dzxfpb8k/input.p',i_0_4282) ).
cnf(c_0_4443,plain,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,X2)))) = sdtlpdtrp0(sdtlpdtrp0(xC,X2),X1)
| sbrdtbr0(X1) != xk
| ~ aSet0(X1)
| ~ epred2_1(X2)
| ~ aSubsetOf0(X1,sdtmndt0(sdtlpdtrp0(xN,X2),szmzizndt0(sdtlpdtrp0(xN,X2)))) ),
i_0_4434 ).
cnf(c_0_4444,hypothesis,
sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))) = xD,
i_0_4289 ).
cnf(c_0_4445,negated_conjecture,
sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) != sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
i_0_4299 ).
cnf(c_0_4446,hypothesis,
( sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)
| sbrdtbr0(X1) != xk
| ~ epred2_1(xn)
| ~ aSubsetOf0(X1,xD)
| ~ aSet0(X1) ),
inference(spm,[status(thm)],[c_0_4443,c_0_4444]) ).
cnf(c_0_4447,hypothesis,
sbrdtbr0(xP) = xk,
i_0_4279 ).
cnf(c_0_4448,hypothesis,
aSet0(xP),
i_0_4271 ).
cnf(c_0_4449,negated_conjecture,
( ~ epred2_1(xn)
| ~ aSubsetOf0(xP,xD) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4445,c_0_4446]),c_0_4447]),c_0_4448])]) ).
cnf(c_0_4450,hypothesis,
aSubsetOf0(xP,xD),
i_0_4297 ).
cnf(c_0_4451,negated_conjecture,
~ epred2_1(xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4449,c_0_4450])]) ).
cnf(c_0_4452,hypothesis,
( epred2_1(X1)
| ~ aElementOf0(X1,szNzAzT0) ),
i_0_4188 ).
cnf(c_0_4453,hypothesis,
aElementOf0(xn,szNzAzT0),
i_0_4282 ).
cnf(c_0_4454,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4451,c_0_4452]),c_0_4453])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM630+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Wed Jul 6 04:29:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 27.76/5.76 # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d45-l8000-e0.15+coop-mzr02:
% 27.76/5.76 # 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: 81; version: 991; iters: 150)
% 27.76/5.76 # Preprocessing time : 2.333 s
% 27.76/5.76
% 27.76/5.76 # Proof found!
% 27.76/5.76 # SZS status Theorem
% 27.76/5.76 # SZS output start CNFRefutation
% See solution above
% 27.76/5.76 # Training examples: 0 positive, 0 negative
% 27.76/5.76
% 27.76/5.76 # -------------------------------------------------
% 27.76/5.76 # User time : 2.202 s
% 27.76/5.76 # System time : 0.145 s
% 27.76/5.76 # Total time : 2.347 s
% 27.76/5.76 # ...preprocessing : 2.333 s
% 27.76/5.76 # ...main loop : 0.014 s
% 27.76/5.76 # Maximum resident set size: 191996 pages
% 27.76/5.76
%------------------------------------------------------------------------------