%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEV563+1 : TPTP v9.1.0. Released v9.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 : 300s
% DateTime : Tue Apr 1 02:00:58 AM UTC 2025
% Result : Theorem 17.34s 3.97s
% Output : CNFRefutation 17.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 16
% Syntax : Number of clauses : 83 ( 14 unt; 40 nHn; 62 RR)
% Number of literals : 218 ( 39 equ; 50 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 121 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_75,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_75) ).
cnf(i_0_79,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_79) ).
cnf(i_0_65,plain,
( mem(X1,X2)
| mem(X1,m(X3,X2))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_65) ).
cnf(i_0_70,plain,
( mem(X1,p(X2))
| ~ subq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_70) ).
cnf(i_0_76,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_76) ).
cnf(i_0_77,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_77) ).
cnf(i_0_69,negated_conjecture,
subq(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))),u(u(s(u(u(e,s(e)),s(u(e,s(e))))),s(s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_69) ).
cnf(i_0_80,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_80) ).
cnf(i_0_78,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_78) ).
cnf(i_0_73,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_73) ).
cnf(i_0_72,plain,
( mem(X1,s(X2))
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_72) ).
cnf(i_0_71,plain,
( subq(X1,X2)
| ~ mem(X1,p(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_71) ).
cnf(i_0_30,plain,
( atleast2p(X1)
| subq(X1,p(X2))
| ~ mem(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_30) ).
cnf(i_0_32,plain,
( mem(esk8_1(X1),X1)
| ~ atleast2p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_32) ).
cnf(i_0_31,plain,
( ~ atleast2p(X1)
| ~ subq(X1,p(esk8_1(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_31) ).
cnf(i_0_64,plain,
~ mem(X1,e),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ml5c00ji/input.p',i_0_64) ).
cnf(c_0_97,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
i_0_75 ).
cnf(c_0_98,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X2) ),
i_0_79 ).
cnf(c_0_99,plain,
( mem(X1,X2)
| mem(X1,m(X3,X2))
| ~ mem(X1,X3) ),
i_0_65 ).
cnf(c_0_100,plain,
( mem(X1,p(X2))
| ~ subq(X1,X2) ),
i_0_70 ).
cnf(c_0_101,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_102,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
i_0_76 ).
cnf(c_0_103,plain,
( mem(X1,m(p(X2),X3))
| mem(X1,X3)
| ~ subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_99,c_0_100]) ).
cnf(c_0_104,plain,
subq(X1,u(X1,X2)),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_105,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
i_0_77 ).
cnf(c_0_106,plain,
( mem(X1,m(p(u(X1,X2)),X3))
| mem(X1,X3) ),
inference(spm,[status(thm)],[c_0_103,c_0_104]) ).
cnf(c_0_107,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ subq(m(p(u(X1,X4)),X2),X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_108,negated_conjecture,
subq(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))),u(u(s(u(u(e,s(e)),s(u(e,s(e))))),s(s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))))),
i_0_69 ).
cnf(c_0_109,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
i_0_80 ).
cnf(c_0_110,negated_conjecture,
( mem(u(e,s(e)),u(u(s(u(u(e,s(e)),s(u(e,s(e))))),s(s(s(u(e,s(e)))))),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))))
| mem(u(e,s(e)),u(u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,plain,
( mem(u(e,s(e)),u(u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))),s(u(s(u(e,s(e))),s(s(u(e,s(e))))))))
| mem(u(e,s(e)),u(s(u(u(e,s(e)),s(u(e,s(e))))),s(s(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))))) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_112,plain,
( mem(u(e,s(e)),u(s(u(u(e,s(e)),s(u(e,s(e))))),s(s(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))))
| mem(u(e,s(e)),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(s(u(e,s(e))),s(s(u(e,s(e))))))) ),
inference(spm,[status(thm)],[c_0_109,c_0_111]) ).
cnf(c_0_113,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
i_0_78 ).
cnf(c_0_114,plain,
( mem(esk17_2(X1,X2),X3)
| subq(X1,X2)
| ~ subq(X1,X3) ),
inference(spm,[status(thm)],[c_0_105,c_0_102]) ).
cnf(c_0_115,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
i_0_73 ).
cnf(c_0_116,plain,
( mem(u(e,s(e)),s(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))))
| mem(u(e,s(e)),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(u(e,s(e)),s(u(e,s(e))))))
| mem(u(e,s(e)),s(s(s(u(e,s(e)))))) ),
inference(spm,[status(thm)],[c_0_109,c_0_112]) ).
cnf(c_0_117,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_97,c_0_113]) ).
cnf(c_0_118,plain,
( mem(esk17_2(X1,X2),u(X1,X3))
| subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_114,c_0_104]) ).
cnf(c_0_119,plain,
( u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))) = u(e,s(e))
| mem(u(e,s(e)),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(u(e,s(e)),s(u(e,s(e))))))
| mem(u(e,s(e)),s(s(s(u(e,s(e)))))) ),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
cnf(c_0_120,plain,
subq(X1,u(X2,u(X1,X3))),
inference(spm,[status(thm)],[c_0_117,c_0_118]) ).
cnf(c_0_121,plain,
( u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e)))))) = u(e,s(e))
| mem(u(e,s(e)),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(u(e,s(e)),s(u(e,s(e))))))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| mem(u(e,s(e)),s(p(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e))))) ),
inference(spm,[status(thm)],[c_0_109,c_0_119]) ).
cnf(c_0_122,plain,
( mem(u(e,s(e)),s(u(s(u(e,s(e))),s(s(u(e,s(e)))))))
| mem(u(e,s(e)),s(u(u(e,s(e)),s(u(e,s(e))))))
| mem(u(e,s(e)),s(p(s(u(e,s(e))))))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_123,plain,
( u(s(u(e,s(e))),s(s(u(e,s(e))))) = u(e,s(e))
| mem(u(e,s(e)),s(u(u(e,s(e)),s(u(e,s(e))))))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| mem(u(e,s(e)),s(p(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_115,c_0_122]) ).
cnf(c_0_124,plain,
( u(s(u(e,s(e))),s(s(u(e,s(e))))) = u(e,s(e))
| u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),s(p(s(u(e,s(e))))))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_115,c_0_123]) ).
cnf(c_0_125,plain,
( mem(X1,s(X2))
| X1 != X2 ),
i_0_72 ).
cnf(c_0_126,plain,
( u(s(u(e,s(e))),s(s(u(e,s(e))))) = u(e,s(e))
| u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| p(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_115,c_0_124]) ).
cnf(c_0_127,plain,
mem(X1,s(X1)),
inference(er,[status(thm)],[c_0_125]) ).
cnf(c_0_128,plain,
( subq(X1,X2)
| ~ mem(X1,p(X2)) ),
i_0_71 ).
cnf(c_0_129,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| p(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_104,c_0_126]) ).
cnf(c_0_130,plain,
( mem(X1,X2)
| ~ subq(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_127]) ).
cnf(c_0_131,plain,
( atleast2p(X1)
| subq(X1,p(X2))
| ~ mem(X2,X1) ),
i_0_30 ).
cnf(c_0_132,plain,
( mem(esk8_1(X1),X1)
| ~ atleast2p(X1) ),
i_0_32 ).
cnf(c_0_133,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| p(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),s(s(s(u(e,s(e))))))
| subq(s(u(e,s(e))),u(e,s(e)))
| subq(u(e,s(e)),s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_128,c_0_129]) ).
cnf(c_0_134,plain,
( mem(X1,X2)
| ~ subq(s(X1),X3)
| ~ subq(X3,X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_130]) ).
cnf(c_0_135,plain,
( atleast2p(s(X1))
| subq(s(X1),p(X1)) ),
inference(spm,[status(thm)],[c_0_131,c_0_127]) ).
cnf(c_0_136,plain,
( ~ atleast2p(X1)
| ~ subq(X1,p(esk8_1(X1))) ),
i_0_31 ).
cnf(c_0_137,plain,
( esk8_1(s(X1)) = X1
| ~ atleast2p(s(X1)) ),
inference(spm,[status(thm)],[c_0_115,c_0_132]) ).
cnf(c_0_138,plain,
( subq(X1,p(X2))
| ~ subq(esk17_2(X1,p(X2)),X2) ),
inference(spm,[status(thm)],[c_0_97,c_0_100]) ).
cnf(c_0_139,plain,
( esk17_2(s(X1),X2) = X1
| subq(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_115,c_0_102]) ).
cnf(c_0_140,plain,
subq(X1,u(X2,X1)),
inference(spm,[status(thm)],[c_0_117,c_0_102]) ).
cnf(c_0_141,plain,
( u(u(e,s(e)),s(u(e,s(e)))) = u(e,s(e))
| p(s(u(e,s(e)))) = u(e,s(e))
| s(s(u(e,s(e)))) = u(e,s(e))
| subq(u(e,s(e)),s(u(e,s(e))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_115,c_0_133]) ).
cnf(c_0_142,plain,
( atleast2p(s(X1))
| mem(X1,X2)
| ~ subq(p(X1),X2) ),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_143,plain,
subq(X1,X1),
inference(spm,[status(thm)],[c_0_97,c_0_102]) ).
cnf(c_0_144,plain,
( ~ atleast2p(s(X1))
| ~ subq(s(X1),p(X1)) ),
inference(spm,[status(thm)],[c_0_136,c_0_137]) ).
cnf(c_0_145,plain,
( subq(s(X1),p(X2))
| ~ subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_146,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ subq(s(X1),u(X2,X3)) ),
inference(spm,[status(thm)],[c_0_109,c_0_130]) ).
cnf(c_0_147,plain,
( s(s(u(e,s(e)))) = u(e,s(e))
| p(s(u(e,s(e)))) = u(e,s(e))
| subq(u(e,s(e)),s(u(e,s(e))))
| subq(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_148,plain,
~ mem(X1,e),
i_0_64 ).
cnf(c_0_149,plain,
( atleast2p(s(X1))
| mem(X1,p(X1)) ),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_150,plain,
~ atleast2p(s(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_143])]) ).
cnf(c_0_151,plain,
( mem(X1,X2)
| ~ subq(u(X3,s(X1)),X2) ),
inference(spm,[status(thm)],[c_0_134,c_0_140]) ).
cnf(c_0_152,plain,
( p(s(u(e,s(e)))) = u(e,s(e))
| s(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),s(e))
| subq(u(e,s(e)),s(u(e,s(e)))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]) ).
cnf(c_0_153,plain,
mem(X1,p(X1)),
inference(sr,[status(thm)],[c_0_149,c_0_150]) ).
cnf(c_0_154,plain,
( s(s(u(e,s(e)))) = u(e,s(e))
| p(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),s(e))
| mem(e,s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_151,c_0_152]) ).
cnf(c_0_155,plain,
( s(s(u(e,s(e)))) = u(e,s(e))
| mem(s(u(e,s(e))),u(e,s(e)))
| mem(e,s(u(e,s(e))))
| mem(u(e,s(e)),s(e)) ),
inference(spm,[status(thm)],[c_0_153,c_0_154]) ).
cnf(c_0_156,plain,
( s(s(u(e,s(e)))) = u(e,s(e))
| mem(s(u(e,s(e))),s(e))
| mem(u(e,s(e)),s(e))
| mem(e,s(u(e,s(e)))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_155]),c_0_148]) ).
cnf(c_0_157,plain,
( s(s(u(e,s(e)))) = u(e,s(e))
| s(u(e,s(e))) = e
| mem(e,s(u(e,s(e))))
| mem(u(e,s(e)),s(e)) ),
inference(spm,[status(thm)],[c_0_115,c_0_156]) ).
cnf(c_0_158,plain,
( s(s(u(e,s(e)))) = u(e,s(e))
| s(u(e,s(e))) = e
| u(e,s(e)) = e ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_157]),c_0_115]) ).
cnf(c_0_159,plain,
( s(u(e,s(e))) = e
| u(e,s(e)) = e
| mem(s(u(e,s(e))),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_127,c_0_158]) ).
cnf(c_0_160,plain,
( s(u(e,s(e))) = e
| u(e,s(e)) = e ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_159]),c_0_148]),c_0_115]) ).
cnf(c_0_161,plain,
u(e,s(e)) = e,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_160]),c_0_148]) ).
cnf(c_0_162,plain,
~ subq(s(X1),e),
inference(spm,[status(thm)],[c_0_148,c_0_130]) ).
cnf(c_0_163,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_161]),c_0_162]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SEV563+1 : TPTP v9.1.0. Released v9.1.0.
% 0.05/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.09/0.30 % Computer : n007.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Mar 31 12:24:50 EDT 2025
% 0.09/0.31 % CPUTime :
% 0.15/0.41 # ENIGMATIC: Selected SinE mode:
% 0.15/0.41 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.41 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.15/0.41 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.15/0.41 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 17.34/3.97 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 17.34/3.97 # Version: 2.1pre011
% 17.34/3.97 # Preprocessing time : 0.101 s
% 17.34/3.97
% 17.34/3.97 # Proof found!
% 17.34/3.97 # SZS status Theorem
% 17.34/3.97 # SZS output start CNFRefutation
% See solution above
% 17.34/3.97 # Proof object total steps : 83
% 17.34/3.97 # Proof object clause steps : 67
% 17.34/3.97 # Proof object formula steps : 16
% 17.34/3.97 # Proof object conjectures : 3
% 17.34/3.97 # Proof object clause conjectures : 2
% 17.34/3.97 # Proof object formula conjectures : 1
% 17.34/3.97 # Proof object initial clauses used : 16
% 17.34/3.97 # Proof object initial formulas used : 16
% 17.34/3.97 # Proof object generating inferences : 49
% 17.34/3.97 # Proof object simplifying inferences : 11
% 17.34/3.97 # Training examples: 0 positive, 0 negative
% 17.34/3.97 # Parsed axioms : 78
% 17.34/3.97 # Removed by relevancy pruning/SinE : 0
% 17.34/3.97 # Initial clauses : 78
% 17.34/3.97 # Removed in clause preprocessing : 0
% 17.34/3.97 # Initial clauses in saturation : 78
% 17.34/3.97 # Processed clauses : 2539
% 17.34/3.97 # ...of these trivial : 11
% 17.34/3.97 # ...subsumed : 1067
% 17.34/3.97 # ...remaining for further processing : 1461
% 17.34/3.97 # Other redundant clauses eliminated : 1
% 17.34/3.97 # Clauses deleted for lack of memory : 0
% 17.34/3.97 # Backward-subsumed : 72
% 17.34/3.97 # Backward-rewritten : 292
% 17.34/3.97 # Generated clauses : 22582
% 17.34/3.97 # ...of the previous two non-trivial : 19899
% 17.34/3.97 # Contextual simplify-reflections : 448
% 17.34/3.97 # Paramodulations : 22491
% 17.34/3.97 # Factorizations : 54
% 17.34/3.97 # Equation resolutions : 1
% 17.34/3.97 # Propositional unsat checks : 0
% 17.34/3.97 # Propositional unsat check successes : 0
% 17.34/3.97 # Current number of processed clauses : 1060
% 17.34/3.97 # Positive orientable unit clauses : 99
% 17.34/3.97 # Positive unorientable unit clauses: 0
% 17.34/3.97 # Negative unit clauses : 21
% 17.34/3.97 # Non-unit-clauses : 940
% 17.34/3.97 # Current number of unprocessed clauses: 11325
% 17.34/3.97 # ...number of literals in the above : 33523
% 17.34/3.97 # Current number of archived formulas : 0
% 17.34/3.97 # Current number of archived clauses : 400
% 17.34/3.97 # Clause-clause subsumption calls (NU) : 336118
% 17.34/3.97 # Rec. Clause-clause subsumption calls : 107343
% 17.34/3.97 # Non-unit clause-clause subsumptions : 1027
% 17.34/3.97 # Unit Clause-clause subsumption calls : 18910
% 17.34/3.97 # Rewrite failures with RHS unbound : 0
% 17.34/3.97 # BW rewrite match attempts : 1338
% 17.34/3.97 # BW rewrite match successes : 16
% 17.34/3.97 # Condensation attempts : 0
% 17.34/3.97 # Condensation successes : 0
% 17.34/3.97 # Termbank termtop insertions : 718343
% 17.34/3.97
% 17.34/3.97 # -------------------------------------------------
% 17.34/3.97 # User time : 0.908 s
% 17.34/3.97 # System time : 0.016 s
% 17.34/3.97 # Total time : 0.924 s
% 17.34/3.97 # ...preprocessing : 0.101 s
% 17.34/3.97 # ...main loop : 0.823 s
% 17.34/3.97 # Maximum resident set size: 24340 pages
% 17.34/3.97
%------------------------------------------------------------------------------