TSTP Solution File: NUM501+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM501+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:42 EDT 2022
% Result : Theorem 8.69s 2.37s
% Output : CNFRefutation 8.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 14 unt; 0 nHn; 26 RR)
% Number of literals : 60 ( 6 equ; 37 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 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-7q7mjq04/lgb.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-7q7mjq04/lgb.p',i_0_6) ).
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-7q7mjq04/lgb.p',i_0_56) ).
cnf(i_0_232,hypothesis,
doDivides0(xr,xk),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_232) ).
cnf(i_0_222,hypothesis,
aNaturalNumber0(xk),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_222) ).
cnf(i_0_235,hypothesis,
aNaturalNumber0(xr),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_235) ).
cnf(i_0_236,negated_conjecture,
~ doDivides0(xr,sdtasdt0(xn,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_236) ).
cnf(i_0_221,hypothesis,
sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_221) ).
cnf(i_0_11,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_11) ).
cnf(i_0_71,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7q7mjq04/lgb.p',i_0_71) ).
cnf(c_0_247,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_248,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_249,plain,
( doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ doDivides0(X3,X2)
| ~ doDivides0(X1,X3) ),
i_0_56 ).
cnf(c_0_250,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_247]),c_0_248]) ).
cnf(c_0_251,plain,
( doDivides0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_249,c_0_250]),c_0_248]) ).
cnf(c_0_252,hypothesis,
doDivides0(xr,xk),
i_0_232 ).
cnf(c_0_253,hypothesis,
aNaturalNumber0(xk),
i_0_222 ).
cnf(c_0_254,hypothesis,
aNaturalNumber0(xr),
i_0_235 ).
cnf(c_0_255,negated_conjecture,
~ doDivides0(xr,sdtasdt0(xn,xm)),
i_0_236 ).
cnf(c_0_256,hypothesis,
sdtasdt0(xp,xk) = sdtasdt0(xn,xm),
i_0_221 ).
cnf(c_0_257,hypothesis,
( doDivides0(xr,sdtasdt0(xk,X1))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_253]),c_0_254])]) ).
cnf(c_0_258,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_11 ).
cnf(c_0_259,negated_conjecture,
~ doDivides0(xr,sdtasdt0(xp,xk)),
inference(rw,[status(thm)],[c_0_255,c_0_256]) ).
cnf(c_0_260,plain,
( doDivides0(xr,sdtasdt0(X1,xk))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_253])]) ).
cnf(c_0_261,hypothesis,
aNaturalNumber0(xp),
i_0_71 ).
cnf(c_0_262,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_259,c_0_260]),c_0_261])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM501+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 00:25:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.69/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.69/2.37 # No SInE strategy applied
% 8.69/2.37 # Trying AutoSched0 for 150 seconds
% 8.69/2.37 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.69/2.37 # and selection function SelectNewComplexAHP.
% 8.69/2.37 #
% 8.69/2.37 # Preprocessing time : 0.023 s
% 8.69/2.37 # Presaturation interreduction done
% 8.69/2.37
% 8.69/2.37 # Proof found!
% 8.69/2.37 # SZS status Theorem
% 8.69/2.37 # SZS output start CNFRefutation
% See solution above
% 8.69/2.37 # Training examples: 0 positive, 0 negative
% 8.69/2.37
% 8.69/2.37 # -------------------------------------------------
% 8.69/2.37 # User time : 0.060 s
% 8.69/2.37 # System time : 0.006 s
% 8.69/2.37 # Total time : 0.066 s
% 8.69/2.37 # Maximum resident set size: 7132 pages
% 8.69/2.37
%------------------------------------------------------------------------------