TSTP Solution File: NUM468+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM468+1 : 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:36:19 EDT 2022
% Result : Theorem 8.44s 2.32s
% Output : CNFRefutation 8.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 16 unt; 7 nHn; 26 RR)
% Number of literals : 66 ( 22 equ; 39 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; 4 con; 0-2 aty)
% Number of variables : 25 ( 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-qhywdnxn/input.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-qhywdnxn/input.p',i_0_55) ).
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/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_18) ).
cnf(i_0_62,negated_conjecture,
sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) != sdtpldt0(xm,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_62) ).
cnf(i_0_60,hypothesis,
doDivides0(xl,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_60) ).
cnf(i_0_59,hypothesis,
aNaturalNumber0(xl),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_59) ).
cnf(i_0_57,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_57) ).
cnf(i_0_63,negated_conjecture,
sz00 != xl,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_63) ).
cnf(i_0_61,hypothesis,
doDivides0(xl,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_61) ).
cnf(i_0_58,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qhywdnxn/input.p',i_0_58) ).
cnf(c_0_74,plain,
( X1 = sz00
| X2 = sdtasdt0(X1,X3)
| X3 != sdtsldt0(X2,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ doDivides0(X1,X2) ),
i_0_54 ).
cnf(c_0_75,plain,
( X1 = sz00
| aNaturalNumber0(X2)
| X2 != sdtsldt0(X3,X1)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| ~ doDivides0(X1,X3) ),
i_0_55 ).
cnf(c_0_76,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_77,plain,
( sdtasdt0(X1,sdtsldt0(X2,X1)) = X2
| X1 = sz00
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_78,plain,
( X1 = sz00
| aNaturalNumber0(sdtsldt0(X2,X1))
| ~ doDivides0(X1,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_79,negated_conjecture,
sdtasdt0(xl,sdtpldt0(sdtsldt0(xm,xl),sdtsldt0(xn,xl))) != sdtpldt0(xm,xn),
i_0_62 ).
cnf(c_0_80,plain,
( sdtasdt0(X1,sdtpldt0(X2,sdtsldt0(X3,X1))) = sdtpldt0(sdtasdt0(X1,X2),X3)
| X1 = sz00
| ~ doDivides0(X1,X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_81,hypothesis,
doDivides0(xl,xn),
i_0_60 ).
cnf(c_0_82,hypothesis,
aNaturalNumber0(xl),
i_0_59 ).
cnf(c_0_83,hypothesis,
aNaturalNumber0(xn),
i_0_57 ).
cnf(c_0_84,negated_conjecture,
sz00 != xl,
i_0_63 ).
cnf(c_0_85,negated_conjecture,
( sdtpldt0(sdtasdt0(xl,sdtsldt0(xm,xl)),xn) != sdtpldt0(xm,xn)
| ~ aNaturalNumber0(sdtsldt0(xm,xl)) ),
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_79,c_0_80]),c_0_81]),c_0_82]),c_0_83])]),c_0_84]) ).
cnf(c_0_86,hypothesis,
doDivides0(xl,xm),
i_0_61 ).
cnf(c_0_87,hypothesis,
aNaturalNumber0(xm),
i_0_58 ).
cnf(c_0_88,plain,
~ aNaturalNumber0(sdtsldt0(xm,xl)),
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_85,c_0_77]),c_0_86]),c_0_87]),c_0_82])]),c_0_84]) ).
cnf(c_0_89,plain,
$false,
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_88,c_0_78]),c_0_86]),c_0_87]),c_0_82])]),c_0_84]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM468+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 : 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 18:45:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 8.44/2.32 # ENIGMATIC: Solved by autoschedule:
% 8.44/2.32 # No SInE strategy applied
% 8.44/2.32 # Trying AutoSched0 for 150 seconds
% 8.44/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S080N
% 8.44/2.32 # and selection function SelectCQIArNXTEqFirst.
% 8.44/2.32 #
% 8.44/2.32 # Preprocessing time : 0.024 s
% 8.44/2.32 # Presaturation interreduction done
% 8.44/2.32
% 8.44/2.32 # Proof found!
% 8.44/2.32 # SZS status Theorem
% 8.44/2.32 # SZS output start CNFRefutation
% See solution above
% 8.44/2.32 # Training examples: 0 positive, 0 negative
% 8.44/2.32
% 8.44/2.32 # -------------------------------------------------
% 8.44/2.32 # User time : 0.183 s
% 8.44/2.32 # System time : 0.013 s
% 8.44/2.32 # Total time : 0.196 s
% 8.44/2.32 # Maximum resident set size: 7120 pages
% 8.44/2.32
%------------------------------------------------------------------------------