%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : BOO038-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:07:02 PM UTC 2026
% Result : Unsatisfiable 78.49s 21.95s
% Output : CNFRefutation 78.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 2
% Syntax : Number of clauses : 63 ( 59 unt; 0 nHn; 6 RR)
% Number of literals : 70 ( 69 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 15 ( 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 : 133 ( 31 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dn1,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dn1) ).
cnf(huntinton,negated_conjecture,
( add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a
| add(add(a,b),c) != add(a,add(b,c))
| add(b,a) != add(a,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',huntinton) ).
cnf(c_0_2,axiom,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(X3),inverse(add(X3,X4)))))))) = X3,
dn1 ).
cnf(c_0_3,plain,
inverse(add(inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(add(inverse(add(X1,inverse(X1))),X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
inverse(add(inverse(X1),inverse(add(X1,inverse(add(inverse(X1),inverse(add(X1,X2)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_6,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(inverse(add(X3,X4)),X1)),inverse(add(inverse(X2),inverse(add(X2,X5)))))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_7,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,X3)))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_5]) ).
cnf(c_0_8,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(add(X1,X2)))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_10,plain,
inverse(add(inverse(X1),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_11,plain,
inverse(add(inverse(add(inverse(X1),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
inverse(add(inverse(add(X1,inverse(add(X1,X1)))),X1)) = inverse(add(X1,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
inverse(add(X1,inverse(add(inverse(X1),inverse(X1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_14,plain,
inverse(add(inverse(add(X1,X1)),inverse(add(X1,X1)))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_15,plain,
inverse(add(inverse(X1),inverse(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_13]) ).
cnf(c_0_16,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
inverse(add(inverse(add(add(X1,inverse(X1)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_18,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X1)),inverse(X1))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
inverse(add(X1,inverse(add(add(X1,inverse(X1)),inverse(X1))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_21,plain,
inverse(add(X1,add(X2,X1))) = inverse(add(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_7]),c_0_19]) ).
cnf(c_0_22,plain,
inverse(add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2)))) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_20]) ).
cnf(c_0_23,plain,
add(X1,add(X2,X1)) = add(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_21]),c_0_16]),c_0_21]),c_0_16]),c_0_19]) ).
cnf(c_0_24,plain,
add(inverse(add(inverse(X1),X2)),inverse(add(X1,X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_25,plain,
inverse(add(inverse(X1),inverse(add(inverse(add(inverse(add(inverse(add(inverse(inverse(X1)),X2)),X1)),X3)),inverse(add(inverse(X1),inverse(add(X1,X4)))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_26,plain,
add(inverse(add(X1,X2)),inverse(X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
inverse(add(X1,add(X1,X2))) = inverse(add(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_19]) ).
cnf(c_0_28,plain,
inverse(add(inverse(X1),inverse(add(X1,X2)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19]),c_0_27]) ).
cnf(c_0_29,plain,
add(inverse(X1),inverse(add(X1,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_30,plain,
inverse(add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(inverse(inverse(add(X2,inverse(add(inverse(X1),inverse(add(X1,X4))))))),inverse(add(inverse(add(X2,inverse(add(inverse(X1),inverse(add(X1,X4)))))),X5)))))))) = inverse(add(X2,inverse(add(inverse(X1),inverse(add(X1,X4)))))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_31,plain,
add(X1,inverse(add(inverse(X1),X2))) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_32,plain,
inverse(add(X1,X2)) = inverse(add(X2,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(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]),c_0_28]),c_0_28]),c_0_31]),c_0_29]),c_0_19]),c_0_28]) ).
cnf(c_0_33,plain,
add(inverse(add(X1,X2)),inverse(add(inverse(X1),X2))) = inverse(X2),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_34,plain,
add(X1,X2) = add(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_32]),c_0_19]) ).
cnf(c_0_35,plain,
add(X1,inverse(add(X1,inverse(add(X1,X2))))) = add(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_36,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X2,X3)),X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_34]),c_0_28]),c_0_34]) ).
cnf(c_0_37,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(X1,X2)))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_32]),c_0_32]) ).
cnf(c_0_38,plain,
inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X3,X1)),inverse(add(inverse(X2),inverse(add(X2,X4)))))))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_6]) ).
cnf(c_0_39,plain,
add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(X1,X2))))) = add(inverse(add(X1,X2)),inverse(add(inverse(add(X2,X3)),X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_32]) ).
cnf(c_0_40,plain,
add(inverse(add(X1,X2)),inverse(add(X1,inverse(add(X1,X2))))) = inverse(X1),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_41,plain,
inverse(add(X1,inverse(add(inverse(add(X2,inverse(add(X3,X1)))),inverse(add(inverse(add(X4,X3)),X1)))))) = inverse(add(inverse(add(X4,X3)),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_38,c_0_38]),c_0_19]),c_0_28]),c_0_28]),c_0_31]),c_0_28]) ).
cnf(c_0_42,plain,
add(inverse(add(X1,X2)),inverse(add(inverse(add(X2,X3)),X1))) = inverse(X1),
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
inverse(add(X1,inverse(add(X2,inverse(add(X2,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_41,c_0_42]),c_0_19]),c_0_16]),c_0_34]),c_0_34]) ).
cnf(c_0_44,plain,
add(X1,inverse(add(X2,inverse(add(X2,X1))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_43]),c_0_19]) ).
cnf(c_0_45,plain,
inverse(add(inverse(add(inverse(add(X1,X2)),X3)),inverse(add(X1,inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X1,X2)),X3)))))))) = inverse(add(inverse(add(X1,X2)),inverse(add(inverse(add(X1,X2)),X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_35]),c_0_19]),c_0_31]) ).
cnf(c_0_46,plain,
add(X1,inverse(add(X2,inverse(add(X1,X2))))) = X1,
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_47,plain,
inverse(add(X1,inverse(add(X2,X1)))) = inverse(add(X1,inverse(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_45,c_0_33]),c_0_19]),c_0_19]),c_0_34]),c_0_46]),c_0_19]),c_0_34]) ).
cnf(c_0_48,plain,
inverse(add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X3,X1)))))) = inverse(add(X3,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(spm,[status(thm)],[c_0_30,c_0_30]),c_0_28]),c_0_28]),c_0_19]),c_0_28]),c_0_31]),c_0_28]) ).
cnf(c_0_49,plain,
add(X1,inverse(add(X2,X1))) = add(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_47]),c_0_19]) ).
cnf(c_0_50,negated_conjecture,
( add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a
| add(add(a,b),c) != add(a,add(b,c))
| add(b,a) != add(a,b) ),
inference(fof_simplification,[status(thm)],[huntinton]) ).
cnf(c_0_51,plain,
add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X3,X1))))) = add(X3,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_48]),c_0_19]) ).
cnf(c_0_52,plain,
add(inverse(add(X1,X2)),inverse(add(X2,add(X1,X3)))) = inverse(add(X1,X2)),
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_44,c_0_2]),c_0_28]),c_0_28]),c_0_34]),c_0_49]),c_0_19]) ).
cnf(c_0_53,negated_conjecture,
( add(inverse(add(inverse(a),b)),inverse(add(inverse(a),inverse(b)))) != a
| add(add(a,b),c) != add(a,add(b,c))
| add(b,a) != add(a,b) ),
c_0_50 ).
cnf(c_0_54,plain,
add(add(X1,X2),add(X1,X3)) = add(X3,add(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_19]) ).
cnf(c_0_55,plain,
add(X1,inverse(add(inverse(add(X2,X3)),inverse(add(X2,X1))))) = add(X2,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(spm,[status(thm)],[c_0_19,c_0_30]),c_0_19]),c_0_19]),c_0_28]),c_0_28]),c_0_31]),c_0_28]) ).
cnf(c_0_56,negated_conjecture,
( add(c,add(a,b)) != add(a,add(b,c))
| add(inverse(add(b,inverse(a))),inverse(add(inverse(a),inverse(b)))) != a ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_32]),c_0_34]),c_0_34])]) ).
cnf(c_0_57,plain,
add(inverse(add(X1,X2)),inverse(add(X2,inverse(X1)))) = inverse(X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_58,plain,
add(add(X1,X2),add(X3,X1)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_54,c_0_34]) ).
cnf(c_0_59,plain,
add(add(X1,X2),add(X2,X3)) = add(X3,add(X1,X2)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
add(c,add(a,b)) != add(a,add(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_19])]) ).
cnf(c_0_61,plain,
add(X1,add(X2,X3)) = add(X2,add(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_58]),c_0_59]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_34]),c_0_61]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO038-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/10.40 % Computer : n018.cluster.edu
% 0.12/10.40 % Model : x86_64 x86_64
% 0.12/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.40 % Memory : 8046.5625MB
% 0.12/10.40 % OS : Linux 6.8.0-71-generic
% 0.12/10.40 % CPULimit : 300
% 0.12/10.40 % WCLimit : 300
% 0.12/10.40 % DateTime : Mon Sep 21 13:52:10 UTC 2026
% 0.12/10.41 % CPUTime :
% 0.12/10.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/10.48 Running first-order theorem proving
% 0.12/10.48 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/benchmark/theBenchmark.p
% 78.49/21.95 % Version: 3.5.1
% 78.49/21.95 % Preprocessing class: FSSSSMSSSSSNFFN.
% 78.49/21.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 78.49/21.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 78.49/21.95 % Starting new_bool_3 with 300s (1) cores
% 78.49/21.95 % Starting new_bool_1 with 300s (1) cores
% 78.49/21.95 % Starting sh5l with 300s (1) cores
% 78.49/21.95 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2056384 completed with status 0
% 78.49/21.95 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 78.49/21.95 % Preprocessing class: FSSSSMSSSSSNFFN.
% 78.49/21.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 78.49/21.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 78.49/21.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 78.49/21.95 % No SInE strategy applied
% 78.49/21.95 % Search class: FUHPF-FFSF21-DFFFFFNN
% 78.49/21.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 78.49/21.95 % Starting SubtermCWHack with 136s (1) cores
% 78.49/21.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 78.49/21.95 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 78.49/21.95 % Starting new_bool_3 with 136s (1) cores
% 78.49/21.95 % Starting new_bool_1 with 136s (1) cores
% 78.49/21.95 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2056389 completed with status 0
% 78.49/21.95 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 78.49/21.95 % Preprocessing class: FSSSSMSSSSSNFFN.
% 78.49/21.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 78.49/21.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 78.49/21.95 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 78.49/21.95 % No SInE strategy applied
% 78.49/21.95 % Search class: FUHPF-FFSF21-DFFFFFNN
% 78.49/21.95 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 78.49/21.95 % Starting SubtermCWHack with 136s (1) cores
% 78.49/21.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 78.49/21.95 % Preprocessing time : 0.005 s
% 78.49/21.95
% 78.49/21.95 % Proof found!
% 78.49/21.95 % SZS status Unsatisfiable
% 78.49/21.95 % SZS output start CNFRefutation
% See solution above
% 78.49/21.95 % Parsed axioms : 2
% 78.49/21.95 % Removed by relevancy pruning/SinE : 0
% 78.49/21.95 % Initial clauses : 2
% 78.49/21.95 % Removed in clause preprocessing : 0
% 78.49/21.95 % Initial clauses in saturation : 2
% 78.49/21.95 % Processed clauses : 5565
% 78.49/21.95 % ...of these trivial : 2032
% 78.49/21.95 % ...subsumed : 3158
% 78.49/21.95 % ...remaining for further processing : 375
% 78.49/21.95 % Other redundant clauses eliminated : 0
% 78.49/21.95 % Clauses deleted for lack of memory : 0
% 78.49/21.95 % Backward-subsumed : 1
% 78.49/21.95 % Backward-rewritten : 158
% 78.49/21.95 % Generated clauses : 224048
% 78.49/21.95 % ...of the previous two non-redundant : 148237
% 78.49/21.95 % ...aggressively subsumed : 0
% 78.49/21.95 % Contextual simplify-reflections : 0
% 78.49/21.95 % Paramodulations : 224048
% 78.49/21.95 % Factorizations : 0
% 78.49/21.95 % NegExts : 0
% 78.49/21.95 % Equation resolutions : 0
% 78.49/21.95 % Disequality decompositions : 0
% 78.49/21.95 % Total rewrite steps : 580033
% 78.49/21.95 % ...of those cached : 547416
% 78.49/21.95 % Propositional unsat checks : 0
% 78.49/21.95 % Propositional check models : 0
% 78.49/21.95 % Propositional check unsatisfiable : 0
% 78.49/21.95 % Propositional clauses : 0
% 78.49/21.95 % Propositional clauses after purity: 0
% 78.49/21.95 % Propositional unsat core size : 0
% 78.49/21.95 % Propositional preprocessing time : 0.000
% 78.49/21.95 % Propositional encoding time : 0.000
% 78.49/21.95 % Propositional solver time : 0.000
% 78.49/21.95 % Success case prop preproc time : 0.000
% 78.49/21.95 % Success case prop encoding time : 0.000
% 78.49/21.95 % Success case prop solver time : 0.000
% 78.49/21.95 % Current number of processed clauses : 216
% 78.49/21.95 % Positive orientable unit clauses : 213
% 78.49/21.95 % Positive unorientable unit clauses: 3
% 78.49/21.95 % Negative unit clauses : 0
% 78.49/21.95 % Non-unit-clauses : 0
% 78.49/21.95 % Current number of unprocessed clauses: 131209
% 78.49/21.95 % ...number of literals in the above : 131209
% 78.49/21.95 % Current number of archived formulas : 0
% 78.49/21.95 % Current number of archived clauses : 159
% 78.49/21.95 % Clause-clause subsumption calls (NU) : 0
% 78.49/21.95 % Rec. Clause-clause subsumption calls : 0
% 78.49/21.95 % Non-unit clause-clause subsumptions : 0
% 78.49/21.95 % Unit Clause-clause subsumption calls : 377
% 78.49/21.95 % Rewrite failures with RHS unbound : 0
% 78.49/21.95 % BW rewrite match attempts : 15770
% 78.49/21.95 % BW rewrite match successes : 333
% 78.49/21.95 % Condensation attempts : 0
% 78.49/21.95 % Condensation successes : 0
% 78.49/21.95 % Termbank termtop insertions : 8896753
% 78.49/21.95 % Search garbage collected termcells : 8
% 78.49/21.95
% 78.49/21.95 % -------------------------------------------------
% 78.49/21.95 % User time : 10.893 s
% 78.49/21.95 % System time : 0.292 s
% 78.49/21.95 % Total time : 11.185 s
% 78.49/21.95 % Maximum resident set size: 3636 pages
% 78.49/21.95
% 78.49/21.95 % -------------------------------------------------
% 78.49/21.95 % User time : 54.865 s
% 78.49/21.95 % System time : 1.428 s
% 78.49/21.95 % Total time : 56.293 s
% 78.49/21.95 % Maximum resident set size: 4864 pages
% 78.49/21.95 % E exiting
%------------------------------------------------------------------------------