TSTP Solution File: RNG024-7 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG024-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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 20:25:32 EDT 2022
% Result : Unsatisfiable 0.43s 1.11s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 16 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG024-7.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG024-7.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(multiply(A,B),B),multiply(A,multiply(B,B))),
file('RNG024-7.p',unknown),
[] ).
cnf(14,plain,
equal(add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(17,plain,
equal(additive_inverse(multiply(A,B)),multiply(additive_inverse(A),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(19,plain,
equal(add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),17]),
[iquote('back_demod(14),demod([17])')] ).
cnf(24,plain,
~ equal(associator(x,y,y),additive_identity),
file('RNG024-7.p',unknown),
[] ).
cnf(29,plain,
equal(add(multiply(A,B),multiply(additive_inverse(A),B)),additive_identity),
inference(para,[status(thm),theory(equality)],[17,6]),
[iquote('para(17,6)')] ).
cnf(93,plain,
equal(associator(A,B,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,19]),29]),1]),
[iquote('para(12,19),demod([29]),flip(1)')] ).
cnf(94,plain,
$false,
inference(conflict,[status(thm)],[93,24]),
[iquote('conflict(93,24)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG024-7 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 12:49:42 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.09 ----- EQP 0.9e, May 2009 -----
% 0.43/1.09 The job began on n025.cluster.edu, Mon May 30 12:49:43 2022
% 0.43/1.09 The command was "./eqp09e".
% 0.43/1.09
% 0.43/1.09 set(prolog_style_variables).
% 0.43/1.09 set(lrpo).
% 0.43/1.09 set(basic_paramod).
% 0.43/1.09 set(functional_subsume).
% 0.43/1.09 set(ordered_paramod).
% 0.43/1.09 set(prime_paramod).
% 0.43/1.09 set(para_pairs).
% 0.43/1.09 assign(pick_given_ratio,4).
% 0.43/1.09 clear(print_kept).
% 0.43/1.09 clear(print_new_demod).
% 0.43/1.09 clear(print_back_demod).
% 0.43/1.09 clear(print_given).
% 0.43/1.09 assign(max_mem,64000).
% 0.43/1.09 end_of_commands.
% 0.43/1.09
% 0.43/1.09 Usable:
% 0.43/1.09 end_of_list.
% 0.43/1.09
% 0.43/1.09 Sos:
% 0.43/1.09 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.43/1.09 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.43/1.09 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.43/1.09 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.43/1.09 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.43/1.09 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.43/1.09 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.43/1.09 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.09 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.43/1.09 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.43/1.09 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.43/1.10 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.43/1.10 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.43/1.10 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.43/1.10 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.43/1.10 0 (wt=-1) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.43/1.10 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.43/1.10 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.43/1.10 0 (wt=-1) [] multiply(A,add(B,additive_inverse(C))) = add(multiply(A,B),additive_inverse(multiply(A,C))).
% 0.43/1.10 0 (wt=-1) [] multiply(add(A,additive_inverse(B)),C) = add(multiply(A,C),additive_inverse(multiply(B,C))).
% 0.43/1.10 0 (wt=-1) [] multiply(additive_inverse(A),add(B,C)) = add(additive_inverse(multiply(A,B)),additive_inverse(multiply(A,C))).
% 0.43/1.10 0 (wt=-1) [] multiply(add(A,B),additive_inverse(C)) = add(additive_inverse(multiply(A,C)),additive_inverse(multiply(B,C))).
% 0.43/1.10 0 (wt=-1) [] -(associator(x,y,y) = additive_identity).
% 0.43/1.10 end_of_list.
% 0.43/1.10
% 0.43/1.10 Demodulators:
% 0.43/1.10 end_of_list.
% 0.43/1.10
% 0.43/1.10 Passive:
% 0.43/1.10 end_of_list.
% 0.43/1.10
% 0.43/1.10 Starting to process input.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.43/1.10 1 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.43/1.10 2 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.43/1.10 3 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.43/1.10 4 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.43/1.10 5 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.43/1.10 6 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.43/1.10 7 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.10 8 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.43/1.10 9 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.43/1.10 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.43/1.10
% 0.43/1.10 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.43/1.10 11 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.43/1.10 12 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.43/1.10 13 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.43/1.10 14 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.43/1.10 15 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.43/1.10 16 is a new demodulator.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.43/1.10 17 is a new demodulator.
% 0.43/1.10 -> 17 back demodulating 15.
% 0.43/1.10
% 0.43/1.10 ** KEPT: 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.43/1.11 18 is a new demodulator.
% 0.43/1.11 -> 17 back demodulating 14.
% 0.43/1.11
% 0.43/1.11 ** KEPT: 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.43/1.11 19 is a new demodulator.
% 0.43/1.11
% 0.43/1.11 ** KEPT: 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.43/1.11
% 0.43/1.11 ** KEPT: 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.43/1.11 clause forward subsumed: 0 (wt=9) [flip(21)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.43/1.11 clause forward subsumed: 0 (wt=17) [demod([8,17])] add(multiply(A,B),multiply(A,additive_inverse(C))) = add(multiply(A,B),multiply(additive_inverse(A),C)).
% 0.43/1.11 clause forward subsumed: 0 (wt=17) [demod([9,17])] add(multiply(A,C),multiply(additive_inverse(B),C)) = add(multiply(A,C),multiply(additive_inverse(B),C)).
% 0.43/1.11 clause forward subsumed: 0 (wt=19) [demod([8,17,17])] add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)).
% 0.43/1.11
% 0.43/1.11 ** KEPT: 22 (wt=19) [demod([9,17,17])] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.43/1.11
% 0.43/1.11 ** KEPT: 23 (wt=19) [flip(22)] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)) = add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 0.43/1.11 clause forward subsumed: 0 (wt=19) [flip(23)] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.43/1.11
% 0.43/1.11 ** KEPT: 24 (wt=6) [] -(associator(x,y,y) = additive_identity).
% 0.43/1.11 ---------------- PROOF FOUND ----------------
% 0.43/1.11 % SZS status Unsatisfiable
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 After processing input:
% 0.43/1.11
% 0.43/1.11 Usable:
% 0.43/1.11 end_of_list.
% 0.43/1.11
% 0.43/1.11 Sos:
% 0.43/1.11 1 (wt=5) [] add(additive_identity,A) = A.
% 0.43/1.11 2 (wt=5) [] add(A,additive_identity) = A.
% 0.43/1.11 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.43/1.11 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.43/1.11 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.43/1.11 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.43/1.11 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.43/1.11 24 (wt=6) [] -(associator(x,y,y) = additive_identity).
% 0.43/1.11 10 (wt=7) [] add(A,B) = add(B,A).
% 0.43/1.11 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.43/1.11 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.43/1.11 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.43/1.11 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.43/1.11 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.43/1.11 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.43/1.11 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.43/1.11 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.43/1.11 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.11 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.43/1.11 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.43/1.11 22 (wt=19) [demod([9,17,17])] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.43/1.11 23 (wt=19) [flip(22)] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)) = add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 0.43/1.11 end_of_list.
% 0.43/1.11
% 0.43/1.11 Demodulators:
% 0.43/1.11 1 (wt=5) [] add(additive_identity,A) = A.
% 0.43/1.11 2 (wt=5) [] add(A,additive_identity) = A.
% 0.43/1.11 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.43/1.11 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.43/1.11 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.43/1.11 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.43/1.11 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.43/1.11 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.11 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.43/1.11 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.43/1.11 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.43/1.11 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.43/1.11 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.43/1.11 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.43/1.11 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.43/1.11 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.43/1.11 end_of_list.
% 0.43/1.11
% 0.43/1.11 Passive:
% 0.43/1.11 end_of_list.
% 0.43/1.11
% 0.43/1.11 UNIT CONFLICT from 93 and 24 at 0.01 seconds.
% 0.43/1.11
% 0.43/1.11 ---------------- PROOF ----------------
% 0.43/1.11 % SZS output start Refutation
% See solution above
% 0.43/1.11 ------------ end of proof -------------
% 0.43/1.11
% 0.43/1.11
% 0.43/1.11 ------------- memory usage ------------
% 0.43/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.11 type (bytes each) gets frees in use avail bytes
% 0.43/1.11 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.43/1.11 term ( 16) 7640 6273 1367 18 26.7 K
% 0.43/1.11 gen_ptr ( 8) 6639 1555 5084 9 39.8 K
% 0.43/1.11 context ( 808) 5715 5713 2 5 5.5 K
% 0.43/1.11 trail ( 12) 276 276 0 4 0.0 K
% 0.43/1.11 bt_node ( 68) 2130 2125 5 3 0.5 K
% 0.43/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.11 ac_match_free_vars_pos (4020)
% 0.43/1.11 0 0 0 0 0.0 K
% 0.43/1.11 discrim ( 12) 1322 185 1137 0 13.3 K
% 0.43/1.11 flat ( 40) 8980 8980 0 31 1.2 K
% 0.43/1.11 discrim_pos ( 12) 407 407 0 1 0.0 K
% 0.43/1.11 fpa_head ( 12) 605 0 605 0 7.1 K
% 0.43/1.11 fpa_tree ( 28) 204 204 0 11 0.3 K
% 0.43/1.11 fpa_pos ( 36) 162 162 0 1 0.0 K
% 0.43/1.11 literal ( 12) 398 305 93 1 1.1 K
% 0.43/1.11 clause ( 24) 398 305 93 1 2.2 K
% 0.43/1.11 list ( 12) 128 72 56 4 0.7 K
% 0.43/1.11 list_pos ( 20) 394 86 308 0 6.0 K
% 0.43/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.11
% 0.43/1.11 -------------- statistics -------------
% 0.43/1.11 Clauses input 23
% 0.43/1.11 Usable input 0
% 0.43/1.11 Sos input 23
% 0.43/1.11 Demodulators input 0
% 0.43/1.11 Passive input 0
% 0.43/1.11
% 0.43/1.11 Processed BS (before search) 30
% 0.43/1.11 Forward subsumed BS 6
% 0.43/1.11 Kept BS 24
% 0.43/1.11 New demodulators BS 18
% 0.43/1.11 Back demodulated BS 2
% 0.43/1.11
% 0.43/1.11 Clauses or pairs given 510
% 0.43/1.11 Clauses generated 243
% 0.43/1.11 Forward subsumed 174
% 0.43/1.11 Deleted by weight 0
% 0.43/1.11 Deleted by variable count 0
% 0.43/1.11 Kept 69
% 0.43/1.11 New demodulators 51
% 0.43/1.11 Back demodulated 11
% 0.43/1.11 Ordered paramod prunes 0
% 0.43/1.11 Basic paramod prunes 450
% 0.43/1.11 Prime paramod prunes 20
% 0.43/1.11 Semantic prunes 0
% 0.43/1.11
% 0.43/1.11 Rewrite attmepts 2195
% 0.43/1.11 Rewrites 360
% 0.43/1.11
% 0.43/1.11 FPA overloads 0
% 0.43/1.11 FPA underloads 0
% 0.43/1.11
% 0.43/1.11 Usable size 0
% 0.43/1.11 Sos size 79
% 0.43/1.11 Demodulators size 58
% 0.43/1.11 Passive size 0
% 0.43/1.11 Disabled size 13
% 0.43/1.11
% 0.43/1.11 Proofs found 1
% 0.43/1.11
% 0.43/1.11 ----------- times (seconds) ----------- Mon May 30 12:49:43 2022
% 0.43/1.11
% 0.43/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.43/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.43/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.11 input time 0.00
% 0.43/1.11 paramodulation time 0.00
% 0.43/1.11 demodulation time 0.00
% 0.43/1.11 orient time 0.00
% 0.43/1.11 weigh time 0.00
% 0.43/1.11 forward subsume time 0.00
% 0.43/1.11 back demod find time 0.00
% 0.43/1.11 conflict time 0.00
% 0.43/1.11 LRPO time 0.00
% 0.43/1.11 store clause time 0.00
% 0.43/1.11 disable clause time 0.00
% 0.43/1.11 prime paramod time 0.00
% 0.43/1.11 semantics time 0.00
% 0.43/1.11
% 0.43/1.11 EQP interrupted
%------------------------------------------------------------------------------