%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM020+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Fri Jul 15 01:07:00 EDT 2022
% Result : Theorem 8.96s 2.66s
% Output : CNFRefutation 8.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of clauses : 51 ( 25 unt; 0 nHn; 51 RR)
% Number of literals : 161 ( 0 equ; 116 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_42,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aNormalFormOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_42) ).
cnf(i_0_64,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_64) ).
cnf(i_0_44,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_44) ).
cnf(i_0_63,hypothesis,
aElement0(xw),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_63) ).
cnf(i_0_65,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ sdtmndtasgtdt0(xd,xR,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_65) ).
cnf(i_0_50,hypothesis,
( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X2,xa)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_50) ).
cnf(i_0_7,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_7) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_3) ).
cnf(i_0_51,hypothesis,
( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X2,xa)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_51) ).
cnf(i_0_48,hypothesis,
aElement0(xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_48) ).
cnf(i_0_38,plain,
( iLess0(X1,X2)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ isTerminating0(X3)
| ~ sdtmndtplgtdt0(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_38) ).
cnf(i_0_52,hypothesis,
( aElement0(esk14_3(X1,X2,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ sdtmndtasgtdt0(X1,xR,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_52) ).
cnf(i_0_56,hypothesis,
aReductOfIn0(xu,xa,xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_56) ).
cnf(i_0_45,hypothesis,
isTerminating0(xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_45) ).
cnf(i_0_49,hypothesis,
aElement0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_49) ).
cnf(i_0_41,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aNormalFormOfIn0(X3,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_41) ).
cnf(i_0_55,hypothesis,
sdtmndtasgtdt0(xu,xR,xb),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_55) ).
cnf(i_0_57,hypothesis,
aElement0(xu),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_57) ).
cnf(i_0_15,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtasgtdt0(X4,X2,X3)
| ~ sdtmndtasgtdt0(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_15) ).
cnf(i_0_62,hypothesis,
sdtmndtasgtdt0(xu,xR,xw),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gp7vcgyp/lgb.p',i_0_62) ).
cnf(c_0_86,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aNormalFormOfIn0(X1,X2,X3) ),
i_0_42 ).
cnf(c_0_87,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
i_0_64 ).
cnf(c_0_88,hypothesis,
aRewritingSystem0(xR),
i_0_44 ).
cnf(c_0_89,hypothesis,
aElement0(xw),
i_0_63 ).
cnf(c_0_90,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xb,xR,X1)
| ~ sdtmndtasgtdt0(xd,xR,X1) ),
i_0_65 ).
cnf(c_0_91,hypothesis,
( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X3,X1))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X2,xa)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1) ),
i_0_50 ).
cnf(c_0_92,plain,
aElement0(xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),c_0_89])]) ).
cnf(c_0_93,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2) ),
i_0_7 ).
cnf(c_0_94,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3) ),
i_0_3 ).
cnf(c_0_95,negated_conjecture,
( ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(xb,xR,esk14_3(X1,X2,xd))
| ~ sdtmndtasgtdt0(X1,xR,xd)
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ aElement0(esk14_3(X1,X2,xd))
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]) ).
cnf(c_0_96,hypothesis,
( sdtmndtasgtdt0(X1,xR,esk14_3(X2,X1,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X2,xa)
| ~ sdtmndtasgtdt0(X2,xR,X3)
| ~ sdtmndtasgtdt0(X2,xR,X1) ),
i_0_51 ).
cnf(c_0_97,hypothesis,
aElement0(xb),
i_0_48 ).
cnf(c_0_98,plain,
( iLess0(X1,X2)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ isTerminating0(X3)
| ~ sdtmndtplgtdt0(X2,X3,X1) ),
i_0_38 ).
cnf(c_0_99,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_100,hypothesis,
( ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,xd)
| ~ sdtmndtasgtdt0(X1,xR,xb)
| ~ aElement0(esk14_3(X1,xb,xd))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_92])]) ).
cnf(c_0_101,hypothesis,
( aElement0(esk14_3(X1,X2,X3))
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,X3)
| ~ sdtmndtasgtdt0(X1,xR,X2) ),
i_0_52 ).
cnf(c_0_102,plain,
( iLess0(X1,X2)
| ~ isTerminating0(X3)
| ~ aReductOfIn0(X1,X2,X3)
| ~ aRewritingSystem0(X3)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_94]) ).
cnf(c_0_103,hypothesis,
aReductOfIn0(xu,xa,xR),
i_0_56 ).
cnf(c_0_104,hypothesis,
isTerminating0(xR),
i_0_45 ).
cnf(c_0_105,hypothesis,
aElement0(xa),
i_0_49 ).
cnf(c_0_106,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aNormalFormOfIn0(X3,X1,X2) ),
i_0_41 ).
cnf(c_0_107,hypothesis,
( ~ iLess0(X1,xa)
| ~ sdtmndtasgtdt0(X1,xR,xd)
| ~ sdtmndtasgtdt0(X1,xR,xb)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_92]),c_0_97])]) ).
cnf(c_0_108,hypothesis,
iLess0(xu,xa),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_88]),c_0_105])]) ).
cnf(c_0_109,hypothesis,
sdtmndtasgtdt0(xu,xR,xb),
i_0_55 ).
cnf(c_0_110,hypothesis,
aElement0(xu),
i_0_57 ).
cnf(c_0_111,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X4)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtasgtdt0(X4,X2,X3)
| ~ sdtmndtasgtdt0(X1,X2,X4) ),
i_0_15 ).
cnf(c_0_112,hypothesis,
sdtmndtasgtdt0(xw,xR,xd),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_87]),c_0_88]),c_0_89])]) ).
cnf(c_0_113,hypothesis,
~ sdtmndtasgtdt0(xu,xR,xd),
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_110])]) ).
cnf(c_0_114,plain,
( sdtmndtasgtdt0(X1,xR,xd)
| ~ sdtmndtasgtdt0(X1,xR,xw)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_88]),c_0_89]),c_0_92])]) ).
cnf(c_0_115,hypothesis,
sdtmndtasgtdt0(xu,xR,xw),
i_0_62 ).
cnf(c_0_116,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_115]),c_0_110])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : COM020+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 20:09:51 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected complete mode:
% 8.96/2.66 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.96/2.66 # No SInE strategy applied
% 8.96/2.66 # Trying AutoSched0 for 150 seconds
% 8.96/2.66 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.96/2.66 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.96/2.66 #
% 8.96/2.66 # Preprocessing time : 0.026 s
% 8.96/2.66
% 8.96/2.66 # Proof found!
% 8.96/2.66 # SZS status Theorem
% 8.96/2.66 # SZS output start CNFRefutation
% See solution above
% 8.96/2.66 # Training examples: 0 positive, 0 negative
% 8.96/2.66
% 8.96/2.66 # -------------------------------------------------
% 8.96/2.66 # User time : 0.040 s
% 8.96/2.66 # System time : 0.007 s
% 8.96/2.66 # Total time : 0.047 s
% 8.96/2.66 # Maximum resident set size: 7124 pages
% 8.96/2.66
%------------------------------------------------------------------------------