%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : KRS081+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : Sun Jul 17 02:55:33 EDT 2022
% Result : Unsatisfiable 7.49s 2.16s
% Output : CNFRefutation 7.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 22
% Syntax : Number of clauses : 70 ( 4 unt; 16 nHn; 70 RR)
% Number of literals : 261 ( 115 equ; 116 neg)
% Maximal clause size : 16 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 87 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_38,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| X4 = X1
| X4 = X3
| X5 = X2
| X5 = X1
| X5 = X3
| X5 = X4
| ~ cUnsatisfiable(X6)
| ~ rr(X6,X2)
| ~ rr(X6,X1)
| ~ rr(X6,X3)
| ~ rr(X6,X4)
| ~ rr(X6,X5) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_38) ).
cnf(i_0_34,plain,
( rr(X1,esk9_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_34) ).
cnf(i_0_37,plain,
( rr(X1,esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_37) ).
cnf(i_0_43,plain,
( rr(X1,esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_43) ).
cnf(i_0_45,plain,
( rr(X1,esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_45) ).
cnf(i_0_61,plain,
( ~ cp2(X1)
| ~ cp5(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_61) ).
cnf(i_0_44,plain,
( cp5(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_44) ).
cnf(i_0_50,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_50) ).
cnf(i_0_65,plain,
( ~ cp4(X1)
| ~ cp5(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_65) ).
cnf(i_0_33,plain,
( cp2(esk9_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_33) ).
cnf(i_0_57,plain,
( ~ cp1(X1)
| ~ cp5(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_57) ).
cnf(i_0_49,plain,
( cp4(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_49) ).
cnf(i_0_36,plain,
( cp1(esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_36) ).
cnf(i_0_62,plain,
( ~ cp2(X1)
| ~ cp4(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_62) ).
cnf(i_0_59,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_59) ).
cnf(i_0_60,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_60) ).
cnf(i_0_41,plain,
( cp3(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_41) ).
cnf(i_0_58,plain,
( ~ cp1(X1)
| ~ cp4(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_58) ).
cnf(i_0_64,plain,
( ~ cp3(X1)
| ~ cp4(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_64) ).
cnf(i_0_56,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_56) ).
cnf(i_0_63,plain,
( ~ cp3(X1)
| ~ cp5(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_63) ).
cnf(i_0_66,plain,
cUnsatisfiable(i2003_11_14_17_19_24236),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-m6hlefii/lgb.p',i_0_66) ).
cnf(c_0_89,plain,
( X1 = X2
| X3 = X2
| X3 = X1
| X4 = X2
| X4 = X1
| X4 = X3
| X5 = X2
| X5 = X1
| X5 = X3
| X5 = X4
| ~ cUnsatisfiable(X6)
| ~ rr(X6,X2)
| ~ rr(X6,X1)
| ~ rr(X6,X3)
| ~ rr(X6,X4)
| ~ rr(X6,X5) ),
i_0_38 ).
cnf(c_0_90,plain,
( rr(X1,esk9_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_34 ).
cnf(c_0_91,plain,
( X1 = esk9_1(X2)
| X3 = esk9_1(X2)
| X4 = esk9_1(X2)
| X5 = esk9_1(X2)
| X1 = X3
| X1 = X4
| X1 = X5
| X3 = X4
| X3 = X5
| X4 = X5
| ~ cUnsatisfiable(X2)
| ~ rr(X2,X5)
| ~ rr(X2,X4)
| ~ rr(X2,X3)
| ~ rr(X2,X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_92,plain,
( rr(X1,esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_37 ).
cnf(c_0_93,plain,
( esk9_1(X1) = esk8_1(X1)
| X2 = esk8_1(X1)
| X3 = esk8_1(X1)
| X4 = esk8_1(X1)
| X2 = esk9_1(X1)
| X3 = esk9_1(X1)
| X4 = esk9_1(X1)
| X3 = X2
| X4 = X2
| X4 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2)
| ~ rr(X1,X3)
| ~ rr(X1,X4) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_94,plain,
( rr(X1,esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_43 ).
cnf(c_0_95,plain,
( esk9_1(X1) = esk6_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| X2 = esk6_1(X1)
| X3 = esk6_1(X1)
| X2 = esk9_1(X1)
| X3 = esk9_1(X1)
| X2 = esk8_1(X1)
| X3 = esk8_1(X1)
| X2 = X3
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X3)
| ~ rr(X1,X2) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_96,plain,
( rr(X1,esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_45 ).
cnf(c_0_97,plain,
( ~ cp2(X1)
| ~ cp5(X1) ),
i_0_61 ).
cnf(c_0_98,plain,
( cp5(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_44 ).
cnf(c_0_99,plain,
( esk5_1(X1) = esk8_1(X1)
| esk5_1(X1) = esk9_1(X1)
| esk5_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk6_1(X1)
| X2 = esk5_1(X1)
| X2 = esk8_1(X1)
| X2 = esk9_1(X1)
| X2 = esk6_1(X1)
| ~ cUnsatisfiable(X1)
| ~ rr(X1,X2) ),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_100,plain,
( rr(X1,esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_50 ).
cnf(c_0_101,plain,
( ~ cp4(X1)
| ~ cp5(X1) ),
i_0_65 ).
cnf(c_0_102,plain,
( ~ cp2(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_103,plain,
( esk3_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk5_1(X1) = esk3_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| esk5_1(X1) = esk6_1(X1)
| esk5_1(X1) = esk9_1(X1)
| esk5_1(X1) = esk8_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,plain,
( cp2(esk9_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_33 ).
cnf(c_0_105,plain,
( ~ cp1(X1)
| ~ cp5(X1) ),
i_0_57 ).
cnf(c_0_106,plain,
( ~ cp4(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_101,c_0_98]) ).
cnf(c_0_107,plain,
( esk5_1(X1) = esk8_1(X1)
| esk5_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk5_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk9_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]) ).
cnf(c_0_108,plain,
( cp4(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_49 ).
cnf(c_0_109,plain,
( ~ cp1(esk5_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_98]) ).
cnf(c_0_110,plain,
( esk3_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| esk5_1(X1) = esk6_1(X1)
| esk5_1(X1) = esk8_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_108]) ).
cnf(c_0_111,plain,
( cp1(esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_36 ).
cnf(c_0_112,plain,
( ~ cp2(X1)
| ~ cp4(X1) ),
i_0_62 ).
cnf(c_0_113,plain,
( esk5_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk9_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk6_1(X1)
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).
cnf(c_0_114,plain,
( ~ cp4(esk9_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_104]) ).
cnf(c_0_115,plain,
( esk3_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk3_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk8_1(X1)
| cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_98,c_0_113]) ).
cnf(c_0_116,plain,
( ~ cp1(X1)
| ~ cp2(X1) ),
i_0_59 ).
cnf(c_0_117,plain,
( ~ cp2(X1)
| ~ cp3(X1) ),
i_0_60 ).
cnf(c_0_118,plain,
( esk9_1(X1) = esk8_1(X1)
| esk8_1(X1) = esk6_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk3_1(X1) = esk6_1(X1)
| cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_108]) ).
cnf(c_0_119,plain,
( ~ cp2(esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_116,c_0_111]) ).
cnf(c_0_120,plain,
( ~ cp3(esk9_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_117,c_0_104]) ).
cnf(c_0_121,plain,
( esk3_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk9_1(X1) = esk6_1(X1)
| esk8_1(X1) = esk6_1(X1)
| cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_118]),c_0_119]) ).
cnf(c_0_122,plain,
( cp3(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
i_0_41 ).
cnf(c_0_123,plain,
( ~ cp1(X1)
| ~ cp4(X1) ),
i_0_58 ).
cnf(c_0_124,plain,
( ~ cp3(X1)
| ~ cp4(X1) ),
i_0_64 ).
cnf(c_0_125,plain,
( esk8_1(X1) = esk6_1(X1)
| esk3_1(X1) = esk8_1(X1)
| esk3_1(X1) = esk6_1(X1)
| cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122]) ).
cnf(c_0_126,plain,
( ~ cp4(esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_111]) ).
cnf(c_0_127,plain,
( ~ cp1(X1)
| ~ cp3(X1) ),
i_0_56 ).
cnf(c_0_128,plain,
( ~ cp3(esk3_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_124,c_0_108]) ).
cnf(c_0_129,plain,
( esk3_1(X1) = esk6_1(X1)
| esk8_1(X1) = esk6_1(X1)
| cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_125]),c_0_126]) ).
cnf(c_0_130,plain,
( ~ cp3(esk8_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(spm,[status(thm)],[c_0_127,c_0_111]) ).
cnf(c_0_131,plain,
( esk8_1(X1) = esk6_1(X1)
| cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_122]) ).
cnf(c_0_132,plain,
( ~ cp3(X1)
| ~ cp5(X1) ),
i_0_63 ).
cnf(c_0_133,plain,
( cp5(esk6_1(X1))
| ~ cUnsatisfiable(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_122]) ).
cnf(c_0_134,plain,
cUnsatisfiable(i2003_11_14_17_19_24236),
i_0_66 ).
cnf(c_0_135,plain,
~ cUnsatisfiable(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_122]) ).
cnf(c_0_136,plain,
$false,
inference(sr,[status(thm)],[c_0_134,c_0_135]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : KRS081+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Tue Jun 7 11:42:37 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.13/0.37 # ENIGMATIC: Selected complete mode:
% 7.49/2.16 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.49/2.16 # No SInE strategy applied
% 7.49/2.16 # Trying AutoSched0 for 150 seconds
% 7.49/2.16 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.49/2.16 # and selection function SelectNewComplexAHP.
% 7.49/2.16 #
% 7.49/2.16 # Preprocessing time : 0.015 s
% 7.49/2.16 # Presaturation interreduction done
% 7.49/2.16
% 7.49/2.16 # Proof found!
% 7.49/2.16 # SZS status Theorem
% 7.49/2.16 # SZS output start CNFRefutation
% See solution above
% 7.49/2.16 # Training examples: 0 positive, 0 negative
% 7.49/2.16
% 7.49/2.16 # -------------------------------------------------
% 7.49/2.16 # User time : 0.044 s
% 7.49/2.16 # System time : 0.004 s
% 7.49/2.16 # Total time : 0.048 s
% 7.49/2.16 # Maximum resident set size: 7124 pages
% 7.49/2.16
%------------------------------------------------------------------------------