TSTP Solution File: COM017+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:06:59 EDT 2022
% Result : Theorem 7.63s 2.27s
% Output : CNFRefutation 7.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 11 unt; 0 nHn; 27 RR)
% Number of literals : 103 ( 0 equ; 81 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-4 aty)
% Number of variables : 48 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_31,plain,
( sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1))
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_31) ).
cnf(i_0_3,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_3) ).
cnf(i_0_61,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ sdtmndtasgtdt0(xv,xR,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_61) ).
cnf(i_0_46,hypothesis,
isLocallyConfluent0(xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_46) ).
cnf(i_0_44,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_44) ).
cnf(i_0_32,plain,
( sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4))
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_32) ).
cnf(i_0_33,plain,
( aElement0(esk6_4(X1,X2,X3,X4))
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ isLocallyConfluent0(X1)
| ~ aReductOfIn0(X4,X2,X1)
| ~ aReductOfIn0(X3,X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_33) ).
cnf(i_0_56,hypothesis,
aReductOfIn0(xu,xa,xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_56) ).
cnf(i_0_59,hypothesis,
aReductOfIn0(xv,xa,xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_59) ).
cnf(i_0_49,hypothesis,
aElement0(xa),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1fg95det/lgb.p',i_0_49) ).
cnf(c_0_72,plain,
( sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1))
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2) ),
i_0_31 ).
cnf(c_0_73,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3) ),
i_0_3 ).
cnf(c_0_74,negated_conjecture,
( ~ aElement0(X1)
| ~ sdtmndtasgtdt0(xu,xR,X1)
| ~ sdtmndtasgtdt0(xv,xR,X1) ),
i_0_61 ).
cnf(c_0_75,plain,
( sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X4,X1))
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_72,c_0_73]),c_0_73]) ).
cnf(c_0_76,hypothesis,
isLocallyConfluent0(xR),
i_0_46 ).
cnf(c_0_77,hypothesis,
aRewritingSystem0(xR),
i_0_44 ).
cnf(c_0_78,plain,
( sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4))
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2) ),
i_0_32 ).
cnf(c_0_79,negated_conjecture,
( ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(X2,X1,xR)
| ~ sdtmndtasgtdt0(xv,xR,esk6_4(xR,X1,X2,xu))
| ~ aElement0(esk6_4(xR,X1,X2,xu))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_77])]) ).
cnf(c_0_80,plain,
( sdtmndtasgtdt0(X1,X2,esk6_4(X2,X3,X1,X4))
| ~ isLocallyConfluent0(X2)
| ~ aReductOfIn0(X4,X3,X2)
| ~ aReductOfIn0(X1,X3,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X3) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_78,c_0_73]),c_0_73]) ).
cnf(c_0_81,plain,
( aElement0(esk6_4(X1,X2,X3,X4))
| ~ aElement0(X4)
| ~ aElement0(X3)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X1)
| ~ isLocallyConfluent0(X1)
| ~ aReductOfIn0(X4,X2,X1)
| ~ aReductOfIn0(X3,X2,X1) ),
i_0_33 ).
cnf(c_0_82,plain,
( ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(esk6_4(xR,X1,xv,xu))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_76]),c_0_77])]) ).
cnf(c_0_83,plain,
( aElement0(esk6_4(X1,X2,X3,X4))
| ~ isLocallyConfluent0(X1)
| ~ aReductOfIn0(X4,X2,X1)
| ~ aReductOfIn0(X3,X2,X1)
| ~ aRewritingSystem0(X1)
| ~ aElement0(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_81,c_0_73]),c_0_73]) ).
cnf(c_0_84,plain,
( ~ aReductOfIn0(xu,X1,xR)
| ~ aReductOfIn0(xv,X1,xR)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_76]),c_0_77])]) ).
cnf(c_0_85,hypothesis,
aReductOfIn0(xu,xa,xR),
i_0_56 ).
cnf(c_0_86,hypothesis,
aReductOfIn0(xv,xa,xR),
i_0_59 ).
cnf(c_0_87,hypothesis,
aElement0(xa),
i_0_49 ).
cnf(c_0_88,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86]),c_0_87])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 Jun 16 18:19:13 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.63/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.63/2.27 # No SInE strategy applied
% 7.63/2.27 # Trying AutoSched0 for 150 seconds
% 7.63/2.27 # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.63/2.27 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.63/2.27 #
% 7.63/2.27 # Preprocessing time : 0.024 s
% 7.63/2.27
% 7.63/2.27 # Proof found!
% 7.63/2.27 # SZS status Theorem
% 7.63/2.27 # SZS output start CNFRefutation
% See solution above
% 7.63/2.27 # Training examples: 0 positive, 0 negative
% 7.63/2.27
% 7.63/2.27 # -------------------------------------------------
% 7.63/2.27 # User time : 0.032 s
% 7.63/2.27 # System time : 0.006 s
% 7.63/2.27 # Total time : 0.038 s
% 7.63/2.27 # Maximum resident set size: 7124 pages
% 7.63/2.27
%------------------------------------------------------------------------------