TSTP Solution File: NUM467+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM467+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:19 EDT 2022
% Result : Theorem 12.00s 2.90s
% Output : CNFRefutation 12.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 15 unt; 0 nHn; 25 RR)
% Number of literals : 50 ( 10 equ; 28 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_18) ).
cnf(i_0_61,hypothesis,
sdtasdt0(xl,esk4_0) = xn,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_61) ).
cnf(i_0_62,hypothesis,
aNaturalNumber0(esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_62) ).
cnf(i_0_59,hypothesis,
aNaturalNumber0(xl),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_59) ).
cnf(i_0_50,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_50) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_6) ).
cnf(i_0_64,hypothesis,
sdtasdt0(xl,esk3_0) = xm,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_64) ).
cnf(i_0_65,hypothesis,
aNaturalNumber0(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_65) ).
cnf(i_0_66,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_66) ).
cnf(i_0_5,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cp7grfe0/input.p',i_0_5) ).
cnf(c_0_77,plain,
( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_18 ).
cnf(c_0_78,hypothesis,
sdtasdt0(xl,esk4_0) = xn,
i_0_61 ).
cnf(c_0_79,hypothesis,
aNaturalNumber0(esk4_0),
i_0_62 ).
cnf(c_0_80,hypothesis,
aNaturalNumber0(xl),
i_0_59 ).
cnf(c_0_81,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_82,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_83,hypothesis,
( sdtpldt0(sdtasdt0(xl,X1),xn) = sdtasdt0(xl,sdtpldt0(X1,esk4_0))
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])]) ).
cnf(c_0_84,hypothesis,
sdtasdt0(xl,esk3_0) = xm,
i_0_64 ).
cnf(c_0_85,hypothesis,
aNaturalNumber0(esk3_0),
i_0_65 ).
cnf(c_0_86,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_81]),c_0_82]) ).
cnf(c_0_87,hypothesis,
sdtasdt0(xl,sdtpldt0(esk3_0,esk4_0)) = sdtpldt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]) ).
cnf(c_0_88,negated_conjecture,
~ doDivides0(xl,sdtpldt0(xm,xn)),
i_0_66 ).
cnf(c_0_89,plain,
~ aNaturalNumber0(sdtpldt0(esk3_0,esk4_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_80])]),c_0_88]) ).
cnf(c_0_90,plain,
( aNaturalNumber0(sdtpldt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_5 ).
cnf(c_0_91,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_79]),c_0_85])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM467+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 : Thu Jul 7 09:04:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 12.00/2.90 # ENIGMATIC: Solved by autoschedule:
% 12.00/2.90 # No SInE strategy applied
% 12.00/2.90 # Trying AutoSched0 for 150 seconds
% 12.00/2.90 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 12.00/2.90 # and selection function PSelectNewComplexAHP.
% 12.00/2.90 #
% 12.00/2.90 # Preprocessing time : 0.024 s
% 12.00/2.90 # Presaturation interreduction done
% 12.00/2.90
% 12.00/2.90 # Proof found!
% 12.00/2.90 # SZS status Theorem
% 12.00/2.90 # SZS output start CNFRefutation
% See solution above
% 12.00/2.90 # Training examples: 0 positive, 0 negative
% 12.00/2.90
% 12.00/2.90 # -------------------------------------------------
% 12.00/2.90 # User time : 0.561 s
% 12.00/2.90 # System time : 0.021 s
% 12.00/2.90 # Total time : 0.582 s
% 12.00/2.90 # Maximum resident set size: 7120 pages
% 12.00/2.90
%------------------------------------------------------------------------------