%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP124-6.004 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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.30s 0.65s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 16
% Syntax : Number of clauses : 80 ( 32 unt; 23 nHn; 76 RR)
% Number of literals : 184 ( 0 equ; 76 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 : 77 ( 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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',product1_left_cancellation) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(product1_right_cancellation,axiom,
( ~ product1(X1,X4,X3)
| ~ product1(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_right_cancellation) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_4) ).
cnf(product1_idempotence,axiom,
product1(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product1_idempotence) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_1) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_4) ).
cnf(product2_total_function2,axiom,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product2_total_function2) ).
cnf(qg2a,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg2a) ).
cnf(element_3,axiom,
group_element(e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_3) ).
cnf(product2_idempotence,axiom,
product2(X1,X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product2_idempotence) ).
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(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_4_is_not_e_3,axiom,
~ equalish(e_4,e_3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_4_is_not_e_3) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_3_is_not_e_4) ).
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_1),
element_1 ).
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_4),
element_4 ).
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_1,e_4)
| product1(X1,e_1,e_3)
| product1(X1,e_1,e_2)
| product1(X1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
~ equalish(e_4,e_1),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_1]) ).
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_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_21]) ).
cnf(c_0_28,plain,
( ~ product1(X1,X2,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( product1(e_4,e_1,e_1)
| product1(e_4,e_1,e_2)
| product1(e_4,e_1,e_3)
| product1(e_4,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_30,plain,
~ equalish(e_4,e_1),
c_0_25 ).
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,
( ~ product1(X2,X1,X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_33,plain,
( product1(e_1,e_4,e_1)
| product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_3)
| product1(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_34,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[product2_total_function2]) ).
cnf(c_0_35,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
inference(fof_simplification,[status(thm)],[qg2a]) ).
cnf(c_0_36,plain,
( product1(e_4,e_1,e_4)
| product1(e_4,e_1,e_3)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_37,plain,
~ equalish(e_1,e_4),
c_0_31 ).
cnf(c_0_38,axiom,
group_element(e_3),
element_3 ).
cnf(c_0_39,plain,
( product1(e_1,e_4,e_4)
| product1(e_1,e_4,e_3)
| product1(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30]) ).
cnf(c_0_40,plain,
( ~ product2(X1,X2,X4)
| ~ product2(X1,X2,X3)
| equalish(X3,X4) ),
c_0_34 ).
cnf(c_0_41,axiom,
product2(X1,X1,X1),
product2_idempotence ).
cnf(c_0_42,negated_conjecture,
( ~ product1(X3,X1,X4)
| ~ product1(X1,X2,X3)
| product2(X4,X2,X1) ),
c_0_35 ).
cnf(c_0_43,plain,
( product1(e_4,e_1,e_2)
| product1(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_37]) ).
cnf(c_0_44,plain,
~ equalish(e_1,e_3),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_3]) ).
cnf(c_0_45,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_38]) ).
cnf(c_0_46,plain,
~ equalish(e_3,e_1),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_1]) ).
cnf(c_0_47,plain,
( product1(e_1,e_4,e_2)
| product1(e_1,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_39]),c_0_37]) ).
cnf(c_0_48,plain,
~ equalish(e_4,e_3),
inference(fof_simplification,[status(thm)],[e_4_is_not_e_3]) ).
cnf(c_0_49,plain,
( ~ product2(X2,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,negated_conjecture,
( ~ product1(e_1,X1,e_4)
| product1(e_4,e_1,e_2)
| product2(e_3,X1,e_1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_51,plain,
~ equalish(e_1,e_3),
c_0_44 ).
cnf(c_0_52,plain,
( product1(e_1,e_3,e_1)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_4) ),
inference(spm,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_53,plain,
~ equalish(e_3,e_1),
c_0_46 ).
cnf(c_0_54,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| product1(e_1,e_4,e_2)
| product2(e_3,X1,e_4) ),
inference(spm,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_55,plain,
~ equalish(e_4,e_3),
c_0_48 ).
cnf(c_0_56,negated_conjecture,
( ~ product1(e_1,e_3,e_4)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_57,plain,
( product1(e_1,e_3,e_4)
| product1(e_1,e_3,e_3)
| product1(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_52]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( ~ product1(e_4,e_3,e_1)
| product1(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_54]),c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( product1(e_4,e_1,e_2)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
~ equalish(e_3,e_4),
inference(fof_simplification,[status(thm)],[e_3_is_not_e_4]) ).
cnf(c_0_61,negated_conjecture,
( ~ product1(e_1,X1,e_2)
| ~ product1(e_4,e_3,e_1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_26,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( product1(e_1,e_3,e_2)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_59]),c_0_51]) ).
cnf(c_0_63,plain,
~ equalish(e_3,e_4),
c_0_60 ).
cnf(c_0_64,negated_conjecture,
( ~ product1(e_4,X1,e_1)
| ~ product1(e_4,e_3,e_1)
| product2(e_2,X1,e_4) ),
inference(spm,[status(thm)],[c_0_42,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
( ~ product1(e_4,e_3,e_1)
| product1(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]) ).
cnf(c_0_66,negated_conjecture,
( ~ product1(e_4,X2,e_1)
| ~ product1(e_4,e_3,e_1)
| ~ product2(e_2,X2,X1)
| equalish(X1,e_4) ),
inference(spm,[status(thm)],[c_0_40,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( ~ product1(e_1,X1,e_4)
| ~ product1(e_4,e_3,e_1)
| product2(e_2,X1,e_1) ),
inference(spm,[status(thm)],[c_0_42,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( ~ product1(e_1,X1,e_4)
| ~ product1(e_4,X1,e_1)
| ~ product1(e_4,e_3,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_37]) ).
cnf(c_0_69,negated_conjecture,
( ~ product1(e_4,e_3,e_1)
| product1(e_1,e_3,e_2)
| product1(e_1,e_3,e_3) ),
inference(spm,[status(thm)],[c_0_68,c_0_57]) ).
cnf(c_0_70,negated_conjecture,
( ~ product1(e_4,e_3,e_1)
| product1(e_1,e_3,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_69]),c_0_51]) ).
cnf(c_0_71,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_45,c_0_21]) ).
cnf(c_0_72,negated_conjecture,
~ product1(e_4,e_3,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_70]),c_0_63]) ).
cnf(c_0_73,plain,
( product1(e_4,e_3,e_4)
| product1(e_4,e_3,e_3)
| product1(e_4,e_3,e_2) ),
inference(sr,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_74,plain,
( product1(e_4,e_3,e_2)
| product1(e_4,e_3,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_73]),c_0_63]) ).
cnf(c_0_75,plain,
product1(e_4,e_3,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_74]),c_0_55]) ).
cnf(c_0_76,negated_conjecture,
( ~ product1(X1,e_3,e_2)
| equalish(X1,e_1)
| product1(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_62]) ).
cnf(c_0_77,plain,
( ~ product1(e_4,X1,e_2)
| equalish(X1,e_3) ),
inference(spm,[status(thm)],[c_0_26,c_0_75]) ).
cnf(c_0_78,negated_conjecture,
product1(e_4,e_1,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_75]),c_0_30]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP124-6.004 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.51 % Computer : n002.cluster.edu
% 0.19/0.51 % Model : x86_64 x86_64
% 0.19/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.51 % Memory : 8046.5625MB
% 0.19/0.51 % OS : Linux 6.8.0-71-generic
% 0.19/0.51 % CPULimit : 300
% 0.19/0.51 % WCLimit : 300
% 0.19/0.51 % DateTime : Sun Sep 20 20:02:03 UTC 2026
% 0.19/0.52 % CPUTime :
% 0.19/0.52 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.59 Running first-order theorem proving
% 0.19/0.59 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.30/0.65 % Version: 3.5.1
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % sh5l with pid 1577707 completed with status 0
% 0.30/0.65 % Result found by sh5l
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.65 % Search class: FGUNS-FFSS00-SFFFFFNN
% 0.30/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.65 % SubtermCWHack with pid 1577715 completed with status 0
% 0.30/0.65 % Result found by SubtermCWHack
% 0.30/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.65 % Starting sh5l with 300s (1) cores
% 0.30/0.65 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.65 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.65 % Search class: FGUNS-FFSS00-SFFFFFNN
% 0.30/0.65 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.65 % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.65 % Preprocessing time : 0.002 s
% 0.30/0.65
% 0.30/0.65 % Proof found!
% 0.30/0.65 % SZS status Unsatisfiable
% 0.30/0.65 % SZS output start CNFRefutation
% See solution above
% 0.30/0.66 % Parsed axioms : 27
% 0.30/0.66 % Removed by relevancy pruning/SinE : 0
% 0.30/0.66 % Initial clauses : 27
% 0.30/0.66 % Removed in clause preprocessing : 0
% 0.30/0.66 % Initial clauses in saturation : 27
% 0.30/0.66 % Processed clauses : 200
% 0.30/0.66 % ...of these trivial : 0
% 0.30/0.66 % ...subsumed : 37
% 0.30/0.66 % ...remaining for further processing : 163
% 0.30/0.66 % Other redundant clauses eliminated : 0
% 0.30/0.66 % Clauses deleted for lack of memory : 0
% 0.30/0.66 % Backward-subsumed : 60
% 0.30/0.66 % Backward-rewritten : 17
% 0.30/0.66 % Generated clauses : 441
% 0.30/0.66 % ...of the previous two non-redundant : 359
% 0.30/0.66 % ...aggressively subsumed : 0
% 0.30/0.66 % Contextual simplify-reflections : 0
% 0.30/0.66 % Paramodulations : 439
% 0.30/0.66 % Factorizations : 0
% 0.30/0.66 % NegExts : 0
% 0.30/0.66 % Equation resolutions : 0
% 0.30/0.66 % Disequality decompositions : 0
% 0.30/0.66 % Total rewrite steps : 103
% 0.30/0.66 % ...of those cached : 88
% 0.30/0.66 % Propositional unsat checks : 0
% 0.30/0.66 % Propositional check models : 0
% 0.30/0.66 % Propositional check unsatisfiable : 0
% 0.30/0.66 % Propositional clauses : 0
% 0.30/0.66 % Propositional clauses after purity: 0
% 0.30/0.66 % Propositional unsat core size : 0
% 0.30/0.66 % Propositional preprocessing time : 0.000
% 0.30/0.66 % Propositional encoding time : 0.000
% 0.30/0.66 % Propositional solver time : 0.000
% 0.30/0.66 % Success case prop preproc time : 0.000
% 0.30/0.66 % Success case prop encoding time : 0.000
% 0.30/0.66 % Success case prop solver time : 0.000
% 0.30/0.66 % Current number of processed clauses : 84
% 0.30/0.66 % Positive orientable unit clauses : 9
% 0.30/0.66 % Positive unorientable unit clauses: 0
% 0.30/0.66 % Negative unit clauses : 16
% 0.30/0.66 % Non-unit-clauses : 59
% 0.30/0.66 % Current number of unprocessed clauses: 160
% 0.30/0.66 % ...number of literals in the above : 689
% 0.30/0.66 % Current number of archived formulas : 0
% 0.30/0.66 % Current number of archived clauses : 79
% 0.30/0.66 % Clause-clause subsumption calls (NU) : 1955
% 0.30/0.66 % Rec. Clause-clause subsumption calls : 1334
% 0.30/0.66 % Non-unit clause-clause subsumptions : 44
% 0.30/0.66 % Unit Clause-clause subsumption calls : 182
% 0.30/0.66 % Rewrite failures with RHS unbound : 0
% 0.30/0.66 % BW rewrite match attempts : 19
% 0.30/0.66 % BW rewrite match successes : 2
% 0.30/0.66 % Condensation attempts : 0
% 0.30/0.66 % Condensation successes : 0
% 0.30/0.66 % Termbank termtop insertions : 6889
% 0.30/0.66 % Search garbage collected termcells : 64
% 0.30/0.66
% 0.30/0.66 % -------------------------------------------------
% 0.30/0.66 % User time : 0.023 s
% 0.30/0.66 % System time : 0.006 s
% 0.30/0.66 % Total time : 0.029 s
% 0.30/0.66 % Maximum resident set size: 3644 pages
% 0.30/0.66
% 0.30/0.66 % -------------------------------------------------
% 0.30/0.66 % User time : 0.027 s
% 0.30/0.66 % System time : 0.011 s
% 0.30/0.66 % Total time : 0.038 s
% 0.30/0.66 % Maximum resident set size: 4608 pages
% 0.30/0.66 % E exiting
%------------------------------------------------------------------------------