%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP125-2.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 12:41:56 PM UTC 2026
% Result : Satisfiable 0.23s 0.57s
% Output : Saturation 0.23s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_32ERROR: Could not build tree for root c_0_38ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_34,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_4)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_32,
[final] ).
cnf(c_0_35,axiom,
group_element(e_4),
element_4,
[final] ).
cnf(c_0_36,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_33,
[final] ).
cnf(c_0_37,axiom,
product(X1,X1,X1),
product_idempotence,
[final] ).
cnf(c_0_38,plain,
( ~ group_element(X1)
| product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]),
[final] ).
cnf(c_0_39,axiom,
group_element(e_3),
element_3,
[final] ).
cnf(c_0_42,axiom,
group_element(e_1),
element_1,
[final] ).
cnf(c_0_45,plain,
( ~ product(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]),
[final] ).
cnf(c_0_47,plain,
~ equalish(e_3,e_4),
c_0_40,
[final] ).
cnf(c_0_48,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_41,
[final] ).
cnf(c_0_49,plain,
( ~ group_element(X1)
| product(X1,e_3,e_4)
| product(X1,e_3,e_3)
| product(X1,e_3,e_2)
| product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_39]),
[final] ).
cnf(c_0_51,plain,
~ equalish(e_1,e_4),
c_0_43,
[final] ).
cnf(c_0_53,plain,
( ~ group_element(X1)
| product(X1,e_1,e_4)
| product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_42]),
[final] ).
cnf(c_0_54,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X1) ),
c_0_44,
[final] ).
cnf(c_0_56,plain,
( ~ product(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_37]),
[final] ).
cnf(c_0_59,plain,
~ equalish(e_4,e_1),
c_0_52,
[final] ).
cnf(c_0_68,plain,
~ equalish(e_4,e_3),
c_0_63,
[final] ).
cnf(c_0_71,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_66,
[final] ).
cnf(c_0_74,plain,
( ~ product(X2,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_37]),
[final] ).
cnf(c_0_81,plain,
~ equalish(e_3,e_1),
c_0_78,
[final] ).
cnf(c_0_84,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
c_0_82,
[final] ).
cnf(c_0_88,axiom,
next(e_2,e_3),
e_2_then_e_3,
[final] ).
cnf(c_0_89,axiom,
greater(e_4,e_3),
e_4_greater_e_3,
[final] ).
cnf(c_0_92,negated_conjecture,
product(e_2,e_3,e_4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_89])]),
[final] ).
cnf(c_0_93,plain,
~ equalish(e_2,e_1),
c_0_90,
[final] ).
cnf(c_0_99,plain,
~ equalish(e_1,e_3),
c_0_96,
[final] ).
cnf(c_0_101,negated_conjecture,
product(e_1,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_98]),c_0_99]),
[final] ).
cnf(c_0_102,axiom,
group_element(e_2),
element_2,
[final] ).
cnf(c_0_105,plain,
( ~ group_element(X1)
| product(X1,e_2,e_4)
| product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_34,c_0_102]),
[final] ).
cnf(c_0_107,negated_conjecture,
product(e_3,e_2,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_103]),c_0_68]),
[final] ).
cnf(c_0_110,plain,
~ equalish(e_2,e_4),
c_0_106,
[final] ).
cnf(c_0_112,negated_conjecture,
( ~ product(e_2,e_3,X1)
| product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_54,c_0_107]),
[final] ).
cnf(c_0_116,plain,
~ equalish(e_2,e_3),
c_0_111,
[final] ).
cnf(c_0_118,negated_conjecture,
product(e_4,e_1,e_2),
inference(spm,[status(thm)],[c_0_112,c_0_92]),
[final] ).
cnf(c_0_122,negated_conjecture,
( ~ product(X1,e_1,e_2)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_36,c_0_118]),
[final] ).
cnf(c_0_126,negated_conjecture,
product(e_3,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_121]),c_0_68]),
[final] ).
cnf(c_0_127,negated_conjecture,
product(e_2,e_4,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_47]),
[final] ).
cnf(c_0_130,negated_conjecture,
( ~ product(e_4,e_3,X1)
| product(X1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_54,c_0_126]),
[final] ).
cnf(c_0_131,negated_conjecture,
( ~ product(e_4,e_2,X1)
| product(X1,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_54,c_0_127]),
[final] ).
cnf(c_0_134,negated_conjecture,
( ~ product(X1,e_3,e_2)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_36,c_0_101]),
[final] ).
cnf(c_0_138,plain,
~ equalish(e_4,e_2),
c_0_133,
[final] ).
cnf(c_0_139,negated_conjecture,
product(e_2,e_1,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_59]),
[final] ).
cnf(c_0_141,negated_conjecture,
( ~ product(e_3,e_1,X1)
| product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_54,c_0_101]),
[final] ).
cnf(c_0_142,negated_conjecture,
product(e_3,e_1,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_137]),c_0_138]),
[final] ).
cnf(c_0_143,negated_conjecture,
( ~ product(e_1,e_2,X1)
| product(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_54,c_0_139]),
[final] ).
cnf(c_0_144,negated_conjecture,
product(e_1,e_2,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_140]),c_0_59]),
[final] ).
cnf(c_0_145,negated_conjecture,
( ~ product(e_3,e_2,X1)
| product(X1,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_54,c_0_92]),
[final] ).
cnf(c_0_146,negated_conjecture,
product(e_4,e_2,e_3),
inference(spm,[status(thm)],[c_0_141,c_0_142]),
[final] ).
cnf(c_0_147,negated_conjecture,
product(e_4,e_3,e_1),
inference(spm,[status(thm)],[c_0_143,c_0_144]),
[final] ).
cnf(c_0_148,negated_conjecture,
product(e_1,e_4,e_3),
inference(spm,[status(thm)],[c_0_145,c_0_107]),
[final] ).
cnf(c_0_149,negated_conjecture,
( ~ next(e_3,X1)
| ~ greater(e_4,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_142]),
[final] ).
cnf(c_0_150,axiom,
next(e_3,e_4),
e_3_then_e_4,
[final] ).
cnf(c_0_151,negated_conjecture,
( ~ next(e_2,X1)
| ~ greater(e_3,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_139]),
[final] ).
cnf(c_0_152,plain,
( ~ next(e_1,X1)
| ~ greater(e_1,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_37]),
[final] ).
cnf(c_0_153,axiom,
next(e_1,e_2),
e_1_then_e_2,
[final] ).
cnf(c_0_156,negated_conjecture,
( ~ product(e_2,e_4,X1)
| product(X1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_54,c_0_146]),
[final] ).
cnf(c_0_157,negated_conjecture,
( ~ product(e_1,e_3,X1)
| product(X1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_54,c_0_142]),
[final] ).
cnf(c_0_158,negated_conjecture,
( ~ product(X1,e_2,e_3)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_36,c_0_146]),
[final] ).
cnf(c_0_159,negated_conjecture,
( ~ product(e_4,e_2,X1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_71,c_0_146]),
[final] ).
cnf(c_0_160,negated_conjecture,
( ~ product(e_4,X1,e_3)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_48,c_0_146]),
[final] ).
cnf(c_0_161,negated_conjecture,
( ~ product(X1,e_1,e_4)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_142]),
[final] ).
cnf(c_0_162,negated_conjecture,
( ~ product(e_3,e_1,X1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_71,c_0_142]),
[final] ).
cnf(c_0_163,negated_conjecture,
( ~ product(e_3,X1,e_4)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_142]),
[final] ).
cnf(c_0_164,negated_conjecture,
( ~ product(X1,e_4,e_1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_127]),
[final] ).
cnf(c_0_165,negated_conjecture,
( ~ product(e_2,e_4,X1)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_71,c_0_127]),
[final] ).
cnf(c_0_166,negated_conjecture,
( ~ product(e_2,X1,e_1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_48,c_0_127]),
[final] ).
cnf(c_0_167,negated_conjecture,
( ~ product(e_3,e_4,X1)
| product(X1,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_54,c_0_147]),
[final] ).
cnf(c_0_168,negated_conjecture,
( ~ product(e_2,e_1,X1)
| product(X1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_54,c_0_144]),
[final] ).
cnf(c_0_169,negated_conjecture,
( ~ product(X1,e_3,e_1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_36,c_0_147]),
[final] ).
cnf(c_0_170,negated_conjecture,
( ~ product(e_4,e_3,X1)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_71,c_0_147]),
[final] ).
cnf(c_0_171,negated_conjecture,
( ~ product(e_4,X1,e_1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_48,c_0_147]),
[final] ).
cnf(c_0_172,negated_conjecture,
( ~ product(X1,e_2,e_4)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_36,c_0_144]),
[final] ).
cnf(c_0_173,negated_conjecture,
( ~ product(e_1,e_2,X1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_71,c_0_144]),
[final] ).
cnf(c_0_174,negated_conjecture,
( ~ product(e_1,X1,e_4)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_48,c_0_144]),
[final] ).
cnf(c_0_175,negated_conjecture,
( ~ product(X1,e_1,e_3)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_139]),
[final] ).
cnf(c_0_176,negated_conjecture,
( ~ product(e_2,e_1,X1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_71,c_0_139]),
[final] ).
cnf(c_0_177,negated_conjecture,
( ~ product(e_2,X1,e_3)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_139]),
[final] ).
cnf(c_0_178,negated_conjecture,
( ~ product(e_1,e_4,X1)
| product(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_54,c_0_118]),
[final] ).
cnf(c_0_179,negated_conjecture,
( ~ product(e_4,e_1,X1)
| product(X1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_54,c_0_148]),
[final] ).
cnf(c_0_180,negated_conjecture,
( ~ product(X1,e_4,e_2)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_126]),
[final] ).
cnf(c_0_181,negated_conjecture,
( ~ product(e_3,e_4,X1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_71,c_0_126]),
[final] ).
cnf(c_0_182,negated_conjecture,
( ~ product(e_3,X1,e_2)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_48,c_0_126]),
[final] ).
cnf(c_0_183,negated_conjecture,
( ~ product(e_4,e_1,X1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_71,c_0_118]),
[final] ).
cnf(c_0_184,negated_conjecture,
( ~ product(e_4,X1,e_2)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_118]),
[final] ).
cnf(c_0_185,negated_conjecture,
( ~ next(e_4,X1)
| ~ greater(e_2,X1) ),
inference(spm,[status(thm)],[c_0_84,c_0_118]),
[final] ).
cnf(c_0_186,negated_conjecture,
( ~ product(X1,e_4,e_3)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_36,c_0_148]),
[final] ).
cnf(c_0_187,negated_conjecture,
( ~ product(e_1,e_4,X1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_71,c_0_148]),
[final] ).
cnf(c_0_188,negated_conjecture,
( ~ product(e_1,X1,e_3)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_48,c_0_148]),
[final] ).
cnf(c_0_189,negated_conjecture,
( ~ product(X1,e_2,e_1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_107]),
[final] ).
cnf(c_0_190,negated_conjecture,
( ~ product(e_3,e_2,X1)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_71,c_0_107]),
[final] ).
cnf(c_0_191,negated_conjecture,
( ~ product(e_3,X1,e_1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_48,c_0_107]),
[final] ).
cnf(c_0_192,negated_conjecture,
( ~ product(e_1,e_3,X1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_71,c_0_101]),
[final] ).
cnf(c_0_193,negated_conjecture,
( ~ product(e_1,X1,e_2)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_48,c_0_101]),
[final] ).
cnf(c_0_194,negated_conjecture,
( ~ product(X1,e_3,e_4)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_36,c_0_92]),
[final] ).
cnf(c_0_195,negated_conjecture,
( ~ product(e_2,e_3,X1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_71,c_0_92]),
[final] ).
cnf(c_0_196,negated_conjecture,
( ~ product(e_2,X1,e_4)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_48,c_0_92]),
[final] ).
cnf(c_0_197,negated_conjecture,
( ~ product(X2,X2,X1)
| product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_37]),
[final] ).
cnf(c_0_198,negated_conjecture,
~ greater(e_4,e_4),
inference(spm,[status(thm)],[c_0_149,c_0_150]),
[final] ).
cnf(c_0_199,negated_conjecture,
~ greater(e_3,e_3),
inference(spm,[status(thm)],[c_0_151,c_0_88]),
[final] ).
cnf(c_0_200,plain,
~ greater(e_1,e_2),
inference(spm,[status(thm)],[c_0_152,c_0_153]),
[final] ).
cnf(c_0_201,plain,
~ equalish(e_3,e_2),
c_0_154,
[final] ).
cnf(c_0_202,plain,
~ equalish(e_1,e_2),
c_0_155,
[final] ).
cnf(c_0_203,plain,
equalish(X1,X1),
inference(spm,[status(thm)],[c_0_74,c_0_37]),
[final] ).
cnf(c_0_204,axiom,
greater(e_4,e_2),
e_4_greater_e_2,
[final] ).
cnf(c_0_205,axiom,
greater(e_4,e_1),
e_4_greater_e_1,
[final] ).
cnf(c_0_206,axiom,
greater(e_3,e_2),
e_3_greater_e_2,
[final] ).
cnf(c_0_207,axiom,
greater(e_3,e_1),
e_3_greater_e_1,
[final] ).
cnf(c_0_208,axiom,
greater(e_2,e_1),
e_2_greater_e_1,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP125-2.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n018.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 20 20:00:57 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.23/0.57 % Version: 3.5.1
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.23/0.57 % Starting sh5l with 300s (1) cores
% 0.23/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 58122 completed with status 1
% 0.23/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.23/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/0.57 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.23/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.23/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.23/0.57 % SubtermCWHack with pid 58126 completed with status 1
% 0.23/0.57 % Result found by SubtermCWHack
% 0.23/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/0.57 % No SInE strategy applied
% 0.23/0.57 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.23/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.23/0.57 % Preprocessing time : 0.001 s
% 0.23/0.57
% 0.23/0.57 % No proof found!
% 0.23/0.57 % SZS status Satisfiable
% 0.23/0.57 % SZS output start Saturation
% See solution above
% 0.23/0.57 % Parsed axioms : 32
% 0.23/0.57 % Removed by relevancy pruning/SinE : 0
% 0.23/0.57 % Initial clauses : 32
% 0.23/0.57 % Removed in clause preprocessing : 0
% 0.23/0.57 % Initial clauses in saturation : 32
% 0.23/0.57 % Processed clauses : 330
% 0.23/0.57 % ...of these trivial : 1
% 0.23/0.57 % ...subsumed : 37
% 0.23/0.57 % ...remaining for further processing : 292
% 0.23/0.57 % Other redundant clauses eliminated : 0
% 0.23/0.57 % Clauses deleted for lack of memory : 0
% 0.23/0.57 % Backward-subsumed : 142
% 0.23/0.57 % Backward-rewritten : 42
% 0.23/0.57 % Generated clauses : 968
% 0.23/0.57 % ...of the previous two non-redundant : 646
% 0.23/0.57 % ...aggressively subsumed : 0
% 0.23/0.57 % Contextual simplify-reflections : 0
% 0.23/0.57 % Paramodulations : 968
% 0.23/0.57 % Factorizations : 0
% 0.23/0.57 % NegExts : 0
% 0.23/0.57 % Equation resolutions : 0
% 0.23/0.57 % Disequality decompositions : 0
% 0.23/0.57 % Total rewrite steps : 366
% 0.23/0.57 % ...of those cached : 343
% 0.23/0.57 % Propositional unsat checks : 0
% 0.23/0.57 % Propositional check models : 0
% 0.23/0.57 % Propositional check unsatisfiable : 0
% 0.23/0.57 % Propositional clauses : 0
% 0.23/0.57 % Propositional clauses after purity: 0
% 0.23/0.57 % Propositional unsat core size : 0
% 0.23/0.57 % Propositional preprocessing time : 0.000
% 0.23/0.57 % Propositional encoding time : 0.000
% 0.23/0.57 % Propositional solver time : 0.000
% 0.23/0.57 % Success case prop preproc time : 0.000
% 0.23/0.57 % Success case prop encoding time : 0.000
% 0.23/0.57 % Success case prop solver time : 0.000
% 0.23/0.57 % Current number of processed clauses : 108
% 0.23/0.57 % Positive orientable unit clauses : 27
% 0.23/0.57 % Positive unorientable unit clauses: 0
% 0.23/0.57 % Negative unit clauses : 15
% 0.23/0.57 % Non-unit-clauses : 66
% 0.23/0.57 % Current number of unprocessed clauses: 0
% 0.23/0.57 % ...number of literals in the above : 0
% 0.23/0.57 % Current number of archived formulas : 0
% 0.23/0.57 % Current number of archived clauses : 184
% 0.23/0.57 % Clause-clause subsumption calls (NU) : 7124
% 0.23/0.57 % Rec. Clause-clause subsumption calls : 3916
% 0.23/0.57 % Non-unit clause-clause subsumptions : 158
% 0.23/0.57 % Unit Clause-clause subsumption calls : 391
% 0.23/0.57 % Rewrite failures with RHS unbound : 0
% 0.23/0.57 % BW rewrite match attempts : 58
% 0.23/0.57 % BW rewrite match successes : 12
% 0.23/0.57 % Condensation attempts : 0
% 0.23/0.57 % Condensation successes : 0
% 0.23/0.57 % Termbank termtop insertions : 15164
% 0.23/0.57 % Search garbage collected termcells : 56
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.029 s
% 0.23/0.57 % System time : 0.002 s
% 0.23/0.57 % Total time : 0.031 s
% 0.23/0.57 % Maximum resident set size: 3644 pages
% 0.23/0.57
% 0.23/0.57 % -------------------------------------------------
% 0.23/0.57 % User time : 0.132 s
% 0.23/0.57 % System time : 0.017 s
% 0.23/0.57 % Total time : 0.149 s
% 0.23/0.57 % Maximum resident set size: 4608 pages
% 0.23/0.57 % E exiting
%------------------------------------------------------------------------------