%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP126-2.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:38:02 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.59s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 91 ( 40 unt; 24 nHn; 89 RR)
% Number of literals : 193 ( 0 equ; 89 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 78 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( ~ 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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function1) ).
cnf(no_redundancy,axiom,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_redundancy) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).
cnf(e_4_greater_e_3,axiom,
greater(e_4,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_greater_e_3) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(e_2_then_e_3,axiom,
next(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_then_e_3) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_idempotence) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_4) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).
cnf(e_2_is_not_e_3,axiom,
~ equalish(e_2,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_2_is_not_e_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(qg4,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg4) ).
cnf(c_0_17,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) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_18,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
inference(fof_simplification,[status(thm)],[no_redundancy]) ).
cnf(c_0_19,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_17 ).
cnf(c_0_20,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_21,plain,
( ~ greater(X2,X3)
| ~ next(X1,X3)
| ~ product(X1,e_1,X2) ),
c_0_18 ).
cnf(c_0_22,axiom,
greater(e_4,e_3),
e_4_greater_e_3 ).
cnf(c_0_23,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_24,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_25,plain,
( ~ group_element(X1)
| product(X1,e_1,e_1)
| product(X1,e_1,e_2)
| product(X1,e_1,e_3)
| product(X1,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_27,plain,
( ~ next(X1,e_3)
| ~ product(X1,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,axiom,
next(e_2,e_3),
e_2_then_e_3 ).
cnf(c_0_29,plain,
~ equalish(e_2,e_1),
c_0_23 ).
cnf(c_0_30,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_24 ).
cnf(c_0_31,plain,
~ equalish(e_1,e_4),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_4]) ).
cnf(c_0_32,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_33,plain,
( product(e_2,e_1,e_4)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
~ product(e_2,e_1,e_4),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_1,X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_37,plain,
~ equalish(e_1,e_4),
c_0_31 ).
cnf(c_0_38,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_32 ).
cnf(c_0_39,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
~ product(e_2,e_1,e_1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_42,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_43,plain,
( ~ product(X1,e_1,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2) ),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
~ equalish(e_2,e_4),
c_0_41 ).
cnf(c_0_46,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_47,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_48,plain,
( ~ group_element(X1)
| product(X1,e_4,e_1)
| product(X1,e_4,e_2)
| product(X1,e_4,e_3)
| product(X1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_19,c_0_42]) ).
cnf(c_0_49,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_50,plain,
( ~ product(e_2,e_4,e_3)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_30]) ).
cnf(c_0_52,plain,
( ~ product(e_1,X1,X2)
| ~ product(e_4,X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_30]) ).
cnf(c_0_53,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_54,plain,
~ equalish(e_2,e_3),
c_0_46 ).
cnf(c_0_55,plain,
~ equalish(e_3,e_4),
c_0_47 ).
cnf(c_0_56,plain,
( product(e_2,e_4,e_4)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_57,plain,
~ product(e_2,e_4,e_3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_36])]) ).
cnf(c_0_58,plain,
~ product(e_2,e_4,e_4),
inference(spm,[status(thm)],[c_0_51,c_0_36]) ).
cnf(c_0_59,plain,
( product(e_4,e_1,e_4)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_2)
| product(e_4,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_42]) ).
cnf(c_0_60,plain,
~ product(e_4,e_1,e_1),
inference(spm,[status(thm)],[c_0_52,c_0_36]) ).
cnf(c_0_61,plain,
( product(e_1,e_4,e_4)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_2)
| product(e_1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_48,c_0_20]) ).
cnf(c_0_62,plain,
~ product(e_1,e_4,e_1),
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_63,plain,
( ~ group_element(X1)
| product(X1,e_3,e_1)
| product(X1,e_3,e_2)
| product(X1,e_3,e_3)
| product(X1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_19,c_0_53]) ).
cnf(c_0_64,plain,
( ~ product(e_2,X1,X2)
| ~ product(e_3,X1,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_30]) ).
cnf(c_0_65,plain,
( ~ product(X1,e_3,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_38]) ).
cnf(c_0_66,plain,
( product(e_2,e_4,e_1)
| product(e_2,e_4,e_2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_67,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_4) ),
inference(sr,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_68,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[qg4]) ).
cnf(c_0_69,plain,
( product(e_1,e_4,e_2)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_4) ),
inference(sr,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_70,plain,
( product(e_2,e_3,e_4)
| 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_63,c_0_26]) ).
cnf(c_0_71,plain,
~ product(e_2,e_3,e_3),
inference(spm,[status(thm)],[c_0_64,c_0_36]) ).
cnf(c_0_72,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_4,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_73,plain,
( ~ product(e_2,e_3,e_1)
| product(e_2,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_74,plain,
( product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_67]),c_0_36])]) ).
cnf(c_0_75,negated_conjecture,
( ~ product(X2,X1,X4)
| ~ product(X1,X2,X3)
| product(X3,X4,X2) ),
c_0_68 ).
cnf(c_0_76,plain,
( product(e_1,e_4,e_3)
| product(e_1,e_4,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_69]),c_0_36])]) ).
cnf(c_0_77,plain,
( product(e_2,e_3,e_1)
| product(e_2,e_3,e_2)
| product(e_2,e_3,e_4) ),
inference(sr,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,plain,
~ product(e_2,e_3,e_1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_36])]) ).
cnf(c_0_79,plain,
( ~ product(e_2,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_51,c_0_74]) ).
cnf(c_0_80,negated_conjecture,
( ~ product(e_4,e_1,X1)
| product(X1,e_3,e_1)
| product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,plain,
( ~ product(X1,e_2,X2)
| ~ product(X1,e_3,X2) ),
inference(spm,[status(thm)],[c_0_54,c_0_38]) ).
cnf(c_0_82,plain,
( product(e_2,e_3,e_4)
| product(e_2,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,negated_conjecture,
( ~ product(e_1,e_4,X1)
| ~ product(e_2,e_1,e_3)
| product(X1,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_75,c_0_79]) ).
cnf(c_0_84,negated_conjecture,
( ~ product(e_2,e_1,e_3)
| product(e_1,e_4,e_2)
| product(e_2,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_80,c_0_79]) ).
cnf(c_0_85,plain,
( ~ product(e_2,e_2,e_4)
| product(e_2,e_3,e_2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,negated_conjecture,
( ~ product(e_1,e_4,X1)
| product(X1,e_2,e_4)
| product(e_2,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_83,c_0_44]) ).
cnf(c_0_87,negated_conjecture,
( product(e_1,e_4,e_2)
| product(e_2,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_44]),c_0_78]) ).
cnf(c_0_88,plain,
~ product(e_2,e_2,e_4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_85]),c_0_36])]) ).
cnf(c_0_89,negated_conjecture,
product(e_2,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_89]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP126-2.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n010.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 19:59:56 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.25/0.51 Running first-order theorem proving
% 0.25/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.25/0.59 % Version: 3.5.1
% 0.25/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.59 % Starting sh5l with 300s (1) cores
% 0.25/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3387152 completed with status 0
% 0.25/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.25/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.59 % No SInE strategy applied
% 0.25/0.59 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.25/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.59 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.25/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.25/0.59 % Starting new_bool_1 with 136s (1) cores
% 0.25/0.59 % G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with pid 3387158 completed with status 0
% 0.25/0.59 % Result found by G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI
% 0.25/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.59 % No SInE strategy applied
% 0.25/0.59 % Search class: FGHNF-FFSM00-SFFFFFNN
% 0.25/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.25/0.59 % Starting G----_404_C05_02_F1_SE_CS_SP_PS_RG_S04AI with 136s (1) cores
% 0.25/0.59 % Preprocessing time : 0.002 s
% 0.25/0.59 % Presaturation interreduction done
% 0.25/0.59
% 0.25/0.59 % Proof found!
% 0.25/0.59 % SZS status Unsatisfiable
% 0.25/0.59 % SZS output start CNFRefutation
% See solution above
% 0.25/0.59 % Parsed axioms : 32
% 0.25/0.59 % Removed by relevancy pruning/SinE : 0
% 0.25/0.59 % Initial clauses : 32
% 0.25/0.59 % Removed in clause preprocessing : 0
% 0.25/0.59 % Initial clauses in saturation : 32
% 0.25/0.59 % Processed clauses : 289
% 0.25/0.59 % ...of these trivial : 0
% 0.25/0.59 % ...subsumed : 37
% 0.25/0.59 % ...remaining for further processing : 252
% 0.25/0.59 % Other redundant clauses eliminated : 0
% 0.25/0.59 % Clauses deleted for lack of memory : 0
% 0.25/0.59 % Backward-subsumed : 51
% 0.25/0.59 % Backward-rewritten : 8
% 0.25/0.59 % Generated clauses : 491
% 0.25/0.59 % ...of the previous two non-redundant : 419
% 0.25/0.59 % ...aggressively subsumed : 0
% 0.25/0.59 % Contextual simplify-reflections : 3
% 0.25/0.59 % Paramodulations : 474
% 0.25/0.59 % Factorizations : 0
% 0.25/0.59 % NegExts : 0
% 0.25/0.59 % Equation resolutions : 0
% 0.25/0.59 % Disequality decompositions : 0
% 0.25/0.59 % Total rewrite steps : 26
% 0.25/0.59 % ...of those cached : 20
% 0.25/0.59 % Propositional unsat checks : 0
% 0.25/0.59 % Propositional check models : 0
% 0.25/0.59 % Propositional check unsatisfiable : 0
% 0.25/0.59 % Propositional clauses : 0
% 0.25/0.59 % Propositional clauses after purity: 0
% 0.25/0.59 % Propositional unsat core size : 0
% 0.25/0.59 % Propositional preprocessing time : 0.000
% 0.25/0.59 % Propositional encoding time : 0.000
% 0.25/0.59 % Propositional solver time : 0.000
% 0.25/0.59 % Success case prop preproc time : 0.000
% 0.25/0.59 % Success case prop encoding time : 0.000
% 0.25/0.59 % Success case prop solver time : 0.000
% 0.25/0.59 % Current number of processed clauses : 144
% 0.25/0.59 % Positive orientable unit clauses : 16
% 0.25/0.59 % Positive unorientable unit clauses: 0
% 0.25/0.59 % Negative unit clauses : 37
% 0.25/0.59 % Non-unit-clauses : 91
% 0.25/0.59 % Current number of unprocessed clauses: 121
% 0.25/0.59 % ...number of literals in the above : 356
% 0.25/0.59 % Current number of archived formulas : 0
% 0.25/0.59 % Current number of archived clauses : 108
% 0.25/0.59 % Clause-clause subsumption calls (NU) : 3714
% 0.25/0.59 % Rec. Clause-clause subsumption calls : 2822
% 0.25/0.59 % Non-unit clause-clause subsumptions : 56
% 0.25/0.59 % Unit Clause-clause subsumption calls : 148
% 0.25/0.59 % Rewrite failures with RHS unbound : 0
% 0.25/0.59 % BW rewrite match attempts : 9
% 0.25/0.59 % BW rewrite match successes : 1
% 0.25/0.59 % Condensation attempts : 0
% 0.25/0.59 % Condensation successes : 0
% 0.25/0.59 % Termbank termtop insertions : 5962
% 0.25/0.59 % Search garbage collected termcells : 56
% 0.25/0.59
% 0.25/0.59 % -------------------------------------------------
% 0.25/0.59 % User time : 0.034 s
% 0.25/0.59 % System time : 0.001 s
% 0.25/0.59 % Total time : 0.036 s
% 0.25/0.59 % Maximum resident set size: 3644 pages
% 0.25/0.59
% 0.25/0.59 % -------------------------------------------------
% 0.25/0.59 % User time : 0.072 s
% 0.25/0.59 % System time : 0.011 s
% 0.25/0.59 % Total time : 0.083 s
% 0.25/0.59 % Maximum resident set size: 4608 pages
% 0.25/0.59 % E exiting
%------------------------------------------------------------------------------