%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HEN011-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:45:41 PM UTC 2026
% Result : Unsatisfiable 7.54s 1.60s
% Output : CNFRefutation 7.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of clauses : 77 ( 50 unt; 0 nHn; 26 RR)
% Number of literals : 110 ( 42 equ; 37 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 153 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal2,axiom,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).
cnf(less_equal_and_equal,axiom,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).
cnf(property_of_divide1,axiom,
( ~ less_equal(divide(X1,X2),X3)
| less_equal(divide(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide1) ).
cnf(x_divide_x_is_zero,axiom,
divide(X1,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).
cnf(property_of_divide3,axiom,
( ~ less_equal(X1,X2)
| less_equal(divide(X1,X3),divide(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide3) ).
cnf(quotient_less_equal1,axiom,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).
cnf(identity_is_largest,axiom,
less_equal(X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',identity_is_largest) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).
cnf(transitivity_of_less_equal,axiom,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
cnf(one_inversion_equals_three,axiom,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_inversion_equals_three) ).
cnf(property_of_inversion,axiom,
divide(divide(identity,X1),divide(identity,divide(identity,X1))) = divide(identity,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_inversion) ).
cnf(property_of_divide2,axiom,
( ~ less_equal(X1,X2)
| less_equal(divide(X3,X2),divide(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_divide2) ).
cnf(zero_divide_anything_is_zero,axiom,
divide(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_divide_anything_is_zero) ).
cnf(prove_this,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_16,plain,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[quotient_less_equal2]) ).
cnf(c_0_17,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[less_equal_and_equal]) ).
cnf(c_0_18,plain,
( ~ less_equal(divide(X1,X2),X3)
| less_equal(divide(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[property_of_divide1]) ).
cnf(c_0_19,plain,
( divide(X1,X2) != zero
| less_equal(X1,X2) ),
c_0_16 ).
cnf(c_0_20,axiom,
divide(X1,X1) = zero,
x_divide_x_is_zero ).
cnf(c_0_21,plain,
( ~ less_equal(X2,X1)
| ~ less_equal(X1,X2)
| X1 = X2 ),
c_0_17 ).
cnf(c_0_22,axiom,
less_equal(zero,X1),
zero_is_smallest ).
cnf(c_0_23,plain,
( ~ less_equal(divide(X1,X2),X3)
| less_equal(divide(X1,X3),X2) ),
c_0_18 ).
cnf(c_0_24,plain,
less_equal(X1,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ less_equal(X1,zero)
| X1 = zero ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
less_equal(divide(X1,divide(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ less_equal(X1,X2)
| less_equal(divide(X1,X3),divide(X2,X3)) ),
inference(fof_simplification,[status(thm)],[property_of_divide3]) ).
cnf(c_0_28,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
inference(fof_simplification,[status(thm)],[quotient_less_equal1]) ).
cnf(c_0_29,plain,
divide(X1,divide(X1,zero)) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ less_equal(X1,X2)
| less_equal(divide(X1,X3),divide(X2,X3)) ),
c_0_27 ).
cnf(c_0_31,axiom,
less_equal(X1,identity),
identity_is_largest ).
cnf(c_0_32,plain,
( ~ less_equal(X1,X2)
| divide(X1,X2) = zero ),
c_0_28 ).
cnf(c_0_33,axiom,
less_equal(divide(X1,X2),X1),
quotient_smaller_than_numerator ).
cnf(c_0_34,plain,
less_equal(X1,divide(X1,zero)),
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_35,plain,
less_equal(divide(X1,X2),divide(identity,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,axiom,
less_equal(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)),
quotient_property ).
cnf(c_0_37,plain,
divide(divide(X1,X2),X1) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
divide(X1,zero) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_34]),c_0_33])]) ).
cnf(c_0_39,plain,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
inference(fof_simplification,[status(thm)],[transitivity_of_less_equal]) ).
cnf(c_0_40,plain,
less_equal(divide(X1,divide(identity,X2)),X2),
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
cnf(c_0_41,plain,
less_equal(divide(X1,X2),divide(divide(X1,divide(X2,X3)),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_42,plain,
less_equal(divide(divide(X1,X2),X3),divide(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_43,plain,
divide(divide(divide(X1,X2),divide(X3,X2)),divide(divide(X1,X3),X2)) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_36]) ).
cnf(c_0_44,axiom,
divide(identity,divide(identity,divide(identity,X1))) = divide(identity,X1),
one_inversion_equals_three ).
cnf(c_0_45,plain,
( ~ less_equal(X2,X3)
| ~ less_equal(X1,X2)
| less_equal(X1,X3) ),
c_0_39 ).
cnf(c_0_46,axiom,
divide(divide(identity,X1),divide(identity,divide(identity,X1))) = divide(identity,X1),
property_of_inversion ).
cnf(c_0_47,plain,
( ~ less_equal(X1,X2)
| less_equal(divide(X3,X2),divide(X3,X1)) ),
inference(fof_simplification,[status(thm)],[property_of_divide2]) ).
cnf(c_0_48,plain,
( ~ less_equal(divide(divide(X1,X3),X2),divide(divide(X1,X2),divide(X3,X2)))
| divide(divide(X1,X2),divide(X3,X2)) = divide(divide(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_49,plain,
divide(divide(X1,divide(identity,X2)),X2) = zero,
inference(spm,[status(thm)],[c_0_32,c_0_40]) ).
cnf(c_0_50,plain,
divide(divide(X1,divide(X2,X3)),X2) = divide(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_41]),c_0_42])]) ).
cnf(c_0_51,plain,
divide(divide(divide(identity,X1),divide(divide(identity,divide(identity,X2)),X1)),divide(divide(identity,X2),X1)) = zero,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,axiom,
divide(zero,X1) = zero,
zero_divide_anything_is_zero ).
cnf(c_0_53,plain,
( ~ less_equal(X1,divide(X2,X3))
| less_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_45,c_0_33]) ).
cnf(c_0_54,plain,
less_equal(divide(divide(identity,X1),divide(X2,divide(identity,divide(identity,X1)))),divide(divide(divide(identity,X1),X2),divide(identity,divide(identity,X1)))),
inference(spm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_55,plain,
( ~ less_equal(X1,X2)
| less_equal(divide(X3,X2),divide(X3,X1)) ),
c_0_47 ).
cnf(c_0_56,plain,
less_equal(divide(divide(X1,X2),divide(divide(X1,X3),X2)),divide(X3,X2)),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_57,plain,
divide(divide(X1,divide(X2,divide(identity,X3))),X3) = divide(X1,X3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38]),c_0_38]),c_0_42])]) ).
cnf(c_0_58,plain,
divide(divide(divide(identity,X1),divide(divide(identity,divide(identity,X2)),X1)),divide(identity,X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_59,plain,
less_equal(divide(divide(identity,X1),divide(X2,divide(identity,divide(identity,X1)))),divide(divide(identity,X1),X2)),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
less_equal(divide(X1,X2),divide(X1,divide(X2,X3))),
inference(spm,[status(thm)],[c_0_55,c_0_33]) ).
cnf(c_0_61,plain,
( ~ less_equal(divide(X3,X2),divide(divide(X1,X2),divide(divide(X1,X3),X2)))
| divide(divide(X1,X2),divide(divide(X1,X3),X2)) = divide(X3,X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_56]) ).
cnf(c_0_62,plain,
divide(divide(divide(identity,X1),divide(divide(identity,X2),X1)),X2) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_52]),c_0_44]) ).
cnf(c_0_63,plain,
less_equal(divide(divide(X1,X2),X3),divide(divide(identity,X2),X3)),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_64,plain,
( ~ less_equal(X2,divide(X1,divide(X1,X2)))
| divide(X1,divide(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_21,c_0_26]) ).
cnf(c_0_65,plain,
less_equal(divide(X1,X2),divide(X1,divide(X3,divide(X3,X2)))),
inference(spm,[status(thm)],[c_0_55,c_0_26]) ).
cnf(c_0_66,plain,
( ~ less_equal(divide(divide(divide(identity,X1),X2),divide(identity,divide(identity,X1))),divide(divide(identity,X1),divide(X2,divide(identity,divide(identity,X1)))))
| divide(divide(divide(identity,X1),X2),divide(identity,divide(identity,X1))) = divide(divide(identity,X1),divide(X2,divide(identity,divide(identity,X1)))) ),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_67,plain,
divide(divide(identity,X1),divide(X2,divide(identity,divide(identity,X1)))) = divide(divide(identity,X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_59]),c_0_60])]) ).
cnf(c_0_68,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_69,plain,
divide(divide(divide(identity,X1),X2),X1) = divide(divide(identity,X2),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_38]),c_0_38]),c_0_63])]) ).
cnf(c_0_70,plain,
divide(X1,divide(X1,divide(X1,X2))) = divide(X1,X2),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,plain,
divide(divide(divide(identity,X1),X2),divide(identity,divide(identity,X1))) = divide(divide(identity,X1),X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67]),c_0_33])]) ).
cnf(c_0_72,negated_conjecture,
divide(divide(identity,a),divide(identity,divide(identity,b))) != divide(divide(identity,b),divide(identity,divide(identity,a))),
c_0_68 ).
cnf(c_0_73,plain,
divide(divide(identity,X1),divide(identity,divide(identity,X2))) = divide(divide(identity,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]) ).
cnf(c_0_74,negated_conjecture,
divide(divide(identity,b),a) != divide(divide(identity,a),b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_73]) ).
cnf(c_0_75,plain,
divide(divide(identity,X1),X2) = divide(divide(identity,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_70]),c_0_73]),c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN011-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.51 % Computer : n004.cluster.edu
% 0.13/0.51 % Model : x86_64 x86_64
% 0.13/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.51 % Memory : 8046.5625MB
% 0.13/0.51 % OS : Linux 6.8.0-71-generic
% 0.13/0.51 % CPULimit : 300
% 0.13/0.51 % WCLimit : 300
% 0.13/0.51 % DateTime : Sun Sep 20 20:46:35 UTC 2026
% 0.13/0.51 % CPUTime :
% 0.13/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.54 Running first-order theorem proving
% 0.13/0.54 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
% 7.54/1.60 % Version: 3.5.1
% 7.54/1.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.54/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.54/1.60 % Starting new_bool_3 with 300s (1) cores
% 7.54/1.60 % Starting new_bool_1 with 300s (1) cores
% 7.54/1.60 % Starting sh5l with 300s (1) cores
% 7.54/1.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1463069 completed with status 0
% 7.54/1.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 7.54/1.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.54/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.54/1.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.54/1.60 % No SInE strategy applied
% 7.54/1.60 % Search class: FHUSM-FFSF22-MFFFFFNN
% 7.54/1.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.54/1.60 % Starting SubtermCWHack with 136s (1) cores
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.54/1.60 % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 7.54/1.60 % Starting new_bool_3 with 136s (1) cores
% 7.54/1.60 % new_bool_3 with pid 1463080 completed with status 0
% 7.54/1.60 % Result found by new_bool_3
% 7.54/1.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 7.54/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 7.54/1.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.54/1.60 % No SInE strategy applied
% 7.54/1.60 % Search class: FHUSM-FFSF22-MFFFFFNN
% 7.54/1.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.54/1.60 % Starting SubtermCWHack with 136s (1) cores
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 7.54/1.60 % Starting U----_212g_01_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 7.54/1.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 7.54/1.60 % Starting new_bool_3 with 136s (1) cores
% 7.54/1.60 % Preprocessing time : 0.001 s
% 7.54/1.60 % Presaturation interreduction done
% 7.54/1.60
% 7.54/1.60 % Proof found!
% 7.54/1.60 % SZS status Unsatisfiable
% 7.54/1.60 % SZS output start CNFRefutation
% See solution above
% 7.54/1.60 % Parsed axioms : 18
% 7.54/1.60 % Removed by relevancy pruning/SinE : 0
% 7.54/1.60 % Initial clauses : 18
% 7.54/1.60 % Removed in clause preprocessing : 0
% 7.54/1.60 % Initial clauses in saturation : 18
% 7.54/1.60 % Processed clauses : 2597
% 7.54/1.60 % ...of these trivial : 213
% 7.54/1.60 % ...subsumed : 2021
% 7.54/1.60 % ...remaining for further processing : 363
% 7.54/1.60 % Other redundant clauses eliminated : 5
% 7.54/1.60 % Clauses deleted for lack of memory : 0
% 7.54/1.60 % Backward-subsumed : 16
% 7.54/1.60 % Backward-rewritten : 99
% 7.54/1.60 % Generated clauses : 63328
% 7.54/1.60 % ...of the previous two non-redundant : 22095
% 7.54/1.60 % ...aggressively subsumed : 0
% 7.54/1.60 % Contextual simplify-reflections : 0
% 7.54/1.60 % Paramodulations : 63323
% 7.54/1.60 % Factorizations : 0
% 7.54/1.60 % NegExts : 0
% 7.54/1.60 % Equation resolutions : 5
% 7.54/1.60 % Disequality decompositions : 0
% 7.54/1.60 % Total rewrite steps : 128697
% 7.54/1.60 % ...of those cached : 118103
% 7.54/1.60 % Propositional unsat checks : 0
% 7.54/1.60 % Propositional check models : 0
% 7.54/1.60 % Propositional check unsatisfiable : 0
% 7.54/1.60 % Propositional clauses : 0
% 7.54/1.60 % Propositional clauses after purity: 0
% 7.54/1.60 % Propositional unsat core size : 0
% 7.54/1.60 % Propositional preprocessing time : 0.000
% 7.54/1.60 % Propositional encoding time : 0.000
% 7.54/1.60 % Propositional solver time : 0.000
% 7.54/1.60 % Success case prop preproc time : 0.000
% 7.54/1.60 % Success case prop encoding time : 0.000
% 7.54/1.60 % Success case prop solver time : 0.000
% 7.54/1.60 % Current number of processed clauses : 230
% 7.54/1.60 % Positive orientable unit clauses : 150
% 7.54/1.60 % Positive unorientable unit clauses: 2
% 7.54/1.60 % Negative unit clauses : 0
% 7.54/1.60 % Non-unit-clauses : 78
% 7.54/1.60 % Current number of unprocessed clauses: 19225
% 7.54/1.60 % ...number of literals in the above : 23199
% 7.54/1.60 % Current number of archived formulas : 0
% 7.54/1.60 % Current number of archived clauses : 133
% 7.54/1.60 % Clause-clause subsumption calls (NU) : 6467
% 7.54/1.60 % Rec. Clause-clause subsumption calls : 6467
% 7.54/1.60 % Non-unit clause-clause subsumptions : 2016
% 7.54/1.60 % Unit Clause-clause subsumption calls : 602
% 7.54/1.60 % Rewrite failures with RHS unbound : 0
% 7.54/1.60 % BW rewrite match attempts : 2214
% 7.54/1.60 % BW rewrite match successes : 142
% 7.54/1.60 % Condensation attempts : 0
% 7.54/1.60 % Condensation successes : 0
% 7.54/1.60 % Termbank termtop insertions : 909464
% 7.54/1.60 % Search garbage collected termcells : 19
% 7.54/1.60
% 7.54/1.60 % -------------------------------------------------
% 7.54/1.60 % User time : 0.940 s
% 7.54/1.60 % System time : 0.024 s
% 7.54/1.60 % Total time : 0.964 s
% 7.54/1.60 % Maximum resident set size: 3640 pages
% 7.54/1.60
% 7.54/1.60 % -------------------------------------------------
% 7.54/1.60 % User time : 4.726 s
% 7.54/1.60 % System time : 0.173 s
% 7.54/1.60 % Total time : 4.899 s
% 7.54/1.60 % Maximum resident set size: 4864 pages
% 7.54/1.60 % E exiting
%------------------------------------------------------------------------------