TSTP Solution File: LCL372-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LCL372-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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 18:24:41 EDT 2023
% Result : Unsatisfiable 26.82s 3.96s
% Output : CNFRefutation 26.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 71 ( 32 unt; 0 nHn; 22 RR)
% Number of literals : 124 ( 0 equ; 58 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 175 ( 45 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.Y4AqF1VRxn/E---3.1_24204.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/tmp/tmp.Y4AqF1VRxn/E---3.1_24204.p',cn_1) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/tmp/tmp.Y4AqF1VRxn/E---3.1_24204.p',cn_3) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/tmp/tmp.Y4AqF1VRxn/E---3.1_24204.p',cn_2) ).
cnf(prove_cn_28,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(x,y),y),z),implies(implies(implies(y,u),x),z))),
file('/export/starexec/sandbox/tmp/tmp.Y4AqF1VRxn/E---3.1_24204.p',prove_cn_28) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X4,X2))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(implies(not(X1),X4),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(not(implies(X1,X2)),X3))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_8,c_0_22]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(not(implies(implies(not(X1),X1),X1)),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(not(X1),X1),implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(not(implies(X1,X3)),implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_6]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_32,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_28,c_0_25]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(not(X1),X1),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_29]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_11]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(not(implies(not(X1),X2)),X3))),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X3),X3)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_36]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(not(implies(X1,X1)),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_9]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(not(implies(X1,implies(not(X1),X2))),X3)),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_25]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(implies(not(X1),X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X1),X1),X3)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_20,c_0_47]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_48,c_0_6]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(implies(not(X1),X1),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_39,c_0_51]) ).
cnf(c_0_55,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(x,y),y),z),implies(implies(implies(y,u),x),z))),
prove_cn_28 ).
cnf(c_0_56,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_15,c_0_44]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,implies(X5,X4)))
| ~ is_a_theorem(implies(X3,X5)) ),
inference(spm,[status(thm)],[c_0_12,c_0_52]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_18,c_0_53]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(implies(not(not(X1)),X2),X1),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_54]) ).
cnf(c_0_60,negated_conjecture,
~ is_a_theorem(implies(implies(implies(y,u),x),implies(implies(x,y),y))),
inference(spm,[status(thm)],[c_0_55,c_0_7]) ).
cnf(c_0_61,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_56]) ).
cnf(c_0_62,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X3,not(X2))) ),
inference(spm,[status(thm)],[c_0_57,c_0_9]) ).
cnf(c_0_63,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_58]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(implies(not(X1),not(not(X1))),X1)),
inference(spm,[status(thm)],[c_0_49,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
~ is_a_theorem(implies(implies(implies(y,u),x),implies(not(y),x))),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X4,X3)))
| ~ is_a_theorem(implies(X1,not(X4))) ),
inference(spm,[status(thm)],[c_0_39,c_0_62]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_68,negated_conjecture,
~ is_a_theorem(implies(y,not(not(y)))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_20,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL372-1 : TPTP v8.1.2. Released v2.3.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 2400
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon Oct 2 12:24:44 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.16/0.46 Running first-order model finding
% 0.16/0.46 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Y4AqF1VRxn/E---3.1_24204.p
% 26.82/3.96 # Version: 3.1pre001
% 26.82/3.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 26.82/3.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.82/3.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.82/3.96 # Starting new_bool_3 with 300s (1) cores
% 26.82/3.96 # Starting new_bool_1 with 300s (1) cores
% 26.82/3.96 # Starting sh5l with 300s (1) cores
% 26.82/3.96 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 24281 completed with status 0
% 26.82/3.96 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 26.82/3.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 26.82/3.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.82/3.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.82/3.96 # No SInE strategy applied
% 26.82/3.96 # Search class: FHUNS-FFSF21-MFFFFFNN
% 26.82/3.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 26.82/3.96 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 26.82/3.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.82/3.96 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.82/3.96 # Starting new_bool_3 with 136s (1) cores
% 26.82/3.96 # Starting new_bool_1 with 136s (1) cores
% 26.82/3.96 # H----_011_C07_F1_PI_SE_SP_S0V with pid 24289 completed with status 0
% 26.82/3.96 # Result found by H----_011_C07_F1_PI_SE_SP_S0V
% 26.82/3.96 # Preprocessing class: FSSSSMSSSSSNFFN.
% 26.82/3.96 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 26.82/3.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 26.82/3.96 # No SInE strategy applied
% 26.82/3.96 # Search class: FHUNS-FFSF21-MFFFFFNN
% 26.82/3.96 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 26.82/3.96 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 811s (1) cores
% 26.82/3.96 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 26.82/3.96 # Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 26.82/3.96 # Preprocessing time : 0.001 s
% 26.82/3.96
% 26.82/3.96 # Proof found!
% 26.82/3.96 # SZS status Unsatisfiable
% 26.82/3.96 # SZS output start CNFRefutation
% See solution above
% 26.82/3.96 # Parsed axioms : 5
% 26.82/3.96 # Removed by relevancy pruning/SinE : 0
% 26.82/3.96 # Initial clauses : 5
% 26.82/3.96 # Removed in clause preprocessing : 0
% 26.82/3.96 # Initial clauses in saturation : 5
% 26.82/3.96 # Processed clauses : 44999
% 26.82/3.96 # ...of these trivial : 449
% 26.82/3.96 # ...subsumed : 41178
% 26.82/3.96 # ...remaining for further processing : 3372
% 26.82/3.96 # Other redundant clauses eliminated : 0
% 26.82/3.96 # Clauses deleted for lack of memory : 0
% 26.82/3.96 # Backward-subsumed : 1312
% 26.82/3.96 # Backward-rewritten : 95
% 26.82/3.96 # Generated clauses : 211660
% 26.82/3.96 # ...of the previous two non-redundant : 203602
% 26.82/3.96 # ...aggressively subsumed : 0
% 26.82/3.96 # Contextual simplify-reflections : 0
% 26.82/3.96 # Paramodulations : 211660
% 26.82/3.96 # Factorizations : 0
% 26.82/3.96 # NegExts : 0
% 26.82/3.96 # Equation resolutions : 0
% 26.82/3.96 # Total rewrite steps : 9242
% 26.82/3.96 # Propositional unsat checks : 0
% 26.82/3.96 # Propositional check models : 0
% 26.82/3.96 # Propositional check unsatisfiable : 0
% 26.82/3.96 # Propositional clauses : 0
% 26.82/3.96 # Propositional clauses after purity: 0
% 26.82/3.96 # Propositional unsat core size : 0
% 26.82/3.96 # Propositional preprocessing time : 0.000
% 26.82/3.96 # Propositional encoding time : 0.000
% 26.82/3.96 # Propositional solver time : 0.000
% 26.82/3.96 # Success case prop preproc time : 0.000
% 26.82/3.96 # Success case prop encoding time : 0.000
% 26.82/3.96 # Success case prop solver time : 0.000
% 26.82/3.96 # Current number of processed clauses : 1965
% 26.82/3.96 # Positive orientable unit clauses : 173
% 26.82/3.96 # Positive unorientable unit clauses: 0
% 26.82/3.96 # Negative unit clauses : 162
% 26.82/3.96 # Non-unit-clauses : 1630
% 26.82/3.96 # Current number of unprocessed clauses: 157938
% 26.82/3.96 # ...number of literals in the above : 562766
% 26.82/3.96 # Current number of archived formulas : 0
% 26.82/3.96 # Current number of archived clauses : 1407
% 26.82/3.96 # Clause-clause subsumption calls (NU) : 3205380
% 26.82/3.96 # Rec. Clause-clause subsumption calls : 1133777
% 26.82/3.96 # Non-unit clause-clause subsumptions : 32256
% 26.82/3.96 # Unit Clause-clause subsumption calls : 63060
% 26.82/3.96 # Rewrite failures with RHS unbound : 0
% 26.82/3.96 # BW rewrite match attempts : 34161
% 26.82/3.96 # BW rewrite match successes : 21
% 26.82/3.96 # Condensation attempts : 0
% 26.82/3.96 # Condensation successes : 0
% 26.82/3.96 # Termbank termtop insertions : 3329223
% 26.82/3.96
% 26.82/3.96 # -------------------------------------------------
% 26.82/3.96 # User time : 3.334 s
% 26.82/3.96 # System time : 0.098 s
% 26.82/3.96 # Total time : 3.432 s
% 26.82/3.96 # Maximum resident set size: 1592 pages
% 26.82/3.96
% 26.82/3.96 # -------------------------------------------------
% 26.82/3.96 # User time : 16.295 s
% 26.82/3.96 # System time : 0.275 s
% 26.82/3.96 # Total time : 16.570 s
% 26.82/3.96 # Maximum resident set size: 1672 pages
% 26.82/3.96 % E---3.1 exiting
%------------------------------------------------------------------------------