TSTP Solution File: GRP430-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GRP430-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 : Sat May 4 08:00:04 EDT 2024
% Result : Unsatisfiable 1.63s 0.72s
% Output : CNFRefutation 2.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 2
% Syntax : Number of clauses : 59 ( 59 unt; 0 nHn; 13 RR)
% Number of literals : 59 ( 58 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 130 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,X2))),X1)))) = X4,
file('/export/starexec/sandbox/tmp/tmp.GqOu6qgOeK/E---3.1_19595.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/tmp/tmp.GqOu6qgOeK/E---3.1_19595.p',prove_these_axioms_1) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,X2))),X1)))) = X4,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,X4))),multiply(X5,inverse(X5))),multiply(X3,X1)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(X3,inverse(X3))),multiply(X4,X1)))) = multiply(multiply(multiply(X5,inverse(X5)),inverse(multiply(X2,X4))),multiply(X6,inverse(X6))),
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,multiply(X3,inverse(multiply(multiply(X4,multiply(X5,inverse(X5))),multiply(X2,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,X3))) = multiply(multiply(X4,inverse(X4)),inverse(multiply(X2,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_7,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_6]),c_0_2]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(inverse(X2),multiply(multiply(X3,inverse(X3)),X1)))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_7]) ).
cnf(c_0_9,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,X2))),X5))),multiply(multiply(multiply(X6,inverse(X6)),inverse(X4)),X1)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_10,plain,
multiply(inverse(multiply(X1,multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,X1))),multiply(multiply(X4,inverse(X4)),inverse(multiply(X5,X6)))))),inverse(multiply(X6,X3))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_11,plain,
multiply(X1,multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(multiply(X3,inverse(X3)),X1))),X4)) = X4,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,X3)),multiply(multiply(multiply(X4,inverse(X4)),inverse(X5)),X1)))) = inverse(multiply(X6,multiply(multiply(multiply(X7,inverse(X7)),inverse(multiply(X3,X6))),multiply(multiply(X8,inverse(X8)),inverse(multiply(X5,X2)))))),
inference(spm,[status(thm)],[c_0_2,c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,inverse(multiply(multiply(multiply(multiply(X2,inverse(X2)),inverse(X3)),multiply(X4,inverse(X4))),multiply(X5,X1)))) = inverse(multiply(multiply(a1,inverse(multiply(multiply(X6,multiply(a1,inverse(a1))),multiply(X3,a1)))),multiply(X6,X5))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_4]) ).
cnf(c_0_14,plain,
multiply(inverse(multiply(X1,inverse(X1))),inverse(multiply(inverse(X2),multiply(X3,inverse(X3))))) = X2,
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_15,plain,
multiply(X1,inverse(multiply(inverse(multiply(multiply(a1,inverse(multiply(multiply(X2,multiply(a1,inverse(a1))),multiply(X3,a1)))),multiply(X2,X4))),multiply(multiply(multiply(X5,inverse(X5)),inverse(X3)),X1)))) = X4,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_3]),c_0_4]) ).
cnf(c_0_16,plain,
multiply(inverse(multiply(X1,inverse(X1))),multiply(multiply(X2,inverse(X2)),X3)) = X3,
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_17,plain,
multiply(multiply(a1,inverse(multiply(inverse(multiply(X1,X2)),multiply(multiply(multiply(a1,inverse(a1)),inverse(X3)),a1)))),inverse(multiply(X1,X2))) = X3,
inference(rw,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
inverse(multiply(multiply(a1,inverse(multiply(multiply(a1,multiply(a1,inverse(a1))),multiply(multiply(X1,X2),a1)))),multiply(a1,X1))) = X2,
inference(rw,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_19,plain,
multiply(multiply(a1,inverse(multiply(multiply(X1,multiply(a1,inverse(a1))),multiply(multiply(X2,inverse(X2)),a1)))),multiply(X1,X3)) = X3,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
multiply(inverse(multiply(X1,inverse(X1))),multiply(X2,inverse(X2))) = inverse(multiply(X3,inverse(X3))),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_21,plain,
multiply(multiply(a1,inverse(multiply(X1,multiply(multiply(multiply(a1,inverse(a1)),inverse(X2)),a1)))),X1) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
multiply(multiply(a1,inverse(a1)),multiply(inverse(multiply(X1,inverse(X1))),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16]) ).
cnf(c_0_23,plain,
inverse(multiply(multiply(a1,inverse(multiply(multiply(a1,multiply(a1,inverse(a1))),X1))),multiply(a1,a1))) = inverse(multiply(a1,multiply(multiply(multiply(a1,inverse(a1)),inverse(X1)),a1))),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_24,plain,
multiply(multiply(X1,inverse(X1)),multiply(inverse(multiply(X2,inverse(X2))),X3)) = X3,
inference(spm,[status(thm)],[c_0_22,c_0_7]) ).
cnf(c_0_25,plain,
multiply(inverse(multiply(X1,inverse(X1))),inverse(inverse(multiply(X2,inverse(X2))))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_26,plain,
inverse(multiply(a1,multiply(multiply(multiply(a1,inverse(a1)),inverse(multiply(multiply(a1,X1),a1))),a1))) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_27,plain,
multiply(X1,inverse(multiply(inverse(inverse(multiply(X2,inverse(X2)))),multiply(X3,X1)))) = inverse(X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_24]),c_0_19]) ).
cnf(c_0_28,plain,
multiply(multiply(a1,multiply(multiply(multiply(a1,inverse(a1)),inverse(multiply(multiply(a1,X1),a1))),a1)),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_25]) ).
cnf(c_0_29,plain,
inverse(multiply(inverse(X1),multiply(X2,inverse(X2)))) = multiply(multiply(a1,inverse(a1)),X1),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_30,plain,
multiply(multiply(a1,inverse(a1)),inverse(multiply(X1,inverse(X1)))) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(a1,inverse(a1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]),c_0_26]) ).
cnf(c_0_32,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_31,c_0_7]) ).
cnf(c_0_33,plain,
multiply(multiply(a1,inverse(a1)),X1) = inverse(inverse(X1)),
inference(rw,[status(thm)],[c_0_29,c_0_32]) ).
cnf(c_0_34,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,inverse(X2)))) = multiply(X3,inverse(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_7]) ).
cnf(c_0_35,plain,
multiply(multiply(inverse(multiply(X1,inverse(X1))),X2),inverse(multiply(inverse(X3),X2))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_24]) ).
cnf(c_0_36,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_33]),c_0_32]),c_0_34]),c_0_33]) ).
cnf(c_0_37,plain,
inverse(inverse(inverse(multiply(a1,inverse(a1))))) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_33]),c_0_34]) ).
cnf(c_0_38,plain,
multiply(multiply(a1,inverse(multiply(multiply(a1,multiply(a1,inverse(a1))),X1))),multiply(a1,a1)) = multiply(a1,multiply(multiply(multiply(a1,inverse(a1)),inverse(X1)),a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_23]),c_0_35]) ).
cnf(c_0_39,plain,
inverse(multiply(a1,inverse(a1))) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
multiply(multiply(multiply(a1,inverse(a1)),inverse(multiply(multiply(a1,a1),a1))),a1) = inverse(multiply(a1,multiply(multiply(a1,inverse(a1)),a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_28]),c_0_38]),c_0_7]) ).
cnf(c_0_41,plain,
multiply(multiply(X1,inverse(X1)),X2) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_33,c_0_7]) ).
cnf(c_0_42,plain,
inverse(multiply(X1,inverse(X1))) = multiply(X1,inverse(X1)),
inference(spm,[status(thm)],[c_0_39,c_0_7]) ).
cnf(c_0_43,plain,
inverse(multiply(a1,inverse(multiply(a1,multiply(multiply(a1,inverse(a1)),a1))))) = a1,
inference(spm,[status(thm)],[c_0_26,c_0_40]) ).
cnf(c_0_44,plain,
multiply(X1,multiply(inverse(X1),X2)) = 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(spm,[status(thm)],[c_0_11,c_0_41]),c_0_42]),c_0_42]),c_0_42]),c_0_41]),c_0_41]),c_0_36]) ).
cnf(c_0_45,plain,
inverse(multiply(a1,inverse(multiply(a1,multiply(multiply(X1,inverse(X1)),a1))))) = a1,
inference(spm,[status(thm)],[c_0_43,c_0_7]) ).
cnf(c_0_46,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_44]) ).
cnf(c_0_47,plain,
multiply(multiply(a1,inverse(multiply(a1,multiply(multiply(X1,inverse(X1)),a1)))),a1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_45]),c_0_25]) ).
cnf(c_0_48,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_49,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_41,c_0_46]) ).
cnf(c_0_50,plain,
multiply(a1,inverse(multiply(a1,a1))) = inverse(a1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_41]),c_0_46]) ).
cnf(c_0_51,plain,
multiply(a1,multiply(a1,inverse(a1))) = a1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_47]),c_0_29]),c_0_34]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_48 ).
cnf(c_0_53,plain,
multiply(inverse(a1),a1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_42]),c_0_41]),c_0_46]),c_0_50]) ).
cnf(c_0_54,plain,
multiply(X1,multiply(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_46]) ).
cnf(c_0_55,plain,
inverse(multiply(a1,multiply(multiply(multiply(a1,inverse(a1)),inverse(multiply(a1,a1))),a1))) = multiply(a1,inverse(a1)),
inference(spm,[status(thm)],[c_0_26,c_0_51]) ).
cnf(c_0_56,negated_conjecture,
multiply(inverse(b1),b1) != multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,plain,
multiply(inverse(X1),X1) = multiply(a1,inverse(a1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_54]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP430-1 : TPTP v8.1.2. Released v2.6.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 16:23:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.49 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.GqOu6qgOeK/E---3.1_19595.p
% 1.63/0.72 # Version: 3.1.0
% 1.63/0.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.63/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.63/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.63/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.63/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.63/0.72 # Starting sh5l with 300s (1) cores
% 1.63/0.72 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 19681 completed with status 0
% 1.63/0.72 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.63/0.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.63/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.63/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.63/0.72 # No SInE strategy applied
% 1.63/0.72 # Search class: FUUPF-FFSF21-DFFFFFNN
% 1.63/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.63/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.63/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.63/0.72 # Starting new_bool_3 with 136s (1) cores
% 1.63/0.72 # Starting new_bool_1 with 136s (1) cores
% 1.63/0.72 # Starting sh5l with 136s (1) cores
% 1.63/0.72 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19685 completed with status 0
% 1.63/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.63/0.72 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.63/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.63/0.72 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.63/0.72 # No SInE strategy applied
% 1.63/0.72 # Search class: FUUPF-FFSF21-DFFFFFNN
% 1.63/0.72 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.63/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1.63/0.72 # Preprocessing time : 0.002 s
% 1.63/0.72 # Presaturation interreduction done
% 1.63/0.72
% 1.63/0.72 # Proof found!
% 1.63/0.72 # SZS status Unsatisfiable
% 1.63/0.72 # SZS output start CNFRefutation
% See solution above
% 2.11/0.72 # Parsed axioms : 2
% 2.11/0.72 # Removed by relevancy pruning/SinE : 0
% 2.11/0.72 # Initial clauses : 2
% 2.11/0.72 # Removed in clause preprocessing : 0
% 2.11/0.72 # Initial clauses in saturation : 2
% 2.11/0.72 # Processed clauses : 264
% 2.11/0.72 # ...of these trivial : 35
% 2.11/0.72 # ...subsumed : 135
% 2.11/0.72 # ...remaining for further processing : 94
% 2.11/0.72 # Other redundant clauses eliminated : 0
% 2.11/0.72 # Clauses deleted for lack of memory : 0
% 2.11/0.72 # Backward-subsumed : 1
% 2.11/0.72 # Backward-rewritten : 62
% 2.11/0.72 # Generated clauses : 8767
% 2.11/0.72 # ...of the previous two non-redundant : 8167
% 2.11/0.72 # ...aggressively subsumed : 0
% 2.11/0.72 # Contextual simplify-reflections : 0
% 2.11/0.72 # Paramodulations : 8767
% 2.11/0.72 # Factorizations : 0
% 2.11/0.72 # NegExts : 0
% 2.11/0.72 # Equation resolutions : 0
% 2.11/0.72 # Disequality decompositions : 0
% 2.11/0.72 # Total rewrite steps : 5989
% 2.11/0.72 # ...of those cached : 4832
% 2.11/0.72 # Propositional unsat checks : 0
% 2.11/0.72 # Propositional check models : 0
% 2.11/0.72 # Propositional check unsatisfiable : 0
% 2.11/0.72 # Propositional clauses : 0
% 2.11/0.72 # Propositional clauses after purity: 0
% 2.11/0.72 # Propositional unsat core size : 0
% 2.11/0.72 # Propositional preprocessing time : 0.000
% 2.11/0.72 # Propositional encoding time : 0.000
% 2.11/0.72 # Propositional solver time : 0.000
% 2.11/0.72 # Success case prop preproc time : 0.000
% 2.11/0.72 # Success case prop encoding time : 0.000
% 2.11/0.72 # Success case prop solver time : 0.000
% 2.11/0.72 # Current number of processed clauses : 29
% 2.11/0.72 # Positive orientable unit clauses : 28
% 2.11/0.72 # Positive unorientable unit clauses: 1
% 2.11/0.72 # Negative unit clauses : 0
% 2.11/0.72 # Non-unit-clauses : 0
% 2.11/0.72 # Current number of unprocessed clauses: 7804
% 2.11/0.72 # ...number of literals in the above : 7804
% 2.11/0.72 # Current number of archived formulas : 0
% 2.11/0.72 # Current number of archived clauses : 65
% 2.11/0.72 # Clause-clause subsumption calls (NU) : 0
% 2.11/0.72 # Rec. Clause-clause subsumption calls : 0
% 2.11/0.72 # Non-unit clause-clause subsumptions : 0
% 2.11/0.72 # Unit Clause-clause subsumption calls : 64
% 2.11/0.72 # Rewrite failures with RHS unbound : 0
% 2.11/0.72 # BW rewrite match attempts : 804
% 2.11/0.72 # BW rewrite match successes : 118
% 2.11/0.72 # Condensation attempts : 0
% 2.11/0.72 # Condensation successes : 0
% 2.11/0.72 # Termbank termtop insertions : 270439
% 2.11/0.72 # Search garbage collected termcells : 2
% 2.11/0.72
% 2.11/0.72 # -------------------------------------------------
% 2.11/0.72 # User time : 0.213 s
% 2.11/0.72 # System time : 0.012 s
% 2.11/0.72 # Total time : 0.225 s
% 2.11/0.72 # Maximum resident set size: 1544 pages
% 2.11/0.72
% 2.11/0.72 # -------------------------------------------------
% 2.11/0.72 # User time : 1.069 s
% 2.11/0.72 # System time : 0.029 s
% 2.11/0.72 # Total time : 1.098 s
% 2.11/0.72 # Maximum resident set size: 1684 pages
% 2.11/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------