TSTP Solution File: RNG006-10 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : RNG006-10 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 19:15:18 EDT 2023
% Result : Unsatisfiable 381.63s 48.57s
% Output : CNFRefutation 381.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 71 ( 71 unt; 0 nHn; 17 RR)
% Number of literals : 71 ( 70 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-4 aty)
% Number of variables : 130 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_addition2,axiom,
ifeq(sum(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X1,X6),true,sum(X6,X2,X5),true),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',associativity_of_addition2) ).
cnf(additive_identity2,axiom,
sum(X1,additive_identity,X1) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',additive_identity2) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',ifeq_axiom_001) ).
cnf(b_plus_inverse_c,hypothesis,
sum(b,additive_inverse(c),bS_Ic) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',b_plus_inverse_c) ).
cnf(addition_is_well_defined,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',addition_is_well_defined) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',additive_identity1) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',ifeq_axiom) ).
cnf(commutativity_of_addition,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',commutativity_of_addition) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',closure_of_addition) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',left_inverse) ).
cnf(aPb_plus_IaPc,hypothesis,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',aPb_plus_IaPc) ).
cnf(distributivity1,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',distributivity1) ).
cnf(a_times_c,hypothesis,
product(a,c,aPc) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',a_times_c) ).
cnf(multiplication_is_well_defined,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',multiplication_is_well_defined) ).
cnf(a_times_b,hypothesis,
product(a,b,aPb) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',a_times_b) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)) = true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',closure_of_multiplication) ).
cnf(prove_a_times_bS_Ic_is_aPb_S__IaPc,negated_conjecture,
product(a,bS_Ic,aPb_S_IaPc) != true,
file('/export/starexec/sandbox/tmp/tmp.NxftTJzG0O/E---3.1_9373.p',prove_a_times_bS_Ic_is_aPb_S__IaPc) ).
cnf(c_0_17,axiom,
ifeq(sum(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X1,X6),true,sum(X6,X2,X5),true),true),true) = true,
associativity_of_addition2 ).
cnf(c_0_18,axiom,
sum(X1,additive_identity,X1) = true,
additive_identity2 ).
cnf(c_0_19,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_20,hypothesis,
sum(b,additive_inverse(c),bS_Ic) = true,
b_plus_inverse_c ).
cnf(c_0_21,axiom,
ifeq2(sum(X1,X2,X3),true,ifeq2(sum(X1,X2,X4),true,X4,X3),X3) = X3,
addition_is_well_defined ).
cnf(c_0_22,axiom,
sum(additive_identity,X1,X1) = true,
additive_identity1 ).
cnf(c_0_23,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_24,axiom,
ifeq(sum(X1,X2,X3),true,sum(X2,X1,X3),true) = true,
commutativity_of_addition ).
cnf(c_0_25,axiom,
sum(X1,X2,add(X1,X2)) = true,
closure_of_addition ).
cnf(c_0_26,plain,
ifeq(sum(X1,X2,additive_identity),true,ifeq(sum(X3,X1,X4),true,sum(X4,X2,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_27,axiom,
sum(additive_inverse(X1),X1,additive_identity) = true,
left_inverse ).
cnf(c_0_28,hypothesis,
ifeq(sum(additive_inverse(c),X1,X2),true,ifeq(sum(b,X2,X3),true,sum(bS_Ic,X1,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_19]) ).
cnf(c_0_29,plain,
ifeq2(sum(additive_identity,X1,X2),true,X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_30,plain,
sum(X1,X2,add(X2,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_19]) ).
cnf(c_0_31,hypothesis,
sum(aPb,additive_inverse(aPc),aPb_S_IaPc) = true,
aPb_plus_IaPc ).
cnf(c_0_32,plain,
ifeq(sum(X1,additive_inverse(X2),X3),true,sum(X3,X2,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]) ).
cnf(c_0_33,hypothesis,
ifeq(sum(b,additive_identity,X1),true,sum(bS_Ic,c,X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_19]) ).
cnf(c_0_34,plain,
add(X1,additive_identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_23]) ).
cnf(c_0_35,plain,
ifeq2(sum(X1,X2,X3),true,add(X1,X2),X3) = X3,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_25]),c_0_23]) ).
cnf(c_0_36,hypothesis,
ifeq(sum(additive_inverse(aPc),X1,X2),true,ifeq(sum(aPb,X2,X3),true,sum(aPb_S_IaPc,X1,X3),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_31]),c_0_19]) ).
cnf(c_0_37,plain,
sum(add(additive_inverse(X1),X2),X1,X2) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_30]),c_0_19]) ).
cnf(c_0_38,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_27]),c_0_19]) ).
cnf(c_0_39,plain,
add(additive_identity,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_23]) ).
cnf(c_0_40,axiom,
ifeq(product(X1,X2,X3),true,ifeq(product(X1,X4,X5),true,ifeq(product(X1,X6,X7),true,ifeq(sum(X6,X4,X2),true,sum(X7,X5,X3),true),true),true),true) = true,
distributivity1 ).
cnf(c_0_41,hypothesis,
product(a,c,aPc) = true,
a_times_c ).
cnf(c_0_42,hypothesis,
sum(bS_Ic,c,b) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_25]),c_0_34]),c_0_19]) ).
cnf(c_0_43,axiom,
ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
multiplication_is_well_defined ).
cnf(c_0_44,hypothesis,
product(a,b,aPb) = true,
a_times_b ).
cnf(c_0_45,plain,
sum(add(X1,additive_inverse(X2)),X2,X1) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_19]) ).
cnf(c_0_46,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_23]) ).
cnf(c_0_47,hypothesis,
ifeq(sum(additive_inverse(aPc),X1,X2),true,sum(aPb_S_IaPc,X1,add(aPb,X2)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_25]),c_0_19]) ).
cnf(c_0_48,plain,
sum(X1,add(additive_inverse(X1),X2),X2) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_37]),c_0_19]) ).
cnf(c_0_49,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_38]),c_0_39]),c_0_23]) ).
cnf(c_0_50,hypothesis,
ifeq(product(a,X1,X2),true,ifeq(product(a,X3,X4),true,ifeq(sum(c,X3,X1),true,sum(aPc,X4,X2),true),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_19]) ).
cnf(c_0_51,hypothesis,
sum(c,bS_Ic,b) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_42]),c_0_19]) ).
cnf(c_0_52,hypothesis,
ifeq2(product(a,b,X1),true,X1,aPb) = aPb,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23]) ).
cnf(c_0_53,axiom,
product(X1,X2,multiply(X1,X2)) = true,
closure_of_multiplication ).
cnf(c_0_54,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_45]),c_0_23]),c_0_46]) ).
cnf(c_0_55,hypothesis,
sum(aPb_S_IaPc,add(aPc,X1),add(aPb,X1)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_19]) ).
cnf(c_0_56,hypothesis,
ifeq(product(a,b,X1),true,ifeq(product(a,bS_Ic,X2),true,sum(aPc,X2,X1),true),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_19]) ).
cnf(c_0_57,hypothesis,
multiply(a,b) = aPb,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_23]) ).
cnf(c_0_58,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_54,c_0_49]) ).
cnf(c_0_59,hypothesis,
add(aPb_S_IaPc,add(aPc,X1)) = add(aPb,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_55]),c_0_23]) ).
cnf(c_0_60,hypothesis,
ifeq(product(a,bS_Ic,X1),true,sum(aPc,X1,aPb),true) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_57]),c_0_19]) ).
cnf(c_0_61,hypothesis,
add(add(aPb,X1),additive_inverse(add(aPc,X1))) = aPb_S_IaPc,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_46]) ).
cnf(c_0_62,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_58]),c_0_46]) ).
cnf(c_0_63,hypothesis,
sum(aPc,multiply(a,bS_Ic),aPb) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_53]),c_0_19]) ).
cnf(c_0_64,plain,
ifeq2(sum(additive_inverse(X1),X1,X2),true,additive_identity,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_23]) ).
cnf(c_0_65,hypothesis,
add(X1,add(aPb,additive_inverse(add(aPc,X1)))) = aPb_S_IaPc,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_49]),c_0_46]) ).
cnf(c_0_66,hypothesis,
add(aPc,multiply(a,bS_Ic)) = aPb,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_63]),c_0_23]) ).
cnf(c_0_67,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_30]),c_0_23]) ).
cnf(c_0_68,hypothesis,
multiply(a,bS_Ic) = aPb_S_IaPc,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_34]) ).
cnf(c_0_69,negated_conjecture,
product(a,bS_Ic,aPb_S_IaPc) != true,
prove_a_times_bS_Ic_is_aPb_S__IaPc ).
cnf(c_0_70,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_68]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : RNG006-10 : TPTP v8.1.2. Released v7.3.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n017.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 19:08:56 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.14/0.41 Running first-order model finding
% 0.14/0.41 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.NxftTJzG0O/E---3.1_9373.p
% 381.63/48.57 # Version: 3.1pre001
% 381.63/48.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 381.63/48.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 381.63/48.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 381.63/48.57 # Starting new_bool_3 with 300s (1) cores
% 381.63/48.57 # Starting new_bool_1 with 300s (1) cores
% 381.63/48.57 # Starting sh5l with 300s (1) cores
% 381.63/48.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 9450 completed with status 0
% 381.63/48.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 381.63/48.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 381.63/48.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 381.63/48.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 381.63/48.57 # No SInE strategy applied
% 381.63/48.57 # Search class: FUUPM-FFMS32-MFFFFFNN
% 381.63/48.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 381.63/48.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 675s (1) cores
% 381.63/48.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 381.63/48.57 # Starting new_bool_3 with 169s (1) cores
% 381.63/48.57 # Starting new_bool_1 with 169s (1) cores
% 381.63/48.57 # Starting sh5l with 169s (1) cores
% 381.63/48.57 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 9454 completed with status 0
% 381.63/48.57 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 381.63/48.57 # Preprocessing class: FSMSSMSMSSSNFFN.
% 381.63/48.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 381.63/48.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 381.63/48.57 # No SInE strategy applied
% 381.63/48.57 # Search class: FUUPM-FFMS32-MFFFFFNN
% 381.63/48.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 381.63/48.57 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 675s (1) cores
% 381.63/48.57 # Preprocessing time : 0.001 s
% 381.63/48.57
% 381.63/48.57 # Proof found!
% 381.63/48.57 # SZS status Unsatisfiable
% 381.63/48.57 # SZS output start CNFRefutation
% See solution above
% 381.63/48.57 # Parsed axioms : 24
% 381.63/48.57 # Removed by relevancy pruning/SinE : 0
% 381.63/48.57 # Initial clauses : 24
% 381.63/48.57 # Removed in clause preprocessing : 0
% 381.63/48.57 # Initial clauses in saturation : 24
% 381.63/48.57 # Processed clauses : 24928
% 381.63/48.57 # ...of these trivial : 16122
% 381.63/48.57 # ...subsumed : 345
% 381.63/48.57 # ...remaining for further processing : 8461
% 381.63/48.57 # Other redundant clauses eliminated : 0
% 381.63/48.57 # Clauses deleted for lack of memory : 74378
% 381.63/48.57 # Backward-subsumed : 0
% 381.63/48.57 # Backward-rewritten : 887
% 381.63/48.57 # Generated clauses : 2197317
% 381.63/48.57 # ...of the previous two non-redundant : 1598401
% 381.63/48.57 # ...aggressively subsumed : 0
% 381.63/48.57 # Contextual simplify-reflections : 0
% 381.63/48.57 # Paramodulations : 2197317
% 381.63/48.57 # Factorizations : 0
% 381.63/48.57 # NegExts : 0
% 381.63/48.57 # Equation resolutions : 0
% 381.63/48.57 # Total rewrite steps : 3409703
% 381.63/48.57 # Propositional unsat checks : 1
% 381.63/48.57 # Propositional check models : 1
% 381.63/48.57 # Propositional check unsatisfiable : 0
% 381.63/48.57 # Propositional clauses : 0
% 381.63/48.57 # Propositional clauses after purity: 0
% 381.63/48.57 # Propositional unsat core size : 0
% 381.63/48.57 # Propositional preprocessing time : 0.000
% 381.63/48.57 # Propositional encoding time : 1.701
% 381.63/48.57 # Propositional solver time : 0.035
% 381.63/48.57 # Success case prop preproc time : 0.000
% 381.63/48.57 # Success case prop encoding time : 0.000
% 381.63/48.57 # Success case prop solver time : 0.000
% 381.63/48.57 # Current number of processed clauses : 7574
% 381.63/48.57 # Positive orientable unit clauses : 7569
% 381.63/48.57 # Positive unorientable unit clauses: 4
% 381.63/48.57 # Negative unit clauses : 1
% 381.63/48.57 # Non-unit-clauses : 0
% 381.63/48.57 # Current number of unprocessed clauses: 866955
% 381.63/48.57 # ...number of literals in the above : 866955
% 381.63/48.57 # Current number of archived formulas : 0
% 381.63/48.57 # Current number of archived clauses : 887
% 381.63/48.57 # Clause-clause subsumption calls (NU) : 0
% 381.63/48.57 # Rec. Clause-clause subsumption calls : 0
% 381.63/48.57 # Non-unit clause-clause subsumptions : 0
% 381.63/48.57 # Unit Clause-clause subsumption calls : 31
% 381.63/48.57 # Rewrite failures with RHS unbound : 0
% 381.63/48.57 # BW rewrite match attempts : 1278025
% 381.63/48.57 # BW rewrite match successes : 1094
% 381.63/48.57 # Condensation attempts : 0
% 381.63/48.57 # Condensation successes : 0
% 381.63/48.57 # Termbank termtop insertions : 53551292
% 381.63/48.57
% 381.63/48.57 # -------------------------------------------------
% 381.63/48.57 # User time : 45.794 s
% 381.63/48.57 # System time : 1.789 s
% 381.63/48.57 # Total time : 47.583 s
% 381.63/48.57 # Maximum resident set size: 1564 pages
% 381.63/48.57
% 381.63/48.57 # -------------------------------------------------
% 381.63/48.57 # User time : 235.103 s
% 381.63/48.57 # System time : 3.219 s
% 381.63/48.57 # Total time : 238.323 s
% 381.63/48.57 # Maximum resident set size: 1688 pages
% 381.63/48.57 % E---3.1 exiting
%------------------------------------------------------------------------------