TSTP Solution File: NUM525+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM525+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:58 EDT 2022
% Result : Theorem 6.86s 2.24s
% Output : CNFRefutation 6.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 19 unt; 6 nHn; 31 RR)
% Number of literals : 71 ( 30 equ; 40 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_54,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_54) ).
cnf(i_0_55,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_55) ).
cnf(i_0_83,hypothesis,
sdtsldt0(xn,xp) = xq,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_83) ).
cnf(i_0_81,hypothesis,
doDivides0(xp,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_81) ).
cnf(i_0_77,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_77) ).
cnf(i_0_75,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_75) ).
cnf(i_0_72,hypothesis,
sz00 != xp,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_72) ).
cnf(i_0_84,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xp,sdtasdt0(xm,xm)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_84) ).
cnf(i_0_79,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_79) ).
cnf(i_0_12,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_12) ).
cnf(i_0_11,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-uzp89hjs/lgb.p',i_0_11) ).
cnf(c_0_96,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
i_0_54 ).
cnf(c_0_97,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_98,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_96]) ).
cnf(c_0_99,hypothesis,
sdtsldt0(xn,xp) = xq,
i_0_83 ).
cnf(c_0_100,hypothesis,
doDivides0(xp,xn),
i_0_81 ).
cnf(c_0_101,hypothesis,
aNaturalNumber0(xn),
i_0_77 ).
cnf(c_0_102,hypothesis,
aNaturalNumber0(xp),
i_0_75 ).
cnf(c_0_103,hypothesis,
sz00 != xp,
i_0_72 ).
cnf(c_0_104,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_97]) ).
cnf(c_0_105,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xp,sdtasdt0(xm,xm)),
i_0_84 ).
cnf(c_0_106,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
i_0_79 ).
cnf(c_0_107,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_12 ).
cnf(c_0_108,hypothesis,
sdtasdt0(xp,xq) = xn,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101]),c_0_102])]),c_0_103]) ).
cnf(c_0_109,hypothesis,
aNaturalNumber0(xq),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_99]),c_0_100]),c_0_101]),c_0_102])]),c_0_103]) ).
cnf(c_0_110,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xn,xn),
inference(rw,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_111,plain,
( sdtasdt0(xp,sdtasdt0(xq,X1)) = sdtasdt0(xn,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_102])]) ).
cnf(c_0_112,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_11 ).
cnf(c_0_113,negated_conjecture,
sdtasdt0(xp,sdtasdt0(xn,xq)) != sdtasdt0(xn,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_109])]) ).
cnf(c_0_114,plain,
( sdtasdt0(xp,sdtasdt0(X1,xq)) = sdtasdt0(xn,X1)
| ~ aNaturalNumber0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_109])]) ).
cnf(c_0_115,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_101])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM525+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 14:56:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.86/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.86/2.24 # No SInE strategy applied
% 6.86/2.24 # Trying AutoSched0 for 150 seconds
% 6.86/2.24 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 6.86/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.86/2.24 #
% 6.86/2.24 # Preprocessing time : 0.020 s
% 6.86/2.24
% 6.86/2.24 # Proof found!
% 6.86/2.24 # SZS status Theorem
% 6.86/2.24 # SZS output start CNFRefutation
% See solution above
% 6.86/2.24 # Training examples: 0 positive, 0 negative
% 6.86/2.24
% 6.86/2.24 # -------------------------------------------------
% 6.86/2.24 # User time : 0.033 s
% 6.86/2.24 # System time : 0.007 s
% 6.86/2.24 # Total time : 0.040 s
% 6.86/2.24 # Maximum resident set size: 7128 pages
% 6.86/2.24
%------------------------------------------------------------------------------