TSTP Solution File: GRP179-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP179-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:54:40 EDT 2024
% Result : Unsatisfiable 2.59s 0.80s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 12
% Syntax : Number of clauses : 68 ( 68 unt; 0 nHn; 4 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 : 122 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_glb) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',monotony_lub1) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',symmetry_of_lub) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_glb) ).
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/sandbox/benchmark/Axioms/GRP004-2.ax',associativity_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',glb_absorbtion) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-2.ax',lub_absorbtion) ).
cnf(prove_p10,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p10) ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_17,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_21,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_22,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_23,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_24,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_21]),c_0_18]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_26,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_22,c_0_14]),c_0_23]) ).
cnf(c_0_27,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_28,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_29,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_24]),c_0_19]) ).
cnf(c_0_30,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_31,plain,
multiply(greatest_lower_bound(X1,identity),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_23]) ).
cnf(c_0_32,plain,
multiply(greatest_lower_bound(X1,inverse(X2)),X2) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_23]) ).
cnf(c_0_33,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_34,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_28]) ).
cnf(c_0_35,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_36,plain,
multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_22,c_0_29]) ).
cnf(c_0_37,plain,
multiply(X1,inverse(greatest_lower_bound(X1,identity))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
multiply(greatest_lower_bound(X1,greatest_lower_bound(X2,inverse(X3))),X3) = greatest_lower_bound(identity,multiply(greatest_lower_bound(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),least_upper_bound(X1,identity)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_13]),c_0_28]) ).
cnf(c_0_40,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_35,c_0_19]) ).
cnf(c_0_41,plain,
multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_28]) ).
cnf(c_0_42,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_43,plain,
greatest_lower_bound(X1,greatest_lower_bound(identity,multiply(X2,X1))) = greatest_lower_bound(identity,multiply(greatest_lower_bound(X2,identity),X1)),
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_36,c_0_37]),c_0_19]),c_0_38]),c_0_19]),c_0_23]),c_0_33]) ).
cnf(c_0_44,plain,
multiply(inverse(X1),least_upper_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_45,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_46,plain,
multiply(X1,least_upper_bound(X2,inverse(multiply(X3,X1)))) = least_upper_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_47,plain,
multiply(inverse(least_upper_bound(X1,identity)),X1) = inverse(least_upper_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_48,plain,
multiply(X1,least_upper_bound(X2,least_upper_bound(X3,inverse(X1)))) = least_upper_bound(identity,multiply(X1,least_upper_bound(X2,X3))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_50,plain,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,inverse(X1)),least_upper_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_23]),c_0_45]),c_0_23]) ).
cnf(c_0_51,plain,
least_upper_bound(X1,least_upper_bound(identity,multiply(X1,X2))) = least_upper_bound(identity,multiply(X1,least_upper_bound(X2,identity))),
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_46,c_0_47]),c_0_19]),c_0_48]),c_0_19]),c_0_28]),c_0_42]) ).
cnf(c_0_52,plain,
multiply(greatest_lower_bound(identity,X1),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_53,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_23]) ).
cnf(c_0_54,plain,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1)))) = identity,
inference(spm,[status(thm)],[c_0_50,c_0_19]) ).
cnf(c_0_55,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1)))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_49]),c_0_28]),c_0_49]),c_0_28]) ).
cnf(c_0_56,plain,
multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_28]),c_0_55]) ).
cnf(c_0_57,plain,
least_upper_bound(identity,inverse(X1)) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_56]),c_0_18]) ).
cnf(c_0_58,plain,
multiply(X1,inverse(greatest_lower_bound(identity,X1))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_30,c_0_52]) ).
cnf(c_0_59,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_60,plain,
inverse(greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_57]),c_0_58]),c_0_18]) ).
cnf(c_0_61,plain,
multiply(inverse(least_upper_bound(X1,multiply(X2,X3))),X2) = inverse(least_upper_bound(multiply(inverse(X2),X1),X3)),
inference(spm,[status(thm)],[c_0_40,c_0_59]) ).
cnf(c_0_62,plain,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_19,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
inference(fof_simplification,[status(thm)],[prove_p10]) ).
cnf(c_0_64,plain,
inverse(least_upper_bound(inverse(X1),X2)) = greatest_lower_bound(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_36]),c_0_14]),c_0_18]) ).
cnf(c_0_65,negated_conjecture,
inverse(least_upper_bound(a,b)) != greatest_lower_bound(inverse(a),inverse(b)),
c_0_63 ).
cnf(c_0_66,plain,
greatest_lower_bound(inverse(X1),inverse(X2)) = inverse(least_upper_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_64,c_0_19]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP179-1 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 04:27:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/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/benchmark/theBenchmark.p
% 2.59/0.80 # Version: 3.1.0
% 2.59/0.80 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.59/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.59/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.59/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.59/0.80 # Starting new_bool_1 with 300s (1) cores
% 2.59/0.80 # Starting sh5l with 300s (1) cores
% 2.59/0.80 # new_bool_1 with pid 30241 completed with status 0
% 2.59/0.80 # Result found by new_bool_1
% 2.59/0.80 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.59/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.59/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.59/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.59/0.80 # Starting new_bool_1 with 300s (1) cores
% 2.59/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.59/0.80 # Search class: FUUPM-FFSF21-SFFFFFNN
% 2.59/0.80 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.59/0.80 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.59/0.80 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30246 completed with status 0
% 2.59/0.80 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.59/0.80 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.59/0.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.59/0.80 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.59/0.80 # Starting new_bool_3 with 300s (1) cores
% 2.59/0.80 # Starting new_bool_1 with 300s (1) cores
% 2.59/0.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.59/0.80 # Search class: FUUPM-FFSF21-SFFFFFNN
% 2.59/0.80 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.59/0.80 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.59/0.80 # Preprocessing time : 0.001 s
% 2.59/0.80 # Presaturation interreduction done
% 2.59/0.80
% 2.59/0.80 # Proof found!
% 2.59/0.80 # SZS status Unsatisfiable
% 2.59/0.80 # SZS output start CNFRefutation
% See solution above
% 2.59/0.80 # Parsed axioms : 16
% 2.59/0.80 # Removed by relevancy pruning/SinE : 0
% 2.59/0.80 # Initial clauses : 16
% 2.59/0.80 # Removed in clause preprocessing : 0
% 2.59/0.80 # Initial clauses in saturation : 16
% 2.59/0.80 # Processed clauses : 2607
% 2.59/0.80 # ...of these trivial : 1298
% 2.59/0.80 # ...subsumed : 884
% 2.59/0.80 # ...remaining for further processing : 425
% 2.59/0.80 # Other redundant clauses eliminated : 0
% 2.59/0.80 # Clauses deleted for lack of memory : 0
% 2.59/0.80 # Backward-subsumed : 0
% 2.59/0.80 # Backward-rewritten : 112
% 2.59/0.80 # Generated clauses : 50292
% 2.59/0.80 # ...of the previous two non-redundant : 29779
% 2.59/0.80 # ...aggressively subsumed : 0
% 2.59/0.80 # Contextual simplify-reflections : 0
% 2.59/0.80 # Paramodulations : 50292
% 2.59/0.80 # Factorizations : 0
% 2.59/0.80 # NegExts : 0
% 2.59/0.80 # Equation resolutions : 0
% 2.59/0.80 # Disequality decompositions : 0
% 2.59/0.80 # Total rewrite steps : 77875
% 2.59/0.80 # ...of those cached : 65496
% 2.59/0.80 # Propositional unsat checks : 0
% 2.59/0.80 # Propositional check models : 0
% 2.59/0.80 # Propositional check unsatisfiable : 0
% 2.59/0.80 # Propositional clauses : 0
% 2.59/0.80 # Propositional clauses after purity: 0
% 2.59/0.80 # Propositional unsat core size : 0
% 2.59/0.80 # Propositional preprocessing time : 0.000
% 2.59/0.80 # Propositional encoding time : 0.000
% 2.59/0.80 # Propositional solver time : 0.000
% 2.59/0.80 # Success case prop preproc time : 0.000
% 2.59/0.80 # Success case prop encoding time : 0.000
% 2.59/0.80 # Success case prop solver time : 0.000
% 2.59/0.80 # Current number of processed clauses : 297
% 2.59/0.80 # Positive orientable unit clauses : 285
% 2.59/0.80 # Positive unorientable unit clauses: 12
% 2.59/0.80 # Negative unit clauses : 0
% 2.59/0.80 # Non-unit-clauses : 0
% 2.59/0.80 # Current number of unprocessed clauses: 27034
% 2.59/0.80 # ...number of literals in the above : 27034
% 2.59/0.80 # Current number of archived formulas : 0
% 2.59/0.80 # Current number of archived clauses : 128
% 2.59/0.80 # Clause-clause subsumption calls (NU) : 0
% 2.59/0.80 # Rec. Clause-clause subsumption calls : 0
% 2.59/0.80 # Non-unit clause-clause subsumptions : 0
% 2.59/0.80 # Unit Clause-clause subsumption calls : 26
% 2.59/0.80 # Rewrite failures with RHS unbound : 0
% 2.59/0.80 # BW rewrite match attempts : 1052
% 2.59/0.80 # BW rewrite match successes : 275
% 2.59/0.80 # Condensation attempts : 0
% 2.59/0.80 # Condensation successes : 0
% 2.59/0.80 # Termbank termtop insertions : 566291
% 2.59/0.80 # Search garbage collected termcells : 2
% 2.59/0.80
% 2.59/0.80 # -------------------------------------------------
% 2.59/0.80 # User time : 0.315 s
% 2.59/0.80 # System time : 0.009 s
% 2.59/0.80 # Total time : 0.325 s
% 2.59/0.80 # Maximum resident set size: 1652 pages
% 2.59/0.80
% 2.59/0.80 # -------------------------------------------------
% 2.59/0.80 # User time : 0.318 s
% 2.59/0.80 # System time : 0.011 s
% 2.59/0.80 # Total time : 0.328 s
% 2.59/0.80 # Maximum resident set size: 1700 pages
% 2.59/0.80 % E---3.1 exiting
%------------------------------------------------------------------------------