%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS009-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:00:33 PM UTC 2026
% Result : Satisfiable 0.08s 0.36s
% Output : Saturation 0.08s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_50ERROR: Could not build tree for root c_0_69ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_43,plain,
( ~ r(X1,X2)
| t(X1,X2) ),
c_0_40,
[final] ).
cnf(c_0_44,axiom,
( r(X1,u9r2(X1))
| r1most(X1) ),
clause_37,
[final] ).
cnf(c_0_45,axiom,
( r(X1,u9r1(X1))
| r1most(X1) ),
clause_36,
[final] ).
cnf(c_0_46,plain,
( ~ s(X1,X2)
| t(X1,X2) ),
c_0_41,
[final] ).
cnf(c_0_47,axiom,
( s(X1,u10r2(X1))
| s1most(X1) ),
clause_41,
[final] ).
cnf(c_0_48,axiom,
( s(X1,u10r1(X1))
| s1most(X1) ),
clause_40,
[final] ).
cnf(c_0_61,plain,
( ~ t(X1,X4)
| ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X4)
| equalish(X2,X4)
| equalish(X2,X3)
| t3least(X1) ),
c_0_42,
[final] ).
cnf(c_0_62,plain,
( t(X1,u9r2(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]),
[final] ).
cnf(c_0_63,plain,
( t(X1,u9r1(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_45]),
[final] ).
cnf(c_0_64,plain,
( t(X1,u10r2(X1))
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]),
[final] ).
cnf(c_0_65,plain,
( t(X1,u10r1(X1))
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_48]),
[final] ).
cnf(c_0_69,plain,
( ~ c(X1)
| a(X1) ),
c_0_50,
[final] ).
cnf(c_0_72,plain,
( ~ p(X1,X3)
| ~ p(X1,X2)
| equalish(X2,X3)
| p2least(X1) ),
c_0_51,
[final] ).
cnf(c_0_73,axiom,
( p(X1,u3r1(X1))
| p1most(X1) ),
clause_12,
[final] ).
cnf(c_0_74,plain,
( ~ d(X1)
| a(X1) ),
c_0_52,
[final] ).
cnf(c_0_77,plain,
( ~ p(X3,X2)
| ~ p(X3,X1)
| ~ p1most(X3)
| equalish(X1,X2) ),
c_0_53,
[final] ).
cnf(c_0_78,plain,
( ~ p2least(X1)
| p(X1,u1r1(X1)) ),
c_0_54,
[final] ).
cnf(c_0_81,plain,
( ~ r(X2,X1)
| c(X1) ),
c_0_55,
[final] ).
cnf(c_0_83,plain,
( ~ t(X2,X1)
| ~ e(X2)
| a(X1) ),
c_0_56,
[final] ).
cnf(c_0_84,plain,
( ~ t3least(X1)
| t(X1,u8r2(X1)) ),
c_0_57,
[final] ).
cnf(c_0_85,plain,
( ~ e(X1)
| t3least(X1) ),
c_0_58,
[final] ).
cnf(c_0_86,plain,
( ~ t3least(X1)
| t(X1,u8r1(X1)) ),
c_0_59,
[final] ).
cnf(c_0_87,plain,
( ~ t3least(X1)
| t(X1,u8r3(X1)) ),
c_0_60,
[final] ).
cnf(c_0_89,plain,
( ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X2)
| equalish(X3,u9r2(X1))
| equalish(X2,u9r2(X1))
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_62]),
[final] ).
cnf(c_0_90,plain,
( ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X2)
| equalish(X3,u9r1(X1))
| equalish(X2,u9r1(X1))
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_63]),
[final] ).
cnf(c_0_91,plain,
( ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X2)
| equalish(X3,u10r2(X1))
| equalish(X2,u10r2(X1))
| s1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_64]),
[final] ).
cnf(c_0_92,plain,
( ~ t(X1,X3)
| ~ t(X1,X2)
| equalish(X3,X2)
| equalish(X3,u10r1(X1))
| equalish(X2,u10r1(X1))
| s1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_61,c_0_65]),
[final] ).
cnf(c_0_93,plain,
( ~ equalish(u9r2(X1),u9r1(X1))
| r1most(X1) ),
c_0_66,
[final] ).
cnf(c_0_94,plain,
( ~ equalish(u10r2(X1),u10r1(X1))
| s1most(X1) ),
c_0_67,
[final] ).
cnf(c_0_96,plain,
( ~ p2least(X1)
| c(X1) ),
c_0_70,
[final] ).
cnf(c_0_97,plain,
( ~ equalish(u3r2(X1),u3r1(X1))
| p1most(X1) ),
c_0_71,
[final] ).
cnf(c_0_99,axiom,
( p(X1,u3r2(X1))
| p1most(X1) ),
clause_13,
[final] ).
cnf(c_0_101,plain,
( ~ p1most(X1)
| d(X1) ),
c_0_75,
[final] ).
cnf(c_0_102,plain,
( ~ equalish(u1r2(X1),u1r1(X1))
| ~ p2least(X1) ),
c_0_76,
[final] ).
cnf(c_0_104,plain,
( ~ p2least(X1)
| p(X1,u1r2(X1)) ),
c_0_79,
[final] ).
cnf(c_0_105,plain,
( ~ c(X1)
| p2least(X1) ),
c_0_80,
[final] ).
cnf(c_0_106,plain,
( c(u9r2(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_44]),
[final] ).
cnf(c_0_107,plain,
( c(u9r1(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_81,c_0_45]),
[final] ).
cnf(c_0_109,plain,
( ~ a(X1)
| d(X1)
| c(X1) ),
c_0_82,
[final] ).
cnf(c_0_110,plain,
( ~ e(X1)
| a(u8r2(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),
[final] ).
cnf(c_0_111,plain,
( ~ e(X1)
| a(u8r1(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_86]),c_0_85]),
[final] ).
cnf(c_0_112,plain,
( ~ e(X1)
| a(u8r3(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_87]),c_0_85]),
[final] ).
cnf(c_0_113,plain,
( ~ s(X2,X1)
| d(X1) ),
c_0_88,
[final] ).
cnf(c_0_114,plain,
( ~ t(X1,X2)
| equalish(X2,u9r2(X1))
| equalish(X2,u10r2(X1))
| equalish(u10r2(X1),u9r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_64]),
[final] ).
cnf(c_0_115,plain,
( ~ t(X1,X2)
| equalish(X2,u9r2(X1))
| equalish(X2,u10r1(X1))
| equalish(u10r1(X1),u9r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_65]),
[final] ).
cnf(c_0_116,plain,
( ~ t(X1,X2)
| equalish(X2,u9r1(X1))
| equalish(X2,u10r2(X1))
| equalish(u10r2(X1),u9r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_64]),
[final] ).
cnf(c_0_117,plain,
( ~ t(X1,X2)
| equalish(X2,u9r1(X1))
| equalish(X2,u10r1(X1))
| equalish(u10r1(X1),u9r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_90,c_0_65]),
[final] ).
cnf(c_0_118,plain,
( ~ t(X1,X2)
| equalish(X2,u10r2(X1))
| equalish(X2,u9r2(X1))
| equalish(u9r2(X1),u10r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_62]),
[final] ).
cnf(c_0_119,plain,
( ~ t(X1,X2)
| equalish(X2,u10r2(X1))
| equalish(X2,u9r1(X1))
| equalish(u9r1(X1),u10r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_63]),
[final] ).
cnf(c_0_120,plain,
( ~ t(X1,X2)
| equalish(X2,u10r1(X1))
| equalish(X2,u9r2(X1))
| equalish(u9r2(X1),u10r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_62]),
[final] ).
cnf(c_0_121,plain,
( ~ t(X1,X2)
| equalish(X2,u10r1(X1))
| equalish(X2,u9r1(X1))
| equalish(u9r1(X1),u10r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_92,c_0_63]),
[final] ).
cnf(c_0_122,plain,
( ~ t(X1,X2)
| equalish(X2,u9r1(X1))
| equalish(X2,u9r2(X1))
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_62]),c_0_93]),
[final] ).
cnf(c_0_124,plain,
( ~ t(X1,X2)
| equalish(X2,u10r1(X1))
| equalish(X2,u10r2(X1))
| s1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_64]),c_0_94]),
[final] ).
cnf(c_0_127,plain,
( p2least(X1)
| p1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99]),
[final] ).
cnf(c_0_129,plain,
( ~ p2least(X1)
| ~ p1most(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),
[final] ).
cnf(c_0_130,plain,
( p2least(u9r2(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_106]),
[final] ).
cnf(c_0_131,plain,
( p2least(u9r1(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_105,c_0_107]),
[final] ).
cnf(c_0_134,plain,
( ~ d(X1)
| p1most(X1) ),
c_0_108,
[final] ).
cnf(c_0_135,plain,
( ~ e(X1)
| c(u8r2(X1))
| d(u8r2(X1)) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]),
[final] ).
cnf(c_0_136,plain,
( ~ e(X1)
| c(u8r1(X1))
| d(u8r1(X1)) ),
inference(spm,[status(thm)],[c_0_109,c_0_111]),
[final] ).
cnf(c_0_137,plain,
( ~ e(X1)
| c(u8r3(X1))
| d(u8r3(X1)) ),
inference(spm,[status(thm)],[c_0_109,c_0_112]),
[final] ).
cnf(c_0_141,plain,
( d(u10r1(X1))
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_48]),
[final] ).
cnf(c_0_142,plain,
( d(u10r2(X1))
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_113,c_0_47]),
[final] ).
cnf(c_0_145,negated_conjecture,
e(exist),
clause_1,
[final] ).
cnf(c_0_146,plain,
( equalish(u10r2(X1),u9r2(X1))
| equalish(u9r1(X1),u10r2(X1))
| equalish(u9r1(X1),u9r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_114,c_0_63]),
[final] ).
cnf(c_0_147,plain,
( equalish(u10r1(X1),u9r2(X1))
| equalish(u9r1(X1),u10r1(X1))
| equalish(u9r1(X1),u9r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_115,c_0_63]),
[final] ).
cnf(c_0_148,plain,
( equalish(u10r1(X1),u9r2(X1))
| equalish(u10r2(X1),u9r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_64]),c_0_94]),
[final] ).
cnf(c_0_149,plain,
( equalish(u10r2(X1),u9r1(X1))
| equalish(u9r2(X1),u10r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_62]),c_0_93]),
[final] ).
cnf(c_0_150,plain,
( equalish(u10r1(X1),u9r1(X1))
| equalish(u9r2(X1),u10r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_62]),c_0_93]),
[final] ).
cnf(c_0_151,plain,
( equalish(u10r1(X1),u9r1(X1))
| equalish(u10r2(X1),u9r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_64]),c_0_94]),
[final] ).
cnf(c_0_152,plain,
( equalish(u9r2(X1),u10r2(X1))
| equalish(u10r1(X1),u9r2(X1))
| equalish(u10r1(X1),u10r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_118,c_0_65]),
[final] ).
cnf(c_0_153,plain,
( equalish(u9r1(X1),u10r2(X1))
| equalish(u9r2(X1),u10r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_62]),c_0_93]),
[final] ).
cnf(c_0_154,plain,
( equalish(u9r1(X1),u10r2(X1))
| equalish(u10r1(X1),u9r1(X1))
| equalish(u10r1(X1),u10r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_119,c_0_65]),
[final] ).
cnf(c_0_155,plain,
( equalish(u9r2(X1),u10r1(X1))
| equalish(u10r2(X1),u9r2(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_64]),c_0_94]),
[final] ).
cnf(c_0_156,plain,
( equalish(u9r1(X1),u10r1(X1))
| equalish(u9r2(X1),u10r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_62]),c_0_93]),
[final] ).
cnf(c_0_157,plain,
( equalish(u9r1(X1),u10r1(X1))
| equalish(u10r2(X1),u9r1(X1))
| s1most(X1)
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_64]),c_0_94]),
[final] ).
cnf(c_0_158,plain,
( equalish(u9r2(X1),u9r2(X1))
| r1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_122]),c_0_62]),
[final] ).
cnf(c_0_159,plain,
( equalish(u9r1(X1),u9r1(X1))
| r1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_63]),
[final] ).
cnf(c_0_160,plain,
( equalish(u10r2(X1),u10r2(X1))
| s1most(X1)
| t3least(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_124]),c_0_64]),
[final] ).
cnf(c_0_161,plain,
( equalish(u10r1(X1),u10r1(X1))
| s1most(X1)
| t3least(X1) ),
inference(spm,[status(thm)],[c_0_125,c_0_65]),
[final] ).
cnf(c_0_162,plain,
( ~ s1most(X1)
| ~ r1most(X1)
| ~ t3least(X1)
| e(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128]),
[final] ).
cnf(c_0_163,plain,
( ~ p1most(u9r2(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]),
[final] ).
cnf(c_0_164,plain,
( ~ p1most(u9r1(X1))
| r1most(X1) ),
inference(spm,[status(thm)],[c_0_129,c_0_131]),
[final] ).
cnf(c_0_165,plain,
( ~ r(X3,X2)
| ~ r(X3,X1)
| ~ r1most(X3)
| equalish(X1,X2) ),
c_0_132,
[final] ).
cnf(c_0_166,plain,
( ~ s(X3,X2)
| ~ s(X3,X1)
| ~ s1most(X3)
| equalish(X1,X2) ),
c_0_133,
[final] ).
cnf(c_0_167,plain,
( ~ e(X1)
| c(u8r2(X1))
| p1most(u8r2(X1)) ),
inference(spm,[status(thm)],[c_0_134,c_0_135]),
[final] ).
cnf(c_0_168,plain,
( ~ e(X1)
| c(u8r1(X1))
| p1most(u8r1(X1)) ),
inference(spm,[status(thm)],[c_0_134,c_0_136]),
[final] ).
cnf(c_0_169,plain,
( ~ e(X1)
| c(u8r3(X1))
| p1most(u8r3(X1)) ),
inference(spm,[status(thm)],[c_0_134,c_0_137]),
[final] ).
cnf(c_0_170,plain,
( ~ equalish(u8r3(X1),u8r1(X1))
| ~ t3least(X1) ),
c_0_138,
[final] ).
cnf(c_0_171,plain,
( ~ equalish(u8r3(X1),u8r2(X1))
| ~ t3least(X1) ),
c_0_139,
[final] ).
cnf(c_0_172,plain,
( ~ equalish(u8r2(X1),u8r1(X1))
| ~ t3least(X1) ),
c_0_140,
[final] ).
cnf(c_0_173,plain,
( p1most(u10r1(X1))
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_134,c_0_141]),
[final] ).
cnf(c_0_174,plain,
( p1most(u10r2(X1))
| s1most(X1) ),
inference(spm,[status(thm)],[c_0_134,c_0_142]),
[final] ).
cnf(c_0_175,plain,
( ~ e(X1)
| r1most(X1) ),
c_0_143,
[final] ).
cnf(c_0_176,plain,
( ~ e(X1)
| s1most(X1) ),
c_0_144,
[final] ).
cnf(c_0_177,negated_conjecture,
t3least(exist),
inference(spm,[status(thm)],[c_0_85,c_0_145]),
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KRS009-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Sun Sep 20 22:50:06 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.34 Running first-order theorem proving
% 0.08/0.34 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Version: 3.5.1
% 0.08/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.36 % Starting sh5l with 300s (1) cores
% 0.08/0.36 % sh5l with pid 1028242 completed with status 1
% 0.08/0.36 % Result found by sh5l
% 0.08/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.36 % Starting sh5l with 300s (1) cores
% 0.08/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.36 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.36 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.08/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.36 % SubtermCWHack with pid 1028251 completed with status 1
% 0.08/0.36 % Result found by SubtermCWHack
% 0.08/0.36 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.08/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.36 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.08/0.36 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.36 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.36 % Starting sh5l with 300s (1) cores
% 0.08/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.36 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.36 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.08/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.36 % Preprocessing time : 0.001 s
% 0.08/0.36
% 0.08/0.36 % No proof found!
% 0.08/0.36 % SZS status Satisfiable
% 0.08/0.36 % SZS output start Saturation
% See solution above
% 0.08/0.36 % Parsed axioms : 41
% 0.08/0.36 % Removed by relevancy pruning/SinE : 0
% 0.08/0.36 % Initial clauses : 41
% 0.08/0.36 % Removed in clause preprocessing : 0
% 0.08/0.36 % Initial clauses in saturation : 41
% 0.08/0.36 % Processed clauses : 139
% 0.08/0.36 % ...of these trivial : 0
% 0.08/0.36 % ...subsumed : 30
% 0.08/0.36 % ...remaining for further processing : 109
% 0.08/0.36 % Other redundant clauses eliminated : 0
% 0.08/0.36 % Clauses deleted for lack of memory : 0
% 0.08/0.36 % Backward-subsumed : 13
% 0.08/0.36 % Backward-rewritten : 0
% 0.08/0.36 % Generated clauses : 165
% 0.08/0.36 % ...of the previous two non-redundant : 104
% 0.08/0.36 % ...aggressively subsumed : 0
% 0.08/0.36 % Contextual simplify-reflections : 18
% 0.08/0.36 % Paramodulations : 165
% 0.08/0.36 % Factorizations : 0
% 0.08/0.36 % NegExts : 0
% 0.08/0.36 % Equation resolutions : 0
% 0.08/0.36 % Disequality decompositions : 0
% 0.08/0.36 % Total rewrite steps : 0
% 0.08/0.36 % ...of those cached : 0
% 0.08/0.36 % Propositional unsat checks : 0
% 0.08/0.36 % Propositional check models : 0
% 0.08/0.36 % Propositional check unsatisfiable : 0
% 0.08/0.36 % Propositional clauses : 0
% 0.08/0.36 % Propositional clauses after purity: 0
% 0.08/0.36 % Propositional unsat core size : 0
% 0.08/0.36 % Propositional preprocessing time : 0.000
% 0.08/0.36 % Propositional encoding time : 0.000
% 0.08/0.36 % Propositional solver time : 0.000
% 0.08/0.36 % Success case prop preproc time : 0.000
% 0.08/0.36 % Success case prop encoding time : 0.000
% 0.08/0.36 % Success case prop solver time : 0.000
% 0.08/0.36 % Current number of processed clauses : 96
% 0.08/0.36 % Positive orientable unit clauses : 2
% 0.08/0.36 % Positive unorientable unit clauses: 0
% 0.08/0.36 % Negative unit clauses : 0
% 0.08/0.36 % Non-unit-clauses : 94
% 0.08/0.36 % Current number of unprocessed clauses: 0
% 0.08/0.36 % ...number of literals in the above : 0
% 0.08/0.36 % Current number of archived formulas : 0
% 0.08/0.36 % Current number of archived clauses : 13
% 0.08/0.36 % Clause-clause subsumption calls (NU) : 5662
% 0.08/0.36 % Rec. Clause-clause subsumption calls : 1029
% 0.08/0.36 % Non-unit clause-clause subsumptions : 61
% 0.08/0.36 % Unit Clause-clause subsumption calls : 0
% 0.08/0.36 % Rewrite failures with RHS unbound : 0
% 0.08/0.36 % BW rewrite match attempts : 0
% 0.08/0.36 % BW rewrite match successes : 0
% 0.08/0.36 % Condensation attempts : 0
% 0.08/0.36 % Condensation successes : 0
% 0.08/0.36 % Termbank termtop insertions : 5050
% 0.08/0.36 % Search garbage collected termcells : 113
% 0.08/0.36
% 0.08/0.36 % -------------------------------------------------
% 0.08/0.36 % User time : 0.005 s
% 0.08/0.36 % System time : 0.003 s
% 0.08/0.36 % Total time : 0.008 s
% 0.08/0.36 % Maximum resident set size: 3664 pages
% 0.08/0.36
% 0.08/0.36 % -------------------------------------------------
% 0.08/0.36 % User time : 0.006 s
% 0.08/0.36 % System time : 0.006 s
% 0.08/0.36 % Total time : 0.013 s
% 0.08/0.36 % Maximum resident set size: 4864 pages
% 0.08/0.36 % E exiting
%------------------------------------------------------------------------------