TSTP Solution File: LCL157-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL157-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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:41:22 EDT 2022
% Result : Unsatisfiable 0.70s 1.09s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 4 RR)
% Number of literals : 38 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 50 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(implies(truth,A),A),
file('LCL157-1.p',unknown),
[] ).
cnf(2,plain,
equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
file('LCL157-1.p',unknown),
[] ).
cnf(3,plain,
equal(implies(implies(A,B),B),implies(implies(B,A),A)),
file('LCL157-1.p',unknown),
[] ).
cnf(4,plain,
equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
file('LCL157-1.p',unknown),
[] ).
cnf(5,plain,
equal(or(A,B),implies(not(A),B)),
file('LCL157-1.p',unknown),
[] ).
cnf(6,plain,
equal(implies(not(A),B),or(A,B)),
inference(flip,[status(thm),theory(equality)],[5]),
[iquote('flip(5)')] ).
cnf(8,plain,
equal(or(A,B),or(B,A)),
file('LCL157-1.p',unknown),
[] ).
cnf(9,plain,
equal(not(or(not(A),not(B))),and(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(and_star(A,B),and(A,B)),
inference(demod,[status(thm),theory(equality)],[9]),
[iquote('demod([9])')] ).
cnf(16,plain,
equal(not(truth),falsehood),
file('LCL157-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(and(x,falsehood),falsehood),
inference(demod,[status(thm),theory(equality)],[15]),
[iquote('demod([15])')] ).
cnf(18,plain,
equal(implies(A,implies(implies(A,B),B)),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
[iquote('para(1,2),demod([1])')] ).
cnf(32,plain,
equal(implies(implies(not(A),falsehood),A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),16]),
[iquote('para(1,4),demod([16])')] ).
cnf(33,plain,
equal(or(truth,A),implies(falsehood,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,6]),1]),
[iquote('para(16,6),flip(1)')] ).
cnf(51,plain,
equal(implies(A,A),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,18]),1]),
[iquote('para(1,18),demod([1])')] ).
cnf(56,plain,
equal(or(A,not(A)),truth),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,6]),1]),
[iquote('para(51,6),flip(1)')] ).
cnf(58,plain,
equal(or(A,B),implies(not(B),A)),
inference(para,[status(thm),theory(equality)],[8,5]),
[iquote('para(8,5)')] ).
cnf(65,plain,
equal(not(implies(not(not(A)),not(B))),and(A,B)),
inference(para,[status(thm),theory(equality)],[5,9]),
[iquote('para(5,9)')] ).
cnf(67,plain,
equal(implies(not(not(A)),A),truth),
inference(para,[status(thm),theory(equality)],[58,56]),
[iquote('para(58,56)')] ).
cnf(70,plain,
equal(not(or(falsehood,not(A))),and(truth,A)),
inference(para,[status(thm),theory(equality)],[16,9]),
[iquote('para(16,9)')] ).
cnf(73,plain,
equal(implies(not(A),truth),implies(falsehood,A)),
inference(para,[status(thm),theory(equality)],[58,33]),
[iquote('para(58,33)')] ).
cnf(78,plain,
equal(not(falsehood),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[67,32]),1]),
[iquote('para(67,32),demod([1])')] ).
cnf(79,plain,
equal(or(falsehood,A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[78,6]),1]),1]),
[iquote('para(78,6),demod([1]),flip(1)')] ).
cnf(81,plain,
equal(not(not(A)),and(truth,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),79]),
[iquote('back_demod(70),demod([79])')] ).
cnf(83,plain,
equal(not(implies(and(truth,A),not(B))),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[65]),81]),
[iquote('back_demod(65),demod([81])')] ).
cnf(106,plain,
equal(implies(not(A),falsehood),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[79,58]),1]),
[iquote('para(79,58),flip(1)')] ).
cnf(110,plain,
equal(not(A),implies(and(truth,A),falsehood)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[81,106]),1]),
[iquote('para(81,106),flip(1)')] ).
cnf(114,plain,
equal(implies(implies(and(truth,A),falsehood),falsehood),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[106]),110]),
[iquote('back_demod(106),demod([110])')] ).
cnf(140,plain,
equal(implies(and(truth,implies(and(truth,A),implies(and(truth,B),falsehood))),falsehood),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[83]),110,110]),
[iquote('back_demod(83),demod([110,110])')] ).
cnf(142,plain,
equal(implies(implies(and(truth,A),falsehood),truth),implies(falsehood,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),110]),
[iquote('back_demod(73),demod([110])')] ).
cnf(202,plain,
equal(implies(A,implies(implies(B,A),A)),truth),
inference(para,[status(thm),theory(equality)],[3,18]),
[iquote('para(3,18)')] ).
cnf(207,plain,
equal(implies(A,truth),truth),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,202]),51]),
[iquote('para(1,202),demod([51])')] ).
cnf(210,plain,
equal(implies(falsehood,A),truth),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[142]),207]),1]),
[iquote('back_demod(142),demod([207]),flip(1)')] ).
cnf(323,plain,
equal(implies(implies(A,falsehood),falsehood),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[210,3]),1]),1]),
[iquote('para(210,3),demod([1]),flip(1)')] ).
cnf(325,plain,
equal(and(truth,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[114]),323]),
[iquote('back_demod(114),demod([323])')] ).
cnf(358,plain,
equal(implies(implies(A,implies(B,falsehood)),falsehood),and(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[140]),325,325,325]),
[iquote('back_demod(140),demod([325,325,325])')] ).
cnf(369,plain,
equal(and(A,falsehood),falsehood),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,358]),207,1]),1]),
[iquote('para(51,358),demod([207,1]),flip(1)')] ).
cnf(370,plain,
$false,
inference(conflict,[status(thm)],[369,17]),
[iquote('conflict(369,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL157-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jul 5 00:22:27 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.70/1.09 ----- EQP 0.9e, May 2009 -----
% 0.70/1.09 The job began on n029.cluster.edu, Tue Jul 5 00:22:27 2022
% 0.70/1.09 The command was "./eqp09e".
% 0.70/1.09
% 0.70/1.09 set(prolog_style_variables).
% 0.70/1.09 set(lrpo).
% 0.70/1.09 set(basic_paramod).
% 0.70/1.09 set(functional_subsume).
% 0.70/1.09 set(ordered_paramod).
% 0.70/1.09 set(prime_paramod).
% 0.70/1.09 set(para_pairs).
% 0.70/1.09 assign(pick_given_ratio,4).
% 0.70/1.09 clear(print_kept).
% 0.70/1.09 clear(print_new_demod).
% 0.70/1.09 clear(print_back_demod).
% 0.70/1.09 clear(print_given).
% 0.70/1.09 assign(max_mem,64000).
% 0.70/1.09 end_of_commands.
% 0.70/1.09
% 0.70/1.09 Usable:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Sos:
% 0.70/1.09 0 (wt=-1) [] implies(truth,A) = A.
% 0.70/1.09 0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.09 0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.70/1.09 0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.09 0 (wt=-1) [] or(A,B) = implies(not(A),B).
% 0.70/1.09 0 (wt=-1) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.70/1.09 0 (wt=-1) [] or(A,B) = or(B,A).
% 0.70/1.09 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 0.70/1.09 0 (wt=-1) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.70/1.09 0 (wt=-1) [] and(A,B) = and(B,A).
% 0.70/1.09 0 (wt=-1) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.70/1.09 0 (wt=-1) [] xor(A,B) = xor(B,A).
% 0.70/1.09 0 (wt=-1) [] and_star(A,B) = not(or(not(A),not(B))).
% 0.70/1.09 0 (wt=-1) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.70/1.09 0 (wt=-1) [] and_star(A,B) = and_star(B,A).
% 0.70/1.09 0 (wt=-1) [] not(truth) = falsehood.
% 0.70/1.09 0 (wt=-1) [] -(and_star(x,falsehood) = falsehood).
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Demodulators:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Passive:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Starting to process input.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.70/1.09 1 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.09 2 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.70/1.09 clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.09 4 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.70/1.09 clause forward subsumed: 0 (wt=8) [flip(6)] or(A,B) = implies(not(A),B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.70/1.09 7 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 8 (wt=7) [] or(A,B) = or(B,A).
% 0.70/1.09 clause forward subsumed: 0 (wt=7) [flip(8)] or(B,A) = or(A,B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.70/1.09 9 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.70/1.09 10 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 11 (wt=7) [] and(A,B) = and(B,A).
% 0.70/1.09 clause forward subsumed: 0 (wt=7) [flip(11)] and(B,A) = and(A,B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.70/1.09 clause forward subsumed: 0 (wt=13) [flip(13)] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.70/1.09 clause forward subsumed: 0 (wt=7) [flip(14)] xor(B,A) = xor(A,B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.70/1.09 15 is a new demodulator.
% 0.70/1.09 clause forward subsumed: 0 (wt=11) [demod([15,15,10,15,15])] and(A,and(B,C)) = and(A,and(B,C)).
% 0.70/1.09 clause forward subsumed: 0 (wt=7) [demod([15,15])] and(A,B) = and(B,A).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 16 (wt=4) [] not(truth) = falsehood.
% 0.70/1.09 16 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 17 (wt=5) [demod([15])] -(and(x,falsehood) = falsehood).
% 0.70/1.09 ---------------- PROOF FOUND ----------------
% 0.70/1.09 % SZS status Unsatisfiable
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 After processing input:
% 0.70/1.09
% 0.70/1.09 Usable:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Sos:
% 0.70/1.09 16 (wt=4) [] not(truth) = falsehood.
% 0.70/1.09 1 (wt=5) [] implies(truth,A) = A.
% 0.70/1.09 17 (wt=5) [demod([15])] -(and(x,falsehood) = falsehood).
% 0.70/1.09 8 (wt=7) [] or(A,B) = or(B,A).
% 0.70/1.09 11 (wt=7) [] and(A,B) = and(B,A).
% 0.70/1.09 14 (wt=7) [] xor(A,B) = xor(B,A).
% 0.70/1.09 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.70/1.09 5 (wt=8) [] or(A,B) = implies(not(A),B).
% 0.70/1.09 6 (wt=8) [flip(5)] implies(not(A),B) = or(A,B).
% 0.70/1.09 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.70/1.09 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.70/1.09 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.09 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.70/1.09 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.70/1.09 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.09 12 (wt=13) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.70/1.09 13 (wt=13) [flip(12)] or(and(A,not(B)),and(not(A),B)) = xor(A,B).
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Demodulators:
% 0.70/1.09 1 (wt=5) [] implies(truth,A) = A.
% 0.70/1.09 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.09 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.09 7 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.70/1.09 9 (wt=10) [flip(1)] not(or(not(A),not(B))) = and(A,B).
% 0.70/1.09 10 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.70/1.09 15 (wt=7) [demod([9])] and_star(A,B) = and(A,B).
% 0.70/1.09 16 (wt=4) [] not(truth) = falsehood.
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Passive:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 UNIT CONFLICT from 369 and 17 at 0.03 seconds.
% 0.70/1.09
% 0.70/1.09 ---------------- PROOF ----------------
% 0.70/1.09 % SZS output start Refutation
% See solution above
% 0.70/1.09 ------------ end of proof -------------
% 0.70/1.09
% 0.70/1.09
% 0.70/1.09 ------------- memory usage ------------
% 0.70/1.09 Memory dynamically allocated (tp_alloc): 976.
% 0.70/1.09 type (bytes each) gets frees in use avail bytes
% 0.70/1.09 sym_ent ( 96) 60 0 60 0 5.6 K
% 0.70/1.09 term ( 16) 29219 21740 7479 21 145.0 K
% 0.70/1.09 gen_ptr ( 8) 42629 9177 33452 37 261.6 K
% 0.70/1.09 context ( 808) 22935 22933 2 3 3.9 K
% 0.70/1.09 trail ( 12) 2599 2599 0 6 0.1 K
% 0.70/1.09 bt_node ( 68) 6771 6768 3 14 1.1 K
% 0.70/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.09 ac_match_free_vars_pos (4020)
% 0.70/1.09 0 0 0 0 0.0 K
% 0.70/1.09 discrim ( 12) 7322 3490 3832 475 50.5 K
% 0.70/1.09 flat ( 40) 58199 58199 0 59 2.3 K
% 0.70/1.09 discrim_pos ( 12) 1537 1537 0 1 0.0 K
% 0.70/1.09 fpa_head ( 12) 2383 0 2383 0 27.9 K
% 0.70/1.09 fpa_tree ( 28) 1542 1542 0 19 0.5 K
% 0.70/1.09 fpa_pos ( 36) 633 633 0 1 0.0 K
% 0.70/1.09 literal ( 12) 1436 1067 369 1 4.3 K
% 0.70/1.09 clause ( 24) 1436 1067 369 1 8.7 K
% 0.70/1.09 list ( 12) 323 267 56 4 0.7 K
% 0.70/1.09 list_pos ( 20) 1837 1005 832 26 16.8 K
% 0.70/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.09
% 0.70/1.09 -------------- statistics -------------
% 0.70/1.09 Clauses input 17
% 0.70/1.09 Usable input 0
% 0.70/1.09 Sos input 17
% 0.70/1.09 Demodulators input 0
% 0.70/1.09 Passive input 0
% 0.70/1.09
% 0.70/1.09 Processed BS (before search) 25
% 0.70/1.09 Forward subsumed BS 8
% 0.70/1.09 Kept BS 17
% 0.70/1.09 New demodulators BS 8
% 0.70/1.09 Back demodulated BS 0
% 0.70/1.09
% 0.70/1.09 Clauses or pairs given 1143
% 0.70/1.09 Clauses generated 915
% 0.70/1.09 Forward subsumed 563
% 0.70/1.09 Deleted by weight 0
% 0.70/1.09 Deleted by variable count 0
% 0.70/1.09 Kept 352
% 0.70/1.09 New demodulators 256
% 0.70/1.09 Back demodulated 203
% 0.70/1.09 Ordered paramod prunes 0
% 0.70/1.09 Basic paramod prunes 1423
% 0.70/1.09 Prime paramod prunes 49
% 0.70/1.09 Semantic prunes 0
% 0.70/1.09
% 0.70/1.09 Rewrite attmepts 12720
% 0.70/1.09 Rewrites 1371
% 0.70/1.09
% 0.70/1.09 FPA overloads 0
% 0.70/1.09 FPA underloads 0
% 0.70/1.09
% 0.70/1.09 Usable size 0
% 0.70/1.09 Sos size 165
% 0.70/1.09 Demodulators size 134
% 0.70/1.09 Passive size 0
% 0.70/1.09 Disabled size 203
% 0.70/1.09
% 0.70/1.09 Proofs found 1
% 0.70/1.09
% 0.70/1.09 ----------- times (seconds) ----------- Tue Jul 5 00:22:27 2022
% 0.70/1.09
% 0.70/1.09 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.70/1.09 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.70/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.09 input time 0.00
% 0.70/1.09 paramodulation time 0.00
% 0.70/1.09 demodulation time 0.01
% 0.70/1.09 orient time 0.00
% 0.70/1.09 weigh time 0.00
% 0.70/1.09 forward subsume time 0.00
% 0.70/1.09 back demod find time 0.00
% 0.70/1.09 conflict time 0.00
% 0.70/1.09 LRPO time 0.00
% 0.70/1.09 store clause time 0.00
% 0.70/1.09 disable clause time 0.00
% 0.70/1.09 prime paramod time 0.00
% 0.70/1.09 semantics time 0.00
% 0.70/1.09
% 0.70/1.09 EQP interrupted
%------------------------------------------------------------------------------