0.01/0.04	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.01/0.04	% Command    : eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule --cpu-limit=%d %s
0.02/0.24	% Computer   : n167.star.cs.uiowa.edu
0.02/0.24	% Model      : x86_64 x86_64
0.02/0.24	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.02/0.24	% Memory     : 32218.625MB
0.02/0.24	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.02/0.24	% CPULimit   : 300
0.02/0.24	% DateTime   : Sat Jul 14 04:18:56 CDT 2018
0.02/0.24	% CPUTime    : 
0.02/0.24	# Version: 2.2pre001
0.02/0.24	# No SInE strategy applied
0.02/0.24	# Trying AutoSched0 for 151 seconds
0.07/0.28	# AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
0.07/0.28	# and selection function SelectMaxLComplexAvoidPosPred.
0.07/0.28	#
0.07/0.28	# Preprocessing time       : 0.013 s
0.07/0.28	# Presaturation interreduction done
0.07/0.28	
0.07/0.28	# Proof found!
0.07/0.28	# SZS status Theorem
0.07/0.28	# SZS output start CNFRefutation
0.07/0.28	fof(fact_78_Bit0__def, axiom, ![X3]:bit0(X3)=plus_plus(int,X3,X3), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_78_Bit0__def)).
0.07/0.28	fof(fact_92_Bit1__def, axiom, ![X3]:bit1(X3)=plus_plus(int,plus_plus(int,one_one(int),X3),X3), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_92_Bit1__def)).
0.07/0.28	fof(conj_0, conjecture, power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))!=zero_zero(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.07/0.28	fof(fact_10_quartic__square__square, axiom, ![X14]:power_power(int,power_power(int,X14,number_number_of(nat,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls))))=power_power(int,X14,number_number_of(nat,bit0(bit0(bit1(pls))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_10_quartic__square__square)).
0.07/0.28	fof(fact_29_nat__1__add__1, axiom, number_number_of(nat,bit0(bit1(pls)))=plus_plus(nat,one_one(nat),one_one(nat)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_29_nat__1__add__1)).
0.07/0.28	fof(fact_75_add__Pls__right, axiom, ![X3]:plus_plus(int,X3,pls)=X3, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_75_add__Pls__right)).
0.07/0.28	fof(fact_4_zero__power2, axiom, ![X1]:(power_power(X1,zero_zero(X1),number_number_of(nat,bit0(bit1(pls))))=zero_zero(X1)<=semiring_1(X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_4_zero__power2)).
0.07/0.28	fof(fact_45_zadd__assoc, axiom, ![X19, X20, X21]:plus_plus(int,X19,plus_plus(int,X20,X21))=plus_plus(int,plus_plus(int,X19,X20),X21), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_45_zadd__assoc)).
0.07/0.28	fof(fact_73_Pls__def, axiom, zero_zero(int)=pls, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_73_Pls__def)).
0.07/0.28	fof(arity_Int_Oint___Rings_Osemiring__1, axiom, semiring_1(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Osemiring__1)).
0.07/0.28	fof(fact_85_add__numeral__0__right, axiom, ![X1]:(number_ring(X1)=>![X17]:ti(X1,X17)=plus_plus(X1,X17,number_number_of(X1,pls))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_85_add__numeral__0__right)).
0.07/0.28	fof(fact_19_zero__is__num__zero, axiom, number_number_of(int,pls)=zero_zero(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_19_zero__is__num__zero)).
0.07/0.28	fof(fact_86_power__eq__0__iff__number__of, axiom, ![X1]:((((power(X1)&mult_zero(X1))&zero_neq_one(X1))&no_zero_divisors(X1))=>![X2, X25]:(zero_zero(X1)=power_power(X1,X2,number_number_of(nat,X25))<=>(zero_zero(nat)!=number_number_of(nat,X25)&zero_zero(X1)=ti(X1,X2)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_86_power__eq__0__iff__number__of)).
0.07/0.28	fof(arity_Int_Oint___Int_Onumber__ring, axiom, number_ring(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Int_Onumber__ring)).
0.07/0.28	fof(fact_0_n1pos, axiom, ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_n1pos)).
0.07/0.28	fof(arity_Int_Oint___Rings_Ono__zero__divisors, axiom, no_zero_divisors(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Ono__zero__divisors)).
0.07/0.28	fof(arity_Int_Oint___Rings_Ozero__neq__one, axiom, zero_neq_one(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Ozero__neq__one)).
0.07/0.28	fof(arity_Int_Oint___Rings_Omult__zero, axiom, mult_zero(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Rings_Omult__zero)).
0.07/0.28	fof(arity_Int_Oint___Power_Opower, axiom, power(int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', arity_Int_Oint___Power_Opower)).
0.07/0.28	fof(fact_32_rel__simps_I2_J, axiom, ~(ord_less(int,pls,pls)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_32_rel__simps_I2_J)).
0.07/0.28	fof(c_0_20, plain, ![X65]:bit0(X65)=plus_plus(int,X65,X65), inference(variable_rename,[status(thm)],[fact_78_Bit0__def])).
0.07/0.28	fof(c_0_21, plain, ![X53]:bit1(X53)=plus_plus(int,plus_plus(int,one_one(int),X53),X53), inference(variable_rename,[status(thm)],[fact_92_Bit1__def])).
0.07/0.28	fof(c_0_22, negated_conjecture, ~(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))!=zero_zero(int)), inference(assume_negation,[status(cth)],[conj_0])).
0.07/0.28	fof(c_0_23, plain, ![X242]:power_power(int,power_power(int,X242,number_number_of(nat,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls))))=power_power(int,X242,number_number_of(nat,bit0(bit0(bit1(pls))))), inference(variable_rename,[status(thm)],[fact_10_quartic__square__square])).
0.07/0.28	cnf(c_0_24, plain, (number_number_of(nat,bit0(bit1(pls)))=plus_plus(nat,one_one(nat),one_one(nat))), inference(split_conjunct,[status(thm)],[fact_29_nat__1__add__1])).
0.07/0.28	cnf(c_0_25, plain, (bit0(X1)=plus_plus(int,X1,X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
0.07/0.28	cnf(c_0_26, plain, (bit1(X1)=plus_plus(int,plus_plus(int,one_one(int),X1),X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
0.07/0.28	fof(c_0_27, plain, ![X186]:plus_plus(int,X186,pls)=X186, inference(variable_rename,[status(thm)],[fact_75_add__Pls__right])).
0.07/0.28	fof(c_0_28, negated_conjecture, power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int), inference(fof_simplification,[status(thm)],[c_0_22])).
0.07/0.28	fof(c_0_29, plain, ![X87]:(~semiring_1(X87)|power_power(X87,zero_zero(X87),number_number_of(nat,bit0(bit1(pls))))=zero_zero(X87)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_4_zero__power2])])])).
0.07/0.28	cnf(c_0_30, plain, (power_power(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),number_number_of(nat,bit0(bit1(pls))))=power_power(int,X1,number_number_of(nat,bit0(bit0(bit1(pls)))))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.07/0.28	cnf(c_0_31, plain, (number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))=plus_plus(nat,one_one(nat),one_one(nat))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_25]), c_0_26]), c_0_26])).
0.07/0.28	cnf(c_0_32, plain, (plus_plus(int,X1,pls)=X1), inference(split_conjunct,[status(thm)],[c_0_27])).
0.07/0.28	fof(c_0_33, plain, ![X75, X76, X77]:plus_plus(int,X75,plus_plus(int,X76,X77))=plus_plus(int,plus_plus(int,X75,X76),X77), inference(variable_rename,[status(thm)],[fact_45_zadd__assoc])).
0.07/0.28	cnf(c_0_34, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int)), inference(split_conjunct,[status(thm)],[c_0_28])).
0.07/0.28	cnf(c_0_35, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,bit0(bit1(pls))))=zero_zero(X1)|~semiring_1(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
0.07/0.28	cnf(c_0_36, plain, (power_power(int,power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))=power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))))), 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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_25]), c_0_25]), c_0_25]), c_0_25]), c_0_26]), c_0_26]), c_0_26]), c_0_26]), c_0_26]), c_0_26]), c_0_26]), c_0_26])).
0.07/0.28	cnf(c_0_37, plain, (number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))=plus_plus(nat,one_one(nat),one_one(nat))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32]), c_0_32]), c_0_32]), c_0_32])).
0.07/0.28	cnf(c_0_38, plain, (plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,plus_plus(int,X1,X2),X3)), inference(split_conjunct,[status(thm)],[c_0_33])).
0.07/0.28	cnf(c_0_39, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))=zero_zero(int)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_25]), c_0_26]), c_0_26])).
0.07/0.28	cnf(c_0_40, plain, (zero_zero(int)=pls), inference(split_conjunct,[status(thm)],[fact_73_Pls__def])).
0.07/0.28	cnf(c_0_41, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))))=zero_zero(X1)|~semiring_1(X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_25]), c_0_26]), c_0_26])).
0.07/0.28	cnf(c_0_42, plain, (power_power(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),plus_plus(nat,one_one(nat),one_one(nat)))=power_power(int,X1,number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))), 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(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36, c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_37]), c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_37]), c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_38])).
0.07/0.28	cnf(c_0_43, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),plus_plus(nat,one_one(nat),one_one(nat)))=pls), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_37]), c_0_40])).
0.07/0.28	cnf(c_0_44, plain, (power_power(X1,zero_zero(X1),plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|~semiring_1(X1)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_32]), c_0_32]), c_0_32]), c_0_32]), c_0_37])).
0.07/0.28	cnf(c_0_45, plain, (semiring_1(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Osemiring__1])).
0.07/0.28	fof(c_0_46, plain, ![X208, X209]:(~number_ring(X208)|ti(X208,X209)=plus_plus(X208,X209,number_number_of(X208,pls))), inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_85_add__numeral__0__right])])])])])).
0.07/0.28	cnf(c_0_47, plain, (number_number_of(int,pls)=zero_zero(int)), inference(split_conjunct,[status(thm)],[fact_19_zero__is__num__zero])).
0.07/0.28	fof(c_0_48, plain, ![X170, X171, X172, X171, X172]:(((zero_zero(nat)!=number_number_of(nat,X172)|zero_zero(X170)!=power_power(X170,X171,number_number_of(nat,X172))|(~power(X170)|~mult_zero(X170)|~zero_neq_one(X170)|~no_zero_divisors(X170)))&(zero_zero(X170)=ti(X170,X171)|zero_zero(X170)!=power_power(X170,X171,number_number_of(nat,X172))|(~power(X170)|~mult_zero(X170)|~zero_neq_one(X170)|~no_zero_divisors(X170))))&(zero_zero(nat)=number_number_of(nat,X172)|zero_zero(X170)!=ti(X170,X171)|zero_zero(X170)=power_power(X170,X171,number_number_of(nat,X172))|(~power(X170)|~mult_zero(X170)|~zero_neq_one(X170)|~no_zero_divisors(X170)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_86_power__eq__0__iff__number__of])])])])])])).
0.07/0.28	cnf(c_0_49, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))=power_power(int,pls,plus_plus(nat,one_one(nat),one_one(nat)))), inference(spm,[status(thm)],[c_0_42, c_0_43])).
0.07/0.28	cnf(c_0_50, plain, (power_power(int,pls,plus_plus(nat,one_one(nat),one_one(nat)))=pls), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44, c_0_45]), c_0_40]), c_0_40])).
0.07/0.28	cnf(c_0_51, plain, (ti(X1,X2)=plus_plus(X1,X2,number_number_of(X1,pls))|~number_ring(X1)), inference(split_conjunct,[status(thm)],[c_0_46])).
0.07/0.28	cnf(c_0_52, plain, (number_ring(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Int_Onumber__ring])).
0.07/0.28	cnf(c_0_53, plain, (number_number_of(int,pls)=pls), inference(rw,[status(thm)],[c_0_47, c_0_40])).
0.07/0.28	cnf(c_0_54, plain, (ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))), inference(split_conjunct,[status(thm)],[fact_0_n1pos])).
0.07/0.28	cnf(c_0_55, plain, (zero_zero(X1)=ti(X1,X2)|zero_zero(X1)!=power_power(X1,X2,number_number_of(nat,X3))|~power(X1)|~mult_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)), inference(split_conjunct,[status(thm)],[c_0_48])).
0.07/0.28	cnf(c_0_56, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int))))))=pls), inference(rw,[status(thm)],[c_0_49, c_0_50])).
0.07/0.28	cnf(c_0_57, plain, (ti(int,X1)=X1), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_53]), c_0_32])).
0.07/0.28	cnf(c_0_58, plain, (no_zero_divisors(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Ono__zero__divisors])).
0.07/0.28	cnf(c_0_59, plain, (zero_neq_one(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Ozero__neq__one])).
0.07/0.28	cnf(c_0_60, plain, (mult_zero(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Omult__zero])).
0.07/0.28	cnf(c_0_61, plain, (power(int)), inference(split_conjunct,[status(thm)],[arity_Int_Oint___Power_Opower])).
0.07/0.28	fof(c_0_62, plain, ~ord_less(int,pls,pls), inference(fof_simplification,[status(thm)],[fact_32_rel__simps_I2_J])).
0.07/0.28	cnf(c_0_63, plain, (ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))), inference(rw,[status(thm)],[c_0_54, c_0_40])).
0.07/0.28	cnf(c_0_64, negated_conjecture, (plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls), inference(cn,[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_55, c_0_56]), c_0_57]), c_0_40]), c_0_40]), c_0_58]), c_0_59]), c_0_60]), c_0_61])])).
0.07/0.28	cnf(c_0_65, plain, (~ord_less(int,pls,pls)), inference(split_conjunct,[status(thm)],[c_0_62])).
0.07/0.28	cnf(c_0_66, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_63, c_0_64]), c_0_65]), ['proof']).
0.07/0.28	# SZS output end CNFRefutation
0.07/0.28	# Proof object total steps             : 67
0.07/0.28	# Proof object clause steps            : 36
0.07/0.28	# Proof object formula steps           : 31
0.07/0.28	# Proof object conjectures             : 9
0.07/0.28	# Proof object clause conjectures      : 6
0.07/0.28	# Proof object formula conjectures     : 3
0.07/0.28	# Proof object initial clauses used    : 20
0.07/0.28	# Proof object initial formulas used   : 20
0.07/0.28	# Proof object generating inferences   : 4
0.07/0.28	# Proof object simplifying inferences  : 72
0.07/0.28	# Training examples: 0 positive, 0 negative
0.07/0.28	# Parsed axioms                        : 153
0.07/0.28	# Removed by relevancy pruning/SinE    : 0
0.07/0.28	# Initial clauses                      : 197
0.07/0.28	# Removed in clause preprocessing      : 7
0.07/0.28	# Initial clauses in saturation        : 190
0.07/0.28	# Processed clauses                    : 854
0.07/0.28	# ...of these trivial                  : 12
0.07/0.28	# ...subsumed                          : 418
0.07/0.28	# ...remaining for further processing  : 424
0.07/0.28	# Other redundant clauses eliminated   : 6
0.07/0.28	# Clauses deleted for lack of memory   : 0
0.07/0.28	# Backward-subsumed                    : 9
0.07/0.28	# Backward-rewritten                   : 35
0.07/0.28	# Generated clauses                    : 1561
0.07/0.28	# ...of the previous two non-trivial   : 1268
0.07/0.28	# Contextual simplify-reflections      : 3
0.07/0.28	# Paramodulations                      : 1547
0.07/0.28	# Factorizations                       : 2
0.07/0.28	# Equation resolutions                 : 11
0.07/0.28	# Propositional unsat checks           : 0
0.07/0.28	#    Propositional check models        : 0
0.07/0.28	#    Propositional check unsatisfiable : 0
0.07/0.28	#    Propositional clauses             : 0
0.07/0.28	#    Propositional clauses after purity: 0
0.07/0.28	#    Propositional unsat core size     : 0
0.07/0.28	# Current number of processed clauses  : 217
0.07/0.28	#    Positive orientable unit clauses  : 56
0.07/0.28	#    Positive unorientable unit clauses: 4
0.07/0.28	#    Negative unit clauses             : 46
0.07/0.28	#    Non-unit-clauses                  : 111
0.07/0.28	# Current number of unprocessed clauses: 686
0.07/0.28	# ...number of literals in the above   : 1225
0.07/0.28	# Current number of archived formulas  : 0
0.07/0.28	# Current number of archived clauses   : 205
0.07/0.28	# Clause-clause subsumption calls (NU) : 2330
0.07/0.28	# Rec. Clause-clause subsumption calls : 1647
0.07/0.28	# Non-unit clause-clause subsumptions  : 103
0.07/0.28	# Unit Clause-clause subsumption calls : 90
0.07/0.28	# Rewrite failures with RHS unbound    : 0
0.07/0.28	# BW rewrite match attempts            : 374
0.07/0.28	# BW rewrite match successes           : 74
0.07/0.28	# Condensation attempts                : 0
0.07/0.28	# Condensation successes               : 0
0.07/0.28	# Termbank termtop insertions          : 39534
0.07/0.28	
0.07/0.28	# -------------------------------------------------
0.07/0.28	# User time                : 0.037 s
0.07/0.28	# System time              : 0.005 s
0.07/0.28	# Total time               : 0.042 s
0.07/0.28	# Maximum resident set size: 1660 pages
0.07/0.29	EOF