TSTP Solution File: LAT230-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT230-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:08:06 EDT 2023
% Result : Unsatisfiable 1547.91s 227.27s
% Output : CNFRefutation 1547.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of clauses : 76 ( 73 unt; 0 nHn; 15 RR)
% Number of literals : 81 ( 80 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 116 ( 23 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',complement_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',prove_distributivity_hypothesis) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',absorption2) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',idempotence_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',associativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',commutativity_of_join) ).
cnf(equation_H18,axiom,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X1,X2),join(meet(X1,X3),meet(X2,join(X1,X3))))),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',equation_H18) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',complement_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',idempotence_of_meet) ).
cnf(meet_join_complement,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',meet_join_complement) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/tmp/tmp.0obVDIjN3w/E---3.1_19512.p',prove_distributivity) ).
cnf(c_0_14,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_15,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_16,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_18,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_19,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_20,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_23,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_24,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_25,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_26,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_27,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_21]) ).
cnf(c_0_30,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_26]) ).
cnf(c_0_31,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_32,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_33,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_21]) ).
cnf(c_0_34,hypothesis,
join(meet(X1,b),meet(a,X1)) = meet(X1,b),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_35,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_36,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_23]) ).
cnf(c_0_37,hypothesis,
join(meet(X1,b),complement(meet(a,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_39,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_14]),c_0_21]) ).
cnf(c_0_40,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_41,axiom,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X1,X2),join(meet(X1,X3),meet(X2,join(X1,X3))))),
equation_H18 ).
cnf(c_0_42,hypothesis,
join(complement(a),meet(b,join(a,X1))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_14]),c_0_17]),c_0_35]) ).
cnf(c_0_43,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X3,X1)),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_44,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_21]),c_0_38]),c_0_40]) ).
cnf(c_0_45,hypothesis,
meet(a,join(b,X1)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_14]),c_0_24]) ).
cnf(c_0_46,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_47,hypothesis,
join(meet(complement(a),X1),meet(b,meet(complement(a),join(a,X2)))) = meet(complement(a),join(X1,meet(b,meet(complement(a),join(a,X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_16]),c_0_43]),c_0_17]),c_0_44]),c_0_39]),c_0_43]),c_0_17]) ).
cnf(c_0_48,hypothesis,
meet(a,join(X1,b)) = a,
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_49,hypothesis,
join(meet(X1,a),meet(X1,b)) = meet(X1,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_35]) ).
cnf(c_0_50,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_21,c_0_46]) ).
cnf(c_0_51,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_52,hypothesis,
join(meet(b,complement(a)),meet(complement(a),X1)) = meet(complement(a),join(X1,meet(b,complement(a)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_31]),c_0_16]),c_0_16]),c_0_35]) ).
cnf(c_0_53,plain,
join(X1,complement(meet(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_19]),c_0_35]) ).
cnf(c_0_54,hypothesis,
meet(X1,join(a,meet(X1,b))) = meet(X1,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_35]),c_0_38]),c_0_35]),c_0_49]),c_0_49]) ).
cnf(c_0_55,hypothesis,
join(b,complement(a)) = join(b,one),
inference(spm,[status(thm)],[c_0_50,c_0_15]) ).
cnf(c_0_56,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_57,hypothesis,
join(b,meet(complement(a),join(X1,meet(b,complement(a))))) = join(b,meet(complement(a),X1)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_58,plain,
join(X1,complement(join(meet(X1,X2),meet(X1,X3)))) = one,
inference(spm,[status(thm)],[c_0_53,c_0_41]) ).
cnf(c_0_59,hypothesis,
meet(X1,join(a,meet(b,X1))) = meet(b,X1),
inference(spm,[status(thm)],[c_0_54,c_0_17]) ).
cnf(c_0_60,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_61,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[c_0_55,c_0_31]) ).
cnf(c_0_62,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_35]) ).
cnf(c_0_63,axiom,
( complement(X1) = X2
| meet(X1,X2) != zero
| join(X1,X2) != one ),
meet_join_complement ).
cnf(c_0_64,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_56,c_0_23]) ).
cnf(c_0_65,hypothesis,
join(b,meet(complement(a),join(meet(b,complement(a)),X1))) = join(b,meet(complement(a),X1)),
inference(spm,[status(thm)],[c_0_57,c_0_35]) ).
cnf(c_0_66,hypothesis,
join(X1,complement(join(meet(X1,X2),meet(b,X1)))) = one,
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_67,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_60]) ).
cnf(c_0_68,hypothesis,
join(meet(b,X1),meet(b,complement(a))) = meet(b,join(X1,meet(b,complement(a)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_61]),c_0_16]),c_0_38]),c_0_40]) ).
cnf(c_0_69,plain,
meet(X1,meet(X2,join(X3,meet(X1,X2)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_62]) ).
cnf(c_0_70,plain,
( meet(X1,complement(meet(X2,X1))) = complement(X2)
| join(X2,meet(X1,complement(meet(X2,X1)))) != one ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_16]),c_0_55]),c_0_31]),c_0_23]),c_0_67]),c_0_68]),c_0_35]),c_0_52]),c_0_69]) ).
cnf(c_0_72,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
prove_distributivity ).
cnf(c_0_73,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_72,c_0_35]) ).
cnf(c_0_75,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_73]),c_0_74]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LAT230-1 : TPTP v8.1.2. Released v3.1.0.
% 0.09/0.10 % Command : run_E %s %d THM
% 0.11/0.30 % Computer : n023.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 2400
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Oct 2 10:39:22 EDT 2023
% 0.11/0.30 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.0obVDIjN3w/E---3.1_19512.p
% 1547.91/227.27 # Version: 3.1pre001
% 1547.91/227.27 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1547.91/227.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1547.91/227.27 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1547.91/227.27 # Starting new_bool_3 with 300s (1) cores
% 1547.91/227.27 # Starting new_bool_1 with 300s (1) cores
% 1547.91/227.27 # Starting sh5l with 300s (1) cores
% 1547.91/227.27 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19592 completed with status 0
% 1547.91/227.27 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1547.91/227.27 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1547.91/227.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1547.91/227.27 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1547.91/227.27 # No SInE strategy applied
% 1547.91/227.27 # Search class: FHUPM-FFSF21-MFFFFFNN
% 1547.91/227.27 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1547.91/227.27 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 1547.91/227.27 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1547.91/227.27 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 1547.91/227.27 # Starting new_bool_3 with 136s (1) cores
% 1547.91/227.27 # Starting new_bool_1 with 136s (1) cores
% 1547.91/227.27 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 19601 completed with status 7
% 1547.91/227.27 # Starting G-E--_303_C18_F1_URBAN_S0Y with 130s (1) cores
% 1547.91/227.27 # new_bool_3 with pid 19602 completed with status 7
% 1547.91/227.27 # new_bool_1 with pid 19604 completed with status 7
% 1547.91/227.27 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19600 completed with status 7
% 1547.91/227.27 # G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 19597 completed with status 0
% 1547.91/227.27 # Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 1547.91/227.27 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1547.91/227.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1547.91/227.27 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1547.91/227.27 # No SInE strategy applied
% 1547.91/227.27 # Search class: FHUPM-FFSF21-MFFFFFNN
% 1547.91/227.27 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1547.91/227.27 # Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 811s (1) cores
% 1547.91/227.27 # Preprocessing time : 0.001 s
% 1547.91/227.27 # Presaturation interreduction done
% 1547.91/227.27
% 1547.91/227.27 # Proof found!
% 1547.91/227.27 # SZS status Unsatisfiable
% 1547.91/227.27 # SZS output start CNFRefutation
% See solution above
% 1547.91/227.27 # Parsed axioms : 14
% 1547.91/227.27 # Removed by relevancy pruning/SinE : 0
% 1547.91/227.27 # Initial clauses : 14
% 1547.91/227.27 # Removed in clause preprocessing : 0
% 1547.91/227.27 # Initial clauses in saturation : 14
% 1547.91/227.27 # Processed clauses : 61961
% 1547.91/227.27 # ...of these trivial : 29780
% 1547.91/227.27 # ...subsumed : 29367
% 1547.91/227.27 # ...remaining for further processing : 2814
% 1547.91/227.27 # Other redundant clauses eliminated : 0
% 1547.91/227.27 # Clauses deleted for lack of memory : 142646
% 1547.91/227.27 # Backward-subsumed : 21
% 1547.91/227.27 # Backward-rewritten : 375
% 1547.91/227.27 # Generated clauses : 5365280
% 1547.91/227.27 # ...of the previous two non-redundant : 3619471
% 1547.91/227.27 # ...aggressively subsumed : 0
% 1547.91/227.27 # Contextual simplify-reflections : 0
% 1547.91/227.27 # Paramodulations : 5365262
% 1547.91/227.27 # Factorizations : 0
% 1547.91/227.27 # NegExts : 0
% 1547.91/227.27 # Equation resolutions : 18
% 1547.91/227.27 # Total rewrite steps : 22168558
% 1547.91/227.27 # Propositional unsat checks : 0
% 1547.91/227.27 # Propositional check models : 0
% 1547.91/227.27 # Propositional check unsatisfiable : 0
% 1547.91/227.27 # Propositional clauses : 0
% 1547.91/227.27 # Propositional clauses after purity: 0
% 1547.91/227.27 # Propositional unsat core size : 0
% 1547.91/227.27 # Propositional preprocessing time : 0.000
% 1547.91/227.27 # Propositional encoding time : 0.000
% 1547.91/227.27 # Propositional solver time : 0.000
% 1547.91/227.27 # Success case prop preproc time : 0.000
% 1547.91/227.27 # Success case prop encoding time : 0.000
% 1547.91/227.27 # Success case prop solver time : 0.000
% 1547.91/227.27 # Current number of processed clauses : 2404
% 1547.91/227.27 # Positive orientable unit clauses : 2224
% 1547.91/227.27 # Positive unorientable unit clauses: 10
% 1547.91/227.27 # Negative unit clauses : 1
% 1547.91/227.27 # Non-unit-clauses : 169
% 1547.91/227.27 # Current number of unprocessed clauses: 756138
% 1547.91/227.27 # ...number of literals in the above : 798609
% 1547.91/227.27 # Current number of archived formulas : 0
% 1547.91/227.27 # Current number of archived clauses : 410
% 1547.91/227.27 # Clause-clause subsumption calls (NU) : 33971
% 1547.91/227.27 # Rec. Clause-clause subsumption calls : 33971
% 1547.91/227.27 # Non-unit clause-clause subsumptions : 11756
% 1547.91/227.27 # Unit Clause-clause subsumption calls : 890
% 1547.91/227.27 # Rewrite failures with RHS unbound : 0
% 1547.91/227.27 # BW rewrite match attempts : 95133
% 1547.91/227.27 # BW rewrite match successes : 2833
% 1547.91/227.27 # Condensation attempts : 0
% 1547.91/227.27 # Condensation successes : 0
% 1547.91/227.27 # Termbank termtop insertions : 209903187
% 1547.91/227.27
% 1547.91/227.27 # -------------------------------------------------
% 1547.91/227.27 # User time : 776.494 s
% 1547.91/227.27 # System time : 6.834 s
% 1547.91/227.27 # Total time : 783.328 s
% 1547.91/227.27 # Maximum resident set size: 1616 pages
% 1547.91/227.27
% 1547.91/227.27 # -------------------------------------------------
% 1547.91/227.27 # User time : 864.424 s
% 1547.91/227.27 # System time : 8.756 s
% 1547.91/227.27 # Total time : 873.180 s
% 1547.91/227.27 # Maximum resident set size: 1672 pages
% 1547.91/227.27 % E---3.1 exiting
% 1547.91/227.27 % E---3.1 exiting
%------------------------------------------------------------------------------