%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV035-2 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:47:27 PM UTC 2026
% Result : Satisfiable 0.27s 0.60s
% Output : Saturation 0.27s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_51ERROR: Could not build tree for root c_0_110ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(c_0_52,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
c_0_40,
[final] ).
cnf(c_0_53,plain,
( ~ halfadder(X1)
| connection(out1(or1(X1)),in1(and1(X1))) ),
c_0_41,
[final] ).
cnf(c_0_54,plain,
( ~ halfadder(X1)
| connection(out1(not1(X1)),in2(and1(X1))) ),
c_0_42,
[final] ).
cnf(c_0_56,plain,
( ~ halfadder(X1)
| connection(out1(and2(X1)),in1(not1(X1))) ),
c_0_43,
[final] ).
cnf(c_0_57,plain,
( ~ halfadder(X1)
| connection(in2(X1),in2(or1(X1))) ),
c_0_44,
[final] ).
cnf(c_0_59,plain,
( ~ halfadder(X1)
| connection(in2(X1),in2(and2(X1))) ),
c_0_45,
[final] ).
cnf(c_0_60,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(or1(X1))) ),
c_0_46,
[final] ).
cnf(c_0_61,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(and2(X1))) ),
c_0_47,
[final] ).
cnf(c_0_62,plain,
( ~ one(X2)
| ~ connection(X1,X2)
| one(X1) ),
c_0_48,
[final] ).
cnf(c_0_63,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
c_0_49,
[final] ).
cnf(c_0_64,plain,
( ~ halfadder(X1)
| connection(outs(X1),out1(and1(X1))) ),
c_0_50,
[final] ).
cnf(c_0_72,plain,
( ~ one(X1)
| ~ zero(X1) ),
c_0_51,
[final] ).
cnf(c_0_73,plain,
( ~ one(out1(or1(X1)))
| ~ halfadder(X1)
| one(in1(and1(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]),
[final] ).
cnf(c_0_74,plain,
( ~ one(out1(not1(X1)))
| ~ halfadder(X1)
| one(in2(and1(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_54]),
[final] ).
cnf(c_0_75,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
c_0_55,
[final] ).
cnf(c_0_76,plain,
( ~ one(out1(and2(X1)))
| ~ halfadder(X1)
| one(in1(not1(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_56]),
[final] ).
cnf(c_0_77,plain,
( ~ one(in2(X1))
| ~ halfadder(X1)
| one(in2(or1(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_57]),
[final] ).
cnf(c_0_78,plain,
( ~ zero(X2)
| ~ connection(X1,X2)
| zero(X1) ),
c_0_58,
[final] ).
cnf(c_0_79,plain,
( ~ one(in2(X1))
| ~ halfadder(X1)
| one(in2(and2(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_59]),
[final] ).
cnf(c_0_80,plain,
( ~ one(in1(X1))
| ~ halfadder(X1)
| one(in1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_60]),
[final] ).
cnf(c_0_81,plain,
( ~ one(in1(X1))
| ~ halfadder(X1)
| one(in1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_61]),
[final] ).
cnf(c_0_82,plain,
( ~ one(out1(and2(X1)))
| ~ halfadder(X1)
| one(outc(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]),
[final] ).
cnf(c_0_83,plain,
( ~ one(out1(and1(X1)))
| ~ halfadder(X1)
| one(outs(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_64]),
[final] ).
cnf(c_0_88,plain,
( ~ logic_not(X1)
| abnormal(X1)
| not_ok(X1) ),
c_0_65,
[final] ).
cnf(c_0_89,plain,
( ~ halfadder(X1)
| logic_not(not1(X1)) ),
c_0_66,
[final] ).
cnf(c_0_90,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
c_0_67,
[final] ).
cnf(c_0_91,plain,
( ~ halfadder(X1)
| logic_or(or1(X1)) ),
c_0_68,
[final] ).
cnf(c_0_92,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
c_0_69,
[final] ).
cnf(c_0_93,plain,
( ~ halfadder(X1)
| logic_and(and1(X1)) ),
c_0_70,
[final] ).
cnf(c_0_94,plain,
( ~ halfadder(X1)
| logic_and(and2(X1)) ),
c_0_71,
[final] ).
cnf(c_0_110,plain,
( ~ zero(in1(and1(X1)))
| ~ one(out1(or1(X1)))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]),
[final] ).
cnf(c_0_111,plain,
( ~ zero(in2(and1(X1)))
| ~ one(out1(not1(X1)))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_74]),
[final] ).
cnf(c_0_112,plain,
( ~ zero(out1(or1(X1)))
| ~ halfadder(X1)
| zero(in1(and1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_53]),
[final] ).
cnf(c_0_113,plain,
( ~ zero(out1(not1(X1)))
| ~ halfadder(X1)
| zero(in2(and1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_54]),
[final] ).
cnf(c_0_114,plain,
( ~ zero(in1(not1(X1)))
| ~ one(out1(and2(X1)))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_76]),
[final] ).
cnf(c_0_115,plain,
( ~ zero(out1(and2(X1)))
| ~ halfadder(X1)
| zero(in1(not1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_56]),
[final] ).
cnf(c_0_116,plain,
( ~ zero(in2(or1(X1)))
| ~ one(in2(X1))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_77]),
[final] ).
cnf(c_0_117,plain,
( ~ one(in1(and1(X1)))
| ~ halfadder(X1)
| one(out1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_62,c_0_53]),
[final] ).
cnf(c_0_118,plain,
( ~ zero(in2(X1))
| ~ halfadder(X1)
| zero(in2(or1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_57]),
[final] ).
cnf(c_0_119,plain,
( ~ zero(in1(and1(X1)))
| ~ halfadder(X1)
| zero(out1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_78,c_0_53]),
[final] ).
cnf(c_0_120,plain,
( ~ one(in2(and1(X1)))
| ~ halfadder(X1)
| one(out1(not1(X1))) ),
inference(spm,[status(thm)],[c_0_62,c_0_54]),
[final] ).
cnf(c_0_121,plain,
( ~ zero(in2(and2(X1)))
| ~ one(in2(X1))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_79]),
[final] ).
cnf(c_0_122,plain,
( ~ zero(in2(X1))
| ~ halfadder(X1)
| zero(in2(and2(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_59]),
[final] ).
cnf(c_0_123,plain,
( ~ zero(in2(and1(X1)))
| ~ halfadder(X1)
| zero(out1(not1(X1))) ),
inference(spm,[status(thm)],[c_0_78,c_0_54]),
[final] ).
cnf(c_0_124,plain,
( ~ one(in1(not1(X1)))
| ~ halfadder(X1)
| one(out1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_62,c_0_56]),
[final] ).
cnf(c_0_125,plain,
( ~ zero(in1(or1(X1)))
| ~ one(in1(X1))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_80]),
[final] ).
cnf(c_0_126,plain,
( ~ zero(in1(not1(X1)))
| ~ halfadder(X1)
| zero(out1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_78,c_0_56]),
[final] ).
cnf(c_0_127,plain,
( ~ zero(in1(and2(X1)))
| ~ one(in1(X1))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_81]),
[final] ).
cnf(c_0_128,plain,
( ~ zero(in1(X1))
| ~ halfadder(X1)
| zero(in1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_60]),
[final] ).
cnf(c_0_129,plain,
( ~ zero(outc(X1))
| ~ one(out1(and2(X1)))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_82]),
[final] ).
cnf(c_0_130,plain,
( ~ one(outc(X1))
| ~ halfadder(X1)
| one(out1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_63]),
[final] ).
cnf(c_0_131,plain,
( ~ zero(outc(X1))
| ~ halfadder(X1)
| zero(out1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_63]),
[final] ).
cnf(c_0_132,plain,
( ~ zero(out1(and2(X1)))
| ~ halfadder(X1)
| zero(outc(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_63]),
[final] ).
cnf(c_0_133,plain,
( ~ one(outs(X1))
| ~ halfadder(X1)
| one(out1(and1(X1))) ),
inference(spm,[status(thm)],[c_0_52,c_0_64]),
[final] ).
cnf(c_0_134,plain,
( ~ zero(outs(X1))
| ~ halfadder(X1)
| zero(out1(and1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_64]),
[final] ).
cnf(c_0_135,plain,
( ~ zero(outs(X1))
| ~ one(out1(and1(X1)))
| ~ halfadder(X1) ),
inference(spm,[status(thm)],[c_0_72,c_0_83]),
[final] ).
cnf(c_0_136,plain,
( ~ zero(in1(X1))
| ~ halfadder(X1)
| zero(in1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_61]),
[final] ).
cnf(c_0_137,plain,
( ~ one(in2(or1(X1)))
| ~ halfadder(X1)
| one(in2(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_57]),
[final] ).
cnf(c_0_138,plain,
( ~ zero(in2(or1(X1)))
| ~ halfadder(X1)
| zero(in2(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_57]),
[final] ).
cnf(c_0_139,plain,
( ~ one(in2(and2(X1)))
| ~ halfadder(X1)
| one(in2(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_59]),
[final] ).
cnf(c_0_140,plain,
( ~ zero(in2(and2(X1)))
| ~ halfadder(X1)
| zero(in2(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_59]),
[final] ).
cnf(c_0_141,plain,
( ~ zero(out1(and1(X1)))
| ~ halfadder(X1)
| zero(outs(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_64]),
[final] ).
cnf(c_0_142,plain,
( ~ one(in1(or1(X1)))
| ~ halfadder(X1)
| one(in1(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_60]),
[final] ).
cnf(c_0_143,plain,
( ~ zero(in1(or1(X1)))
| ~ halfadder(X1)
| zero(in1(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_60]),
[final] ).
cnf(c_0_144,plain,
( ~ one(in1(and2(X1)))
| ~ halfadder(X1)
| one(in1(X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_61]),
[final] ).
cnf(c_0_145,plain,
( ~ zero(in1(and2(X1)))
| ~ halfadder(X1)
| zero(in1(X1)) ),
inference(spm,[status(thm)],[c_0_78,c_0_61]),
[final] ).
cnf(c_0_146,plain,
( ~ one(out1(X1))
| ~ or_ok(X1)
| one(in2(X1))
| one(in1(X1)) ),
c_0_84,
[final] ).
cnf(c_0_147,plain,
( ~ one(in2(X1))
| ~ one(in1(X1))
| ~ and_ok(X1)
| one(out1(X1)) ),
c_0_85,
[final] ).
cnf(c_0_148,plain,
( ~ zero(in2(X1))
| ~ zero(in1(X1))
| ~ or_ok(X1)
| zero(out1(X1)) ),
c_0_86,
[final] ).
cnf(c_0_149,plain,
( ~ zero(out1(X1))
| ~ and_ok(X1)
| zero(in2(X1))
| zero(in1(X1)) ),
c_0_87,
[final] ).
cnf(c_0_150,plain,
( ~ halfadder(X1)
| abnormal(not1(X1))
| not_ok(not1(X1)) ),
inference(spm,[status(thm)],[c_0_88,c_0_89]),
[final] ).
cnf(c_0_151,plain,
( ~ halfadder(X1)
| abnormal(or1(X1))
| or_ok(or1(X1)) ),
inference(spm,[status(thm)],[c_0_90,c_0_91]),
[final] ).
cnf(c_0_152,plain,
( ~ halfadder(X1)
| and_ok(and1(X1))
| abnormal(and1(X1)) ),
inference(spm,[status(thm)],[c_0_92,c_0_93]),
[final] ).
cnf(c_0_153,plain,
( ~ halfadder(X1)
| and_ok(and2(X1))
| abnormal(and2(X1)) ),
inference(spm,[status(thm)],[c_0_92,c_0_94]),
[final] ).
cnf(c_0_154,plain,
( ~ one(out1(X1))
| ~ and_ok(X1)
| one(in2(X1)) ),
c_0_95,
[final] ).
cnf(c_0_155,plain,
( ~ zero(in1(X1))
| ~ not_ok(X1)
| one(out1(X1)) ),
c_0_96,
[final] ).
cnf(c_0_156,plain,
( ~ one(in2(X1))
| ~ or_ok(X1)
| one(out1(X1)) ),
c_0_97,
[final] ).
cnf(c_0_157,plain,
( ~ one(in1(X1))
| ~ or_ok(X1)
| one(out1(X1)) ),
c_0_98,
[final] ).
cnf(c_0_158,plain,
( ~ zero(out1(X1))
| ~ not_ok(X1)
| one(in1(X1)) ),
c_0_99,
[final] ).
cnf(c_0_159,plain,
( ~ one(out1(X1))
| ~ and_ok(X1)
| one(in1(X1)) ),
c_0_100,
[final] ).
cnf(c_0_160,plain,
( ~ zero(out1(X1))
| ~ or_ok(X1)
| zero(in2(X1)) ),
c_0_101,
[final] ).
cnf(c_0_161,plain,
( ~ one(in1(X1))
| ~ not_ok(X1)
| zero(out1(X1)) ),
c_0_102,
[final] ).
cnf(c_0_162,plain,
( ~ zero(in2(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
c_0_103,
[final] ).
cnf(c_0_163,plain,
( ~ zero(in1(X1))
| ~ and_ok(X1)
| zero(out1(X1)) ),
c_0_104,
[final] ).
cnf(c_0_164,plain,
( ~ one(out1(X1))
| ~ not_ok(X1)
| zero(in1(X1)) ),
c_0_105,
[final] ).
cnf(c_0_165,plain,
( ~ zero(out1(X1))
| ~ or_ok(X1)
| zero(in1(X1)) ),
c_0_106,
[final] ).
cnf(c_0_166,plain,
( ~ abnormal(X1)
| ~ not_ok(X1) ),
c_0_107,
[final] ).
cnf(c_0_167,plain,
( ~ abnormal(X1)
| ~ or_ok(X1) ),
c_0_108,
[final] ).
cnf(c_0_168,plain,
( ~ abnormal(X1)
| ~ and_ok(X1) ),
c_0_109,
[final] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : HWV035-2 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n017.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Sun Sep 20 20:44:56 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.52 Running first-order theorem proving
% 0.16/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.27/0.60 % Version: 3.5.1
% 0.27/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.60 % Starting sh5l with 300s (1) cores
% 0.27/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 613488 completed with status 1
% 0.27/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.60 % No SInE strategy applied
% 0.27/0.60 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.27/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.60 % Starting G-E--_107_C18_F1_PI_AE_Q4_CS_SP_PS_S4S with 136s (1) cores
% 0.27/0.60 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.60 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SP_CO_S5PRR_S0Y with 136s (1) cores
% 0.27/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 613502 completed with status 1
% 0.27/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.60 % No SInE strategy applied
% 0.27/0.60 % Search class: FGHNF-FFMF11-SFFFFFNN
% 0.27/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.60 % Preprocessing time : 0.002 s
% 0.27/0.60 % Presaturation interreduction done
% 0.27/0.60
% 0.27/0.60 % No proof found!
% 0.27/0.60 % SZS status Satisfiable
% 0.27/0.60 % SZS output start Saturation
% See solution above
% 0.27/0.60 % Parsed axioms : 40
% 0.27/0.60 % Removed by relevancy pruning/SinE : 0
% 0.27/0.60 % Initial clauses : 40
% 0.27/0.60 % Removed in clause preprocessing : 0
% 0.27/0.60 % Initial clauses in saturation : 40
% 0.27/0.60 % Processed clauses : 138
% 0.27/0.60 % ...of these trivial : 0
% 0.27/0.60 % ...subsumed : 9
% 0.27/0.60 % ...remaining for further processing : 129
% 0.27/0.60 % Other redundant clauses eliminated : 0
% 0.27/0.60 % Clauses deleted for lack of memory : 0
% 0.27/0.60 % Backward-subsumed : 0
% 0.27/0.60 % Backward-rewritten : 0
% 0.27/0.60 % Generated clauses : 76
% 0.27/0.60 % ...of the previous two non-redundant : 58
% 0.27/0.60 % ...aggressively subsumed : 0
% 0.27/0.60 % Contextual simplify-reflections : 0
% 0.27/0.60 % Paramodulations : 76
% 0.27/0.60 % Factorizations : 0
% 0.27/0.60 % NegExts : 0
% 0.27/0.60 % Equation resolutions : 0
% 0.27/0.60 % Disequality decompositions : 0
% 0.27/0.60 % Total rewrite steps : 0
% 0.27/0.60 % ...of those cached : 0
% 0.27/0.60 % Propositional unsat checks : 0
% 0.27/0.60 % Propositional check models : 0
% 0.27/0.60 % Propositional check unsatisfiable : 0
% 0.27/0.60 % Propositional clauses : 0
% 0.27/0.60 % Propositional clauses after purity: 0
% 0.27/0.60 % Propositional unsat core size : 0
% 0.27/0.60 % Propositional preprocessing time : 0.000
% 0.27/0.60 % Propositional encoding time : 0.000
% 0.27/0.60 % Propositional solver time : 0.000
% 0.27/0.60 % Success case prop preproc time : 0.000
% 0.27/0.60 % Success case prop encoding time : 0.000
% 0.27/0.60 % Success case prop solver time : 0.000
% 0.27/0.60 % Current number of processed clauses : 89
% 0.27/0.60 % Positive orientable unit clauses : 0
% 0.27/0.60 % Positive unorientable unit clauses: 0
% 0.27/0.60 % Negative unit clauses : 0
% 0.27/0.60 % Non-unit-clauses : 89
% 0.27/0.60 % Current number of unprocessed clauses: 0
% 0.27/0.60 % ...number of literals in the above : 0
% 0.27/0.60 % Current number of archived formulas : 0
% 0.27/0.60 % Current number of archived clauses : 40
% 0.27/0.60 % Clause-clause subsumption calls (NU) : 1456
% 0.27/0.60 % Rec. Clause-clause subsumption calls : 1248
% 0.27/0.60 % Non-unit clause-clause subsumptions : 9
% 0.27/0.60 % Unit Clause-clause subsumption calls : 0
% 0.27/0.60 % Rewrite failures with RHS unbound : 0
% 0.27/0.60 % BW rewrite match attempts : 0
% 0.27/0.60 % BW rewrite match successes : 0
% 0.27/0.60 % Condensation attempts : 0
% 0.27/0.60 % Condensation successes : 0
% 0.27/0.60 % Termbank termtop insertions : 3671
% 0.27/0.60 % Search garbage collected termcells : 84
% 0.27/0.60
% 0.27/0.60 % -------------------------------------------------
% 0.27/0.60 % User time : 0.017 s
% 0.27/0.60 % System time : 0.004 s
% 0.27/0.60 % Total time : 0.020 s
% 0.27/0.60 % Maximum resident set size: 3668 pages
% 0.27/0.60
% 0.27/0.60 % -------------------------------------------------
% 0.27/0.60 % User time : 0.071 s
% 0.27/0.60 % System time : 0.020 s
% 0.27/0.60 % Total time : 0.091 s
% 0.27/0.60 % Maximum resident set size: 4864 pages
% 0.27/0.60 % E exiting
%------------------------------------------------------------------------------