TSTP Solution File: ANA023-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ANA023-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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 : Thu Jul 14 18:50:45 EDT 2022
% Result : Unsatisfiable 0.74s 1.10s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 12 RR)
% Number of literals : 25 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-4 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('ANA023-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('ANA023-10.p',unknown),
[] ).
cnf(3,plain,
equal(ifeq2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B),B),
file('ANA023-10.p',unknown),
[] ).
cnf(4,plain,
equal(ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(B,c_minus(C,D,A),A),true,c_lessequals(c_plus(B,D,A),C,A),true),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(5,plain,
equal(ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(c_plus(B,C,A),D,A),true,c_lessequals(B,c_minus(D,C,A),A),true),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(6,plain,
equal(ifeq(class_Orderings_Oorder(A),true,ifeq(c_lessequals(B,C,A),true,ifeq(c_lessequals(C,D,A),true,c_lessequals(B,D,A),true),true),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(7,plain,
equal(c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b),true),
file('ANA023-10.p',unknown),
[] ).
cnf(8,plain,
equal(c_lessequals(v_k(v_x),v_f(v_x),t_b),true),
file('ANA023-10.p',unknown),
[] ).
cnf(9,plain,
~ equal(c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),true),
file('ANA023-10.p',unknown),
[] ).
cnf(10,plain,
equal(ifeq(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(11,plain,
equal(ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(12,plain,
equal(ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(13,plain,
equal(ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true),true),
file('ANA023-10.p',unknown),
[] ).
cnf(14,plain,
equal(class_Ring__and__Field_Oordered__idom(t_b),true),
file('ANA023-10.p',unknown),
[] ).
cnf(15,plain,
equal(class_OrderedGroup_Ocomm__monoid__add(t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,11]),2]),
[iquote('para(14,11),demod([2])')] ).
cnf(16,plain,
equal(class_Orderings_Olinorder(t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,12]),2]),
[iquote('para(14,12),demod([2])')] ).
cnf(17,plain,
equal(class_OrderedGroup_Opordered__ab__group__add(t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,13]),2]),
[iquote('para(14,13),demod([2])')] ).
cnf(18,plain,
equal(class_Orderings_Oorder(t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,10]),2]),
[iquote('para(16,10),demod([2])')] ).
cnf(19,plain,
equal(c_plus(c_0,A,t_b),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,3]),1]),
[iquote('para(15,3),demod([1])')] ).
cnf(20,plain,
equal(c_lessequals(v_g(v_x),v_k(v_x),t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,4]),17,19,2,2]),
[iquote('para(7,4),demod([17,19,2,2])')] ).
cnf(25,plain,
equal(ifeq(c_lessequals(A,v_k(v_x),t_b),true,c_lessequals(A,v_f(v_x),t_b),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,6]),18,2,2]),
[iquote('para(8,6),demod([18,2,2])')] ).
cnf(29,plain,
equal(c_lessequals(v_g(v_x),v_f(v_x),t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,25]),2]),
[iquote('para(20,25),demod([2])')] ).
cnf(34,plain,
equal(ifeq(c_lessequals(A,B,t_b),true,c_lessequals(c_0,c_minus(B,A,t_b),t_b),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,5]),17,2]),
[iquote('para(19,5),demod([17,2])')] ).
cnf(44,plain,
equal(c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,34]),2]),
[iquote('para(29,34),demod([2])')] ).
cnf(45,plain,
$false,
inference(conflict,[status(thm)],[44,9]),
[iquote('conflict(44,9)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ANA023-10 : TPTP v8.1.0. Released v7.5.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n016.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 : Fri Jul 8 05:57:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.10 ----- EQP 0.9e, May 2009 -----
% 0.74/1.10 The job began on n016.cluster.edu, Fri Jul 8 05:57:08 2022
% 0.74/1.10 The command was "./eqp09e".
% 0.74/1.10
% 0.74/1.10 set(prolog_style_variables).
% 0.74/1.10 set(lrpo).
% 0.74/1.10 set(basic_paramod).
% 0.74/1.10 set(functional_subsume).
% 0.74/1.10 set(ordered_paramod).
% 0.74/1.10 set(prime_paramod).
% 0.74/1.10 set(para_pairs).
% 0.74/1.10 assign(pick_given_ratio,4).
% 0.74/1.10 clear(print_kept).
% 0.74/1.10 clear(print_new_demod).
% 0.74/1.10 clear(print_back_demod).
% 0.74/1.10 clear(print_given).
% 0.74/1.10 assign(max_mem,64000).
% 0.74/1.10 end_of_commands.
% 0.74/1.10
% 0.74/1.10 Usable:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Sos:
% 0.74/1.10 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.74/1.10 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.74/1.10 0 (wt=-1) [] ifeq2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B) = B.
% 0.74/1.10 0 (wt=-1) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(B,c_minus(C,D,A),A),true,c_lessequals(c_plus(B,D,A),C,A),true),true) = true.
% 0.74/1.10 0 (wt=-1) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(c_plus(B,C,A),D,A),true,c_lessequals(B,c_minus(D,C,A),A),true),true) = true.
% 0.74/1.10 0 (wt=-1) [] ifeq(class_Orderings_Oorder(A),true,ifeq(c_lessequals(B,C,A),true,ifeq(c_lessequals(C,D,A),true,c_lessequals(B,D,A),true),true),true) = true.
% 0.74/1.10 0 (wt=-1) [] c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true.
% 0.74/1.10 0 (wt=-1) [] c_lessequals(v_k(v_x),v_f(v_x),t_b) = true.
% 0.74/1.10 0 (wt=-1) [] -(c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) = true).
% 0.74/1.10 0 (wt=-1) [] ifeq(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true) = true.
% 0.74/1.10 0 (wt=-1) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true) = true.
% 0.74/1.10 0 (wt=-1) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true) = true.
% 0.74/1.10 0 (wt=-1) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true) = true.
% 0.74/1.10 0 (wt=-1) [] class_Ring__and__Field_Oordered__idom(t_b) = true.
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Demodulators:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Passive:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Starting to process input.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.74/1.10 1 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.74/1.10 2 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 3 (wt=11) [] ifeq2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B) = B.
% 0.74/1.10 3 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 4 (wt=24) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(B,c_minus(C,D,A),A),true,c_lessequals(c_plus(B,D,A),C,A),true),true) = true.
% 0.74/1.10 4 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 5 (wt=24) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(c_plus(B,C,A),D,A),true,c_lessequals(B,c_minus(D,C,A),A),true),true) = true.
% 0.74/1.10 5 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 6 (wt=25) [] ifeq(class_Orderings_Oorder(A),true,ifeq(c_lessequals(B,C,A),true,ifeq(c_lessequals(C,D,A),true,c_lessequals(B,D,A),true),true),true) = true.
% 0.74/1.10 6 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 7 (wt=11) [] c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true.
% 0.74/1.10 7 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 8 (wt=8) [] c_lessequals(v_k(v_x),v_f(v_x),t_b) = true.
% 0.74/1.10 8 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 9 (wt=11) [] -(c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) = true).
% 0.74/1.10
% 0.74/1.10 ** KEPT: 10 (wt=9) [] ifeq(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true) = true.
% 0.74/1.10 10 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 11 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true) = true.
% 0.74/1.10 11 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 12 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true) = true.
% 0.74/1.10 12 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 13 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true) = true.
% 0.74/1.10 13 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 14 (wt=4) [] class_Ring__and__Field_Oordered__idom(t_b) = true.
% 0.74/1.10 14 is a new demodulator.
% 0.74/1.10 ---------------- PROOF FOUND ----------------
% 0.74/1.10 % SZS status Unsatisfiable
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 After processing input:
% 0.74/1.10
% 0.74/1.10 Usable:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Sos:
% 0.74/1.10 14 (wt=4) [] class_Ring__and__Field_Oordered__idom(t_b) = true.
% 0.74/1.10 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.74/1.10 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.74/1.10 8 (wt=8) [] c_lessequals(v_k(v_x),v_f(v_x),t_b) = true.
% 0.74/1.10 10 (wt=9) [] ifeq(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true) = true.
% 0.74/1.10 11 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true) = true.
% 0.74/1.10 12 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true) = true.
% 0.74/1.10 13 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true) = true.
% 0.74/1.10 3 (wt=11) [] ifeq2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B) = B.
% 0.74/1.10 7 (wt=11) [] c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true.
% 0.74/1.10 9 (wt=11) [] -(c_lessequals(c_0,c_minus(v_f(v_x),v_g(v_x),t_b),t_b) = true).
% 0.74/1.10 4 (wt=24) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(B,c_minus(C,D,A),A),true,c_lessequals(c_plus(B,D,A),C,A),true),true) = true.
% 0.74/1.10 5 (wt=24) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(c_plus(B,C,A),D,A),true,c_lessequals(B,c_minus(D,C,A),A),true),true) = true.
% 0.74/1.10 6 (wt=25) [] ifeq(class_Orderings_Oorder(A),true,ifeq(c_lessequals(B,C,A),true,ifeq(c_lessequals(C,D,A),true,c_lessequals(B,D,A),true),true),true) = true.
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Demodulators:
% 0.74/1.10 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.74/1.10 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.74/1.10 3 (wt=11) [] ifeq2(class_OrderedGroup_Ocomm__monoid__add(A),true,c_plus(c_0,B,A),B) = B.
% 0.74/1.10 4 (wt=24) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(B,c_minus(C,D,A),A),true,c_lessequals(c_plus(B,D,A),C,A),true),true) = true.
% 0.74/1.10 5 (wt=24) [] ifeq(class_OrderedGroup_Opordered__ab__group__add(A),true,ifeq(c_lessequals(c_plus(B,C,A),D,A),true,c_lessequals(B,c_minus(D,C,A),A),true),true) = true.
% 0.74/1.10 6 (wt=25) [] ifeq(class_Orderings_Oorder(A),true,ifeq(c_lessequals(B,C,A),true,ifeq(c_lessequals(C,D,A),true,c_lessequals(B,D,A),true),true),true) = true.
% 0.74/1.10 7 (wt=11) [] c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b) = true.
% 0.74/1.10 8 (wt=8) [] c_lessequals(v_k(v_x),v_f(v_x),t_b) = true.
% 0.74/1.10 10 (wt=9) [] ifeq(class_Orderings_Olinorder(A),true,class_Orderings_Oorder(A),true) = true.
% 0.74/1.10 11 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Ocomm__monoid__add(A),true) = true.
% 0.74/1.10 12 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_Orderings_Olinorder(A),true) = true.
% 0.74/1.10 13 (wt=9) [] ifeq(class_Ring__and__Field_Oordered__idom(A),true,class_OrderedGroup_Opordered__ab__group__add(A),true) = true.
% 0.74/1.10 14 (wt=4) [] class_Ring__and__Field_Oordered__idom(t_b) = true.
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Passive:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 UNIT CONFLICT from 44 and 9 at 0.01 seconds.
% 0.74/1.10
% 0.74/1.10 ---------------- PROOF ----------------
% 0.74/1.10 % SZS output start Refutation
% See solution above
% 0.74/1.10 ------------ end of proof -------------
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 ------------- memory usage ------------
% 0.74/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.10 type (bytes each) gets frees in use avail bytes
% 0.74/1.10 sym_ent ( 96) 76 0 76 0 7.1 K
% 0.74/1.10 term ( 16) 3115 2541 574 28 11.6 K
% 0.74/1.10 gen_ptr ( 8) 2551 393 2158 24 17.0 K
% 0.74/1.10 context ( 808) 12922 12920 2 2 3.2 K
% 0.74/1.10 trail ( 12) 47 47 0 4 0.0 K
% 0.74/1.10 bt_node ( 68) 7136 7132 4 19 1.5 K
% 0.74/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.10 ac_match_free_vars_pos (4020)
% 0.74/1.10 0 0 0 0 0.0 K
% 0.74/1.10 discrim ( 12) 783 15 768 15 9.2 K
% 0.74/1.10 flat ( 40) 2088 2088 0 18 0.7 K
% 0.74/1.10 discrim_pos ( 12) 75 75 0 1 0.0 K
% 0.74/1.10 fpa_head ( 12) 444 0 444 0 5.2 K
% 0.74/1.10 fpa_tree ( 28) 414 414 0 21 0.6 K
% 0.74/1.10 fpa_pos ( 36) 86 86 0 1 0.0 K
% 0.74/1.10 literal ( 12) 128 84 44 1 0.5 K
% 0.74/1.10 clause ( 24) 128 84 44 1 1.1 K
% 0.74/1.10 list ( 12) 101 45 56 3 0.7 K
% 0.74/1.10 list_pos ( 20) 187 19 168 4 3.4 K
% 0.74/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.10
% 0.74/1.10 -------------- statistics -------------
% 0.74/1.10 Clauses input 14
% 0.74/1.10 Usable input 0
% 0.74/1.10 Sos input 14
% 0.74/1.10 Demodulators input 0
% 0.74/1.10 Passive input 0
% 0.74/1.10
% 0.74/1.10 Processed BS (before search) 14
% 0.74/1.10 Forward subsumed BS 0
% 0.74/1.10 Kept BS 14
% 0.74/1.10 New demodulators BS 13
% 0.74/1.10 Back demodulated BS 0
% 0.74/1.10
% 0.74/1.10 Clauses or pairs given 516
% 0.74/1.10 Clauses generated 71
% 0.74/1.10 Forward subsumed 41
% 0.74/1.10 Deleted by weight 0
% 0.74/1.10 Deleted by variable count 0
% 0.74/1.10 Kept 30
% 0.74/1.10 New demodulators 29
% 0.74/1.10 Back demodulated 1
% 0.74/1.10 Ordered paramod prunes 0
% 0.74/1.10 Basic paramod prunes 281
% 0.74/1.10 Prime paramod prunes 0
% 0.74/1.10 Semantic prunes 0
% 0.74/1.10
% 0.74/1.10 Rewrite attmepts 874
% 0.74/1.10 Rewrites 75
% 0.74/1.10
% 0.74/1.10 FPA overloads 0
% 0.74/1.10 FPA underloads 0
% 0.74/1.10
% 0.74/1.10 Usable size 0
% 0.74/1.10 Sos size 42
% 0.74/1.10 Demodulators size 41
% 0.74/1.10 Passive size 0
% 0.74/1.10 Disabled size 1
% 0.74/1.10
% 0.74/1.10 Proofs found 1
% 0.74/1.10
% 0.74/1.10 ----------- times (seconds) ----------- Fri Jul 8 05:57:08 2022
% 0.74/1.10
% 0.74/1.10 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.10 input time 0.00
% 0.74/1.10 paramodulation time 0.00
% 0.74/1.10 demodulation time 0.00
% 0.74/1.10 orient time 0.00
% 0.74/1.10 weigh time 0.00
% 0.74/1.10 forward subsume time 0.00
% 0.74/1.10 back demod find time 0.00
% 0.74/1.10 conflict time 0.00
% 0.74/1.10 LRPO time 0.00
% 0.74/1.10 store clause time 0.00
% 0.74/1.10 disable clause time 0.00
% 0.74/1.10 prime paramod time 0.00
% 0.74/1.10 semantics time 0.00
% 0.74/1.10
% 0.74/1.10 EQP interrupted
%------------------------------------------------------------------------------