%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM523+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n016.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:56 EDT 2022
% Result : Theorem 7.37s 2.37s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 23 ( 13 unt; 2 nHn; 23 RR)
% Number of literals : 52 ( 4 equ; 30 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 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-5zrhr2bc/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-5zrhr2bc/lgb.p',i_0_6) ).
cnf(i_0_85,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_85) ).
cnf(i_0_75,hypothesis,
aNaturalNumber0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_75) ).
cnf(i_0_76,hypothesis,
aNaturalNumber0(xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_76) ).
cnf(i_0_90,negated_conjecture,
( ~ doDivides0(xp,xn)
| ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_90) ).
cnf(i_0_71,plain,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X1)
| ~ doDivides0(X1,sdtasdt0(X3,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_71) ).
cnf(i_0_86,hypothesis,
isPrime0(xp),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_86) ).
cnf(i_0_77,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5zrhr2bc/lgb.p',i_0_77) ).
cnf(c_0_100,plain,
( doDivides0(X1,X2)
| X2 != sdtasdt0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3) ),
i_0_50 ).
cnf(c_0_101,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_102,plain,
( doDivides0(X1,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_100]),c_0_101]) ).
cnf(c_0_103,hypothesis,
sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
i_0_85 ).
cnf(c_0_104,hypothesis,
aNaturalNumber0(xp),
i_0_75 ).
cnf(c_0_105,hypothesis,
( doDivides0(xp,sdtasdt0(xn,xn))
| ~ aNaturalNumber0(sdtasdt0(xm,xm)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104])]) ).
cnf(c_0_106,hypothesis,
aNaturalNumber0(xm),
i_0_76 ).
cnf(c_0_107,negated_conjecture,
( ~ doDivides0(xp,xn)
| ~ doDivides0(xp,sdtasdt0(xn,xn)) ),
i_0_90 ).
cnf(c_0_108,plain,
doDivides0(xp,sdtasdt0(xn,xn)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_101]),c_0_106])]) ).
cnf(c_0_109,plain,
( doDivides0(X1,X2)
| doDivides0(X1,X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X3)
| ~ isPrime0(X1)
| ~ doDivides0(X1,sdtasdt0(X3,X2)) ),
i_0_71 ).
cnf(c_0_110,hypothesis,
isPrime0(xp),
i_0_86 ).
cnf(c_0_111,hypothesis,
aNaturalNumber0(xn),
i_0_77 ).
cnf(c_0_112,negated_conjecture,
~ doDivides0(xp,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_107,c_0_108])]) ).
cnf(c_0_113,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_109,c_0_108]),c_0_110]),c_0_111]),c_0_104])]),c_0_112]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM523+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 : n016.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 : Tue Jul 5 02:27:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.37/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.37/2.37 # No SInE strategy applied
% 7.37/2.37 # Trying AutoSched0 for 150 seconds
% 7.37/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S068N
% 7.37/2.37 # and selection function PSelectNewComplexAHP.
% 7.37/2.37 #
% 7.37/2.37 # Preprocessing time : 0.024 s
% 7.37/2.37 # Presaturation interreduction done
% 7.37/2.37
% 7.37/2.37 # Proof found!
% 7.37/2.37 # SZS status Theorem
% 7.37/2.37 # SZS output start CNFRefutation
% See solution above
% 7.37/2.37 # Training examples: 0 positive, 0 negative
% 7.37/2.37
% 7.37/2.37 # -------------------------------------------------
% 7.37/2.37 # User time : 0.033 s
% 7.37/2.37 # System time : 0.004 s
% 7.37/2.37 # Total time : 0.037 s
% 7.37/2.37 # Maximum resident set size: 7128 pages
% 7.37/2.37
%------------------------------------------------------------------------------