TSTP Solution File: GRP124-4.004 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : GRP124-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:45:31 EDT 2023
% Result : Unsatisfiable 0.19s 0.51s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of clauses : 70 ( 24 unt; 31 nHn; 68 RR)
% Number of literals : 183 ( 0 equ; 64 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',product_total_function1) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',element_1) ).
cnf(product_left_cancellation,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',product_left_cancellation) ).
cnf(product_idempotence,axiom,
product(X1,X1,X1),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',product_idempotence) ).
cnf(element_4,axiom,
group_element(e_4),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',element_4) ).
cnf(column_surjectivity,axiom,
( product(X1,e_1,X2)
| product(X1,e_2,X2)
| product(X1,e_3,X2)
| product(X1,e_4,X2)
| ~ group_element(X1)
| ~ group_element(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',column_surjectivity) ).
cnf(product_right_cancellation,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',product_right_cancellation) ).
cnf(e_4_is_not_e_1,axiom,
~ equalish(e_4,e_1),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_4_is_not_e_1) ).
cnf(product_total_function2,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',product_total_function2) ).
cnf(qg2_2,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',qg2_2) ).
cnf(e_1_is_not_e_4,axiom,
~ equalish(e_1,e_4),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_1_is_not_e_4) ).
cnf(e_3_is_not_e_4,axiom,
~ equalish(e_3,e_4),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_3_is_not_e_4) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',element_2) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_1_is_not_e_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_2_is_not_e_1) ).
cnf(e_4_is_not_e_2,axiom,
~ equalish(e_4,e_2),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_4_is_not_e_2) ).
cnf(e_2_is_not_e_4,axiom,
~ equalish(e_2,e_4),
file('/export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p',e_2_is_not_e_4) ).
cnf(c_0_17,axiom,
( product(X1,X2,e_1)
| product(X1,X2,e_2)
| product(X1,X2,e_3)
| product(X1,X2,e_4)
| ~ group_element(X1)
| ~ group_element(X2) ),
product_total_function1 ).
cnf(c_0_18,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_19,axiom,
( equalish(X1,X4)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X3) ),
product_left_cancellation ).
cnf(c_0_20,axiom,
product(X1,X1,X1),
product_idempotence ).
cnf(c_0_21,plain,
( product(X1,e_1,e_4)
| product(X1,e_1,e_3)
| product(X1,e_1,e_2)
| product(X1,e_1,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
group_element(e_4),
element_4 ).
cnf(c_0_23,axiom,
( product(X1,e_1,X2)
| product(X1,e_2,X2)
| product(X1,e_3,X2)
| product(X1,e_4,X2)
| ~ group_element(X1)
| ~ group_element(X2) ),
column_surjectivity ).
cnf(c_0_24,axiom,
( equalish(X2,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X3) ),
product_right_cancellation ).
cnf(c_0_25,plain,
( equalish(X1,X2)
| ~ product(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( product(e_4,e_1,e_1)
| product(e_4,e_1,e_2)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
~ equalish(e_4,e_1),
e_4_is_not_e_1 ).
cnf(c_0_28,axiom,
( equalish(X3,X4)
| ~ product(X1,X2,X3)
| ~ product(X1,X2,X4) ),
product_total_function2 ).
cnf(c_0_29,plain,
( product(X1,e_4,e_4)
| product(X1,e_3,e_4)
| product(X1,e_2,e_4)
| product(X1,e_1,e_4)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( equalish(X2,X5)
| ~ product(X1,X2,X3)
| ~ product(X4,X5,X3)
| ~ product(X6,X1,X2)
| ~ product(X6,X4,X5) ),
qg2_2 ).
cnf(c_0_31,plain,
( equalish(X1,X2)
| ~ product(X2,X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_32,plain,
( product(e_4,e_1,e_4)
| product(e_4,e_1,e_3)
| product(e_4,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,axiom,
~ equalish(e_1,e_4),
e_1_is_not_e_4 ).
cnf(c_0_34,plain,
( equalish(X1,X2)
| ~ product(X2,X2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_20]) ).
cnf(c_0_35,plain,
( product(e_1,e_1,e_4)
| product(e_1,e_2,e_4)
| product(e_1,e_3,e_4)
| product(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_36,negated_conjecture,
( equalish(X1,X2)
| ~ product(X2,X3,X1)
| ~ product(X2,X2,X4)
| ~ product(X3,X1,X4) ),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_37,plain,
( product(e_4,e_1,e_2)
| product(e_4,e_1,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,axiom,
~ equalish(e_3,e_4),
e_3_is_not_e_4 ).
cnf(c_0_39,plain,
( product(e_1,e_4,e_4)
| product(e_1,e_3,e_4)
| product(e_1,e_2,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_27]) ).
cnf(c_0_40,plain,
( product(X1,e_4,e_4)
| product(X1,e_4,e_3)
| product(X1,e_4,e_2)
| product(X1,e_4,e_1)
| ~ group_element(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_41,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_42,negated_conjecture,
( product(e_4,e_1,e_2)
| ~ product(e_4,e_4,X1)
| ~ product(e_1,e_3,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_43,plain,
( product(e_1,e_2,e_4)
| product(e_1,e_3,e_4) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_39]),c_0_33]) ).
cnf(c_0_44,plain,
( product(e_2,e_4,e_1)
| product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,axiom,
~ equalish(e_1,e_2),
e_1_is_not_e_2 ).
cnf(c_0_46,negated_conjecture,
( product(e_1,e_2,e_4)
| product(e_4,e_1,e_2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_20])]) ).
cnf(c_0_47,plain,
( product(e_1,e_4,e_1)
| product(e_1,e_4,e_2)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_4) ),
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_48,negated_conjecture,
( 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_2,X1)
| ~ product(e_4,e_1,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_44]),c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( product(e_4,e_1,e_2)
| ~ product(e_1,e_1,X1)
| ~ product(e_2,e_4,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_46]),c_0_27]) ).
cnf(c_0_50,plain,
( product(e_2,e_1,e_1)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_4) ),
inference(spm,[status(thm)],[c_0_21,c_0_41]) ).
cnf(c_0_51,axiom,
~ equalish(e_2,e_1),
e_2_is_not_e_1 ).
cnf(c_0_52,plain,
( product(e_1,e_4,e_4)
| product(e_1,e_4,e_3)
| product(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_47]),c_0_27]) ).
cnf(c_0_53,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_4)
| ~ product(e_4,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_48,c_0_20]) ).
cnf(c_0_54,negated_conjecture,
( product(e_4,e_1,e_2)
| ~ product(e_2,e_4,e_1) ),
inference(spm,[status(thm)],[c_0_49,c_0_20]) ).
cnf(c_0_55,plain,
( product(e_2,e_1,e_4)
| product(e_2,e_1,e_3)
| product(e_2,e_1,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_50]),c_0_51]) ).
cnf(c_0_56,axiom,
~ equalish(e_4,e_2),
e_4_is_not_e_2 ).
cnf(c_0_57,plain,
( product(e_1,e_4,e_2)
| product(e_1,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_52]),c_0_33]) ).
cnf(c_0_58,negated_conjecture,
( product(e_2,e_4,e_4)
| product(e_2,e_4,e_3)
| product(e_2,e_4,e_2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_44]) ).
cnf(c_0_59,axiom,
~ equalish(e_2,e_4),
e_2_is_not_e_4 ).
cnf(c_0_60,negated_conjecture,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_3)
| ~ product(e_2,e_2,X1)
| ~ product(e_1,e_4,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_55]),c_0_56]) ).
cnf(c_0_61,plain,
( equalish(X1,e_1)
| product(e_1,e_4,e_2)
| ~ product(X1,e_4,e_3) ),
inference(spm,[status(thm)],[c_0_19,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_4,e_3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_58]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( product(e_2,e_1,e_3)
| product(e_2,e_1,e_2)
| ~ product(e_1,e_4,e_2) ),
inference(spm,[status(thm)],[c_0_60,c_0_20]) ).
cnf(c_0_64,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_1,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_51]) ).
cnf(c_0_65,negated_conjecture,
( equalish(X1,e_4)
| product(e_2,e_4,e_2)
| ~ product(e_2,X1,e_3) ),
inference(spm,[status(thm)],[c_0_24,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( product(e_2,e_4,e_2)
| product(e_2,e_1,e_2)
| product(e_2,e_1,e_3) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
( product(e_2,e_1,e_2)
| product(e_2,e_4,e_2) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_33]) ).
cnf(c_0_68,negated_conjecture,
product(e_2,e_4,e_2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_67]),c_0_45]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_68]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP124-4.004 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 2400
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Oct 3 02:51:31 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.R3opp9dxty/E---3.1_820.p
% 0.19/0.51 # Version: 3.1pre001
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.51 # Starting sh5l with 300s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 900 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.51 # Starting sh5l with 136s (1) cores
% 0.19/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 908 completed with status 0
% 0.19/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.51 # No SInE strategy applied
% 0.19/0.51 # Search class: FGUNF-FFSS00-SFFFFFNN
% 0.19/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.19/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.51 # Preprocessing time : 0.001 s
% 0.19/0.51 # Presaturation interreduction done
% 0.19/0.51
% 0.19/0.51 # Proof found!
% 0.19/0.51 # SZS status Unsatisfiable
% 0.19/0.51 # SZS output start CNFRefutation
% See solution above
% 0.19/0.51 # Parsed axioms : 25
% 0.19/0.51 # Removed by relevancy pruning/SinE : 0
% 0.19/0.51 # Initial clauses : 25
% 0.19/0.51 # Removed in clause preprocessing : 0
% 0.19/0.51 # Initial clauses in saturation : 25
% 0.19/0.51 # Processed clauses : 467
% 0.19/0.51 # ...of these trivial : 0
% 0.19/0.51 # ...subsumed : 110
% 0.19/0.51 # ...remaining for further processing : 357
% 0.19/0.51 # Other redundant clauses eliminated : 0
% 0.19/0.51 # Clauses deleted for lack of memory : 0
% 0.19/0.51 # Backward-subsumed : 38
% 0.19/0.51 # Backward-rewritten : 26
% 0.19/0.51 # Generated clauses : 1023
% 0.19/0.51 # ...of the previous two non-redundant : 828
% 0.19/0.51 # ...aggressively subsumed : 0
% 0.19/0.51 # Contextual simplify-reflections : 4
% 0.19/0.51 # Paramodulations : 1022
% 0.19/0.51 # Factorizations : 0
% 0.19/0.51 # NegExts : 0
% 0.19/0.51 # Equation resolutions : 0
% 0.19/0.51 # Total rewrite steps : 231
% 0.19/0.51 # Propositional unsat checks : 0
% 0.19/0.51 # Propositional check models : 0
% 0.19/0.51 # Propositional check unsatisfiable : 0
% 0.19/0.51 # Propositional clauses : 0
% 0.19/0.51 # Propositional clauses after purity: 0
% 0.19/0.51 # Propositional unsat core size : 0
% 0.19/0.51 # Propositional preprocessing time : 0.000
% 0.19/0.51 # Propositional encoding time : 0.000
% 0.19/0.51 # Propositional solver time : 0.000
% 0.19/0.51 # Success case prop preproc time : 0.000
% 0.19/0.51 # Success case prop encoding time : 0.000
% 0.19/0.51 # Success case prop solver time : 0.000
% 0.19/0.51 # Current number of processed clauses : 267
% 0.19/0.51 # Positive orientable unit clauses : 7
% 0.19/0.51 # Positive unorientable unit clauses: 0
% 0.19/0.51 # Negative unit clauses : 14
% 0.19/0.51 # Non-unit-clauses : 246
% 0.19/0.51 # Current number of unprocessed clauses: 354
% 0.19/0.51 # ...number of literals in the above : 1906
% 0.19/0.51 # Current number of archived formulas : 0
% 0.19/0.51 # Current number of archived clauses : 90
% 0.19/0.51 # Clause-clause subsumption calls (NU) : 6730
% 0.19/0.51 # Rec. Clause-clause subsumption calls : 3178
% 0.19/0.51 # Non-unit clause-clause subsumptions : 139
% 0.19/0.51 # Unit Clause-clause subsumption calls : 147
% 0.19/0.51 # Rewrite failures with RHS unbound : 0
% 0.19/0.51 # BW rewrite match attempts : 19
% 0.19/0.51 # BW rewrite match successes : 1
% 0.19/0.51 # Condensation attempts : 0
% 0.19/0.51 # Condensation successes : 0
% 0.19/0.51 # Termbank termtop insertions : 17045
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.030 s
% 0.19/0.51 # System time : 0.003 s
% 0.19/0.51 # Total time : 0.033 s
% 0.19/0.51 # Maximum resident set size: 1632 pages
% 0.19/0.51
% 0.19/0.51 # -------------------------------------------------
% 0.19/0.51 # User time : 0.134 s
% 0.19/0.51 # System time : 0.010 s
% 0.19/0.51 # Total time : 0.144 s
% 0.19/0.52 # Maximum resident set size: 1688 pages
% 0.19/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------