%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP128-4.003 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:42:30 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.44s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 16
% Syntax : Number of clauses : 81 ( 28 unt; 33 nHn; 81 RR)
% Number of literals : 197 ( 0 equ; 81 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 100 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(qg3,negated_conjecture,
( ~ product(X3,X2,X4)
| ~ product(X1,X2,X3)
| product(X1,X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg3) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(e_1_is_not_e_3,axiom,
~ equalish(e_1,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_3) ).
cnf(qg3_1,negated_conjecture,
( ~ product(X3,X2,X4)
| ~ product(X1,X3,X4)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg3_1) ).
cnf(qg3_2,negated_conjecture,
( ~ product(X4,X2,X1)
| ~ product(X4,X1,X3)
| product(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg3_2) ).
cnf(row_surjectivity,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product(e_3,X1,X2)
| product(e_2,X1,X2)
| product(e_1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',row_surjectivity) ).
cnf(product_total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function2) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
cnf(e_3_is_not_e_1,axiom,
~ equalish(e_3,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_1) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(c_0_16,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_17,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_3)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_16 ).
cnf(c_0_18,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_19,negated_conjecture,
( ~ product(X3,X2,X4)
| ~ product(X1,X2,X3)
| product(X1,X3,X4) ),
inference(fof_simplification,[status(thm)],[qg3]) ).
cnf(c_0_20,plain,
( ~ group_element(X1)
| product(X1,e_3,e_1)
| product(X1,e_3,e_2)
| product(X1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_22,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_23,negated_conjecture,
( ~ product(X3,X2,X4)
| ~ product(X1,X2,X3)
| product(X1,X3,X4) ),
c_0_19 ).
cnf(c_0_24,plain,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_26,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
( ~ product(X1,e_3,e_1)
| product(X1,e_1,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_29,negated_conjecture,
( ~ product(X3,X2,X4)
| ~ product(X1,X3,X4)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[qg3_1]) ).
cnf(c_0_30,plain,
( ~ group_element(X1)
| product(X1,e_2,e_1)
| product(X1,e_2,e_2)
| product(X1,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ product(X4,X2,X1)
| ~ product(X4,X1,X3)
| product(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[qg3_2]) ).
cnf(c_0_32,plain,
( ~ product(e_1,X1,e_1)
| product(e_1,e_3,e_2)
| product(e_1,e_3,e_3)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2)
| product(e_1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_34,plain,
~ equalish(e_1,e_3),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
( ~ product(X3,X2,X4)
| ~ product(X1,X3,X4)
| product(X1,X2,X3) ),
c_0_29 ).
cnf(c_0_36,plain,
( product(e_2,e_2,e_3)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_37,negated_conjecture,
( ~ product(X4,X2,X1)
| ~ product(X4,X1,X3)
| product(X1,X2,X3) ),
c_0_31 ).
cnf(c_0_38,negated_conjecture,
( product(e_1,e_3,e_3)
| product(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_39,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(e_3,X1,X2)
| product(e_2,X1,X2)
| product(e_1,X1,X2) ),
inference(fof_simplification,[status(thm)],[row_surjectivity]) ).
cnf(c_0_40,negated_conjecture,
( ~ product(X1,e_2,e_1)
| product(X1,e_2,e_2)
| product(e_2,e_2,e_2)
| product(e_2,e_2,e_3) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product_total_function2]) ).
cnf(c_0_42,negated_conjecture,
( ~ product(e_1,e_3,X1)
| product(e_3,e_3,X1)
| product(e_1,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(e_3,X1,X2)
| product(e_2,X1,X2)
| product(e_1,X1,X2) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( product(e_2,e_2,e_3)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_45,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_46,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_41 ).
cnf(c_0_47,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_42,c_0_38]) ).
cnf(c_0_48,plain,
( ~ group_element(X1)
| product(e_1,X1,e_3)
| product(e_2,X1,e_3)
| product(e_3,X1,e_3) ),
inference(spm,[status(thm)],[c_0_43,c_0_18]) ).
cnf(c_0_49,plain,
~ equalish(e_3,e_2),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_2]) ).
cnf(c_0_50,negated_conjecture,
( ~ product(X1,e_2,e_3)
| product(X1,e_2,e_2)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_35,c_0_44]) ).
cnf(c_0_51,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_45 ).
cnf(c_0_52,negated_conjecture,
( ~ product(e_1,e_3,X1)
| product(e_3,e_3,e_3)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,plain,
( product(e_3,e_3,e_3)
| product(e_2,e_3,e_3)
| product(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_48,c_0_18]) ).
cnf(c_0_54,plain,
~ equalish(e_3,e_2),
c_0_49 ).
cnf(c_0_55,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_56,negated_conjecture,
product(e_2,e_2,e_2),
inference(spm,[status(thm)],[c_0_50,c_0_44]) ).
cnf(c_0_57,plain,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_58,negated_conjecture,
( ~ product(X1,e_3,e_3)
| product(e_1,e_3,e_2)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_51,c_0_38]) ).
cnf(c_0_59,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_2,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_60,plain,
~ equalish(e_3,e_1),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
( ~ product(e_2,X1,e_2)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_56]) ).
cnf(c_0_62,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_63,negated_conjecture,
( ~ product(X1,e_3,e_1)
| product(X1,e_3,e_3)
| product(e_3,e_3,e_2)
| product(e_3,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_35,c_0_57]) ).
cnf(c_0_64,negated_conjecture,
( product(e_1,e_3,e_2)
| product(e_2,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]) ).
cnf(c_0_65,plain,
( product(e_2,e_3,e_3)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_66,negated_conjecture,
~ product(e_2,e_3,e_2),
inference(spm,[status(thm)],[c_0_54,c_0_61]) ).
cnf(c_0_67,plain,
~ equalish(e_1,e_2),
c_0_62 ).
cnf(c_0_68,negated_conjecture,
( product(e_3,e_3,e_3)
| product(e_3,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_63,c_0_57]) ).
cnf(c_0_69,negated_conjecture,
( ~ product(X1,e_3,e_1)
| product(X1,e_1,e_2)
| product(e_2,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_23,c_0_64]) ).
cnf(c_0_70,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_3) ),
inference(sr,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,negated_conjecture,
~ product(e_2,e_1,e_2),
inference(spm,[status(thm)],[c_0_67,c_0_61]) ).
cnf(c_0_72,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_73,negated_conjecture,
( ~ product(X1,e_3,e_3)
| product(e_3,e_3,e_2)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_51,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
product(e_2,e_3,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_75,plain,
~ equalish(e_2,e_3),
c_0_72 ).
cnf(c_0_76,negated_conjecture,
( ~ product(X1,e_3,e_2)
| product(e_3,e_3,e_3)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_51,c_0_47]) ).
cnf(c_0_77,negated_conjecture,
product(e_3,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_78,negated_conjecture,
( ~ product(X1,e_3,e_3)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_51,c_0_74]) ).
cnf(c_0_79,negated_conjecture,
product(e_3,e_3,e_3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_60]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP128-4.003 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n006.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 20:00:13 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.12/0.44 % Version: 3.5.1
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44 % Starting sh5l with 300s (1) cores
% 0.12/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1138253 completed with status 0
% 0.12/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.12/0.44 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.44 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1138258 completed with status 0
% 0.12/0.44 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44 % No SInE strategy applied
% 0.12/0.44 % Search class: FGUNF-FFSS00-SFFFFFNN
% 0.12/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44 % Preprocessing time : 0.001 s
% 0.12/0.44 % Presaturation interreduction done
% 0.12/0.44
% 0.12/0.44 % Proof found!
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start CNFRefutation
% See solution above
% 0.12/0.44 % Parsed axioms : 18
% 0.12/0.44 % Removed by relevancy pruning/SinE : 0
% 0.12/0.44 % Initial clauses : 18
% 0.12/0.44 % Removed in clause preprocessing : 0
% 0.12/0.44 % Initial clauses in saturation : 18
% 0.12/0.44 % Processed clauses : 242
% 0.12/0.44 % ...of these trivial : 0
% 0.12/0.44 % ...subsumed : 32
% 0.12/0.44 % ...remaining for further processing : 210
% 0.12/0.44 % Other redundant clauses eliminated : 0
% 0.12/0.44 % Clauses deleted for lack of memory : 0
% 0.12/0.44 % Backward-subsumed : 35
% 0.12/0.44 % Backward-rewritten : 67
% 0.12/0.44 % Generated clauses : 662
% 0.12/0.44 % ...of the previous two non-redundant : 633
% 0.12/0.44 % ...aggressively subsumed : 0
% 0.12/0.44 % Contextual simplify-reflections : 0
% 0.12/0.44 % Paramodulations : 641
% 0.12/0.44 % Factorizations : 0
% 0.12/0.44 % NegExts : 0
% 0.12/0.44 % Equation resolutions : 0
% 0.12/0.44 % Disequality decompositions : 0
% 0.12/0.44 % Total rewrite steps : 71
% 0.12/0.44 % ...of those cached : 63
% 0.12/0.44 % Propositional unsat checks : 0
% 0.12/0.44 % Propositional check models : 0
% 0.12/0.44 % Propositional check unsatisfiable : 0
% 0.12/0.44 % Propositional clauses : 0
% 0.12/0.44 % Propositional clauses after purity: 0
% 0.12/0.44 % Propositional unsat core size : 0
% 0.12/0.44 % Propositional preprocessing time : 0.000
% 0.12/0.44 % Propositional encoding time : 0.000
% 0.12/0.44 % Propositional solver time : 0.000
% 0.12/0.44 % Success case prop preproc time : 0.000
% 0.12/0.44 % Success case prop encoding time : 0.000
% 0.12/0.44 % Success case prop solver time : 0.000
% 0.12/0.44 % Current number of processed clauses : 69
% 0.12/0.44 % Positive orientable unit clauses : 12
% 0.12/0.44 % Positive unorientable unit clauses: 0
% 0.12/0.44 % Negative unit clauses : 14
% 0.12/0.44 % Non-unit-clauses : 43
% 0.12/0.44 % Current number of unprocessed clauses: 421
% 0.12/0.44 % ...number of literals in the above : 1541
% 0.12/0.44 % Current number of archived formulas : 0
% 0.12/0.44 % Current number of archived clauses : 141
% 0.12/0.44 % Clause-clause subsumption calls (NU) : 1452
% 0.12/0.44 % Rec. Clause-clause subsumption calls : 710
% 0.12/0.44 % Non-unit clause-clause subsumptions : 60
% 0.12/0.44 % Unit Clause-clause subsumption calls : 241
% 0.12/0.44 % Rewrite failures with RHS unbound : 0
% 0.12/0.44 % BW rewrite match attempts : 28
% 0.12/0.44 % BW rewrite match successes : 8
% 0.12/0.44 % Condensation attempts : 0
% 0.12/0.44 % Condensation successes : 0
% 0.12/0.44 % Termbank termtop insertions : 9760
% 0.12/0.44 % Search garbage collected termcells : 48
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.018 s
% 0.12/0.44 % System time : 0.003 s
% 0.12/0.44 % Total time : 0.021 s
% 0.12/0.44 % Maximum resident set size: 3640 pages
% 0.12/0.44
% 0.12/0.44 % -------------------------------------------------
% 0.12/0.44 % User time : 0.081 s
% 0.12/0.44 % System time : 0.014 s
% 0.12/0.44 % Total time : 0.094 s
% 0.12/0.44 % Maximum resident set size: 4864 pages
% 0.12/0.44 % E exiting
%------------------------------------------------------------------------------