%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEV566+1 : TPTP v9.1.0. Released v9.1.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 : 300s
% DateTime : Tue Apr 1 02:00:58 AM UTC 2025
% Result : Theorem 16.70s 3.47s
% Output : CNFRefutation 16.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 19
% Syntax : Number of clauses : 97 ( 20 unt; 36 nHn; 66 RR)
% Number of literals : 199 ( 20 equ; 66 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 10 ( 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 : 164 ( 24 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_75,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/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-om_tuyxc/input.p',i_0_79) ).
cnf(i_0_77,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_77) ).
cnf(i_0_76,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_76) ).
cnf(i_0_65,plain,
( mem(X1,X2)
| mem(X1,m(X3,X2))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/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-om_tuyxc/input.p',i_0_70) ).
cnf(i_0_66,plain,
( ~ mem(X1,X2)
| ~ mem(X1,m(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_66) ).
cnf(i_0_69,negated_conjecture,
subq(u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))),u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(s(u(e,s(e))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_69) ).
cnf(i_0_64,plain,
~ mem(X1,e),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_64) ).
cnf(i_0_67,plain,
( mem(X1,X2)
| ~ mem(X1,m(X2,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_67) ).
cnf(i_0_72,plain,
( mem(X1,s(X2))
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_72) ).
cnf(i_0_74,plain,
( X1 = X2
| ~ subq(X2,X1)
| ~ subq(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_74) ).
cnf(i_0_80,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_80) ).
cnf(i_0_73,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_73) ).
cnf(i_0_32,plain,
( mem(esk8_1(X1),X1)
| ~ atleast2p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/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-om_tuyxc/input.p',i_0_31) ).
cnf(i_0_30,plain,
( atleast2p(X1)
| subq(X1,p(X2))
| ~ mem(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_30) ).
cnf(i_0_78,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_78) ).
cnf(i_0_71,plain,
( subq(X1,X2)
| ~ mem(X1,p(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-om_tuyxc/input.p',i_0_71) ).
cnf(c_0_100,plain,
( subq(X1,X2)
| ~ mem(esk17_2(X1,X2),X2) ),
i_0_75 ).
cnf(c_0_101,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X2) ),
i_0_79 ).
cnf(c_0_102,plain,
( mem(X1,X2)
| ~ subq(X3,X2)
| ~ mem(X1,X3) ),
i_0_77 ).
cnf(c_0_103,plain,
( subq(X1,X2)
| mem(esk17_2(X1,X2),X1) ),
i_0_76 ).
cnf(c_0_104,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_100,c_0_101]) ).
cnf(c_0_105,plain,
( mem(esk17_2(X1,X2),X3)
| subq(X1,X2)
| ~ subq(X1,X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_106,plain,
subq(X1,u(X1,X2)),
inference(spm,[status(thm)],[c_0_104,c_0_103]) ).
cnf(c_0_107,plain,
( mem(X1,X2)
| mem(X1,m(X3,X2))
| ~ mem(X1,X3) ),
i_0_65 ).
cnf(c_0_108,plain,
( mem(X1,p(X2))
| ~ subq(X1,X2) ),
i_0_70 ).
cnf(c_0_109,plain,
( mem(esk17_2(X1,X2),u(X1,X3))
| subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_110,plain,
( ~ mem(X1,X2)
| ~ mem(X1,m(X3,X2)) ),
i_0_66 ).
cnf(c_0_111,plain,
( mem(X1,m(p(X2),X3))
| mem(X1,X3)
| ~ subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_112,plain,
( mem(esk17_2(X1,X2),X3)
| subq(X1,X2)
| ~ subq(u(X1,X4),X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_109]) ).
cnf(c_0_113,negated_conjecture,
subq(u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))),u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(s(u(e,s(e))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
i_0_69 ).
cnf(c_0_114,plain,
~ mem(X1,e),
i_0_64 ).
cnf(c_0_115,plain,
( subq(m(X1,X2),X3)
| ~ mem(esk17_2(m(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_110,c_0_103]) ).
cnf(c_0_116,plain,
( mem(X1,X2)
| ~ mem(X1,m(X2,X3)) ),
i_0_67 ).
cnf(c_0_117,plain,
( mem(X1,m(p(u(X1,X2)),X3))
| mem(X1,X3) ),
inference(spm,[status(thm)],[c_0_111,c_0_106]) ).
cnf(c_0_118,negated_conjecture,
( mem(esk17_2(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))),X1),u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(s(u(e,s(e))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))))
| subq(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))),X1) ),
inference(spm,[status(thm)],[c_0_112,c_0_113]) ).
cnf(c_0_119,plain,
( mem(X1,s(X2))
| X1 != X2 ),
i_0_72 ).
cnf(c_0_120,plain,
( X1 = X2
| ~ subq(X2,X1)
| ~ subq(X1,X2) ),
i_0_74 ).
cnf(c_0_121,plain,
subq(e,X1),
inference(spm,[status(thm)],[c_0_114,c_0_103]) ).
cnf(c_0_122,plain,
( subq(m(X1,u(X2,X3)),X4)
| ~ mem(esk17_2(m(X1,u(X2,X3)),X4),X2) ),
inference(spm,[status(thm)],[c_0_115,c_0_101]) ).
cnf(c_0_123,plain,
( mem(esk17_2(m(X1,X2),X3),X1)
| subq(m(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_116,c_0_103]) ).
cnf(c_0_124,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ subq(m(p(u(X1,X4)),X2),X3) ),
inference(spm,[status(thm)],[c_0_102,c_0_117]) ).
cnf(c_0_125,plain,
subq(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))),u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(s(u(e,s(e))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))),
inference(spm,[status(thm)],[c_0_100,c_0_118]) ).
cnf(c_0_126,plain,
mem(X1,s(X1)),
inference(er,[status(thm)],[c_0_119]) ).
cnf(c_0_127,plain,
( X1 = e
| ~ subq(X1,e) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_128,plain,
subq(m(X1,u(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_122,c_0_123]) ).
cnf(c_0_129,plain,
( mem(X1,X2)
| mem(X1,X3)
| ~ mem(X1,u(X3,X2)) ),
i_0_80 ).
cnf(c_0_130,plain,
( mem(u(e,s(e)),u(m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(s(u(e,s(e))),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e)))))))),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e)))))))))
| mem(u(e,s(e)),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))) ),
inference(spm,[status(thm)],[c_0_124,c_0_125]) ).
cnf(c_0_131,plain,
( mem(X1,m(s(X1),X2))
| mem(X1,X2) ),
inference(spm,[status(thm)],[c_0_107,c_0_126]) ).
cnf(c_0_132,plain,
m(X1,u(X1,X2)) = e,
inference(spm,[status(thm)],[c_0_127,c_0_128]) ).
cnf(c_0_133,plain,
( mem(u(e,s(e)),m(p(u(u(e,s(e)),u(s(u(e,s(e))),s(s(u(e,s(e))))))),u(s(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(u(u(e,s(e)),s(u(e,s(e))))))))
| mem(u(e,s(e)),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_134,plain,
mem(X1,u(s(X1),X2)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_114]) ).
cnf(c_0_135,plain,
( X1 = X2
| ~ mem(X1,s(X2)) ),
i_0_73 ).
cnf(c_0_136,plain,
( mem(u(e,s(e)),s(u(s(u(e,s(e))),s(u(u(e,s(e)),s(u(e,s(e))))))))
| mem(u(e,s(e)),u(p(s(u(e,s(e)))),s(p(s(u(e,s(e))))))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_133]),c_0_134])]) ).
cnf(c_0_137,plain,
( u(s(u(e,s(e))),s(u(u(e,s(e)),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))))))) ),
inference(spm,[status(thm)],[c_0_135,c_0_136]) ).
cnf(c_0_138,plain,
( mem(esk8_1(X1),X1)
| ~ atleast2p(X1) ),
i_0_32 ).
cnf(c_0_139,plain,
( u(s(u(e,s(e))),s(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)),p(s(u(e,s(e))))) ),
inference(spm,[status(thm)],[c_0_129,c_0_137]) ).
cnf(c_0_140,plain,
( ~ atleast2p(X1)
| ~ subq(X1,p(esk8_1(X1))) ),
i_0_31 ).
cnf(c_0_141,plain,
( esk8_1(s(X1)) = X1
| ~ atleast2p(s(X1)) ),
inference(spm,[status(thm)],[c_0_135,c_0_138]) ).
cnf(c_0_142,plain,
( subq(X1,p(X2))
| ~ subq(esk17_2(X1,p(X2)),X2) ),
inference(spm,[status(thm)],[c_0_100,c_0_108]) ).
cnf(c_0_143,plain,
( esk17_2(s(X1),X2) = X1
| subq(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_135,c_0_103]) ).
cnf(c_0_144,plain,
( mem(X1,X2)
| ~ subq(s(X1),X2) ),
inference(spm,[status(thm)],[c_0_102,c_0_126]) ).
cnf(c_0_145,plain,
( atleast2p(X1)
| subq(X1,p(X2))
| ~ mem(X2,X1) ),
i_0_30 ).
cnf(c_0_146,plain,
( mem(X1,u(X2,X3))
| ~ mem(X1,X3) ),
i_0_78 ).
cnf(c_0_147,plain,
( mem(u(e,s(e)),s(p(s(u(e,s(e))))))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| mem(u(e,s(e)),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_134,c_0_139]) ).
cnf(c_0_148,plain,
( ~ atleast2p(s(X1))
| ~ subq(s(X1),p(X1)) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_149,plain,
( subq(s(X1),p(X2))
| ~ subq(X1,X2) ),
inference(spm,[status(thm)],[c_0_142,c_0_143]) ).
cnf(c_0_150,plain,
subq(X1,X1),
inference(spm,[status(thm)],[c_0_100,c_0_103]) ).
cnf(c_0_151,plain,
( subq(X1,X2)
| ~ mem(X1,p(X2)) ),
i_0_71 ).
cnf(c_0_152,plain,
( mem(X1,X2)
| ~ subq(s(X1),X3)
| ~ subq(X3,X2) ),
inference(spm,[status(thm)],[c_0_102,c_0_144]) ).
cnf(c_0_153,plain,
( atleast2p(s(X1))
| subq(s(X1),p(X1)) ),
inference(spm,[status(thm)],[c_0_145,c_0_126]) ).
cnf(c_0_154,plain,
( subq(X1,u(X2,X3))
| ~ mem(esk17_2(X1,u(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_100,c_0_146]) ).
cnf(c_0_155,plain,
( p(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),p(s(u(e,s(e)))))
| mem(u(e,s(e)),u(e,s(e))) ),
inference(spm,[status(thm)],[c_0_135,c_0_147]) ).
cnf(c_0_156,plain,
~ atleast2p(s(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_150])]) ).
cnf(c_0_157,plain,
( subq(esk17_2(p(X1),X2),X1)
| subq(p(X1),X2) ),
inference(spm,[status(thm)],[c_0_151,c_0_103]) ).
cnf(c_0_158,plain,
( atleast2p(s(X1))
| mem(X1,X2)
| ~ subq(p(X1),X2) ),
inference(spm,[status(thm)],[c_0_152,c_0_153]) ).
cnf(c_0_159,plain,
subq(X1,u(X2,X1)),
inference(spm,[status(thm)],[c_0_154,c_0_103]) ).
cnf(c_0_160,plain,
( p(s(u(e,s(e)))) = u(e,s(e))
| mem(u(e,s(e)),u(e,s(e)))
| subq(u(e,s(e)),s(u(e,s(e)))) ),
inference(spm,[status(thm)],[c_0_151,c_0_155]) ).
cnf(c_0_161,plain,
subq(s(X1),p(X1)),
inference(sr,[status(thm)],[c_0_153,c_0_156]) ).
cnf(c_0_162,plain,
( esk17_2(p(e),X1) = e
| subq(p(e),X1) ),
inference(spm,[status(thm)],[c_0_127,c_0_157]) ).
cnf(c_0_163,plain,
( atleast2p(s(X1))
| mem(X1,p(X1)) ),
inference(spm,[status(thm)],[c_0_158,c_0_150]) ).
cnf(c_0_164,plain,
( mem(X1,X2)
| ~ subq(u(X3,s(X1)),X2) ),
inference(spm,[status(thm)],[c_0_152,c_0_159]) ).
cnf(c_0_165,plain,
( p(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_129,c_0_160]),c_0_114]) ).
cnf(c_0_166,plain,
( p(X1) = s(X1)
| ~ subq(p(X1),s(X1)) ),
inference(spm,[status(thm)],[c_0_120,c_0_161]) ).
cnf(c_0_167,plain,
( subq(p(e),X1)
| ~ mem(e,X1) ),
inference(spm,[status(thm)],[c_0_100,c_0_162]) ).
cnf(c_0_168,plain,
mem(X1,p(X1)),
inference(sr,[status(thm)],[c_0_163,c_0_156]) ).
cnf(c_0_169,plain,
( 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_164,c_0_165]) ).
cnf(c_0_170,plain,
p(e) = s(e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_126])]) ).
cnf(c_0_171,plain,
( 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_168,c_0_169]) ).
cnf(c_0_172,plain,
( subq(X1,e)
| ~ mem(X1,s(e)) ),
inference(spm,[status(thm)],[c_0_151,c_0_170]) ).
cnf(c_0_173,plain,
( 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_129,c_0_171]),c_0_114]) ).
cnf(c_0_174,plain,
~ subq(s(X1),e),
inference(spm,[status(thm)],[c_0_114,c_0_144]) ).
cnf(c_0_175,plain,
( mem(e,s(u(e,s(e))))
| mem(u(e,s(e)),s(e)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_174]) ).
cnf(c_0_176,plain,
u(e,s(e)) = e,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_175]),c_0_135]) ).
cnf(c_0_177,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_176]),c_0_174]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEV566+1 : TPTP v9.1.0. Released v9.1.0.
% 0.06/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 : 300
% 0.12/0.33 % DateTime : Mon Mar 31 12:32:52 EDT 2025
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected SinE mode:
% 0.19/0.45 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.45 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.45 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 16.70/3.47 # ENIGMATIC: Solved by G_E___302_C18_F1_URBAN_S5PRR_RG_S04BN:
% 16.70/3.47 # Version: 2.1pre011
% 16.70/3.47 # Preprocessing time : 0.104 s
% 16.70/3.47
% 16.70/3.47 # Proof found!
% 16.70/3.47 # SZS status Theorem
% 16.70/3.47 # SZS output start CNFRefutation
% See solution above
% 16.70/3.47 # Proof object total steps : 97
% 16.70/3.47 # Proof object clause steps : 78
% 16.70/3.47 # Proof object formula steps : 19
% 16.70/3.47 # Proof object conjectures : 3
% 16.70/3.47 # Proof object clause conjectures : 2
% 16.70/3.47 # Proof object formula conjectures : 1
% 16.70/3.47 # Proof object initial clauses used : 19
% 16.70/3.47 # Proof object initial formulas used : 19
% 16.70/3.47 # Proof object generating inferences : 56
% 16.70/3.47 # Proof object simplifying inferences : 15
% 16.70/3.47 # Training examples: 0 positive, 0 negative
% 16.70/3.47 # Parsed axioms : 78
% 16.70/3.47 # Removed by relevancy pruning/SinE : 0
% 16.70/3.47 # Initial clauses : 78
% 16.70/3.47 # Removed in clause preprocessing : 0
% 16.70/3.47 # Initial clauses in saturation : 78
% 16.70/3.47 # Processed clauses : 3579
% 16.70/3.47 # ...of these trivial : 44
% 16.70/3.47 # ...subsumed : 1668
% 16.70/3.47 # ...remaining for further processing : 1867
% 16.70/3.47 # Other redundant clauses eliminated : 1
% 16.70/3.47 # Clauses deleted for lack of memory : 0
% 16.70/3.47 # Backward-subsumed : 65
% 16.70/3.47 # Backward-rewritten : 280
% 16.70/3.47 # Generated clauses : 45699
% 16.70/3.47 # ...of the previous two non-trivial : 42579
% 16.70/3.47 # Contextual simplify-reflections : 653
% 16.70/3.47 # Paramodulations : 45605
% 16.70/3.47 # Factorizations : 62
% 16.70/3.47 # Equation resolutions : 1
% 16.70/3.47 # Propositional unsat checks : 0
% 16.70/3.47 # Propositional unsat check successes : 0
% 16.70/3.47 # Current number of processed clauses : 1490
% 16.70/3.47 # Positive orientable unit clauses : 111
% 16.70/3.47 # Positive unorientable unit clauses: 0
% 16.70/3.47 # Negative unit clauses : 22
% 16.70/3.47 # Non-unit-clauses : 1357
% 16.70/3.47 # Current number of unprocessed clauses: 28530
% 16.70/3.47 # ...number of literals in the above : 87376
% 16.70/3.47 # Current number of archived formulas : 0
% 16.70/3.47 # Current number of archived clauses : 376
% 16.70/3.47 # Clause-clause subsumption calls (NU) : 410147
% 16.70/3.47 # Rec. Clause-clause subsumption calls : 161712
% 16.70/3.47 # Non-unit clause-clause subsumptions : 1500
% 16.70/3.47 # Unit Clause-clause subsumption calls : 15377
% 16.70/3.47 # Rewrite failures with RHS unbound : 0
% 16.70/3.47 # BW rewrite match attempts : 1162
% 16.70/3.47 # BW rewrite match successes : 17
% 16.70/3.47 # Condensation attempts : 0
% 16.70/3.47 # Condensation successes : 0
% 16.70/3.47 # Termbank termtop insertions : 1963095
% 16.70/3.47
% 16.70/3.47 # -------------------------------------------------
% 16.70/3.47 # User time : 0.961 s
% 16.70/3.47 # System time : 0.021 s
% 16.70/3.47 # Total time : 0.982 s
% 16.70/3.47 # ...preprocessing : 0.104 s
% 16.70/3.47 # ...main loop : 0.878 s
% 16.70/3.47 # Maximum resident set size: 45648 pages
% 16.70/3.47
%------------------------------------------------------------------------------