TSTP Solution File: ITP208_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP208_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 22:16:51 EDT 2024
% Result : Theorem 36.36s 5.80s
% Output : CNFRefutation 36.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 32
% Syntax : Number of formulae : 60 ( 12 unt; 24 typ; 0 def)
% Number of atoms : 95 ( 38 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 104 ( 45 ~; 38 |; 5 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 8 ( 7 usr)
% Number of type conns : 15 ( 9 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 115 ( 0 sgn 111 !; 4 ?; 115 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_bool: $tType ).
tff(decl_sort2,type,
fun_nat_fun_nat_bool: $tType ).
tff(decl_sort3,type,
nat: $tType ).
tff(decl_sort4,type,
heap_e7401611519738050253t_unit: $tType ).
tff(decl_sort5,type,
array_a: $tType ).
tff(decl_sort6,type,
heap_Time_Heap_nat: $tType ).
tff(decl_sort7,type,
bool: $tType ).
tff(decl_149,type,
array_len_a: array_a > heap_Time_Heap_nat ).
tff(decl_153,type,
array_length_a: ( heap_e7401611519738050253t_unit * array_a ) > nat ).
tff(decl_457,type,
one_one_nat: nat ).
tff(decl_526,type,
heap_Time_effect_nat: ( heap_Time_Heap_nat * heap_e7401611519738050253t_unit * heap_e7401611519738050253t_unit ) > fun_nat_fun_nat_bool ).
tff(decl_739,type,
ord_less_nat: fun_nat_fun_nat_bool ).
tff(decl_1028,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_1044,type,
aa_nat_fun_nat_bool: ( fun_nat_fun_nat_bool * nat ) > fun_nat_bool ).
tff(decl_1145,type,
pp: bool > $o ).
tff(decl_1146,type,
a: array_a ).
tff(decl_1147,type,
h: heap_e7401611519738050253t_unit ).
tff(decl_1148,type,
h2: heap_e7401611519738050253t_unit ).
tff(decl_1149,type,
n: nat ).
tff(decl_1150,type,
r: nat ).
tff(decl_1151,type,
thesis: $o ).
tff(decl_1213,type,
esk62_1: fun_nat_bool > nat ).
tff(decl_1214,type,
esk63_2: ( fun_nat_bool * nat ) > nat ).
tff(decl_1215,type,
esk64_1: fun_nat_bool > nat ).
tff(fact_1327_exists__least__iff,axiom,
! [X2089: fun_nat_bool] :
( ? [X2090: nat] : pp(aa_nat_bool(X2089,X2090))
<=> ? [X2091: nat] :
( pp(aa_nat_bool(X2089,X2091))
& ! [X1055: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X1055),X2091))
=> ~ pp(aa_nat_bool(X2089,X1055)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1327_exists__least__iff) ).
tff(fact_2_effect__lengthI,axiom,
! [X1: heap_e7401611519738050253t_unit,X2: heap_e7401611519738050253t_unit,X3: nat,X4: array_a,X5: nat] :
( ( X1 = X2 )
=> ( ( X3 = array_length_a(X2,X4) )
=> ( ( X5 = one_one_nat )
=> pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(X4),X2,X1),X3),X5)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_effect__lengthI) ).
tff(fact_55_effect__deterministic_I2_J,axiom,
! [X12: heap_Time_Heap_nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X17: nat,X5: nat,X14: heap_e7401611519738050253t_unit,X15: nat,X16: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X2,X1),X17),X5))
=> ( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X2,X14),X15),X16))
=> ( X1 = X14 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_55_effect__deterministic_I2_J) ).
fof(conj_1,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(fact_0_assms,axiom,
pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(a),h,h2),r),n)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_assms) ).
tff(fact_1_that,axiom,
( ( r = array_length_a(h2,a) )
=> ( ( h2 = h )
=> ( ( n = one_one_nat )
=> thesis ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_that) ).
tff(fact_54_effect__deterministic_I3_J,axiom,
! [X12: heap_Time_Heap_nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X13: nat,X5: nat,X14: heap_e7401611519738050253t_unit,X15: nat,X16: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X2,X1),X13),X5))
=> ( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X2,X14),X15),X16))
=> ( X5 = X16 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_54_effect__deterministic_I3_J) ).
tff(fact_56_effect__deterministic_I1_J,axiom,
! [X12: heap_Time_Heap_nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X18: nat,X5: nat,X14: heap_e7401611519738050253t_unit,X15: nat,X16: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X2,X1),X18),X5))
=> ( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X2,X14),X15),X16))
=> ( X18 = X15 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_56_effect__deterministic_I1_J) ).
tff(c_0_8,plain,
! [X2089: fun_nat_bool] :
( ? [X2090: nat] : pp(aa_nat_bool(X2089,X2090))
<=> ? [X2091: nat] :
( pp(aa_nat_bool(X2089,X2091))
& ! [X1055: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X1055),X2091))
=> ~ pp(aa_nat_bool(X2089,X1055)) ) ) ),
inference(fof_simplification,[status(thm)],[fact_1327_exists__least__iff]) ).
tff(c_0_9,plain,
! [X14332: heap_e7401611519738050253t_unit,X14333: heap_e7401611519738050253t_unit,X14334: nat,X14335: array_a,X14336: nat] :
( ( X14332 != X14333 )
| ( X14334 != array_length_a(X14333,X14335) )
| ( X14336 != one_one_nat )
| pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(X14335),X14333,X14332),X14334),X14336)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2_effect__lengthI])])]) ).
tff(c_0_10,plain,
! [X15871: heap_Time_Heap_nat,X15872: heap_e7401611519738050253t_unit,X15873: heap_e7401611519738050253t_unit,X15874: nat,X15875: nat,X15876: heap_e7401611519738050253t_unit,X15877: nat,X15878: nat] :
( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X15871,X15872,X15873),X15874),X15875))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X15871,X15872,X15876),X15877),X15878))
| ( X15873 = X15876 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_55_effect__deterministic_I2_J])])]) ).
tff(c_0_11,plain,
! [X14931: fun_nat_bool,X14932: nat,X14934: nat,X14935: fun_nat_bool,X14936: nat] :
( ( pp(aa_nat_bool(X14931,esk62_1(X14931)))
| ~ pp(aa_nat_bool(X14931,X14932)) )
& ( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X14934),esk62_1(X14931)))
| ~ pp(aa_nat_bool(X14931,X14934))
| ~ pp(aa_nat_bool(X14931,X14932)) )
& ( pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,esk63_2(X14935,X14936)),X14936))
| ~ pp(aa_nat_bool(X14935,X14936))
| pp(aa_nat_bool(X14935,esk64_1(X14935))) )
& ( pp(aa_nat_bool(X14935,esk63_2(X14935,X14936)))
| ~ pp(aa_nat_bool(X14935,X14936))
| pp(aa_nat_bool(X14935,esk64_1(X14935))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])])]) ).
tcf(c_0_12,plain,
! [X1: heap_e7401611519738050253t_unit,X2: heap_e7401611519738050253t_unit,X3: nat,X4: array_a,X5: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(X4),X2,X1),X3),X5))
| ( X1 != X2 )
| ( X3 != array_length_a(X2,X4) )
| ( X5 != one_one_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ thesis,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
tcf(c_0_14,plain,
! [X3: nat,X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X5: nat,X6: nat,X14: heap_e7401611519738050253t_unit,X12: heap_Time_Heap_nat,X11: nat] :
( ( X2 = X14 )
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X1,X2),X3),X5))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X1,X14),X6),X11)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_15,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(a),h,h2),r),n)),
inference(split_conjunct,[status(thm)],[fact_0_assms]) ).
tcf(c_0_16,plain,
! [X41: fun_nat_bool,X3: nat] :
( pp(aa_nat_bool(X41,esk62_1(X41)))
| ~ pp(aa_nat_bool(X41,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_17,plain,
! [X1: heap_e7401611519738050253t_unit,X4: array_a] : pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(X4),X1,X1),array_length_a(X1,X4)),one_one_nat)),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])])]) ).
tff(c_0_18,plain,
( ( r != array_length_a(h2,a) )
| ( h2 != h )
| ( n != one_one_nat )
| thesis ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_that])]) ).
fof(c_0_19,negated_conjecture,
~ thesis,
inference(fof_nnf,[status(thm)],[c_0_13]) ).
tff(c_0_20,plain,
! [X15863: heap_Time_Heap_nat,X15864: heap_e7401611519738050253t_unit,X15865: heap_e7401611519738050253t_unit,X15866: nat,X15867: nat,X15868: heap_e7401611519738050253t_unit,X15869: nat,X15870: nat] :
( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X15863,X15864,X15865),X15866),X15867))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X15863,X15864,X15868),X15869),X15870))
| ( X15867 = X15870 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_54_effect__deterministic_I3_J])])]) ).
tcf(c_0_21,plain,
! [X1: heap_e7401611519738050253t_unit,X3: nat,X5: nat] :
( ( X1 = h2 )
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(a),h,X1),X3),X5)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
tcf(c_0_22,plain,
! [X1: heap_e7401611519738050253t_unit,X4: array_a] : pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(X4),X1,X1),array_length_a(X1,X4)),esk62_1(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(X4),X1,X1),array_length_a(X1,X4))))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_23,plain,
( thesis
| ( r != array_length_a(h2,a) )
| ( h2 != h )
| ( n != one_one_nat ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
~ thesis,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_25,plain,
! [X2: heap_e7401611519738050253t_unit,X1: heap_e7401611519738050253t_unit,X3: nat,X5: nat,X6: nat,X14: heap_e7401611519738050253t_unit,X12: heap_Time_Heap_nat,X11: nat] :
( ( X5 = X11 )
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X1,X2),X3),X5))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X1,X14),X6),X11)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_26,plain,
h = h2,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
tff(c_0_27,plain,
! [X15879: heap_Time_Heap_nat,X15880: heap_e7401611519738050253t_unit,X15881: heap_e7401611519738050253t_unit,X15882: nat,X15883: nat,X15884: heap_e7401611519738050253t_unit,X15885: nat,X15886: nat] :
( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X15879,X15880,X15881),X15882),X15883))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X15879,X15880,X15884),X15885),X15886))
| ( X15882 = X15885 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_56_effect__deterministic_I1_J])])]) ).
tcf(c_0_28,plain,
( ( array_length_a(h2,a) != r )
| ( h != h2 )
| ( n != one_one_nat ) ),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
tcf(c_0_29,plain,
! [X1: heap_e7401611519738050253t_unit,X5: nat,X3: nat] :
( ( X3 = n )
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(a),h2,X1),X5),X3)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_26]) ).
tcf(c_0_30,plain,
! [X2: heap_e7401611519738050253t_unit,X5: nat,X3: nat,X1: heap_e7401611519738050253t_unit,X6: nat,X14: heap_e7401611519738050253t_unit,X12: heap_Time_Heap_nat,X11: nat] :
( ( X3 = X6 )
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X1,X2),X3),X5))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(X12,X1,X14),X6),X11)) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(c_0_31,plain,
( ( array_length_a(h2,a) != r )
| ( n != one_one_nat ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_26])]) ).
tcf(c_0_32,plain,
n = one_one_nat,
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
tcf(c_0_33,plain,
! [X1: heap_e7401611519738050253t_unit,X3: nat,X5: nat] :
( ( X3 = r )
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(heap_Time_effect_nat(array_len_a(a),h2,X1),X3),X5)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_26]) ).
tcf(c_0_34,plain,
array_length_a(h2,a) != r,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP208_1 : TPTP v8.2.0. Released v8.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 16:11:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.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
% 36.36/5.80 # Version: 3.1.0
% 36.36/5.80 # Preprocessing class: FMLLSMLLSSSNFFN.
% 36.36/5.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.36/5.80 # Starting new_bool_3 with 900s (3) cores
% 36.36/5.80 # Starting new_bool_1 with 900s (3) cores
% 36.36/5.80 # Starting sh5l with 300s (1) cores
% 36.36/5.80 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 36.36/5.80 # new_bool_3 with pid 17892 completed with status 0
% 36.36/5.80 # Result found by new_bool_3
% 36.36/5.80 # Preprocessing class: FMLLSMLLSSSNFFN.
% 36.36/5.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.36/5.80 # Starting new_bool_3 with 900s (3) cores
% 36.36/5.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.36/5.80 # Search class: FGHSM-SSLM31-DFFFFFNN
% 36.36/5.80 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 36.36/5.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 487s (1) cores
% 36.36/5.80 # Starting new_bool_3 with 91s (1) cores
% 36.36/5.80 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 82s (1) cores
% 36.36/5.80 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 17905 completed with status 0
% 36.36/5.80 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 36.36/5.80 # Preprocessing class: FMLLSMLLSSSNFFN.
% 36.36/5.80 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 36.36/5.80 # Starting new_bool_3 with 900s (3) cores
% 36.36/5.80 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 36.36/5.80 # Search class: FGHSM-SSLM31-DFFFFFNN
% 36.36/5.80 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 36.36/5.80 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 487s (1) cores
% 36.36/5.80 # Starting new_bool_3 with 91s (1) cores
% 36.36/5.80 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 82s (1) cores
% 36.36/5.80 # Preprocessing time : 0.030 s
% 36.36/5.80 # Presaturation interreduction done
% 36.36/5.80
% 36.36/5.80 # Proof found!
% 36.36/5.80 # SZS status Theorem
% 36.36/5.80 # SZS output start CNFRefutation
% See solution above
% 36.36/5.80 # Parsed axioms : 10768
% 36.36/5.80 # Removed by relevancy pruning/SinE : 10137
% 36.36/5.80 # Initial clauses : 1177
% 36.36/5.80 # Removed in clause preprocessing : 33
% 36.36/5.80 # Initial clauses in saturation : 1144
% 36.36/5.80 # Processed clauses : 14295
% 36.36/5.80 # ...of these trivial : 168
% 36.36/5.80 # ...subsumed : 9987
% 36.36/5.80 # ...remaining for further processing : 4140
% 36.36/5.80 # Other redundant clauses eliminated : 1160
% 36.36/5.80 # Clauses deleted for lack of memory : 0
% 36.36/5.80 # Backward-subsumed : 119
% 36.36/5.80 # Backward-rewritten : 24
% 36.36/5.80 # Generated clauses : 154558
% 36.36/5.80 # ...of the previous two non-redundant : 145729
% 36.36/5.80 # ...aggressively subsumed : 0
% 36.36/5.80 # Contextual simplify-reflections : 33
% 36.36/5.80 # Paramodulations : 153379
% 36.36/5.80 # Factorizations : 14
% 36.36/5.80 # NegExts : 0
% 36.36/5.80 # Equation resolutions : 1179
% 36.36/5.80 # Disequality decompositions : 0
% 36.36/5.80 # Total rewrite steps : 22707
% 36.36/5.80 # ...of those cached : 19909
% 36.36/5.80 # Propositional unsat checks : 0
% 36.36/5.80 # Propositional check models : 0
% 36.36/5.80 # Propositional check unsatisfiable : 0
% 36.36/5.80 # Propositional clauses : 0
% 36.36/5.80 # Propositional clauses after purity: 0
% 36.36/5.80 # Propositional unsat core size : 0
% 36.36/5.80 # Propositional preprocessing time : 0.000
% 36.36/5.80 # Propositional encoding time : 0.000
% 36.36/5.80 # Propositional solver time : 0.000
% 36.36/5.80 # Success case prop preproc time : 0.000
% 36.36/5.80 # Success case prop encoding time : 0.000
% 36.36/5.80 # Success case prop solver time : 0.000
% 36.36/5.80 # Current number of processed clauses : 3238
% 36.36/5.80 # Positive orientable unit clauses : 227
% 36.36/5.80 # Positive unorientable unit clauses: 7
% 36.36/5.80 # Negative unit clauses : 920
% 36.36/5.80 # Non-unit-clauses : 2084
% 36.36/5.80 # Current number of unprocessed clauses: 132489
% 36.36/5.80 # ...number of literals in the above : 449952
% 36.36/5.80 # Current number of archived formulas : 0
% 36.36/5.80 # Current number of archived clauses : 784
% 36.36/5.80 # Clause-clause subsumption calls (NU) : 743724
% 36.36/5.80 # Rec. Clause-clause subsumption calls : 522009
% 36.36/5.80 # Non-unit clause-clause subsumptions : 4872
% 36.36/5.80 # Unit Clause-clause subsumption calls : 570732
% 36.36/5.80 # Rewrite failures with RHS unbound : 0
% 36.36/5.80 # BW rewrite match attempts : 7695
% 36.36/5.80 # BW rewrite match successes : 105
% 36.36/5.80 # Condensation attempts : 0
% 36.36/5.80 # Condensation successes : 0
% 36.36/5.80 # Termbank termtop insertions : 3267348
% 36.36/5.80 # Search garbage collected termcells : 114218
% 36.36/5.80
% 36.36/5.80 # -------------------------------------------------
% 36.36/5.80 # User time : 4.364 s
% 36.36/5.80 # System time : 0.152 s
% 36.36/5.80 # Total time : 4.516 s
% 36.36/5.80 # Maximum resident set size: 25308 pages
% 36.36/5.80
% 36.36/5.80 # -------------------------------------------------
% 36.36/5.80 # User time : 13.505 s
% 36.36/5.80 # System time : 0.293 s
% 36.36/5.80 # Total time : 13.798 s
% 36.36/5.80 # Maximum resident set size: 22004 pages
% 36.36/5.80 % E---3.1 exiting
% 36.36/5.80 % E exiting
%------------------------------------------------------------------------------