TSTP Solution File: GRP438-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRP438-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 07:52:15 EDT 2024
% Result : Unsatisfiable 1.68s 0.69s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 39
% Number of leaves : 2
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 5 RR)
% Number of literals : 61 ( 60 equ; 3 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 166 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
file('/export/starexec/sandbox/tmp/tmp.iD7jDrKFLp/E---3.1_21303.p',single_axiom) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/tmp/tmp.iD7jDrKFLp/E---3.1_21303.p',prove_these_axioms_3) ).
cnf(c_0_2,axiom,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X1))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),inverse(X5))),multiply(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(X4))),multiply(X4,multiply(X5,X1))))) = multiply(X6,multiply(multiply(inverse(X6),inverse(multiply(X3,X5))),inverse(X2))),
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
multiply(inverse(multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(X3,X1))),multiply(inverse(X4),inverse(multiply(X5,X6))))))),inverse(multiply(X6,multiply(X4,X3)))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_6,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(inverse(X3),inverse(multiply(X4,multiply(X5,multiply(X2,inverse(X3))))))))),inverse(X5))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_7,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X5,multiply(multiply(inverse(X5),inverse(X6)),X1))))) = inverse(multiply(X7,multiply(X8,multiply(multiply(inverse(X8),inverse(multiply(X4,X7))),multiply(inverse(X3),inverse(multiply(X6,X2))))))),
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_8,plain,
multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,multiply(X1,multiply(X4,inverse(X2)))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_9,plain,
multiply(multiply(a3,inverse(multiply(inverse(multiply(X1,multiply(X2,X3))),multiply(a3,multiply(multiply(inverse(a3),inverse(X4)),a3))))),inverse(multiply(X1,multiply(X2,X3)))) = X4,
inference(rw,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(multiply(inverse(X2),inverse(multiply(X3,X4))),X3))),inverse(X2))) = X4,
inference(spm,[status(thm)],[c_0_6,c_0_2]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(inverse(X5),inverse(multiply(X2,multiply(X3,multiply(X4,inverse(X5)))))),
inference(spm,[status(thm)],[c_0_2,c_0_8]) ).
cnf(c_0_12,plain,
multiply(multiply(a3,inverse(multiply(inverse(X1),multiply(a3,multiply(multiply(inverse(a3),inverse(X2)),a3))))),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
multiply(X1,inverse(multiply(X2,multiply(X3,multiply(X4,X1))))) = multiply(X5,inverse(multiply(X2,multiply(X3,multiply(X4,X5))))),
inference(spm,[status(thm)],[c_0_11,c_0_11]) ).
cnf(c_0_14,plain,
multiply(X1,inverse(multiply(inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X5)))),multiply(X6,multiply(multiply(inverse(X6),inverse(X4)),X1))))) = X5,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,inverse(multiply(inverse(X2),multiply(a3,multiply(multiply(inverse(a3),inverse(X3)),X1))))),inverse(X2)) = X3,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(X2)),inverse(X3))) = multiply(X4,multiply(multiply(inverse(X4),inverse(X2)),inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_2]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),inverse(multiply(multiply(a3,multiply(multiply(inverse(a3),inverse(X2)),inverse(X3))),multiply(X3,X2)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_15]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(inverse(X1),inverse(X2))) = multiply(X3,multiply(inverse(X3),inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_19,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(multiply(inverse(X2),multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,inverse(X4)))),X1))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_19]) ).
cnf(c_0_21,plain,
multiply(inverse(X1),inverse(multiply(X2,multiply(X3,multiply(multiply(inverse(X3),inverse(multiply(X4,X2))),X4))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_17,c_0_10]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,multiply(multiply(inverse(X2),inverse(multiply(multiply(X3,inverse(X3)),X1))),X4))) = X4,
inference(spm,[status(thm)],[c_0_14,c_0_20]) ).
cnf(c_0_23,plain,
multiply(inverse(X1),inverse(multiply(X2,inverse(X2)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(multiply(inverse(X2),multiply(X3,multiply(inverse(X3),X1))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_22]) ).
cnf(c_0_25,plain,
multiply(X1,multiply(X2,inverse(X2))) = multiply(X3,multiply(inverse(X3),inverse(inverse(X1)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
multiply(inverse(inverse(X1)),inverse(multiply(inverse(X2),multiply(X1,multiply(a3,inverse(a3)))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_27,plain,
multiply(X1,inverse(multiply(multiply(X2,X3),multiply(X4,multiply(inverse(X4),X1))))) = multiply(a3,multiply(multiply(inverse(a3),inverse(X3)),inverse(X2))),
inference(spm,[status(thm)],[c_0_2,c_0_17]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(multiply(multiply(X2,multiply(a3,inverse(a3))),multiply(inverse(X2),multiply(X3,X1))))) = inverse(X3),
inference(spm,[status(thm)],[c_0_2,c_0_26]) ).
cnf(c_0_29,plain,
multiply(inverse(X1),inverse(multiply(multiply(X2,inverse(multiply(X3,multiply(X1,multiply(X4,X2))))),X3))) = X4,
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_30,plain,
multiply(a3,multiply(inverse(a3),inverse(X1))) = inverse(inverse(inverse(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(multiply(inverse(X1),inverse(multiply(X2,multiply(X3,inverse(multiply(X4,multiply(X5,multiply(X2,X3)))))))),inverse(X5))) = X4,
inference(spm,[status(thm)],[c_0_10,c_0_29]) ).
cnf(c_0_32,plain,
multiply(X1,multiply(inverse(X1),inverse(X2))) = inverse(inverse(inverse(X2))),
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_33,plain,
inverse(inverse(inverse(inverse(X1)))) = multiply(X1,multiply(a3,inverse(a3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_23]),c_0_32]) ).
cnf(c_0_34,plain,
inverse(multiply(X1,multiply(a3,inverse(a3)))) = multiply(inverse(X1),multiply(a3,inverse(a3))),
inference(spm,[status(thm)],[c_0_33,c_0_33]) ).
cnf(c_0_35,plain,
multiply(inverse(multiply(X1,inverse(X1))),multiply(X2,multiply(inverse(X2),X3))) = X3,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_36,plain,
multiply(X1,multiply(inverse(X1),multiply(X2,multiply(a3,inverse(a3))))) = multiply(inverse(inverse(X2)),multiply(a3,inverse(a3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_34]) ).
cnf(c_0_37,plain,
multiply(multiply(inverse(multiply(X1,inverse(X1))),multiply(a3,inverse(a3))),multiply(a3,inverse(a3))) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]),c_0_34]) ).
cnf(c_0_38,plain,
inverse(multiply(X1,multiply(X2,inverse(X2)))) = multiply(inverse(X1),multiply(X2,inverse(X2))),
inference(spm,[status(thm)],[c_0_34,c_0_19]) ).
cnf(c_0_39,plain,
multiply(inverse(X1),multiply(multiply(a3,inverse(a3)),multiply(a3,inverse(a3)))) = inverse(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_17,c_0_37]),c_0_23]),c_0_38]),c_0_36]),c_0_33]),c_0_38]),c_0_38]),c_0_38]),c_0_37]) ).
cnf(c_0_40,plain,
multiply(X1,inverse(X1)) = inverse(inverse(inverse(multiply(X2,inverse(X2))))),
inference(spm,[status(thm)],[c_0_32,c_0_23]) ).
cnf(c_0_41,plain,
multiply(inverse(inverse(multiply(a3,inverse(a3)))),inverse(inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_39]) ).
cnf(c_0_42,plain,
inverse(multiply(a3,inverse(a3))) = multiply(a3,inverse(a3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_40]) ).
cnf(c_0_43,plain,
inverse(multiply(X1,inverse(X1))) = multiply(X1,inverse(X1)),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_44,plain,
multiply(inverse(X1),multiply(X2,inverse(X2))) = inverse(X1),
inference(rw,[status(thm)],[c_0_23,c_0_43]) ).
cnf(c_0_45,plain,
multiply(X1,multiply(a3,inverse(a3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_44]),c_0_24]),c_0_23]),c_0_32]),c_0_33]) ).
cnf(c_0_46,plain,
inverse(inverse(inverse(inverse(X1)))) = X1,
inference(rw,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_47,plain,
multiply(multiply(a3,inverse(a3)),X1) = inverse(inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_46]),c_0_43]),c_0_43]) ).
cnf(c_0_48,plain,
inverse(inverse(inverse(X1))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_47]),c_0_43]),c_0_47]),c_0_33]),c_0_45]) ).
cnf(c_0_49,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_50,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_46,c_0_48]) ).
cnf(c_0_51,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_49]),c_0_23]),c_0_44]),c_0_50]) ).
cnf(c_0_52,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_51]),c_0_43]),c_0_51]),c_0_51]) ).
cnf(c_0_53,plain,
multiply(inverse(multiply(inverse(X1),inverse(multiply(X2,X3)))),inverse(multiply(X3,multiply(X1,multiply(X4,inverse(X4)))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_19]) ).
cnf(c_0_54,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_28]),c_0_45]),c_0_52]) ).
cnf(c_0_55,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(fof_simplification,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_0_56,plain,
multiply(multiply(X1,X2),inverse(X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_43]),c_0_51]),c_0_50]),c_0_49]) ).
cnf(c_0_57,plain,
multiply(multiply(multiply(X1,X2),X3),inverse(multiply(X2,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_50]),c_0_49]) ).
cnf(c_0_58,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
c_0_55 ).
cnf(c_0_59,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_50]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : GRP438-1 : TPTP v8.1.2. Released v2.6.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n027.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 16:07:37 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.iD7jDrKFLp/E---3.1_21303.p
% 1.68/0.69 # Version: 3.1.0
% 1.68/0.69 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.68/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.69 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.68/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.69 # Starting sh5l with 300s (1) cores
% 1.68/0.69 # new_bool_3 with pid 21386 completed with status 8
% 1.68/0.69 # new_bool_1 with pid 21387 completed with status 8
% 1.68/0.69 # sh5l with pid 21388 completed with status 0
% 1.68/0.69 # Result found by sh5l
% 1.68/0.69 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.68/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.69 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.68/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.69 # Starting sh5l with 300s (1) cores
% 1.68/0.69 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.68/0.69 # Search class: FUUPF-FFSF21-DFFFFFNN
% 1.68/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.68/0.69 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21395 completed with status 0
% 1.68/0.69 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.68/0.69 # Preprocessing class: FSSSSMSSSSSNFFN.
% 1.68/0.69 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.69 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.68/0.69 # Starting new_bool_3 with 300s (1) cores
% 1.68/0.69 # Starting new_bool_1 with 300s (1) cores
% 1.68/0.69 # Starting sh5l with 300s (1) cores
% 1.68/0.69 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.68/0.69 # Search class: FUUPF-FFSF21-DFFFFFNN
% 1.68/0.69 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.69 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.68/0.69 # Preprocessing time : 0.001 s
% 1.68/0.69 # Presaturation interreduction done
% 1.68/0.69
% 1.68/0.69 # Proof found!
% 1.68/0.69 # SZS status Unsatisfiable
% 1.68/0.69 # SZS output start CNFRefutation
% See solution above
% 1.68/0.69 # Parsed axioms : 2
% 1.68/0.69 # Removed by relevancy pruning/SinE : 0
% 1.68/0.69 # Initial clauses : 2
% 1.68/0.69 # Removed in clause preprocessing : 0
% 1.68/0.69 # Initial clauses in saturation : 2
% 1.68/0.69 # Processed clauses : 317
% 1.68/0.69 # ...of these trivial : 82
% 1.68/0.69 # ...subsumed : 104
% 1.68/0.69 # ...remaining for further processing : 131
% 1.68/0.69 # Other redundant clauses eliminated : 0
% 1.68/0.69 # Clauses deleted for lack of memory : 0
% 1.68/0.69 # Backward-subsumed : 0
% 1.68/0.69 # Backward-rewritten : 106
% 1.68/0.69 # Generated clauses : 13438
% 1.68/0.69 # ...of the previous two non-redundant : 12532
% 1.68/0.69 # ...aggressively subsumed : 0
% 1.68/0.69 # Contextual simplify-reflections : 0
% 1.68/0.69 # Paramodulations : 13438
% 1.68/0.69 # Factorizations : 0
% 1.68/0.69 # NegExts : 0
% 1.68/0.69 # Equation resolutions : 0
% 1.68/0.69 # Disequality decompositions : 0
% 1.68/0.69 # Total rewrite steps : 9363
% 1.68/0.69 # ...of those cached : 6621
% 1.68/0.69 # Propositional unsat checks : 0
% 1.68/0.69 # Propositional check models : 0
% 1.68/0.69 # Propositional check unsatisfiable : 0
% 1.68/0.69 # Propositional clauses : 0
% 1.68/0.69 # Propositional clauses after purity: 0
% 1.68/0.69 # Propositional unsat core size : 0
% 1.68/0.69 # Propositional preprocessing time : 0.000
% 1.68/0.69 # Propositional encoding time : 0.000
% 1.68/0.69 # Propositional solver time : 0.000
% 1.68/0.69 # Success case prop preproc time : 0.000
% 1.68/0.69 # Success case prop encoding time : 0.000
% 1.68/0.69 # Success case prop solver time : 0.000
% 1.68/0.69 # Current number of processed clauses : 23
% 1.68/0.69 # Positive orientable unit clauses : 21
% 1.68/0.69 # Positive unorientable unit clauses: 2
% 1.68/0.69 # Negative unit clauses : 0
% 1.68/0.69 # Non-unit-clauses : 0
% 1.68/0.69 # Current number of unprocessed clauses: 12053
% 1.68/0.69 # ...number of literals in the above : 12053
% 1.68/0.69 # Current number of archived formulas : 0
% 1.68/0.69 # Current number of archived clauses : 108
% 1.68/0.69 # Clause-clause subsumption calls (NU) : 0
% 1.68/0.69 # Rec. Clause-clause subsumption calls : 0
% 1.68/0.69 # Non-unit clause-clause subsumptions : 0
% 1.68/0.69 # Unit Clause-clause subsumption calls : 83
% 1.68/0.69 # Rewrite failures with RHS unbound : 0
% 1.68/0.69 # BW rewrite match attempts : 762
% 1.68/0.69 # BW rewrite match successes : 133
% 1.68/0.69 # Condensation attempts : 0
% 1.68/0.69 # Condensation successes : 0
% 1.68/0.69 # Termbank termtop insertions : 345400
% 1.68/0.69 # Search garbage collected termcells : 2
% 1.68/0.69
% 1.68/0.69 # -------------------------------------------------
% 1.68/0.69 # User time : 0.253 s
% 1.68/0.69 # System time : 0.014 s
% 1.68/0.69 # Total time : 0.267 s
% 1.68/0.69 # Maximum resident set size: 1616 pages
% 1.68/0.69
% 1.68/0.69 # -------------------------------------------------
% 1.68/0.69 # User time : 0.271 s
% 1.68/0.69 # System time : 0.032 s
% 1.68/0.69 # Total time : 0.303 s
% 1.68/0.69 # Maximum resident set size: 1688 pages
% 1.68/0.69 % E---3.1 exiting
% 1.68/0.69 % E exiting
%------------------------------------------------------------------------------