%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV005-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 : n009.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:18 PM UTC 2026
% Result : Unsatisfiable 0.16s 0.65s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 25
% Syntax : Number of clauses : 94 ( 22 unt; 15 nHn; 94 RR)
% Number of literals : 211 ( 0 equ; 114 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-1 aty)
% Number of variables : 72 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(and_ok_or_abnormal,axiom,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',and_ok_or_abnormal) ).
cnf(halfadder_and1,axiom,
( ~ halfadder(X1)
| logic_and(and1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_and1) ).
cnf(or_ok_or_abnormal,axiom,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',or_ok_or_abnormal) ).
cnf(halfadder_or1,axiom,
( ~ halfadder(X1)
| logic_or(or1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_or1) ).
cnf(and_11_1,axiom,
( ~ one(in2(X1))
| ~ one(in1(X1))
| ~ and_ok(X1)
| one(out1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',and_11_1) ).
cnf(or_1x_1,axiom,
( ~ one(in1(X1))
| ~ or_ok(X1)
| one(out1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',or_1x_1) ).
cnf(diagnosis_and1,negated_conjecture,
~ abnormal(and1(h)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_and1) ).
cnf(value_propagation_one1,axiom,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',value_propagation_one1) ).
cnf(halfadder_connection_out1not1_in2and1,axiom,
( ~ halfadder(X1)
| connection(out1(not1(X1)),in2(and1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_out1not1_in2and1) ).
cnf(diagnosis_or1,negated_conjecture,
~ abnormal(or1(h)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_or1) ).
cnf(halfadder_connection_in1_in1or1,axiom,
( ~ halfadder(X1)
| connection(in1(X1),in1(or1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_in1_in1or1) ).
cnf(not_ok_or_abnormal,axiom,
( ~ logic_not(X1)
| abnormal(X1)
| not_ok(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',not_ok_or_abnormal) ).
cnf(halfadder_not1,axiom,
( ~ halfadder(X1)
| logic_not(not1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_not1) ).
cnf(h_isa_halfadder,hypothesis,
halfadder(h),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_isa_halfadder) ).
cnf(halfadder_connection_out1or1_in1_and1,axiom,
( ~ halfadder(X1)
| connection(out1(or1(X1)),in1(and1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_out1or1_in1_and1) ).
cnf(not_0_1_fw,axiom,
( ~ zero(in1(X1))
| ~ not_ok(X1)
| one(out1(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',not_0_1_fw) ).
cnf(in1_1,hypothesis,
one(in1(h)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in1_1) ).
cnf(diagnosis_not1,negated_conjecture,
~ abnormal(not1(h)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diagnosis_not1) ).
cnf(value_propagation_zero1,axiom,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',value_propagation_zero1) ).
cnf(halfadder_connection_outc_out1and2,axiom,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_outc_out1and2) ).
cnf(halfadder_connection_out1and2_in1not1,axiom,
( ~ halfadder(X1)
| connection(out1(and2(X1)),in1(not1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_out1and2_in1not1) ).
cnf(halfadder_connection_outs_out1and1,axiom,
( ~ halfadder(X1)
| connection(outs(X1),out1(and1(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-1.ax',halfadder_connection_outs_out1and1) ).
cnf(outc_0,hypothesis,
zero(outc(h)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',outc_0) ).
cnf(unique_value,axiom,
( ~ one(X1)
| ~ zero(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV002-0.ax',unique_value) ).
cnf(outs_0,hypothesis,
zero(outs(h)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',outs_0) ).
cnf(c_0_25,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
inference(fof_simplification,[status(thm)],[and_ok_or_abnormal]) ).
cnf(c_0_26,plain,
( ~ halfadder(X1)
| logic_and(and1(X1)) ),
inference(fof_simplification,[status(thm)],[halfadder_and1]) ).
cnf(c_0_27,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
inference(fof_simplification,[status(thm)],[or_ok_or_abnormal]) ).
cnf(c_0_28,plain,
( ~ halfadder(X1)
| logic_or(or1(X1)) ),
inference(fof_simplification,[status(thm)],[halfadder_or1]) ).
cnf(c_0_29,plain,
( ~ one(in2(X1))
| ~ one(in1(X1))
| ~ and_ok(X1)
| one(out1(X1)) ),
inference(fof_simplification,[status(thm)],[and_11_1]) ).
cnf(c_0_30,plain,
( ~ logic_and(X1)
| abnormal(X1)
| and_ok(X1) ),
c_0_25 ).
cnf(c_0_31,plain,
( ~ halfadder(X1)
| logic_and(and1(X1)) ),
c_0_26 ).
cnf(c_0_32,plain,
( ~ one(in1(X1))
| ~ or_ok(X1)
| one(out1(X1)) ),
inference(fof_simplification,[status(thm)],[or_1x_1]) ).
cnf(c_0_33,plain,
( ~ logic_or(X1)
| abnormal(X1)
| or_ok(X1) ),
c_0_27 ).
cnf(c_0_34,plain,
( ~ halfadder(X1)
| logic_or(or1(X1)) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
~ abnormal(and1(h)),
inference(fof_simplification,[status(thm)],[diagnosis_and1]) ).
cnf(c_0_36,plain,
( ~ one(in2(X1))
| ~ one(in1(X1))
| ~ and_ok(X1)
| one(out1(X1)) ),
c_0_29 ).
cnf(c_0_37,plain,
( ~ halfadder(X1)
| and_ok(and1(X1))
| abnormal(and1(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
inference(fof_simplification,[status(thm)],[value_propagation_one1]) ).
cnf(c_0_39,plain,
( ~ halfadder(X1)
| connection(out1(not1(X1)),in2(and1(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_out1not1_in2and1]) ).
cnf(c_0_40,negated_conjecture,
~ abnormal(or1(h)),
inference(fof_simplification,[status(thm)],[diagnosis_or1]) ).
cnf(c_0_41,plain,
( ~ one(in1(X1))
| ~ or_ok(X1)
| one(out1(X1)) ),
c_0_32 ).
cnf(c_0_42,plain,
( ~ halfadder(X1)
| abnormal(or1(X1))
| or_ok(or1(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_43,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(or1(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_in1_in1or1]) ).
cnf(c_0_44,plain,
( ~ logic_not(X1)
| abnormal(X1)
| not_ok(X1) ),
inference(fof_simplification,[status(thm)],[not_ok_or_abnormal]) ).
cnf(c_0_45,plain,
( ~ halfadder(X1)
| logic_not(not1(X1)) ),
inference(fof_simplification,[status(thm)],[halfadder_not1]) ).
cnf(c_0_46,negated_conjecture,
~ abnormal(and1(h)),
c_0_35 ).
cnf(c_0_47,plain,
( ~ one(in2(and1(X1)))
| ~ one(in1(and1(X1)))
| ~ halfadder(X1)
| one(out1(and1(X1)))
| abnormal(and1(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_48,hypothesis,
halfadder(h),
h_isa_halfadder ).
cnf(c_0_49,plain,
( ~ one(X1)
| ~ connection(X1,X2)
| one(X2) ),
c_0_38 ).
cnf(c_0_50,plain,
( ~ halfadder(X1)
| connection(out1(not1(X1)),in2(and1(X1))) ),
c_0_39 ).
cnf(c_0_51,plain,
( ~ halfadder(X1)
| connection(out1(or1(X1)),in1(and1(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_out1or1_in1_and1]) ).
cnf(c_0_52,negated_conjecture,
~ abnormal(or1(h)),
c_0_40 ).
cnf(c_0_53,plain,
( ~ one(in1(or1(X1)))
| ~ halfadder(X1)
| one(out1(or1(X1)))
| abnormal(or1(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_54,plain,
( ~ halfadder(X1)
| connection(in1(X1),in1(or1(X1))) ),
c_0_43 ).
cnf(c_0_55,plain,
( ~ zero(in1(X1))
| ~ not_ok(X1)
| one(out1(X1)) ),
inference(fof_simplification,[status(thm)],[not_0_1_fw]) ).
cnf(c_0_56,plain,
( ~ logic_not(X1)
| abnormal(X1)
| not_ok(X1) ),
c_0_44 ).
cnf(c_0_57,plain,
( ~ halfadder(X1)
| logic_not(not1(X1)) ),
c_0_45 ).
cnf(c_0_58,negated_conjecture,
( ~ one(in2(and1(h)))
| ~ one(in1(and1(h)))
| one(out1(and1(h))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_59,plain,
( ~ one(out1(not1(X1)))
| ~ halfadder(X1)
| one(in2(and1(X1))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_60,plain,
( ~ halfadder(X1)
| connection(out1(or1(X1)),in1(and1(X1))) ),
c_0_51 ).
cnf(c_0_61,negated_conjecture,
( ~ one(in1(or1(h)))
| one(out1(or1(h))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_48])]) ).
cnf(c_0_62,plain,
( ~ one(in1(X1))
| ~ halfadder(X1)
| one(in1(or1(X1))) ),
inference(spm,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_63,hypothesis,
one(in1(h)),
in1_1 ).
cnf(c_0_64,negated_conjecture,
~ abnormal(not1(h)),
inference(fof_simplification,[status(thm)],[diagnosis_not1]) ).
cnf(c_0_65,plain,
( ~ zero(in1(X1))
| ~ not_ok(X1)
| one(out1(X1)) ),
c_0_55 ).
cnf(c_0_66,plain,
( ~ halfadder(X1)
| abnormal(not1(X1))
| not_ok(not1(X1)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
inference(fof_simplification,[status(thm)],[value_propagation_zero1]) ).
cnf(c_0_68,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outc_out1and2]) ).
cnf(c_0_69,negated_conjecture,
( ~ one(out1(not1(h)))
| ~ one(in1(and1(h)))
| one(out1(and1(h))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_48])]) ).
cnf(c_0_70,plain,
( ~ one(out1(or1(X1)))
| ~ halfadder(X1)
| one(in1(and1(X1))) ),
inference(spm,[status(thm)],[c_0_49,c_0_60]) ).
cnf(c_0_71,negated_conjecture,
one(out1(or1(h))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_48]),c_0_63])]) ).
cnf(c_0_72,negated_conjecture,
~ abnormal(not1(h)),
c_0_64 ).
cnf(c_0_73,plain,
( ~ zero(in1(not1(X1)))
| ~ halfadder(X1)
| one(out1(not1(X1)))
| abnormal(not1(X1)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,plain,
( ~ halfadder(X1)
| connection(out1(and2(X1)),in1(not1(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_out1and2_in1not1]) ).
cnf(c_0_75,plain,
( ~ zero(X1)
| ~ connection(X1,X2)
| zero(X2) ),
c_0_67 ).
cnf(c_0_76,plain,
( ~ halfadder(X1)
| connection(outc(X1),out1(and2(X1))) ),
c_0_68 ).
cnf(c_0_77,plain,
( ~ halfadder(X1)
| connection(outs(X1),out1(and1(X1))) ),
inference(fof_simplification,[status(thm)],[halfadder_connection_outs_out1and1]) ).
cnf(c_0_78,negated_conjecture,
( ~ one(out1(not1(h)))
| one(out1(and1(h))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_48]),c_0_71])]) ).
cnf(c_0_79,negated_conjecture,
( ~ zero(in1(not1(h)))
| one(out1(not1(h))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_48])]) ).
cnf(c_0_80,plain,
( ~ halfadder(X1)
| connection(out1(and2(X1)),in1(not1(X1))) ),
c_0_74 ).
cnf(c_0_81,plain,
( ~ zero(outc(X1))
| ~ halfadder(X1)
| zero(out1(and2(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,hypothesis,
zero(outc(h)),
outc_0 ).
cnf(c_0_83,plain,
( ~ halfadder(X1)
| connection(outs(X1),out1(and1(X1))) ),
c_0_77 ).
cnf(c_0_84,plain,
( ~ one(X1)
| ~ zero(X1) ),
inference(fof_simplification,[status(thm)],[unique_value]) ).
cnf(c_0_85,negated_conjecture,
( ~ zero(in1(not1(h)))
| one(out1(and1(h))) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_86,plain,
( ~ zero(out1(and2(X1)))
| ~ halfadder(X1)
| zero(in1(not1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_80]) ).
cnf(c_0_87,hypothesis,
zero(out1(and2(h))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_48])]) ).
cnf(c_0_88,plain,
( ~ zero(outs(X1))
| ~ halfadder(X1)
| zero(out1(and1(X1))) ),
inference(spm,[status(thm)],[c_0_75,c_0_83]) ).
cnf(c_0_89,hypothesis,
zero(outs(h)),
outs_0 ).
cnf(c_0_90,plain,
( ~ one(X1)
| ~ zero(X1) ),
c_0_84 ).
cnf(c_0_91,negated_conjecture,
one(out1(and1(h))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_48]),c_0_87])]) ).
cnf(c_0_92,hypothesis,
zero(out1(and1(h))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_48])]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_92])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV005-2 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.58 % Computer : n009.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Sun Sep 20 20:47:14 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.62 Running first-order theorem proving
% 0.12/0.62 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.16/0.65 % Version: 3.5.1
% 0.16/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.65 % Starting sh5l with 300s (1) cores
% 0.16/0.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 33030 completed with status 0
% 0.16/0.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.65 % No SInE strategy applied
% 0.16/0.65 % Search class: FGHNF-FFMS11-SFFFFFNN
% 0.16/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.65 % Starting new_bool_3 with 136s (1) cores
% 0.16/0.65 % Starting new_bool_1 with 136s (1) cores
% 0.16/0.65 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 33038 completed with status 0
% 0.16/0.65 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.16/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.65 % No SInE strategy applied
% 0.16/0.65 % Search class: FGHNF-FFMS11-SFFFFFNN
% 0.16/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.16/0.65 % Preprocessing time : 0.001 s
% 0.16/0.65 % Presaturation interreduction done
% 0.16/0.65
% 0.16/0.65 % Proof found!
% 0.16/0.65 % SZS status Unsatisfiable
% 0.16/0.65 % SZS output start CNFRefutation
% See solution above
% 0.16/0.65 % Parsed axioms : 48
% 0.16/0.65 % Removed by relevancy pruning/SinE : 0
% 0.16/0.65 % Initial clauses : 48
% 0.16/0.65 % Removed in clause preprocessing : 0
% 0.16/0.65 % Initial clauses in saturation : 48
% 0.16/0.65 % Processed clauses : 209
% 0.16/0.65 % ...of these trivial : 1
% 0.16/0.65 % ...subsumed : 17
% 0.16/0.65 % ...remaining for further processing : 191
% 0.16/0.65 % Other redundant clauses eliminated : 0
% 0.16/0.65 % Clauses deleted for lack of memory : 0
% 0.16/0.65 % Backward-subsumed : 8
% 0.16/0.65 % Backward-rewritten : 9
% 0.16/0.65 % Generated clauses : 155
% 0.16/0.65 % ...of the previous two non-redundant : 127
% 0.16/0.65 % ...aggressively subsumed : 0
% 0.16/0.65 % Contextual simplify-reflections : 0
% 0.16/0.65 % Paramodulations : 155
% 0.16/0.65 % Factorizations : 0
% 0.16/0.65 % NegExts : 0
% 0.16/0.65 % Equation resolutions : 0
% 0.16/0.65 % Disequality decompositions : 0
% 0.16/0.65 % Total rewrite steps : 59
% 0.16/0.65 % ...of those cached : 51
% 0.16/0.65 % Propositional unsat checks : 0
% 0.16/0.65 % Propositional check models : 0
% 0.16/0.65 % Propositional check unsatisfiable : 0
% 0.16/0.65 % Propositional clauses : 0
% 0.16/0.65 % Propositional clauses after purity: 0
% 0.16/0.65 % Propositional unsat core size : 0
% 0.16/0.65 % Propositional preprocessing time : 0.000
% 0.16/0.65 % Propositional encoding time : 0.000
% 0.16/0.65 % Propositional solver time : 0.000
% 0.16/0.65 % Success case prop preproc time : 0.000
% 0.16/0.65 % Success case prop encoding time : 0.000
% 0.16/0.65 % Success case prop solver time : 0.000
% 0.16/0.65 % Current number of processed clauses : 126
% 0.16/0.65 % Positive orientable unit clauses : 9
% 0.16/0.65 % Positive unorientable unit clauses: 0
% 0.16/0.65 % Negative unit clauses : 9
% 0.16/0.65 % Non-unit-clauses : 108
% 0.16/0.65 % Current number of unprocessed clauses: 7
% 0.16/0.65 % ...number of literals in the above : 32
% 0.16/0.65 % Current number of archived formulas : 0
% 0.16/0.65 % Current number of archived clauses : 65
% 0.16/0.65 % Clause-clause subsumption calls (NU) : 1914
% 0.16/0.65 % Rec. Clause-clause subsumption calls : 1292
% 0.16/0.65 % Non-unit clause-clause subsumptions : 8
% 0.16/0.65 % Unit Clause-clause subsumption calls : 44
% 0.16/0.65 % Rewrite failures with RHS unbound : 0
% 0.16/0.65 % BW rewrite match attempts : 6
% 0.16/0.65 % BW rewrite match successes : 2
% 0.16/0.65 % Condensation attempts : 0
% 0.16/0.65 % Condensation successes : 0
% 0.16/0.65 % Termbank termtop insertions : 4908
% 0.16/0.65 % Search garbage collected termcells : 90
% 0.16/0.65
% 0.16/0.65 % -------------------------------------------------
% 0.16/0.65 % User time : 0.009 s
% 0.16/0.65 % System time : 0.002 s
% 0.16/0.65 % Total time : 0.011 s
% 0.16/0.65 % Maximum resident set size: 3616 pages
% 0.16/0.65
% 0.16/0.65 % -------------------------------------------------
% 0.16/0.65 % User time : 0.032 s
% 0.16/0.65 % System time : 0.013 s
% 0.16/0.65 % Total time : 0.045 s
% 0.16/0.65 % Maximum resident set size: 4864 pages
% 0.16/0.65 % E exiting
%------------------------------------------------------------------------------