%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP124-8.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 : 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:38:00 PM UTC 2026
% Result : Unsatisfiable 0.28s 0.52s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of clauses : 81 ( 32 unt; 22 nHn; 77 RR)
% Number of literals : 186 ( 0 equ; 80 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 83 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product1_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_4)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_total_function1) ).
cnf(product1_left_cancellation,axiom,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_left_cancellation) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_4) ).
cnf(product1_right_cancellation,axiom,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_right_cancellation) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_3) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product1_idempotence) ).
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(qg2a,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg2a) ).
cnf(e_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(product2_total_function2,axiom,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_total_function2) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_4_is_not_e_2) ).
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(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product2_idempotence) ).
cnf(e_3_is_not_e_2,axiom,
~ equalish(e_3,e_2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_3_is_not_e_2) ).
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(c_0_16,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_4)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product1_total_function1]) ).
cnf(c_0_17,plain,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product1_left_cancellation]) ).
cnf(c_0_18,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product1(X1,X2,e_4)
| product1(X1,X2,e_3)
| product1(X1,X2,e_2)
| product1(X1,X2,e_1) ),
c_0_16 ).
cnf(c_0_19,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_20,plain,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product1_right_cancellation]) ).
cnf(c_0_21,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_22,plain,
( ~ product1(X4,X2,X3)
| ~ product1(X1,X2,X3)
| equalish(X1,X4) ),
c_0_17 ).
cnf(c_0_23,axiom,
product1(X1,X1,X1),
product1_idempotence ).
cnf(c_0_24,plain,
( ~ group_element(X1)
| product1(X1,e_4,e_4)
| product1(X1,e_4,e_3)
| product1(X1,e_4,e_2)
| product1(X1,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_26,plain,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
c_0_20 ).
cnf(c_0_27,plain,
( ~ group_element(X1)
| product1(X1,e_3,e_4)
| product1(X1,e_3,e_3)
| product1(X1,e_3,e_2)
| product1(X1,e_3,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
inference(fof_simplification,[status(thm)],[qg2a]) ).
cnf(c_0_29,plain,
( ~ product1(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
( product1(e_3,e_4,e_1)
| product1(e_3,e_4,e_2)
| product1(e_3,e_4,e_3)
| product1(e_3,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_31,plain,
~ equalish(e_3,e_4),
c_0_25 ).
cnf(c_0_32,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_33,plain,
( ~ product1(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_34,plain,
( product1(e_4,e_3,e_1)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_35,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product2_total_function2]) ).
cnf(c_0_36,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
c_0_28 ).
cnf(c_0_37,plain,
( product1(e_3,e_4,e_3)
| product1(e_3,e_4,e_2)
| product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_38,plain,
~ equalish(e_4,e_3),
c_0_32 ).
cnf(c_0_39,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_40,plain,
( product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31]) ).
cnf(c_0_41,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
c_0_35 ).
cnf(c_0_42,negated_conjecture,
( ~ product1(X1,X2,X1)
| product2(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_43,plain,
( product1(e_3,e_4,e_1)
| product1(e_3,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_37]),c_0_38]) ).
cnf(c_0_44,plain,
~ equalish(e_4,e_2),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_2]) ).
cnf(c_0_45,plain,
( ~ group_element(X1)
| product1(X1,e_2,e_4)
| product1(X1,e_2,e_3)
| product1(X1,e_2,e_2)
| product1(X1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_46,plain,
~ equalish(e_2,e_4),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_4]) ).
cnf(c_0_47,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_48,plain,
( product1(e_4,e_3,e_1)
| product1(e_4,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_40]),c_0_38]) ).
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,
( ~ product1(X2,X3,X2)
| ~ product2(X2,X3,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( ~ product1(e_4,X1,e_3)
| product1(e_3,e_4,e_1)
| product2(e_2,X1,e_4) ),
inference(spm,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_52,plain,
~ equalish(e_4,e_2),
c_0_44 ).
cnf(c_0_53,plain,
( product1(e_4,e_2,e_1)
| product1(e_4,e_2,e_2)
| product1(e_4,e_2,e_3)
| product1(e_4,e_2,e_4) ),
inference(spm,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_54,plain,
~ equalish(e_2,e_4),
c_0_46 ).
cnf(c_0_55,plain,
( ~ product2(X2,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
( ~ product1(e_3,X1,e_4)
| product1(e_4,e_3,e_1)
| product2(e_2,X1,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_48]) ).
cnf(c_0_57,plain,
~ equalish(e_3,e_2),
c_0_49 ).
cnf(c_0_58,negated_conjecture,
( ~ product1(e_4,X1,e_3)
| ~ product1(e_2,X1,e_2)
| product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_59,plain,
( product1(e_4,e_2,e_3)
| product1(e_4,e_2,e_2)
| product1(e_4,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_53]),c_0_54]) ).
cnf(c_0_60,negated_conjecture,
( ~ product1(e_3,e_2,e_4)
| product1(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( product1(e_3,e_4,e_1)
| product1(e_4,e_2,e_1)
| product1(e_4,e_2,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_23])]) ).
cnf(c_0_62,plain,
~ equalish(e_2,e_3),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_3]) ).
cnf(c_0_63,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| ~ product1(e_3,e_2,e_4)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_26,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
( product1(e_4,e_2,e_1)
| product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_61]),c_0_52]) ).
cnf(c_0_65,plain,
~ equalish(e_2,e_3),
c_0_62 ).
cnf(c_0_66,negated_conjecture,
( ~ product1(e_3,X1,e_4)
| ~ product1(e_3,e_2,e_4)
| product2(e_1,X1,e_3) ),
inference(spm,[status(thm)],[c_0_36,c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( ~ product1(e_3,e_2,e_4)
| product1(e_3,e_4,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( ~ product1(e_3,X2,e_4)
| ~ product1(e_3,e_2,e_4)
| ~ product2(e_1,X2,X1)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_41,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
( ~ product1(e_4,X1,e_3)
| ~ product1(e_3,e_2,e_4)
| product2(e_1,X1,e_4) ),
inference(spm,[status(thm)],[c_0_36,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
( ~ product1(e_4,X1,e_3)
| ~ product1(e_3,X1,e_4)
| ~ product1(e_3,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_38]) ).
cnf(c_0_71,negated_conjecture,
( ~ product1(e_3,e_2,e_4)
| product1(e_4,e_2,e_1)
| product1(e_4,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_70,c_0_59]) ).
cnf(c_0_72,negated_conjecture,
( ~ product1(e_3,e_2,e_4)
| product1(e_4,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_71]),c_0_52]) ).
cnf(c_0_73,negated_conjecture,
~ product1(e_3,e_2,e_4),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_72]),c_0_65]) ).
cnf(c_0_74,plain,
( product1(e_3,e_2,e_1)
| product1(e_3,e_2,e_2)
| product1(e_3,e_2,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_21]),c_0_73]) ).
cnf(c_0_75,plain,
( product1(e_3,e_2,e_2)
| product1(e_3,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_74]),c_0_65]) ).
cnf(c_0_76,plain,
product1(e_3,e_2,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_75]),c_0_57]) ).
cnf(c_0_77,negated_conjecture,
( ~ product1(X1,e_2,e_1)
| equalish(X1,e_4)
| product1(e_3,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_22,c_0_64]) ).
cnf(c_0_78,plain,
( ~ product1(e_3,X1,e_1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_26,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
product1(e_3,e_4,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_76]),c_0_31]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP124-8.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 19:54:27 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.28/0.52 % Version: 3.5.1
% 0.28/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.52 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.52 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.52 % Starting sh5l with 300s (1) cores
% 0.28/0.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 492969 completed with status 0
% 0.28/0.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.28/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.52 % No SInE strategy applied
% 0.28/0.52 % Search class: FGHNS-FFMM00-SFFFFFNN
% 0.28/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.28/0.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.28/0.52 % Starting new_bool_3 with 136s (1) cores
% 0.28/0.52 % Starting new_bool_1 with 136s (1) cores
% 0.28/0.52 % SubtermCWHack with pid 492974 completed with status 0
% 0.28/0.52 % Result found by SubtermCWHack
% 0.28/0.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.52 % No SInE strategy applied
% 0.28/0.52 % Search class: FGHNS-FFMM00-SFFFFFNN
% 0.28/0.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.52 % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.52 % Preprocessing time : 0.002 s
% 0.28/0.52
% 0.28/0.52 % Proof found!
% 0.28/0.52 % SZS status Unsatisfiable
% 0.28/0.52 % SZS output start CNFRefutation
% See solution above
% 0.28/0.52 % Parsed axioms : 48
% 0.28/0.52 % Removed by relevancy pruning/SinE : 0
% 0.28/0.52 % Initial clauses : 48
% 0.28/0.52 % Removed in clause preprocessing : 0
% 0.28/0.52 % Initial clauses in saturation : 48
% 0.28/0.52 % Processed clauses : 383
% 0.28/0.52 % ...of these trivial : 0
% 0.28/0.52 % ...subsumed : 99
% 0.28/0.52 % ...remaining for further processing : 284
% 0.28/0.52 % Other redundant clauses eliminated : 0
% 0.28/0.52 % Clauses deleted for lack of memory : 0
% 0.28/0.52 % Backward-subsumed : 75
% 0.28/0.52 % Backward-rewritten : 25
% 0.28/0.52 % Generated clauses : 765
% 0.28/0.52 % ...of the previous two non-redundant : 578
% 0.28/0.52 % ...aggressively subsumed : 0
% 0.28/0.52 % Contextual simplify-reflections : 1
% 0.28/0.52 % Paramodulations : 765
% 0.28/0.52 % Factorizations : 0
% 0.28/0.52 % NegExts : 0
% 0.28/0.52 % Equation resolutions : 0
% 0.28/0.52 % Disequality decompositions : 0
% 0.28/0.52 % Total rewrite steps : 232
% 0.28/0.52 % ...of those cached : 209
% 0.28/0.52 % Propositional unsat checks : 0
% 0.28/0.52 % Propositional check models : 0
% 0.28/0.52 % Propositional check unsatisfiable : 0
% 0.28/0.52 % Propositional clauses : 0
% 0.28/0.52 % Propositional clauses after purity: 0
% 0.28/0.52 % Propositional unsat core size : 0
% 0.28/0.52 % Propositional preprocessing time : 0.000
% 0.28/0.52 % Propositional encoding time : 0.000
% 0.28/0.52 % Propositional solver time : 0.000
% 0.28/0.52 % Success case prop preproc time : 0.000
% 0.28/0.52 % Success case prop encoding time : 0.000
% 0.28/0.52 % Success case prop solver time : 0.000
% 0.28/0.52 % Current number of processed clauses : 184
% 0.28/0.52 % Positive orientable unit clauses : 24
% 0.28/0.52 % Positive unorientable unit clauses: 0
% 0.28/0.52 % Negative unit clauses : 16
% 0.28/0.52 % Non-unit-clauses : 144
% 0.28/0.52 % Current number of unprocessed clauses: 155
% 0.28/0.52 % ...number of literals in the above : 774
% 0.28/0.52 % Current number of archived formulas : 0
% 0.28/0.52 % Current number of archived clauses : 100
% 0.28/0.52 % Clause-clause subsumption calls (NU) : 12905
% 0.28/0.52 % Rec. Clause-clause subsumption calls : 7492
% 0.28/0.52 % Non-unit clause-clause subsumptions : 114
% 0.28/0.52 % Unit Clause-clause subsumption calls : 532
% 0.28/0.52 % Rewrite failures with RHS unbound : 0
% 0.28/0.52 % BW rewrite match attempts : 21
% 0.28/0.52 % BW rewrite match successes : 3
% 0.28/0.52 % Condensation attempts : 0
% 0.28/0.52 % Condensation successes : 0
% 0.28/0.52 % Termbank termtop insertions : 13847
% 0.28/0.52 % Search garbage collected termcells : 114
% 0.28/0.52
% 0.28/0.52 % -------------------------------------------------
% 0.28/0.52 % User time : 0.062 s
% 0.28/0.52 % System time : 0.003 s
% 0.28/0.52 % Total time : 0.065 s
% 0.28/0.52 % Maximum resident set size: 3612 pages
% 0.28/0.52
% 0.28/0.52 % -------------------------------------------------
% 0.28/0.52 % User time : 0.207 s
% 0.28/0.52 % System time : 0.018 s
% 0.28/0.52 % Total time : 0.225 s
% 0.28/0.52 % Maximum resident set size: 4608 pages
% 0.28/0.52 % E exiting
%------------------------------------------------------------------------------