TSTP Solution File: NUM924+8 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM924+8 : TPTP v8.1.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n026.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  : 600s
% DateTime : Mon Jul 18 09:37:45 EDT 2022

% Result   : Theorem 1.95s 142.12s
% Output   : CNFRefutation 1.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   36 (  36 unt;   0 def)
%            Number of atoms       :   36 (  26 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :   13 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  10 con; 0-4 aty)
%            Number of variables   :   33 (   1 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_99_zadd__commute,axiom,
    ! [X16,X12] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X16),X12) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X12),X16),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_99_zadd__commute) ).

fof(fact_23_zmult__commute,axiom,
    ! [X16,X12] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X16),X12) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X12),X16),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_23_zmult__commute) ).

fof(fact_22_number__of__is__id,axiom,
    ! [X15] : hAPP(int,int,number_number_of(int),X15) = ti(int,X15),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_22_number__of__is__id) ).

fof(tsy_c_hAPP_res,axiom,
    ! [X3,X1,X4,X5] : ti(X3,hAPP(X1,X3,X4,X5)) = hAPP(X1,X3,X4,X5),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',tsy_c_hAPP_res) ).

fof(conj_0,conjecture,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',conj_0) ).

fof(fact_3_t,axiom,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_3_t) ).

fof(fact_1427_semiring__norm_I115_J,axiom,
    hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))) = hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_1427_semiring__norm_I115_J) ).

fof(fact_62_mult__Pls,axiom,
    ! [X12] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X12) = pls,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_62_mult__Pls) ).

fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).

fof(fact_123_Pls__def,axiom,
    pls = zero_zero(int),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_123_Pls__def) ).

fof(fact_112_one__is__num__one,axiom,
    one_one(int) = hAPP(int,int,number_number_of(int),hAPP(int,int,bit1,pls)),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fact_112_one__is__num__one) ).

fof(c_0_11,plain,
    ! [X17,X18] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X17),X18) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X18),X17),
    inference(variable_rename,[status(thm)],[fact_99_zadd__commute]) ).

fof(c_0_12,plain,
    ! [X17,X18] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X17),X18) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X18),X17),
    inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).

fof(c_0_13,plain,
    ! [X16] : hAPP(int,int,number_number_of(int),X16) = ti(int,X16),
    inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).

fof(c_0_14,plain,
    ! [X6,X7,X8,X9] : ti(X6,hAPP(X7,X6,X8,X9)) = hAPP(X7,X6,X8,X9),
    inference(variable_rename,[status(thm)],[tsy_c_hAPP_res]) ).

fof(c_0_15,negated_conjecture,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
    inference(assume_negation,[status(cth)],[conj_0]) ).

cnf(c_0_16,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t),
    inference(split_conjunct,[status(thm)],[fact_3_t]) ).

cnf(c_0_17,plain,
    hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),X2) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X2) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,plain,
    hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))) = hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
    inference(split_conjunct,[status(thm)],[fact_1427_semiring__norm_I115_J]) ).

fof(c_0_20,plain,
    ! [X13] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X13) = pls,
    inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).

cnf(c_0_21,plain,
    hAPP(int,int,number_number_of(int),X1) = ti(int,X1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_22,plain,
    ti(X1,hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_23,negated_conjecture,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

cnf(c_0_24,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
    inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).

cnf(c_0_25,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),t),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),m),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_18]),c_0_17]),c_0_19]) ).

cnf(c_0_26,plain,
    pls = zero_zero(int),
    inference(split_conjunct,[status(thm)],[fact_123_Pls__def]) ).

cnf(c_0_27,plain,
    hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X1) = pls,
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    one_one(int) = hAPP(int,int,number_number_of(int),hAPP(int,int,bit1,pls)),
    inference(split_conjunct,[status(thm)],[fact_112_one__is__num__one]) ).

cnf(c_0_29,plain,
    hAPP(int,int,number_number_of(int),hAPP(X1,int,X2,X3)) = hAPP(X1,int,X2,X3),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_30,negated_conjecture,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_31,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_18]),c_0_18]),c_0_25]),c_0_17]),c_0_18]),c_0_26]),c_0_18]),c_0_27]) ).

cnf(c_0_32,plain,
    one_one(int) = hAPP(int,int,bit1,pls),
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),pls)),
    inference(rw,[status(thm)],[c_0_30,c_0_26]) ).

cnf(c_0_34,plain,
    hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,bit1,pls)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat)))))),pls)),
    inference(rw,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,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_33,c_0_17]),c_0_32]),c_0_19]),c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM924+8 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jul  7 08:42:54 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.32/24.38  eprover: CPU time limit exceeded, terminating
% 1.32/24.38  eprover: CPU time limit exceeded, terminating
% 1.32/24.38  eprover: CPU time limit exceeded, terminating
% 1.32/24.39  eprover: CPU time limit exceeded, terminating
% 1.45/47.40  eprover: CPU time limit exceeded, terminating
% 1.45/47.41  eprover: CPU time limit exceeded, terminating
% 1.45/47.42  eprover: CPU time limit exceeded, terminating
% 1.45/47.42  eprover: CPU time limit exceeded, terminating
% 1.56/70.42  eprover: CPU time limit exceeded, terminating
% 1.56/70.42  eprover: CPU time limit exceeded, terminating
% 1.56/70.43  eprover: CPU time limit exceeded, terminating
% 1.56/70.44  eprover: CPU time limit exceeded, terminating
% 1.69/93.43  eprover: CPU time limit exceeded, terminating
% 1.69/93.45  eprover: CPU time limit exceeded, terminating
% 1.69/93.45  eprover: CPU time limit exceeded, terminating
% 1.69/93.46  eprover: CPU time limit exceeded, terminating
% 1.81/116.46  eprover: CPU time limit exceeded, terminating
% 1.81/116.47  eprover: CPU time limit exceeded, terminating
% 1.81/116.48  eprover: CPU time limit exceeded, terminating
% 1.81/116.48  eprover: CPU time limit exceeded, terminating
% 1.93/139.47  eprover: CPU time limit exceeded, terminating
% 1.93/139.49  eprover: CPU time limit exceeded, terminating
% 1.93/139.50  eprover: CPU time limit exceeded, terminating
% 1.93/139.50  eprover: CPU time limit exceeded, terminating
% 1.95/142.12  # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 1.95/142.12  
% 1.95/142.12  # Failure: Resource limit exceeded (time)
% 1.95/142.12  # OLD status Res
% 1.95/142.12  # Preprocessing time       : 0.897 s
% 1.95/142.12  # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 1.95/142.12  
% 1.95/142.12  # Failure: Resource limit exceeded (time)
% 1.95/142.12  # OLD status Res
% 1.95/142.12  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 1.95/142.12  # Preprocessing time       : 0.350 s
% 1.95/142.12  # Running protocol protocol_eprover_75515770aeb32f68e33e9fbd9dff93f5a2e34f2e for 23 seconds:
% 1.95/142.12  
% 1.95/142.12  # Failure: Resource limit exceeded (time)
% 1.95/142.12  # OLD status Res
% 1.95/142.12  # Preprocessing time       : 0.871 s
% 1.95/142.12  # Running protocol protocol_eprover_6c565d2524e660970ec2a72c26d577f665a55420 for 23 seconds:
% 1.95/142.12  
% 1.95/142.12  # Failure: Resource limit exceeded (time)
% 1.95/142.12  # OLD status Res
% 1.95/142.12  # Preprocessing time       : 1.941 s
% 1.95/142.12  # Running protocol protocol_eprover_750456fc664a9e0b97096ad0f5110b1ead7d782b for 23 seconds:
% 1.95/142.12  
% 1.95/142.12  # Failure: Resource limit exceeded (time)
% 1.95/142.12  # OLD status Res
% 1.95/142.12  # Preprocessing time       : 0.850 s
% 1.95/142.12  # Running protocol protocol_eprover_a9abcacdf80c460fdc9fe242616d68da2308faf5 for 23 seconds:
% 1.95/142.12  
% 1.95/142.12  # Failure: Resource limit exceeded (time)
% 1.95/142.12  # OLD status Res
% 1.95/142.12  # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,500,1.0)
% 1.95/142.12  # Preprocessing time       : 0.250 s
% 1.95/142.12  # Running protocol protocol_eprover_e60008599937a0dc787316fd87bf9ff4d65ffb48 for 23 seconds:
% 1.95/142.12  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 1.95/142.12  # Preprocessing time       : 0.258 s
% 1.95/142.12  
% 1.95/142.12  # Proof found!
% 1.95/142.12  # SZS status Theorem
% 1.95/142.12  # SZS output start CNFRefutation
% See solution above
% 1.95/142.12  # Proof object total steps             : 36
% 1.95/142.12  # Proof object clause steps            : 18
% 1.95/142.12  # Proof object formula steps           : 18
% 1.95/142.12  # Proof object conjectures             : 6
% 1.95/142.12  # Proof object clause conjectures      : 3
% 1.95/142.12  # Proof object formula conjectures     : 3
% 1.95/142.12  # Proof object initial clauses used    : 11
% 1.95/142.12  # Proof object initial formulas used   : 11
% 1.95/142.12  # Proof object generating inferences   : 1
% 1.95/142.12  # Proof object simplifying inferences  : 22
% 1.95/142.12  # Training examples: 0 positive, 0 negative
% 1.95/142.12  # Parsed axioms                        : 5738
% 1.95/142.12  # Removed by relevancy pruning/SinE    : 4978
% 1.95/142.12  # Initial clauses                      : 1156
% 1.95/142.12  # Removed in clause preprocessing      : 72
% 1.95/142.12  # Initial clauses in saturation        : 1084
% 1.95/142.12  # Processed clauses                    : 3418
% 1.95/142.12  # ...of these trivial                  : 514
% 1.95/142.12  # ...subsumed                          : 1403
% 1.95/142.12  # ...remaining for further processing  : 1500
% 1.95/142.12  # Other redundant clauses eliminated   : 175
% 1.95/142.12  # Clauses deleted for lack of memory   : 0
% 1.95/142.12  # Backward-subsumed                    : 28
% 1.95/142.12  # Backward-rewritten                   : 159
% 1.95/142.12  # Generated clauses                    : 41752
% 1.95/142.12  # ...of the previous two non-trivial   : 32740
% 1.95/142.12  # Contextual simplify-reflections      : 63
% 1.95/142.12  # Paramodulations                      : 41532
% 1.95/142.12  # Factorizations                       : 11
% 1.95/142.12  # Equation resolutions                 : 209
% 1.95/142.12  # Current number of processed clauses  : 1293
% 1.95/142.12  #    Positive orientable unit clauses  : 456
% 1.95/142.12  #    Positive unorientable unit clauses: 13
% 1.95/142.12  #    Negative unit clauses             : 33
% 1.95/142.12  #    Non-unit-clauses                  : 791
% 1.95/142.12  # Current number of unprocessed clauses: 26673
% 1.95/142.12  # ...number of literals in the above   : 77670
% 1.95/142.12  # Current number of archived formulas  : 0
% 1.95/142.12  # Current number of archived clauses   : 187
% 1.95/142.12  # Clause-clause subsumption calls (NU) : 104328
% 1.95/142.12  # Rec. Clause-clause subsumption calls : 58693
% 1.95/142.12  # Non-unit clause-clause subsumptions  : 1220
% 1.95/142.12  # Unit Clause-clause subsumption calls : 8962
% 1.95/142.12  # Rewrite failures with RHS unbound    : 0
% 1.95/142.12  # BW rewrite match attempts            : 132458
% 1.95/142.12  # BW rewrite match successes           : 139
% 1.95/142.12  # Condensation attempts                : 0
% 1.95/142.12  # Condensation successes               : 0
% 1.95/142.12  # Termbank termtop insertions          : 3391156
% 1.95/142.12  
% 1.95/142.12  # -------------------------------------------------
% 1.95/142.12  # User time                : 1.739 s
% 1.95/142.12  # System time              : 0.024 s
% 1.95/142.12  # Total time               : 1.763 s
% 1.95/142.12  # Maximum resident set size: 45480 pages
% 1.95/162.49  eprover: CPU time limit exceeded, terminating
% 1.95/162.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.95/162.50  eprover: No such file or directory
% 1.95/162.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.95/162.51  eprover: No such file or directory
% 1.95/162.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.95/162.51  eprover: No such file or directory
% 1.95/162.51  eprover: CPU time limit exceeded, terminating
% 1.95/162.51  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.95/162.51  eprover: No such file or directory
% 1.95/162.52  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 1.95/162.52  eprover: No such file or directory
% 1.95/162.53  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.53  eprover: No such file or directory
% 1.95/162.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.54  eprover: No such file or directory
% 1.95/162.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.54  eprover: No such file or directory
% 1.95/162.54  eprover: CPU time limit exceeded, terminating
% 1.95/162.54  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.54  eprover: No such file or directory
% 1.95/162.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.55  eprover: No such file or directory
% 1.95/162.55  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.55  eprover: No such file or directory
% 1.95/162.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.56  eprover: No such file or directory
% 1.95/162.56  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.56  eprover: No such file or directory
% 1.95/162.57  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.57  eprover: No such file or directory
% 1.95/162.57  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 1.95/162.57  eprover: No such file or directory
%------------------------------------------------------------------------------