TSTP Solution File: GRP180-2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP180-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 17:39:09 EDT 2023
% Result : Unsatisfiable 7.52s 1.33s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of clauses : 68 ( 68 unt; 0 nHn; 6 RR)
% Number of literals : 68 ( 67 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 134 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',left_inverse) ).
cnf(p11_2,hypothesis,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',p11_2) ).
cnf(p11_3,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',p11_3) ).
cnf(p11_1,hypothesis,
inverse(identity) = identity,
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',p11_1) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',left_identity) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',associativity) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',monotony_glb1) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',symmetry_of_glb) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',glb_absorbtion) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',symmetry_of_lub) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',associativity_of_lub) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',lub_absorbtion) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',monotony_lub1) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',associativity_of_glb) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',monotony_lub2) ).
cnf(prove_p11,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/tmp/tmp.TNj8Bk7oWf/E---3.1_9536.p',prove_p11) ).
cnf(c_0_17,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_18,hypothesis,
inverse(inverse(X1)) = X1,
p11_2 ).
cnf(c_0_19,hypothesis,
inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)),
p11_3 ).
cnf(c_0_20,hypothesis,
inverse(identity) = identity,
p11_1 ).
cnf(c_0_21,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_22,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_23,hypothesis,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,hypothesis,
multiply(inverse(X1),identity) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,hypothesis,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_26,hypothesis,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]) ).
cnf(c_0_27,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_28,hypothesis,
multiply(X1,identity) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_29,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_30,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_31,hypothesis,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_18]) ).
cnf(c_0_32,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_33,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_34,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_35,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_36,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_37,hypothesis,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(identity,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_38,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_30]) ).
cnf(c_0_39,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_40,hypothesis,
multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_29,c_0_31]) ).
cnf(c_0_41,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_42,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,hypothesis,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_28]),c_0_33]) ).
cnf(c_0_44,hypothesis,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_39,c_0_32]) ).
cnf(c_0_46,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_47,hypothesis,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_48,hypothesis,
multiply(greatest_lower_bound(X1,multiply(X2,X3)),inverse(X3)) = greatest_lower_bound(multiply(X1,inverse(X3)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_19]),c_0_18]),c_0_18]) ).
cnf(c_0_49,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_17]),c_0_21]) ).
cnf(c_0_50,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(greatest_lower_bound(X1,X3),X2)) = least_upper_bound(greatest_lower_bound(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_30]) ).
cnf(c_0_51,hypothesis,
least_upper_bound(greatest_lower_bound(X1,identity),multiply(X1,greatest_lower_bound(identity,X1))) = multiply(greatest_lower_bound(X1,identity),least_upper_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
greatest_lower_bound(X1,multiply(greatest_lower_bound(X2,identity),least_upper_bound(X1,X3))) = greatest_lower_bound(X1,multiply(X2,least_upper_bound(X1,X3))),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_53,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_21]),c_0_33]) ).
cnf(c_0_54,hypothesis,
multiply(X1,inverse(greatest_lower_bound(X2,multiply(X3,X1)))) = inverse(greatest_lower_bound(multiply(X2,inverse(X1)),X3)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_55,plain,
greatest_lower_bound(identity,multiply(inverse(X1),X2)) = multiply(inverse(X1),greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_17]),c_0_30]) ).
cnf(c_0_56,hypothesis,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_19]),c_0_18]) ).
cnf(c_0_57,hypothesis,
multiply(greatest_lower_bound(X1,identity),least_upper_bound(X1,identity)) = X1,
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_50,c_0_51]),c_0_43]),c_0_33]),c_0_35]),c_0_28]),c_0_52]),c_0_37]),c_0_41]),c_0_28]) ).
cnf(c_0_58,hypothesis,
multiply(least_upper_bound(X1,identity),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_23]),c_0_33]) ).
cnf(c_0_59,hypothesis,
multiply(greatest_lower_bound(X1,multiply(X2,inverse(X3))),X3) = greatest_lower_bound(multiply(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_47]),c_0_18]) ).
cnf(c_0_60,negated_conjecture,
multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) != least_upper_bound(a,b),
prove_p11 ).
cnf(c_0_61,hypothesis,
multiply(X1,multiply(inverse(greatest_lower_bound(X1,X2)),X2)) = inverse(greatest_lower_bound(inverse(X1),inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_25]),c_0_21]) ).
cnf(c_0_62,hypothesis,
multiply(X1,least_upper_bound(X2,inverse(multiply(X3,X1)))) = least_upper_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_36,c_0_56]) ).
cnf(c_0_63,hypothesis,
least_upper_bound(identity,inverse(X1)) = inverse(greatest_lower_bound(X1,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_64,hypothesis,
multiply(X1,inverse(greatest_lower_bound(multiply(X2,X1),X3))) = inverse(greatest_lower_bound(X2,multiply(X3,inverse(X1)))),
inference(spm,[status(thm)],[c_0_56,c_0_59]) ).
cnf(c_0_65,negated_conjecture,
inverse(greatest_lower_bound(inverse(a),inverse(b))) != least_upper_bound(a,b),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,hypothesis,
inverse(greatest_lower_bound(X1,inverse(X2))) = least_upper_bound(X2,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),c_0_21]),c_0_28]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_18]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP180-2 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.08/0.26 % Computer : n026.cluster.edu
% 0.08/0.26 % Model : x86_64 x86_64
% 0.08/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.26 % Memory : 8042.1875MB
% 0.08/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.26 % CPULimit : 2400
% 0.08/0.26 % WCLimit : 300
% 0.08/0.26 % DateTime : Tue Oct 3 03:08:14 EDT 2023
% 0.08/0.27 % CPUTime :
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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.TNj8Bk7oWf/E---3.1_9536.p
% 7.52/1.33 # Version: 3.1pre001
% 7.52/1.33 # Preprocessing class: FSMSSMSSSSSNFFN.
% 7.52/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.52/1.33 # Starting new_bool_3 with 300s (1) cores
% 7.52/1.33 # Starting new_bool_1 with 300s (1) cores
% 7.52/1.33 # Starting sh5l with 300s (1) cores
% 7.52/1.33 # new_bool_1 with pid 9688 completed with status 0
% 7.52/1.33 # Result found by new_bool_1
% 7.52/1.33 # Preprocessing class: FSMSSMSSSSSNFFN.
% 7.52/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.52/1.33 # Starting new_bool_3 with 300s (1) cores
% 7.52/1.33 # Starting new_bool_1 with 300s (1) cores
% 7.52/1.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 7.52/1.33 # Search class: FUUPM-FFSF21-MFFFFFNN
% 7.52/1.33 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 7.52/1.33 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 7.52/1.33 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 9694 completed with status 0
% 7.52/1.33 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 7.52/1.33 # Preprocessing class: FSMSSMSSSSSNFFN.
% 7.52/1.33 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.33 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.52/1.33 # Starting new_bool_3 with 300s (1) cores
% 7.52/1.33 # Starting new_bool_1 with 300s (1) cores
% 7.52/1.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 7.52/1.33 # Search class: FUUPM-FFSF21-MFFFFFNN
% 7.52/1.33 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 7.52/1.33 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 7.52/1.33 # Preprocessing time : 0.001 s
% 7.52/1.33 # Presaturation interreduction done
% 7.52/1.33
% 7.52/1.33 # Proof found!
% 7.52/1.33 # SZS status Unsatisfiable
% 7.52/1.33 # SZS output start CNFRefutation
% See solution above
% 7.52/1.33 # Parsed axioms : 19
% 7.52/1.33 # Removed by relevancy pruning/SinE : 0
% 7.52/1.33 # Initial clauses : 19
% 7.52/1.33 # Removed in clause preprocessing : 0
% 7.52/1.33 # Initial clauses in saturation : 19
% 7.52/1.33 # Processed clauses : 5017
% 7.52/1.33 # ...of these trivial : 1790
% 7.52/1.33 # ...subsumed : 2624
% 7.52/1.33 # ...remaining for further processing : 603
% 7.52/1.33 # Other redundant clauses eliminated : 0
% 7.52/1.33 # Clauses deleted for lack of memory : 0
% 7.52/1.33 # Backward-subsumed : 0
% 7.52/1.33 # Backward-rewritten : 119
% 7.52/1.33 # Generated clauses : 133664
% 7.52/1.33 # ...of the previous two non-redundant : 91478
% 7.52/1.33 # ...aggressively subsumed : 0
% 7.52/1.33 # Contextual simplify-reflections : 0
% 7.52/1.33 # Paramodulations : 133664
% 7.52/1.33 # Factorizations : 0
% 7.52/1.33 # NegExts : 0
% 7.52/1.33 # Equation resolutions : 0
% 7.52/1.33 # Total rewrite steps : 198817
% 7.52/1.33 # Propositional unsat checks : 0
% 7.52/1.33 # Propositional check models : 0
% 7.52/1.33 # Propositional check unsatisfiable : 0
% 7.52/1.33 # Propositional clauses : 0
% 7.52/1.33 # Propositional clauses after purity: 0
% 7.52/1.33 # Propositional unsat core size : 0
% 7.52/1.33 # Propositional preprocessing time : 0.000
% 7.52/1.33 # Propositional encoding time : 0.000
% 7.52/1.33 # Propositional solver time : 0.000
% 7.52/1.33 # Success case prop preproc time : 0.000
% 7.52/1.33 # Success case prop encoding time : 0.000
% 7.52/1.33 # Success case prop solver time : 0.000
% 7.52/1.33 # Current number of processed clauses : 465
% 7.52/1.33 # Positive orientable unit clauses : 432
% 7.52/1.33 # Positive unorientable unit clauses: 33
% 7.52/1.33 # Negative unit clauses : 0
% 7.52/1.33 # Non-unit-clauses : 0
% 7.52/1.33 # Current number of unprocessed clauses: 86183
% 7.52/1.33 # ...number of literals in the above : 86183
% 7.52/1.33 # Current number of archived formulas : 0
% 7.52/1.33 # Current number of archived clauses : 138
% 7.52/1.33 # Clause-clause subsumption calls (NU) : 0
% 7.52/1.33 # Rec. Clause-clause subsumption calls : 0
% 7.52/1.33 # Non-unit clause-clause subsumptions : 0
% 7.52/1.33 # Unit Clause-clause subsumption calls : 274
% 7.52/1.33 # Rewrite failures with RHS unbound : 0
% 7.52/1.33 # BW rewrite match attempts : 1947
% 7.52/1.33 # BW rewrite match successes : 518
% 7.52/1.33 # Condensation attempts : 0
% 7.52/1.33 # Condensation successes : 0
% 7.52/1.33 # Termbank termtop insertions : 1697535
% 7.52/1.33
% 7.52/1.33 # -------------------------------------------------
% 7.52/1.33 # User time : 0.873 s
% 7.52/1.33 # System time : 0.031 s
% 7.52/1.33 # Total time : 0.904 s
% 7.52/1.33 # Maximum resident set size: 1608 pages
% 7.52/1.33
% 7.52/1.33 # -------------------------------------------------
% 7.52/1.33 # User time : 0.876 s
% 7.52/1.33 # System time : 0.031 s
% 7.52/1.33 # Total time : 0.907 s
% 7.52/1.33 # Maximum resident set size: 1676 pages
% 7.52/1.33 % E---3.1 exiting
% 7.52/1.34 % E---3.1 exiting
%------------------------------------------------------------------------------