TSTP Solution File: LCL430-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL430-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:18:50 EDT 2024
% Result : Unsatisfiable 110.98s 14.70s
% Output : CNFRefutation 110.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 29 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 51 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 84 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_PropLog_ODiff__weaken__left_0,axiom,
( c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4))) ),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_PropLog_ODiff__weaken__left_0) ).
cnf(cls_PropLog_Oweaken__left_0,axiom,
( c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3))) ),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_PropLog_Oweaken__left_0) ).
cnf(cls_conjecture_3,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_conjecture_3) ).
cnf(cls_PropLog_Ohyps__insert_0,axiom,
c_lessequals(c_PropLog_Ohyps(X1,c_insert(X2,X3,X4),X4),c_insert(c_PropLog_Opl_Ovar(X2,X4),c_minus(c_PropLog_Ohyps(X1,X3,X4),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,X4),c_PropLog_Opl_Ofalse,X4),c_emptyset,tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_PropLog_Ohyps__insert_0) ).
cnf(cls_PropLog_Othms__excluded__middle__rule_0,axiom,
( c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_PropLog_Othms__excluded__middle__rule_0) ).
cnf(cls_PropLog_Oinsert__Diff__same_0,axiom,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_insert(X4,c_minus(X1,c_insert(X4,X2,X3),tc_set(X3)),X3),tc_set(X3)),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_PropLog_Oinsert__Diff__same_0) ).
cnf(cls_PropLog_Oinsert__Diff__subset2_0,axiom,
c_lessequals(c_minus(c_insert(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),X5,tc_set(X4)),c_insert(X1,c_minus(X2,c_insert(X3,X5,X4),tc_set(X4)),X4),tc_set(X4)),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_PropLog_Oinsert__Diff__subset2_0) ).
cnf(cls_conjecture_5,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p',cls_conjecture_5) ).
cnf(c_0_8,plain,
( c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4))) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_ODiff__weaken__left_0]) ).
cnf(c_0_9,plain,
( c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3))) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Oweaken__left_0]) ).
cnf(c_0_10,plain,
( c_in(X1,c_PropLog_Othms(c_minus(X5,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_minus(X2,X3,tc_set(tc_PropLog_Opl(X4))),X4),tc_PropLog_Opl(X4))
| ~ c_lessequals(X2,X5,tc_set(tc_PropLog_Opl(X4))) ),
c_0_8 ).
cnf(c_0_11,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
cls_conjecture_3 ).
cnf(c_0_12,plain,
( c_in(X1,c_PropLog_Othms(X4,X3),tc_PropLog_Opl(X3))
| ~ c_in(X1,c_PropLog_Othms(X2,X3),tc_PropLog_Opl(X3))
| ~ c_lessequals(X2,X4,tc_set(tc_PropLog_Opl(X3))) ),
c_0_9 ).
cnf(c_0_13,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(c_minus(X1,v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))
| ~ c_lessequals(c_PropLog_Ohyps(v_p,X2,t_a),X1,tc_set(tc_PropLog_Opl(t_a))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
c_lessequals(c_PropLog_Ohyps(X1,c_insert(X2,X3,X4),X4),c_insert(c_PropLog_Opl_Ovar(X2,X4),c_minus(c_PropLog_Ohyps(X1,X3,X4),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,X4),c_PropLog_Opl_Ofalse,X4),c_emptyset,tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),tc_PropLog_Opl(X4)),tc_set(tc_PropLog_Opl(X4))),
cls_PropLog_Ohyps__insert_0 ).
cnf(c_0_15,plain,
( c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
inference(fof_simplification,[status(thm)],[cls_PropLog_Othms__excluded__middle__rule_0]) ).
cnf(c_0_16,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a))
| ~ c_lessequals(c_minus(c_PropLog_Ohyps(v_p,X2,t_a),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a))) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,axiom,
c_lessequals(c_minus(X1,X2,tc_set(X3)),c_insert(X4,c_minus(X1,c_insert(X4,X2,X3),tc_set(X3)),X3),tc_set(X3)),
cls_PropLog_Oinsert__Diff__same_0 ).
cnf(c_0_18,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_insert(c_PropLog_Opl_Ovar(X1,t_a),c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( c_in(X1,c_PropLog_Othms(X3,X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(X2,X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4))
| ~ c_in(X1,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,X4),X3,tc_PropLog_Opl(X4)),X4),tc_PropLog_Opl(X4)) ),
c_0_15 ).
cnf(c_0_20,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(X1,c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(X1,v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(X1,t_a),tc_PropLog_Opl(t_a))
| ~ c_lessequals(c_minus(c_insert(c_PropLog_Opl_Ovar(X2,t_a),c_minus(c_PropLog_Ohyps(v_p,X3,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,t_a),c_PropLog_Opl_Ofalse,t_a),c_emptyset,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),v_F,tc_set(tc_PropLog_Opl(t_a))),X1,tc_set(tc_PropLog_Opl(t_a))) ),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_22,axiom,
c_lessequals(c_minus(c_insert(X1,c_minus(X2,c_insert(X3,c_emptyset,X4),tc_set(X4)),X4),X5,tc_set(X4)),c_insert(X1,c_minus(X2,c_insert(X3,X5,X4),tc_set(X4)),X4),tc_set(X4)),
cls_PropLog_Oinsert__Diff__subset2_0 ).
cnf(c_0_23,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).
cnf(c_0_24,negated_conjecture,
( c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a))
| ~ c_in(v_p,c_PropLog_Othms(c_insert(X2,c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(X2,c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_insert(c_PropLog_Opl_Ovar(X1,t_a),c_minus(c_PropLog_Ohyps(v_p,X2,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X1,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,v_t,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(v_v,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
c_in(v_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(v_p,X1,t_a),c_insert(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Ovar(X2,t_a),c_PropLog_Opl_Ofalse,t_a),v_F,tc_PropLog_Opl(t_a)),tc_set(tc_PropLog_Opl(t_a))),t_a),tc_PropLog_Opl(t_a)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.23 % Problem : LCL430-1 : TPTP v8.1.2. Released v3.2.0.
% 0.24/0.24 % Command : run_E %s %d THM
% 0.25/0.45 % Computer : n016.cluster.edu
% 0.25/0.45 % Model : x86_64 x86_64
% 0.25/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.45 % Memory : 8042.1875MB
% 0.25/0.45 % OS : Linux 3.10.0-693.el7.x86_64
% 0.25/0.45 % CPULimit : 300
% 0.25/0.45 % WCLimit : 300
% 0.25/0.45 % DateTime : Fri May 3 09:40:15 EDT 2024
% 0.25/0.45 % CPUTime :
% 0.42/0.69 Running first-order theorem proving
% 0.42/0.69 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/tmp/tmp.rsgO3PEHPf/E---3.1_30911.p
% 110.98/14.70 # Version: 3.1.0
% 110.98/14.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 110.98/14.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.98/14.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 110.98/14.70 # Starting new_bool_3 with 300s (1) cores
% 110.98/14.70 # Starting new_bool_1 with 300s (1) cores
% 110.98/14.70 # Starting sh5l with 300s (1) cores
% 110.98/14.70 # new_bool_1 with pid 30991 completed with status 0
% 110.98/14.70 # Result found by new_bool_1
% 110.98/14.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 110.98/14.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.98/14.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 110.98/14.70 # Starting new_bool_3 with 300s (1) cores
% 110.98/14.70 # Starting new_bool_1 with 300s (1) cores
% 110.98/14.70 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 110.98/14.70 # Search class: FGHSM-FFMM32-MFFFFFNN
% 110.98/14.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 110.98/14.70 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 110.98/14.70 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 30994 completed with status 0
% 110.98/14.70 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 110.98/14.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 110.98/14.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 110.98/14.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 110.98/14.70 # Starting new_bool_3 with 300s (1) cores
% 110.98/14.70 # Starting new_bool_1 with 300s (1) cores
% 110.98/14.70 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 110.98/14.70 # Search class: FGHSM-FFMM32-MFFFFFNN
% 110.98/14.70 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 110.98/14.70 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 110.98/14.70 # Preprocessing time : 0.003 s
% 110.98/14.70
% 110.98/14.70 # Proof found!
% 110.98/14.70 # SZS status Unsatisfiable
% 110.98/14.70 # SZS output start CNFRefutation
% See solution above
% 110.98/14.70 # Parsed axioms : 1382
% 110.98/14.70 # Removed by relevancy pruning/SinE : 1297
% 110.98/14.70 # Initial clauses : 85
% 110.98/14.70 # Removed in clause preprocessing : 0
% 110.98/14.70 # Initial clauses in saturation : 85
% 110.98/14.70 # Processed clauses : 25264
% 110.98/14.70 # ...of these trivial : 324
% 110.98/14.70 # ...subsumed : 18529
% 110.98/14.70 # ...remaining for further processing : 6411
% 110.98/14.70 # Other redundant clauses eliminated : 0
% 110.98/14.70 # Clauses deleted for lack of memory : 0
% 110.98/14.70 # Backward-subsumed : 693
% 110.98/14.70 # Backward-rewritten : 168
% 110.98/14.70 # Generated clauses : 641093
% 110.98/14.70 # ...of the previous two non-redundant : 623394
% 110.98/14.70 # ...aggressively subsumed : 0
% 110.98/14.70 # Contextual simplify-reflections : 138
% 110.98/14.70 # Paramodulations : 641008
% 110.98/14.70 # Factorizations : 0
% 110.98/14.70 # NegExts : 0
% 110.98/14.70 # Equation resolutions : 85
% 110.98/14.70 # Disequality decompositions : 0
% 110.98/14.70 # Total rewrite steps : 29430
% 110.98/14.70 # ...of those cached : 20526
% 110.98/14.70 # Propositional unsat checks : 0
% 110.98/14.70 # Propositional check models : 0
% 110.98/14.70 # Propositional check unsatisfiable : 0
% 110.98/14.70 # Propositional clauses : 0
% 110.98/14.70 # Propositional clauses after purity: 0
% 110.98/14.70 # Propositional unsat core size : 0
% 110.98/14.70 # Propositional preprocessing time : 0.000
% 110.98/14.70 # Propositional encoding time : 0.000
% 110.98/14.70 # Propositional solver time : 0.000
% 110.98/14.70 # Success case prop preproc time : 0.000
% 110.98/14.70 # Success case prop encoding time : 0.000
% 110.98/14.70 # Success case prop solver time : 0.000
% 110.98/14.70 # Current number of processed clauses : 5550
% 110.98/14.70 # Positive orientable unit clauses : 298
% 110.98/14.70 # Positive unorientable unit clauses: 0
% 110.98/14.70 # Negative unit clauses : 12
% 110.98/14.70 # Non-unit-clauses : 5240
% 110.98/14.70 # Current number of unprocessed clauses: 596792
% 110.98/14.70 # ...number of literals in the above : 1902046
% 110.98/14.70 # Current number of archived formulas : 0
% 110.98/14.70 # Current number of archived clauses : 861
% 110.98/14.70 # Clause-clause subsumption calls (NU) : 3906218
% 110.98/14.70 # Rec. Clause-clause subsumption calls : 2936691
% 110.98/14.70 # Non-unit clause-clause subsumptions : 19121
% 110.98/14.70 # Unit Clause-clause subsumption calls : 44365
% 110.98/14.70 # Rewrite failures with RHS unbound : 0
% 110.98/14.70 # BW rewrite match attempts : 100656
% 110.98/14.70 # BW rewrite match successes : 122
% 110.98/14.70 # Condensation attempts : 0
% 110.98/14.70 # Condensation successes : 0
% 110.98/14.70 # Termbank termtop insertions : 32492930
% 110.98/14.70 # Search garbage collected termcells : 2631
% 110.98/14.70
% 110.98/14.70 # -------------------------------------------------
% 110.98/14.70 # User time : 13.306 s
% 110.98/14.70 # System time : 0.344 s
% 110.98/14.70 # Total time : 13.650 s
% 110.98/14.70 # Maximum resident set size: 2836 pages
% 110.98/14.70
% 110.98/14.70 # -------------------------------------------------
% 110.98/14.70 # User time : 13.321 s
% 110.98/14.70 # System time : 0.344 s
% 110.98/14.70 # Total time : 13.664 s
% 110.98/14.70 # Maximum resident set size: 2440 pages
% 110.98/14.70 % E---3.1 exiting
% 110.98/14.70 % E exiting
%------------------------------------------------------------------------------