TSTP Solution File: LCL026-10 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : LCL026-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n008.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 : Sun Jul 17 09:40:32 EDT 2022

% Result   : Unsatisfiable 5.68s 8.53s
% Output   : Refutation 5.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   43 (  43 unt;   0 nHn;   2 RR)
%            Number of literals    :   43 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-4 aty)
%            Number of variables   :  107 (  31 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(ifeq(A,A,B,C),B),
    file('LCL026-10.p',unknown),
    [] ).

cnf(2,plain,
    equal(ifeq(is_a_theorem(implies(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true),true),
    file('LCL026-10.p',unknown),
    [] ).

cnf(3,plain,
    equal(is_a_theorem(implies(A,implies(B,A))),true),
    file('LCL026-10.p',unknown),
    [] ).

cnf(4,plain,
    equal(is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)),true),
    file('LCL026-10.p',unknown),
    [] ).

cnf(5,plain,
    equal(is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))),true),
    file('LCL026-10.p',unknown),
    [] ).

cnf(6,plain,
    ~ equal(is_a_theorem(implies(implies(implies(a,b),a),a)),true),
    file('LCL026-10.p',unknown),
    [] ).

cnf(7,plain,
    equal(ifeq(is_a_theorem(A),true,is_a_theorem(implies(B,A)),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
    [iquote('para(3,2),demod([1])')] ).

cnf(8,plain,
    equal(ifeq(is_a_theorem(implies(implies(A,implies(B,A)),C)),true,is_a_theorem(C),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
    [iquote('para(3,2),demod([1])')] ).

cnf(13,plain,
    equal(is_a_theorem(implies(A,implies(B,implies(C,B)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,7]),1]),
    [iquote('para(3,7),demod([1])')] ).

cnf(15,plain,
    equal(ifeq(is_a_theorem(implies(A,implies(B,C))),true,is_a_theorem(implies(implies(A,B),implies(A,C))),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,2]),1]),
    [iquote('para(5,2),demod([1])')] ).

cnf(17,plain,
    equal(is_a_theorem(implies(A,implies(implies(implies(B,falsehood),falsehood),B))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,7]),1]),
    [iquote('para(4,7),demod([1])')] ).

cnf(19,plain,
    equal(is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,7]),1]),
    [iquote('para(5,7),demod([1])')] ).

cnf(23,plain,
    equal(is_a_theorem(implies(implies(A,B),implies(A,A))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,8]),1]),
    [iquote('para(5,8),demod([1])')] ).

cnf(31,plain,
    equal(ifeq(is_a_theorem(implies(implies(A,implies(B,implies(C,B))),D)),true,is_a_theorem(D),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,2]),1]),
    [iquote('para(13,2),demod([1])')] ).

cnf(34,plain,
    equal(is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,15]),1]),
    [iquote('para(5,15),demod([1])')] ).

cnf(44,plain,
    equal(is_a_theorem(implies(A,A)),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,8]),1]),
    [iquote('para(23,8),demod([1])')] ).

cnf(45,plain,
    equal(is_a_theorem(implies(implies(A,implies(implies(B,falsehood),falsehood)),implies(A,B))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,15]),1]),
    [iquote('para(17,15),demod([1])')] ).

cnf(54,plain,
    equal(is_a_theorem(implies(implies(A,implies(B,implies(C,D))),implies(A,implies(implies(B,C),implies(B,D))))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,15]),1]),
    [iquote('para(19,15),demod([1])')] ).

cnf(61,plain,
    equal(is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,15]),1]),
    [iquote('para(44,15),demod([1])')] ).

cnf(62,plain,
    equal(is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(implies(B,C),C)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,7]),1]),
    [iquote('para(61,7),demod([1])')] ).

cnf(83,plain,
    equal(is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,31]),1]),
    [iquote('para(34,31),demod([1])')] ).

cnf(93,plain,
    equal(is_a_theorem(implies(A,implies(implies(B,implies(implies(C,B),D)),implies(B,D)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[83,7]),1]),
    [iquote('para(83,7),demod([1])')] ).

cnf(120,plain,
    equal(ifeq(is_a_theorem(implies(A,implies(implies(B,falsehood),falsehood))),true,is_a_theorem(implies(A,B)),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,2]),1]),
    [iquote('para(45,2),demod([1])')] ).

cnf(122,plain,
    equal(is_a_theorem(implies(falsehood,A)),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,120]),1]),
    [iquote('para(3,120),demod([1])')] ).

cnf(124,plain,
    equal(is_a_theorem(implies(A,implies(falsehood,B))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[122,7]),1]),
    [iquote('para(122,7),demod([1])')] ).

cnf(145,plain,
    equal(is_a_theorem(implies(implies(A,falsehood),implies(A,B))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[124,15]),1]),
    [iquote('para(124,15),demod([1])')] ).

cnf(146,plain,
    equal(is_a_theorem(implies(A,implies(implies(B,falsehood),implies(B,C)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,7]),1]),
    [iquote('para(145,7),demod([1])')] ).

cnf(151,plain,
    equal(is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[54,8]),1]),
    [iquote('para(54,8),demod([1])')] ).

cnf(205,plain,
    equal(ifeq(is_a_theorem(implies(implies(A,implies(implies(implies(B,C),B),implies(implies(B,C),C))),D)),true,is_a_theorem(D),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[62,2]),1]),
    [iquote('para(62,2),demod([1])')] ).

cnf(409,plain,
    equal(ifeq(is_a_theorem(implies(A,implies(implies(B,A),C))),true,is_a_theorem(implies(A,C)),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[83,2]),1]),
    [iquote('para(83,2),demod([1])')] ).

cnf(768,plain,
    equal(is_a_theorem(implies(implies(implies(A,falsehood),A),A)),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,120]),1]),
    [iquote('para(61,120),demod([1])')] ).

cnf(780,plain,
    equal(ifeq(is_a_theorem(implies(implies(A,falsehood),A)),true,is_a_theorem(A),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[768,2]),1]),
    [iquote('para(768,2),demod([1])')] ).

cnf(1034,plain,
    equal(is_a_theorem(implies(implies(A,implies(B,falsehood)),implies(A,implies(B,C)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[146,15]),1]),
    [iquote('para(146,15),demod([1])')] ).

cnf(1116,plain,
    equal(ifeq(is_a_theorem(implies(A,B)),true,is_a_theorem(implies(implies(C,A),implies(C,B))),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[151,2]),1]),
    [iquote('para(151,2),demod([1])')] ).

cnf(1631,plain,
    equal(is_a_theorem(implies(A,implies(implies(A,B),B))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[83,205]),1]),
    [iquote('para(83,205),demod([1])')] ).

cnf(1784,plain,
    equal(is_a_theorem(implies(implies(A,B),implies(A,implies(implies(B,C),C)))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1631,1116]),1]),
    [iquote('para(1631,1116),demod([1])')] ).

cnf(2538,plain,
    equal(ifeq(is_a_theorem(implies(A,implies(B,falsehood))),true,is_a_theorem(implies(A,implies(B,C))),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1034,2]),1]),
    [iquote('para(1034,2),demod([1])')] ).

cnf(3757,plain,
    equal(ifeq(is_a_theorem(implies(A,B)),true,is_a_theorem(implies(A,implies(implies(B,C),C))),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1784,2]),1]),
    [iquote('para(1784,2),demod([1])')] ).

cnf(6737,plain,
    equal(is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[93,409]),1]),
    [iquote('para(93,409),demod([1])')] ).

cnf(6912,plain,
    equal(is_a_theorem(implies(implies(implies(A,B),falsehood),implies(B,C))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6737,2538]),1]),
    [iquote('para(6737,2538),demod([1])')] ).

cnf(7078,plain,
    equal(is_a_theorem(implies(implies(implies(A,B),falsehood),implies(implies(implies(B,C),D),D))),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6912,3757]),1]),
    [iquote('para(6912,3757),demod([1])')] ).

cnf(7081,plain,
    equal(is_a_theorem(implies(implies(implies(A,B),A),A)),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7078,780]),1]),
    [iquote('para(7078,780),demod([1])')] ).

cnf(7082,plain,
    $false,
    inference(conflict,[status(thm)],[7081,6]),
    [iquote('conflict(7081,6)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.66  % Problem  : LCL026-10 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.66  % Command  : tptp2X_and_run_eqp %s
% 0.13/0.87  % Computer : n008.cluster.edu
% 0.13/0.87  % Model    : x86_64 x86_64
% 0.13/0.87  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.87  % Memory   : 8042.1875MB
% 0.13/0.87  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.87  % CPULimit : 300
% 0.13/0.87  % WCLimit  : 600
% 0.13/0.87  % DateTime : Mon Jul  4 13:53:01 EDT 2022
% 0.13/0.88  % CPUTime  : 
% 5.68/8.53  ----- EQP 0.9e, May 2009 -----
% 5.68/8.53  The job began on n008.cluster.edu, Mon Jul  4 13:53:04 2022
% 5.68/8.53  The command was "./eqp09e".
% 5.68/8.53  
% 5.68/8.53  set(prolog_style_variables).
% 5.68/8.53  set(lrpo).
% 5.68/8.53  set(basic_paramod).
% 5.68/8.53  set(functional_subsume).
% 5.68/8.53  set(ordered_paramod).
% 5.68/8.53  set(prime_paramod).
% 5.68/8.53  set(para_pairs).
% 5.68/8.53  assign(pick_given_ratio,4).
% 5.68/8.53  clear(print_kept).
% 5.68/8.53  clear(print_new_demod).
% 5.68/8.53  clear(print_back_demod).
% 5.68/8.53  clear(print_given).
% 5.68/8.53  assign(max_mem,64000).
% 5.68/8.53  end_of_commands.
% 5.68/8.53  
% 5.68/8.53  Usable:
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Sos:
% 5.68/8.53  0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 5.68/8.53  0 (wt=-1) [] ifeq(is_a_theorem(implies(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true) = true.
% 5.68/8.53  0 (wt=-1) [] is_a_theorem(implies(A,implies(B,A))) = true.
% 5.68/8.53  0 (wt=-1) [] is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)) = true.
% 5.68/8.53  0 (wt=-1) [] is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) = true.
% 5.68/8.53  0 (wt=-1) [] -(is_a_theorem(implies(implies(implies(a,b),a),a)) = true).
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Demodulators:
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Passive:
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Starting to process input.
% 5.68/8.53  
% 5.68/8.53  ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 5.68/8.53  1 is a new demodulator.
% 5.68/8.53  
% 5.68/8.53  ** KEPT: 2 (wt=16) [] ifeq(is_a_theorem(implies(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true) = true.
% 5.68/8.53  2 is a new demodulator.
% 5.68/8.53  
% 5.68/8.53  ** KEPT: 3 (wt=8) [] is_a_theorem(implies(A,implies(B,A))) = true.
% 5.68/8.53  3 is a new demodulator.
% 5.68/8.53  
% 5.68/8.53  ** KEPT: 4 (wt=10) [] is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)) = true.
% 5.68/8.53  4 is a new demodulator.
% 5.68/8.53  
% 5.68/8.53  ** KEPT: 5 (wt=16) [] is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) = true.
% 5.68/8.53  5 is a new demodulator.
% 5.68/8.53  
% 5.68/8.53  ** KEPT: 6 (wt=10) [] -(is_a_theorem(implies(implies(implies(a,b),a),a)) = true).
% 5.68/8.53  ---------------- PROOF FOUND ----------------
% 5.68/8.53  % SZS status Unsatisfiable
% 5.68/8.53  
% 5.68/8.53  
% 5.68/8.53  After processing input:
% 5.68/8.53  
% 5.68/8.53  Usable:
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Sos:
% 5.68/8.53  1 (wt=7) [] ifeq(A,A,B,C) = B.
% 5.68/8.53  3 (wt=8) [] is_a_theorem(implies(A,implies(B,A))) = true.
% 5.68/8.53  4 (wt=10) [] is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)) = true.
% 5.68/8.53  6 (wt=10) [] -(is_a_theorem(implies(implies(implies(a,b),a),a)) = true).
% 5.68/8.53  2 (wt=16) [] ifeq(is_a_theorem(implies(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true) = true.
% 5.68/8.53  5 (wt=16) [] is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) = true.
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Demodulators:
% 5.68/8.53  1 (wt=7) [] ifeq(A,A,B,C) = B.
% 5.68/8.53  2 (wt=16) [] ifeq(is_a_theorem(implies(A,B)),true,ifeq(is_a_theorem(A),true,is_a_theorem(B),true),true) = true.
% 5.68/8.53  3 (wt=8) [] is_a_theorem(implies(A,implies(B,A))) = true.
% 5.68/8.53  4 (wt=10) [] is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)) = true.
% 5.68/8.53  5 (wt=16) [] is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))) = true.
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  Passive:
% 5.68/8.53  end_of_list.
% 5.68/8.53  
% 5.68/8.53  UNIT CONFLICT from 7081 and 6 at   2.04 seconds.
% 5.68/8.53  
% 5.68/8.53  ---------------- PROOF ----------------
% 5.68/8.53  % SZS output start Refutation
% See solution above
% 5.68/8.53  ------------ end of proof -------------
% 5.68/8.53  
% 5.68/8.53  
% 5.68/8.53  ------------- memory usage ------------
% 5.68/8.53  Memory dynamically allocated (tp_alloc): 12695.
% 5.68/8.53    type (bytes each)        gets      frees     in use      avail      bytes
% 5.68/8.53  sym_ent (  96)               61          0         61          0      5.7 K
% 5.68/8.53  term (  16)             7914334    7762709     151625         47   2934.7 K
% 5.68/8.53  gen_ptr (   8)          1905609     994240     911369         42   7120.4 K
% 5.68/8.53  context ( 808)         12908568   12908566          2          2      3.2 K
% 5.68/8.53  trail (  12)             214475     214475          0         11      0.1 K
% 5.68/8.53  bt_node (  68)          5828163    5828155          8         50      3.9 K
% 5.68/8.53  ac_position (285432)          0          0          0          0      0.0 K
% 5.68/8.53  ac_match_pos (14044)          0          0          0          0      0.0 K
% 5.68/8.53  ac_match_free_vars_pos (4020)
% 5.68/8.53                                0          0          0          0      0.0 K
% 5.68/8.53  discrim (  12)            88675       1027      87648          0   1027.1 K
% 5.68/8.53  flat (  40)             6078868    6078868          0         80      3.1 K
% 5.68/8.53  discrim_pos (  12)       143787     143787          0          1      0.0 K
% 5.68/8.53  fpa_head (  12)            2676          0       2676          0     31.4 K
% 5.68/8.53  fpa_tree (  28)           38712      38712          0         47      1.3 K
% 5.68/8.53  fpa_pos (  36)            14160      14160          0          1      0.0 K
% 5.68/8.53  literal (  12)           244928     237847       7081          1     83.0 K
% 5.68/8.53  clause (  24)            244928     237847       7081          1    166.0 K
% 5.68/8.53  list (  12)                7138       7082         56          3      0.7 K
% 5.68/8.53  list_pos (  20)           28535        531      28004          0    547.0 K
% 5.68/8.53  pair_index (   40)              2          0          2          0      0.1 K
% 5.68/8.53  
% 5.68/8.53  -------------- statistics -------------
% 5.68/8.53  Clauses input                  6
% 5.68/8.53    Usable input                   0
% 5.68/8.53    Sos input                      6
% 5.68/8.53    Demodulators input             0
% 5.68/8.53    Passive input                  0
% 5.68/8.53  
% 5.68/8.53  Processed BS (before search)   6
% 5.68/8.53  Forward subsumed BS            0
% 5.68/8.53  Kept BS                        6
% 5.68/8.53  New demodulators BS            5
% 5.68/8.53  Back demodulated BS            0
% 5.68/8.53  
% 5.68/8.53  Clauses or pairs given    293093
% 5.68/8.53  Clauses generated         237842
% 5.68/8.53  Forward subsumed          230767
% 5.68/8.53  Deleted by weight              0
% 5.68/8.53  Deleted by variable count      0
% 5.68/8.53  Kept                        7075
% 5.68/8.53  New demodulators            7074
% 5.68/8.53  Back demodulated             105
% 5.68/8.53  Ordered paramod prunes         0
% 5.68/8.53  Basic paramod prunes      134432
% 5.68/8.53  Prime paramod prunes           0
% 5.68/8.53  Semantic prunes                0
% 5.68/8.53  
% 5.68/8.53  Rewrite attmepts         1844648
% 5.68/8.53  Rewrites                  143787
% 5.68/8.53  
% 5.68/8.53  FPA overloads                  0
% 5.68/8.53  FPA underloads                 0
% 5.68/8.53  
% 5.68/8.53  Usable size                    0
% 5.68/8.53  Sos size                    6975
% 5.68/8.53  Demodulators size           6974
% 5.68/8.53  Passive size                   0
% 5.68/8.53  Disabled size                105
% 5.68/8.53  
% 5.68/8.53  Proofs found                   1
% 5.68/8.53  
% 5.68/8.53  ----------- times (seconds) ----------- Mon Jul  4 13:53:09 2022
% 5.68/8.53  
% 5.68/8.53  user CPU time             2.04   (0 hr, 0 min, 2 sec)
% 5.68/8.53  system CPU time           2.93   (0 hr, 0 min, 2 sec)
% 5.68/8.53  wall-clock time           5      (0 hr, 0 min, 5 sec)
% 5.68/8.53  input time                0.00
% 5.68/8.53  paramodulation time       0.70
% 5.68/8.53  demodulation time         0.16
% 5.68/8.53  orient time               0.26
% 5.68/8.53  weigh time                0.05
% 5.68/8.53  forward subsume time      0.07
% 5.68/8.53  back demod find time      0.09
% 5.68/8.53  conflict time             0.01
% 5.68/8.53  LRPO time                 0.10
% 5.68/8.53  store clause time         0.20
% 5.68/8.53  disable clause time       0.00
% 5.68/8.53  prime paramod time        0.19
% 5.68/8.53  semantics time            0.00
% 5.68/8.53  
% 5.68/8.53  EQP interrupted
%------------------------------------------------------------------------------