TSTP Solution File: NUM926_1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM926_1 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:58:02 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 26
% Syntax : Number of formulae : 57 ( 26 unt; 17 typ; 0 def)
% Number of atoms : 61 ( 44 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 46 ( 25 ~; 15 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 14 ( 9 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn; 38 !; 8 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
one_one_int: int ).
tff(decl_24,type,
plus_plus_int: ( int * int ) > int ).
tff(decl_26,type,
times_times_int: ( int * int ) > int ).
tff(decl_29,type,
bit0: int > int ).
tff(decl_30,type,
bit1: int > int ).
tff(decl_31,type,
pls: int ).
tff(decl_32,type,
number_number_of_int: int > int ).
tff(decl_33,type,
number_number_of_nat: int > nat ).
tff(decl_34,type,
ord_less_int: ( int * int ) > $o ).
tff(decl_36,type,
ord_less_eq_int: ( int * int ) > $o ).
tff(decl_38,type,
power_power_int: ( int * nat ) > int ).
tff(decl_41,type,
m: int ).
tff(decl_43,type,
t: int ).
tff(decl_44,type,
esk1_0: int ).
tff(decl_45,type,
esk2_0: int ).
tff(decl_46,type,
esk3_0: int ).
tff(decl_47,type,
esk4_0: int ).
tff(conj_0,conjecture,
? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',conj_0) ).
tff(fact_111_number__of__is__id,axiom,
! [X26: int] : ( number_number_of_int(X26) = X26 ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_111_number__of__is__id) ).
tff(fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X142: int,X143: int] : ( plus_plus_int(X142,X143) = plus_plus_int(X143,X142) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
tff(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ( t = one_one_int )
=> ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
tff(fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J,axiom,
! [X106: int,X107: int] : ( times_times_int(X106,X107) = times_times_int(X107,X106) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
tff(fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X10: int] : ( times_times_int(X10,X10) = power_power_int(X10,number_number_of_nat(bit0(bit1(pls)))) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
tff(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ord_less_int(one_one_int,t)
=> ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
tff(fact_28_zless__le,axiom,
! [X22: int,X23: int] :
( ord_less_int(X22,X23)
<=> ( ord_less_eq_int(X22,X23)
& ( X22 != X23 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_28_zless__le) ).
tff(fact_0_tpos,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/tmp/tmp.COXWKZ48ul/E---3.1_3359.p',fact_0_tpos) ).
tff(c_0_9,negated_conjecture,
~ ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_10,negated_conjecture,
! [X152: int,X153: int] : ( plus_plus_int(power_power_int(X152,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X153,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).
tff(c_0_11,plain,
! [X254: int] : ( number_number_of_int(X254) = X254 ),
inference(variable_rename,[status(thm)],[fact_111_number__of__is__id]) ).
tcf(c_0_12,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_13,plain,
! [X1: int] : number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_14,plain,
! [X180: int,X181: int] : ( plus_plus_int(X180,X181) = plus_plus_int(X181,X180) ),
inference(variable_rename,[status(thm)],[fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
tff(c_0_15,plain,
( ( t != one_one_int )
| ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])]) ).
tcf(c_0_16,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_17,plain,
! [X2: int,X1: int] : plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tff(c_0_18,plain,
! [X222: int,X223: int] : ( times_times_int(X222,X223) = times_times_int(X223,X222) ),
inference(variable_rename,[status(thm)],[fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J]) ).
tcf(c_0_19,plain,
( ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ( t != one_one_int ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tff(c_0_20,plain,
! [X274: int] : ( times_times_int(X274,X274) = power_power_int(X274,number_number_of_nat(bit0(bit1(pls)))) ),
inference(variable_rename,[status(thm)],[fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
tcf(c_0_21,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(bit0(bit0(bit1(pls))),m)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
tcf(c_0_22,plain,
! [X2: int,X1: int] : times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_23,plain,
( ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
tcf(c_0_24,plain,
! [X1: int] : times_times_int(X1,X1) = power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_25,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
tcf(c_0_26,plain,
( ( plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) = plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
tff(c_0_27,plain,
( ~ ord_less_int(one_one_int,t)
| ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])]) ).
tcf(c_0_28,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(times_times_int(X1,X1),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
tcf(c_0_29,plain,
( ( plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(bit0(bit0(bit1(pls))),m)) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[c_0_26,c_0_17]) ).
tcf(c_0_30,plain,
( ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tff(c_0_31,plain,
! [X292: int,X293: int] :
( ( ord_less_eq_int(X292,X293)
| ~ ord_less_int(X292,X293) )
& ( ( X292 != X293 )
| ~ ord_less_int(X292,X293) )
& ( ~ ord_less_eq_int(X292,X293)
| ( X292 = X293 )
| ord_less_int(X292,X293) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_28_zless__le])])]) ).
tcf(c_0_32,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(times_times_int(X1,X1),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
tcf(c_0_33,plain,
( ( plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))) )
| ( t != one_one_int ) ),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
tcf(c_0_34,plain,
( ( plus_plus_int(times_times_int(esk3_0,esk3_0),times_times_int(esk4_0,esk4_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))) )
| ~ ord_less_int(one_one_int,t) ),
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_24]),c_0_24]),c_0_13]),c_0_22]),c_0_17]) ).
tcf(c_0_35,plain,
! [X1: int,X2: int] :
( ( X1 = X2 )
| ord_less_int(X1,X2)
| ~ ord_less_eq_int(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
tcf(c_0_36,plain,
ord_less_eq_int(one_one_int,t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
tcf(c_0_37,negated_conjecture,
t != one_one_int,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
tcf(c_0_38,negated_conjecture,
~ ord_less_int(one_one_int,t),
inference(spm,[status(thm)],[c_0_32,c_0_34]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM926_1 : TPTP v8.1.2. Released v5.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.32 % Computer : n031.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 14:02:43 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.COXWKZ48ul/E---3.1_3359.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_1 with pid 3439 completed with status 0
% 0.17/0.46 # Result found by new_bool_1
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSM-FFMS21-DFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 55s (1) cores
% 0.17/0.46 # new_ho_10 with pid 3446 completed with status 0
% 0.17/0.46 # Result found by new_ho_10
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FGHSM-FFMS21-DFFFFFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 55s (1) cores
% 0.17/0.46 # Preprocessing time : 0.002 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 148
% 0.17/0.46 # Removed by relevancy pruning/SinE : 44
% 0.17/0.46 # Initial clauses : 142
% 0.17/0.46 # Removed in clause preprocessing : 7
% 0.17/0.46 # Initial clauses in saturation : 135
% 0.17/0.46 # Processed clauses : 244
% 0.17/0.46 # ...of these trivial : 26
% 0.17/0.46 # ...subsumed : 40
% 0.17/0.46 # ...remaining for further processing : 178
% 0.17/0.46 # Other redundant clauses eliminated : 1
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 3
% 0.17/0.46 # Backward-rewritten : 9
% 0.17/0.46 # Generated clauses : 265
% 0.17/0.46 # ...of the previous two non-redundant : 226
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 262
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 3
% 0.17/0.46 # Total rewrite steps : 196
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 84
% 0.17/0.46 # Positive orientable unit clauses : 23
% 0.17/0.46 # Positive unorientable unit clauses: 7
% 0.17/0.46 # Negative unit clauses : 11
% 0.17/0.46 # Non-unit-clauses : 43
% 0.17/0.46 # Current number of unprocessed clauses: 191
% 0.17/0.46 # ...number of literals in the above : 277
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 93
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 545
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 518
% 0.17/0.46 # Non-unit clause-clause subsumptions : 19
% 0.17/0.46 # Unit Clause-clause subsumption calls : 96
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 134
% 0.17/0.46 # BW rewrite match successes : 112
% 0.17/0.46 # Condensation attempts : 244
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 11167
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.015 s
% 0.17/0.46 # System time : 0.003 s
% 0.17/0.46 # Total time : 0.018 s
% 0.17/0.46 # Maximum resident set size: 2292 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.017 s
% 0.17/0.46 # System time : 0.005 s
% 0.17/0.46 # Total time : 0.022 s
% 0.17/0.46 # Maximum resident set size: 1896 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------