TSTP Solution File: NUM479+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM479+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:27 EDT 2022
% Result : Theorem 8.42s 2.37s
% Output : CNFRefutation 8.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 23 unt; 2 nHn; 35 RR)
% Number of literals : 66 ( 28 equ; 38 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_22,plain,
( X1 = X2
| X3 = sz00
| sdtasdt0(X3,X1) != sdtasdt0(X3,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_22) ).
cnf(i_0_63,hypothesis,
sdtasdt0(xl,esk3_0) = xm,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_63) ).
cnf(i_0_61,hypothesis,
aNaturalNumber0(xl),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_61) ).
cnf(i_0_64,hypothesis,
aNaturalNumber0(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_64) ).
cnf(i_0_65,hypothesis,
sz00 != xl,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_65) ).
cnf(i_0_67,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_67) ).
cnf(i_0_68,negated_conjecture,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) = sdtasdt0(xn,xm),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_68) ).
cnf(i_0_70,negated_conjecture,
sdtasdt0(xl,sdtsldt0(xm,xl)) = xm,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_70) ).
cnf(i_0_71,negated_conjecture,
aNaturalNumber0(sdtsldt0(xm,xl)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_71) ).
cnf(i_0_11,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_11) ).
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-6rwbg5hb/lgb.p',i_0_12) ).
cnf(i_0_6,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_6) ).
cnf(i_0_66,hypothesis,
aNaturalNumber0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6rwbg5hb/lgb.p',i_0_66) ).
cnf(c_0_85,plain,
( X1 = X2
| X3 = sz00
| sdtasdt0(X3,X1) != sdtasdt0(X3,X2)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3) ),
i_0_22 ).
cnf(c_0_86,hypothesis,
sdtasdt0(xl,esk3_0) = xm,
i_0_63 ).
cnf(c_0_87,hypothesis,
aNaturalNumber0(xl),
i_0_61 ).
cnf(c_0_88,hypothesis,
aNaturalNumber0(esk3_0),
i_0_64 ).
cnf(c_0_89,hypothesis,
sz00 != xl,
i_0_65 ).
cnf(c_0_90,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)),
i_0_67 ).
cnf(c_0_91,negated_conjecture,
sdtasdt0(xl,sdtsldt0(sdtasdt0(xn,xm),xl)) = sdtasdt0(xn,xm),
i_0_68 ).
cnf(c_0_92,hypothesis,
( X1 = esk3_0
| sdtasdt0(xl,X1) != xm
| ~ aNaturalNumber0(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]),c_0_88])]),c_0_89]) ).
cnf(c_0_93,negated_conjecture,
sdtasdt0(xl,sdtsldt0(xm,xl)) = xm,
i_0_70 ).
cnf(c_0_94,negated_conjecture,
aNaturalNumber0(sdtsldt0(xm,xl)),
i_0_71 ).
cnf(c_0_95,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),sdtsldt0(xm,xl)) != sdtasdt0(xn,xm),
inference(rw,[status(thm)],[c_0_90,c_0_91]) ).
cnf(c_0_96,negated_conjecture,
sdtsldt0(xm,xl) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_94])]) ).
cnf(c_0_97,negated_conjecture,
sdtasdt0(sdtasdt0(xl,xn),esk3_0) != sdtasdt0(xn,xm),
inference(rw,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_98,plain,
( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_11 ).
cnf(c_0_99,plain,
( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_12 ).
cnf(c_0_100,plain,
( aNaturalNumber0(sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
i_0_6 ).
cnf(c_0_101,plain,
( sdtasdt0(esk3_0,sdtasdt0(xl,xn)) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtasdt0(xl,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_88])]) ).
cnf(c_0_102,plain,
( sdtasdt0(X1,sdtasdt0(X2,X3)) = sdtasdt0(X3,sdtasdt0(X1,X2))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X2)
| ~ aNaturalNumber0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]) ).
cnf(c_0_103,hypothesis,
aNaturalNumber0(xn),
i_0_66 ).
cnf(c_0_104,plain,
( sdtasdt0(xn,sdtasdt0(esk3_0,xl)) != sdtasdt0(xn,xm)
| ~ aNaturalNumber0(sdtasdt0(xl,xn)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),c_0_87]),c_0_88])]) ).
cnf(c_0_105,plain,
~ aNaturalNumber0(sdtasdt0(xl,xn)),
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_98]),c_0_86]),c_0_87]),c_0_88])]) ).
cnf(c_0_106,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_100]),c_0_103]),c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM479+2 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n025.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jul 7 23:07:01 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 8.42/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.42/2.37 # No SInE strategy applied
% 8.42/2.37 # Trying AutoSched0 for 150 seconds
% 8.42/2.37 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S080N
% 8.42/2.37 # and selection function SelectCQIArNXTEqFirst.
% 8.42/2.37 #
% 8.42/2.37 # Preprocessing time : 0.023 s
% 8.42/2.37 # Presaturation interreduction done
% 8.42/2.37
% 8.42/2.37 # Proof found!
% 8.42/2.37 # SZS status Theorem
% 8.42/2.37 # SZS output start CNFRefutation
% See solution above
% 8.42/2.37 # Training examples: 0 positive, 0 negative
% 8.42/2.37
% 8.42/2.37 # -------------------------------------------------
% 8.42/2.37 # User time : 0.063 s
% 8.42/2.37 # System time : 0.012 s
% 8.42/2.37 # Total time : 0.075 s
% 8.42/2.37 # Maximum resident set size: 7124 pages
% 8.42/2.37
%------------------------------------------------------------------------------