TSTP Solution File: ANA028-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : ANA028-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:16:05 EDT 2023
% Result : Unsatisfiable 0.15s 0.61s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of clauses : 54 ( 28 unt; 0 nHn; 21 RR)
% Number of literals : 89 ( 30 equ; 39 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 112 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0,axiom,
( c_plus(c_0,X2,X1) = X2
| ~ class_OrderedGroup_Ocomm__monoid__add(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_23,axiom,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',clsrel_Ring__and__Field_Oordered__idom_23) ).
cnf(tfree_tcs,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',tfree_tcs) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_4,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',clsrel_Ring__and__Field_Oordered__idom_4) ).
cnf(cls_OrderedGroup_Ocompare__rls__5_0,axiom,
( c_minus(X2,c_minus(X3,X4,X1),X1) = c_minus(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Ocompare__rls__5_0) ).
cnf(cls_OrderedGroup_Odiff__self_0,axiom,
( c_minus(X2,X2,X1) = c_0
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Odiff__self_0) ).
cnf(cls_OrderedGroup_Ocompare__rls__3_0,axiom,
( c_plus(c_minus(X2,X3,X1),X4,X1) = c_minus(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Ocompare__rls__3_0) ).
cnf(cls_OrderedGroup_Ocompare__rls__8_1,axiom,
( c_lessequals(c_minus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_plus(X3,X4,X1),X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Ocompare__rls__8_1) ).
cnf(cls_OrderedGroup_Ocompare__rls__2_0,axiom,
( c_plus(X2,c_minus(X3,X4,X1),X1) = c_minus(c_plus(X2,X3,X1),X4,X1)
| ~ class_OrderedGroup_Oab__group__add(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Ocompare__rls__2_0) ).
cnf(cls_OrderedGroup_Ocompare__rls__9_1,axiom,
( c_lessequals(X2,c_minus(X4,X3,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_plus(X2,X3,X1),X4,X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_OrderedGroup_Ocompare__rls__9_1) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_conjecture_3) ).
cnf(cls_conjecture_1,negated_conjecture,
c_lessequals(v_g(X1),v_k(X1),t_b),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',cls_conjecture_1) ).
cnf(clsrel_Ring__and__Field_Oordered__idom_54,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p',clsrel_Ring__and__Field_Oordered__idom_54) ).
cnf(c_0_13,axiom,
( c_plus(c_0,X2,X1) = X2
| ~ class_OrderedGroup_Ocomm__monoid__add(X1) ),
cls_OrderedGroup_Ocomm__monoid__add__class_Oaxioms_0 ).
cnf(c_0_14,axiom,
( class_OrderedGroup_Ocomm__monoid__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_23 ).
cnf(c_0_15,plain,
( c_plus(c_0,X1,X2) = X1
| ~ class_Ring__and__Field_Oordered__idom(X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
class_Ring__and__Field_Oordered__idom(t_b),
tfree_tcs ).
cnf(c_0_17,axiom,
( class_OrderedGroup_Oab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_4 ).
cnf(c_0_18,axiom,
( c_minus(X2,c_minus(X3,X4,X1),X1) = c_minus(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Oab__group__add(X1) ),
cls_OrderedGroup_Ocompare__rls__5_0 ).
cnf(c_0_19,negated_conjecture,
c_plus(c_0,X1,t_b) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
class_OrderedGroup_Oab__group__add(t_b),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,axiom,
( c_minus(X2,X2,X1) = c_0
| ~ class_OrderedGroup_Oab__group__add(X1) ),
cls_OrderedGroup_Odiff__self_0 ).
cnf(c_0_22,negated_conjecture,
c_minus(c_0,c_minus(X1,X2,t_b),t_b) = c_minus(X2,X1,t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,axiom,
( c_plus(c_minus(X2,X3,X1),X4,X1) = c_minus(c_plus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Oab__group__add(X1) ),
cls_OrderedGroup_Ocompare__rls__3_0 ).
cnf(c_0_24,negated_conjecture,
c_minus(X1,X1,t_b) = c_0,
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
c_minus(c_minus(X1,X2,t_b),c_0,t_b) = c_minus(X1,X2,t_b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_22]),c_0_22]) ).
cnf(c_0_26,negated_conjecture,
c_minus(c_plus(X1,X2,t_b),X1,t_b) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
c_minus(X1,c_0,t_b) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
c_minus(X1,c_minus(c_0,X2,t_b),t_b) = c_plus(X1,X2,t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_27]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
c_minus(X1,c_plus(X2,X3,t_b),t_b) = c_minus(c_minus(X1,X3,t_b),X2,t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_22]),c_0_20])]) ).
cnf(c_0_30,negated_conjecture,
c_plus(c_minus(c_0,X1,t_b),X1,t_b) = c_0,
inference(spm,[status(thm)],[c_0_24,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
c_minus(X1,c_minus(X1,X2,t_b),t_b) = X2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_20])]) ).
cnf(c_0_32,negated_conjecture,
c_plus(c_minus(X1,X2,t_b),X2,t_b) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_27]),c_0_28]) ).
cnf(c_0_33,negated_conjecture,
c_minus(c_plus(X1,X2,t_b),X2,t_b) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_34,axiom,
( c_lessequals(c_minus(X2,X4,X1),X3,X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(X2,c_plus(X3,X4,X1),X1) ),
cls_OrderedGroup_Ocompare__rls__8_1 ).
cnf(c_0_35,negated_conjecture,
c_plus(X1,X2,t_b) = c_plus(X2,X1,t_b),
inference(spm,[status(thm)],[c_0_32,c_0_26]) ).
cnf(c_0_36,negated_conjecture,
c_minus(c_plus(X1,X2,t_b),X3,t_b) = c_minus(X1,c_minus(X3,X2,t_b),t_b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_22]) ).
cnf(c_0_37,axiom,
( c_plus(X2,c_minus(X3,X4,X1),X1) = c_minus(c_plus(X2,X3,X1),X4,X1)
| ~ class_OrderedGroup_Oab__group__add(X1) ),
cls_OrderedGroup_Ocompare__rls__2_0 ).
cnf(c_0_38,negated_conjecture,
c_plus(X1,c_0,t_b) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( c_lessequals(c_minus(X1,X2,t_b),X3,t_b)
| ~ c_lessequals(X1,c_plus(X2,X3,t_b),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,axiom,
( c_lessequals(X2,c_minus(X4,X3,X1),X1)
| ~ class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ c_lessequals(c_plus(X2,X3,X1),X4,X1) ),
cls_OrderedGroup_Ocompare__rls__9_1 ).
cnf(c_0_41,negated_conjecture,
c_minus(X1,c_minus(c_minus(X1,X2,t_b),X3,t_b),t_b) = c_plus(X2,X3,t_b),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_31]),c_0_20])]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
c_plus(c_minus(X1,X2,t_b),X3,t_b) = c_minus(X3,c_minus(X2,X1,t_b),t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_22]),c_0_19]),c_0_20])]) ).
cnf(c_0_43,negated_conjecture,
c_plus(X1,c_minus(X2,X3,t_b),t_b) = c_minus(X1,c_minus(X3,X2,t_b),t_b),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_22]),c_0_20])]),c_0_38]) ).
cnf(c_0_44,negated_conjecture,
~ c_lessequals(c_minus(v_f(v_x),v_k(v_x),t_b),c_minus(v_f(v_x),v_g(v_x),t_b),t_b),
cls_conjecture_3 ).
cnf(c_0_45,negated_conjecture,
( c_lessequals(c_minus(X1,X2,t_b),c_minus(X3,X4,t_b),t_b)
| ~ c_lessequals(X1,c_minus(X2,c_minus(X4,X3,t_b),t_b),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_37]),c_0_20])]),c_0_36]) ).
cnf(c_0_46,plain,
( c_lessequals(X1,c_minus(X2,c_minus(X3,X4,X5),X5),X5)
| ~ c_lessequals(c_minus(c_plus(X1,X3,X5),X4,X5),X2,X5)
| ~ class_OrderedGroup_Opordered__ab__group__add(X5)
| ~ class_OrderedGroup_Oab__group__add(X5) ),
inference(spm,[status(thm)],[c_0_40,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
c_minus(X1,c_minus(X2,c_minus(X3,X1,t_b),t_b),t_b) = c_minus(X3,X2,t_b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_28]),c_0_42]),c_0_43]),c_0_27]) ).
cnf(c_0_48,negated_conjecture,
( ~ c_lessequals(v_f(v_x),c_minus(v_k(v_x),c_minus(v_g(v_x),v_f(v_x),t_b),t_b),t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
( c_lessequals(X1,c_minus(X2,c_minus(X3,X1,t_b),t_b),t_b)
| ~ c_lessequals(X3,X2,t_b)
| ~ class_OrderedGroup_Opordered__ab__group__add(t_b) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_31]),c_0_20])]),c_0_36]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
c_lessequals(v_g(X1),v_k(X1),t_b),
cls_conjecture_1 ).
cnf(c_0_51,negated_conjecture,
~ class_OrderedGroup_Opordered__ab__group__add(t_b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_52,axiom,
( class_OrderedGroup_Opordered__ab__group__add(X1)
| ~ class_Ring__and__Field_Oordered__idom(X1) ),
clsrel_Ring__and__Field_Oordered__idom_54 ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : ANA028-2 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 15:06:51 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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/tmp/tmp.Z6oWR4AbP7/E---3.1_10636.p
% 0.15/0.61 # Version: 3.1pre001
% 0.15/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 # Starting sh5l with 300s (1) cores
% 0.15/0.61 # sh5l with pid 10717 completed with status 0
% 0.15/0.61 # Result found by sh5l
% 0.15/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 # Starting sh5l with 300s (1) cores
% 0.15/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.61 # Search class: FHUSF-FFSF31-SFFFFFNN
% 0.15/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.61 # SAT001_MinMin_p005000_rr_RG with pid 10724 completed with status 0
% 0.15/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.61 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.61 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.61 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.61 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.61 # Starting sh5l with 300s (1) cores
% 0.15/0.61 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.61 # Search class: FHUSF-FFSF31-SFFFFFNN
% 0.15/0.61 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.61 # Preprocessing time : 0.001 s
% 0.15/0.61 # Presaturation interreduction done
% 0.15/0.61
% 0.15/0.61 # Proof found!
% 0.15/0.61 # SZS status Unsatisfiable
% 0.15/0.61 # SZS output start CNFRefutation
% See solution above
% 0.15/0.61 # Parsed axioms : 13
% 0.15/0.61 # Removed by relevancy pruning/SinE : 0
% 0.15/0.61 # Initial clauses : 13
% 0.15/0.61 # Removed in clause preprocessing : 0
% 0.15/0.61 # Initial clauses in saturation : 13
% 0.15/0.61 # Processed clauses : 1538
% 0.15/0.61 # ...of these trivial : 72
% 0.15/0.61 # ...subsumed : 1244
% 0.15/0.61 # ...remaining for further processing : 222
% 0.15/0.61 # Other redundant clauses eliminated : 0
% 0.15/0.61 # Clauses deleted for lack of memory : 0
% 0.15/0.61 # Backward-subsumed : 125
% 0.15/0.61 # Backward-rewritten : 15
% 0.15/0.61 # Generated clauses : 11401
% 0.15/0.61 # ...of the previous two non-redundant : 10406
% 0.15/0.61 # ...aggressively subsumed : 0
% 0.15/0.61 # Contextual simplify-reflections : 0
% 0.15/0.61 # Paramodulations : 11401
% 0.15/0.61 # Factorizations : 0
% 0.15/0.61 # NegExts : 0
% 0.15/0.61 # Equation resolutions : 0
% 0.15/0.61 # Total rewrite steps : 29030
% 0.15/0.61 # Propositional unsat checks : 0
% 0.15/0.61 # Propositional check models : 0
% 0.15/0.61 # Propositional check unsatisfiable : 0
% 0.15/0.61 # Propositional clauses : 0
% 0.15/0.61 # Propositional clauses after purity: 0
% 0.15/0.61 # Propositional unsat core size : 0
% 0.15/0.61 # Propositional preprocessing time : 0.000
% 0.15/0.61 # Propositional encoding time : 0.000
% 0.15/0.61 # Propositional solver time : 0.000
% 0.15/0.61 # Success case prop preproc time : 0.000
% 0.15/0.61 # Success case prop encoding time : 0.000
% 0.15/0.61 # Success case prop solver time : 0.000
% 0.15/0.61 # Current number of processed clauses : 69
% 0.15/0.61 # Positive orientable unit clauses : 22
% 0.15/0.61 # Positive unorientable unit clauses: 5
% 0.15/0.61 # Negative unit clauses : 2
% 0.15/0.61 # Non-unit-clauses : 40
% 0.15/0.61 # Current number of unprocessed clauses: 8722
% 0.15/0.61 # ...number of literals in the above : 23158
% 0.15/0.61 # Current number of archived formulas : 0
% 0.15/0.61 # Current number of archived clauses : 153
% 0.15/0.61 # Clause-clause subsumption calls (NU) : 9875
% 0.15/0.61 # Rec. Clause-clause subsumption calls : 9760
% 0.15/0.61 # Non-unit clause-clause subsumptions : 1177
% 0.15/0.61 # Unit Clause-clause subsumption calls : 117
% 0.15/0.61 # Rewrite failures with RHS unbound : 0
% 0.15/0.61 # BW rewrite match attempts : 159
% 0.15/0.61 # BW rewrite match successes : 70
% 0.15/0.61 # Condensation attempts : 0
% 0.15/0.61 # Condensation successes : 0
% 0.15/0.61 # Termbank termtop insertions : 267082
% 0.15/0.61
% 0.15/0.61 # -------------------------------------------------
% 0.15/0.61 # User time : 0.172 s
% 0.15/0.61 # System time : 0.008 s
% 0.15/0.61 # Total time : 0.180 s
% 0.15/0.61 # Maximum resident set size: 1608 pages
% 0.15/0.61
% 0.15/0.61 # -------------------------------------------------
% 0.15/0.61 # User time : 0.172 s
% 0.15/0.61 # System time : 0.011 s
% 0.15/0.61 # Total time : 0.183 s
% 0.15/0.61 # Maximum resident set size: 1684 pages
% 0.15/0.61 % E---3.1 exiting
% 0.15/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------