TSTP Solution File: COM013+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : COM013+1 : 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 : Fri Jul 15 01:06:56 EDT 2022
% Result : Theorem 8.81s 2.45s
% Output : CNFRefutation 8.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 15
% Syntax : Number of clauses : 48 ( 10 unt; 5 nHn; 48 RR)
% Number of literals : 185 ( 2 equ; 140 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 98 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_40,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X4,X2)
| ~ aNormalFormOfIn0(X4,X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_40) ).
cnf(i_0_39,plain,
( aNormalFormOfIn0(X1,X2,X3)
| aReductOfIn0(esk12_3(X2,X3,X1),X1,X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_39) ).
cnf(i_0_42,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aNormalFormOfIn0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_42) ).
cnf(i_0_46,negated_conjecture,
( aNormalFormOfIn0(esk14_1(X1),X1,xR)
| ~ aElement0(X1)
| ~ iLess0(X1,esk13_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_46) ).
cnf(i_0_44,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_44) ).
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-kzu8tdgg/lgb.p',i_0_41) ).
cnf(i_0_45,negated_conjecture,
~ aNormalFormOfIn0(X1,esk13_0,xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_45) ).
cnf(i_0_47,negated_conjecture,
aElement0(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_47) ).
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-kzu8tdgg/lgb.p',i_0_15) ).
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-kzu8tdgg/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-kzu8tdgg/lgb.p',i_0_3) ).
cnf(i_0_12,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X1,X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_12) ).
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-kzu8tdgg/lgb.p',i_0_38) ).
cnf(i_0_43,hypothesis,
isTerminating0(xR),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_43) ).
cnf(i_0_13,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| X1 != X3
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-kzu8tdgg/lgb.p',i_0_13) ).
cnf(c_0_63,plain,
( ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X4,X2)
| ~ aNormalFormOfIn0(X4,X1,X2) ),
i_0_40 ).
cnf(c_0_64,plain,
( aNormalFormOfIn0(X1,X2,X3)
| aReductOfIn0(esk12_3(X2,X3,X1),X1,X3)
| ~ aElement0(X2)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1) ),
i_0_39 ).
cnf(c_0_65,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aNormalFormOfIn0(X1,X2,X3) ),
i_0_42 ).
cnf(c_0_66,plain,
( aNormalFormOfIn0(X1,X2,X3)
| ~ aRewritingSystem0(X3)
| ~ sdtmndtasgtdt0(X2,X3,X1)
| ~ aElement0(X4)
| ~ aElement0(X2)
| ~ aNormalFormOfIn0(X1,X4,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_67,negated_conjecture,
( aNormalFormOfIn0(esk14_1(X1),X1,xR)
| ~ aElement0(X1)
| ~ iLess0(X1,esk13_0) ),
i_0_46 ).
cnf(c_0_68,hypothesis,
aRewritingSystem0(xR),
i_0_44 ).
cnf(c_0_69,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ aNormalFormOfIn0(X3,X1,X2) ),
i_0_41 ).
cnf(c_0_70,negated_conjecture,
~ aNormalFormOfIn0(X1,esk13_0,xR),
i_0_45 ).
cnf(c_0_71,negated_conjecture,
( aNormalFormOfIn0(esk14_1(X1),X2,xR)
| ~ sdtmndtasgtdt0(X2,xR,esk14_1(X1))
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1)
| ~ aElement0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68])]) ).
cnf(c_0_72,negated_conjecture,
aElement0(esk13_0),
i_0_47 ).
cnf(c_0_73,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_74,negated_conjecture,
( sdtmndtasgtdt0(X1,xR,esk14_1(X1))
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_67]),c_0_68])]) ).
cnf(c_0_75,negated_conjecture,
( aElement0(esk14_1(X1))
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_67]),c_0_68])]) ).
cnf(c_0_76,negated_conjecture,
( ~ sdtmndtasgtdt0(esk13_0,xR,esk14_1(X1))
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]) ).
cnf(c_0_77,plain,
( sdtmndtasgtdt0(X1,xR,esk14_1(X2))
| ~ sdtmndtasgtdt0(X1,xR,X2)
| ~ iLess0(X2,esk13_0)
| ~ aElement0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_68])]),c_0_75]) ).
cnf(c_0_78,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aElement0(X1)
| ~ aElement0(X3)
| ~ aRewritingSystem0(X2)
| ~ aReductOfIn0(X3,X1,X2) ),
i_0_7 ).
cnf(c_0_79,plain,
( aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ aReductOfIn0(X1,X2,X3) ),
i_0_3 ).
cnf(c_0_80,negated_conjecture,
( ~ sdtmndtasgtdt0(esk13_0,xR,X1)
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_72])]) ).
cnf(c_0_81,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtplgtdt0(X1,X2,X3) ),
i_0_12 ).
cnf(c_0_82,plain,
( sdtmndtplgtdt0(X1,X2,X3)
| ~ aReductOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_83,plain,
( ~ sdtmndtplgtdt0(esk13_0,xR,X1)
| ~ iLess0(X1,esk13_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_68]),c_0_72])]) ).
cnf(c_0_84,plain,
( sdtmndtplgtdt0(X1,X2,esk12_3(X3,X2,X1))
| aNormalFormOfIn0(X1,X3,X2)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtasgtdt0(X3,X2,X1)
| ~ aElement0(X1)
| ~ aElement0(X3) ),
inference(spm,[status(thm)],[c_0_82,c_0_64]) ).
cnf(c_0_85,plain,
( iLess0(X1,X2)
| ~ aElement0(X1)
| ~ aElement0(X2)
| ~ aRewritingSystem0(X3)
| ~ isTerminating0(X3)
| ~ sdtmndtplgtdt0(X2,X3,X1) ),
i_0_38 ).
cnf(c_0_86,plain,
( aElement0(esk12_3(X1,X2,X3))
| aNormalFormOfIn0(X3,X1,X2)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(spm,[status(thm)],[c_0_79,c_0_64]) ).
cnf(c_0_87,plain,
( aNormalFormOfIn0(esk13_0,X1,xR)
| ~ sdtmndtasgtdt0(X1,xR,esk13_0)
| ~ iLess0(esk12_3(X1,xR,esk13_0),esk13_0)
| ~ aElement0(esk12_3(X1,xR,esk13_0))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_68]),c_0_72])]) ).
cnf(c_0_88,plain,
( iLess0(esk12_3(X1,X2,X3),X3)
| aNormalFormOfIn0(X3,X1,X2)
| ~ isTerminating0(X2)
| ~ aRewritingSystem0(X2)
| ~ sdtmndtasgtdt0(X1,X2,X3)
| ~ aElement0(X3)
| ~ aElement0(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_84]),c_0_86]) ).
cnf(c_0_89,hypothesis,
isTerminating0(xR),
i_0_43 ).
cnf(c_0_90,plain,
( aNormalFormOfIn0(esk13_0,X1,xR)
| ~ sdtmndtasgtdt0(X1,xR,esk13_0)
| ~ aElement0(esk12_3(X1,xR,esk13_0))
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89]),c_0_68]),c_0_72])]) ).
cnf(c_0_91,plain,
( aNormalFormOfIn0(esk13_0,X1,xR)
| ~ sdtmndtasgtdt0(X1,xR,esk13_0)
| ~ aElement0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_86]),c_0_68]),c_0_72])]) ).
cnf(c_0_92,plain,
( sdtmndtasgtdt0(X1,X2,X3)
| X1 != X3
| ~ aElement0(X3)
| ~ aElement0(X1)
| ~ aRewritingSystem0(X2) ),
i_0_13 ).
cnf(c_0_93,negated_conjecture,
~ sdtmndtasgtdt0(esk13_0,xR,esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_91]),c_0_72])]) ).
cnf(c_0_94,plain,
( sdtmndtasgtdt0(X1,X2,X1)
| ~ aRewritingSystem0(X2)
| ~ aElement0(X1) ),
inference(er,[status(thm)],[c_0_92]) ).
cnf(c_0_95,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_68]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : Thu Jun 16 17:27:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.81/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.81/2.45 # No SInE strategy applied
% 8.81/2.45 # Trying AutoSched0 for 150 seconds
% 8.81/2.45 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 8.81/2.45 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.81/2.45 #
% 8.81/2.45 # Preprocessing time : 0.014 s
% 8.81/2.45
% 8.81/2.45 # Proof found!
% 8.81/2.45 # SZS status Theorem
% 8.81/2.45 # SZS output start CNFRefutation
% See solution above
% 8.81/2.45 # Training examples: 0 positive, 0 negative
% 8.81/2.45
% 8.81/2.45 # -------------------------------------------------
% 8.81/2.45 # User time : 0.044 s
% 8.81/2.45 # System time : 0.004 s
% 8.81/2.45 # Total time : 0.048 s
% 8.81/2.45 # Maximum resident set size: 7120 pages
% 8.81/2.45
%------------------------------------------------------------------------------