TSTP Solution File: REL002-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL002-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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 19:15:09 EDT 2022
% Result : Unsatisfiable 0.74s 1.16s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 8 RR)
% Number of literals : 48 ( 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 53 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL002-1.p',unknown),
[] ).
cnf(2,plain,
equal(join(join(A,B),C),join(A,join(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))),A),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(complement(join(complement(A),complement(B))),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(join(meet(A,B),complement(join(complement(A),B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(7,plain,
equal(composition(A,one),A),
file('REL002-1.p',unknown),
[] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL002-1.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL002-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL002-1.p',unknown),
[] ).
cnf(13,plain,
equal(join(A,complement(A)),top),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
equal(meet(A,complement(A)),zero),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
~ equal(join(sk1,top),top),
file('REL002-1.p',unknown),
[] ).
cnf(19,plain,
equal(meet(A,B),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),4]),
[iquote('para(1,4),demod([4])')] ).
cnf(20,plain,
equal(join(complement(A),A),top),
inference(para,[status(thm),theory(equality)],[1,13]),
[iquote('para(1,13)')] ).
cnf(24,plain,
equal(join(meet(A,B),complement(join(B,complement(A)))),A),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(25,plain,
equal(meet(complement(A),A),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,19]),1]),
[iquote('para(14,19),flip(1)')] ).
cnf(28,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(29,plain,
equal(composition(converse(one),converse(A)),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,11]),1]),
[iquote('para(7,11),flip(1)')] ).
cnf(30,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,29]),9]),
[iquote('para(9,29),demod([9])')] ).
cnf(31,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,7]),1]),
[iquote('para(30,7),flip(1)')] ).
cnf(32,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),31]),
[iquote('back_demod(30),demod([31])')] ).
cnf(37,plain,
equal(complement(top),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,4]),14]),
[iquote('para(13,4),demod([14])')] ).
cnf(44,plain,
equal(complement(join(zero,complement(A))),meet(top,A)),
inference(para,[status(thm),theory(equality)],[37,4]),
[iquote('para(37,4)')] ).
cnf(46,plain,
equal(complement(join(zero,zero)),meet(top,top)),
inference(para,[status(thm),theory(equality)],[37,44]),
[iquote('para(37,44)')] ).
cnf(59,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),37]),
[iquote('para(13,5),demod([37])')] ).
cnf(64,plain,
equal(join(zero,meet(A,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,5]),4]),
[iquote('para(14,5),demod([4])')] ).
cnf(103,plain,
equal(join(complement(A),join(A,B)),join(top,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,2]),1]),
[iquote('para(20,2),flip(1)')] ).
cnf(145,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[19,59]),
[iquote('para(19,59)')] ).
cnf(147,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[145,1]),1]),
[iquote('para(145,1),flip(1)')] ).
cnf(148,plain,
equal(join(zero,complement(join(A,complement(complement(A))))),complement(A)),
inference(para,[status(thm),theory(equality)],[25,24]),
[iquote('para(25,24)')] ).
cnf(149,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,28]),147]),1]),
[iquote('para(25,28),demod([147]),flip(1)')] ).
cnf(150,plain,
equal(join(zero,complement(join(A,A))),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[148]),149]),
[iquote('back_demod(148),demod([149])')] ).
cnf(157,plain,
equal(complement(join(zero,A)),meet(top,complement(A))),
inference(para,[status(thm),theory(equality)],[149,44]),
[iquote('para(149,44)')] ).
cnf(160,plain,
equal(meet(top,complement(zero)),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),157]),
[iquote('back_demod(46),demod([157])')] ).
cnf(187,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[149,4]),
[iquote('para(149,4)')] ).
cnf(218,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,12]),32,32]),
[iquote('para(31,12),demod([32,32])')] ).
cnf(229,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[149,218]),149,149]),
[iquote('para(149,218),demod([149,149])')] ).
cnf(230,plain,
equal(join(zero,complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[150]),229]),
[iquote('back_demod(150),demod([229])')] ).
cnf(245,plain,
equal(join(zero,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[149,230]),149]),
[iquote('para(149,230),demod([149])')] ).
cnf(249,plain,
equal(meet(top,complement(A)),complement(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[157]),245]),1]),
[iquote('back_demod(157),demod([245]),flip(1)')] ).
cnf(250,plain,
equal(complement(zero),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[160]),249]),
[iquote('back_demod(160),demod([249])')] ).
cnf(255,plain,
equal(meet(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[64]),245]),
[iquote('back_demod(64),demod([245])')] ).
cnf(256,plain,
equal(complement(zero),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[250]),255]),
[iquote('back_demod(250),demod([255])')] ).
cnf(300,plain,
equal(complement(join(A,top)),meet(complement(A),zero)),
inference(para,[status(thm),theory(equality)],[256,187]),
[iquote('para(256,187)')] ).
cnf(339,plain,
equal(join(A,join(top,meet(complement(A),zero))),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[300,13]),2]),
[iquote('para(300,13),demod([2])')] ).
cnf(372,plain,
equal(join(top,A),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[229,103]),20]),1]),
[iquote('para(229,103),demod([20]),flip(1)')] ).
cnf(374,plain,
equal(join(A,top),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[339]),372]),
[iquote('back_demod(339),demod([372])')] ).
cnf(375,plain,
$false,
inference(conflict,[status(thm)],[374,15]),
[iquote('conflict(374,15)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL002-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 11:36:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.16 ----- EQP 0.9e, May 2009 -----
% 0.74/1.16 The job began on n015.cluster.edu, Fri Jul 8 11:36:21 2022
% 0.74/1.16 The command was "./eqp09e".
% 0.74/1.16
% 0.74/1.16 set(prolog_style_variables).
% 0.74/1.16 set(lrpo).
% 0.74/1.16 set(basic_paramod).
% 0.74/1.16 set(functional_subsume).
% 0.74/1.16 set(ordered_paramod).
% 0.74/1.16 set(prime_paramod).
% 0.74/1.16 set(para_pairs).
% 0.74/1.16 assign(pick_given_ratio,4).
% 0.74/1.16 clear(print_kept).
% 0.74/1.16 clear(print_new_demod).
% 0.74/1.16 clear(print_back_demod).
% 0.74/1.16 clear(print_given).
% 0.74/1.16 assign(max_mem,64000).
% 0.74/1.16 end_of_commands.
% 0.74/1.16
% 0.74/1.16 Usable:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Sos:
% 0.74/1.16 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.74/1.16 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.74/1.16 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.74/1.16 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.74/1.16 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.74/1.16 0 (wt=-1) [] composition(A,one) = A.
% 0.74/1.16 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.74/1.16 0 (wt=-1) [] converse(converse(A)) = A.
% 0.74/1.16 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.74/1.16 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.74/1.16 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.74/1.16 0 (wt=-1) [] top = join(A,complement(A)).
% 0.74/1.16 0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.74/1.16 0 (wt=-1) [] -(join(sk1,top) = top).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Demodulators:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Passive:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Starting to process input.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.74/1.16 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.74/1.16
% 0.74/1.16 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.74/1.16 2 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.74/1.16 3 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.74/1.16 4 is a new demodulator.
% 0.74/1.16 -> 4 back demodulating 3.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.74/1.16 5 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.74/1.16 6 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.74/1.16 7 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.74/1.16 8 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.74/1.16 9 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.74/1.16 10 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.74/1.16 11 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.74/1.16 12 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.74/1.16 13 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.74/1.16 14 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 15 (wt=5) [] -(join(sk1,top) = top).
% 0.74/1.16 ---------------- PROOF FOUND ----------------
% 0.74/1.16 % SZS status Unsatisfiable
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 After processing input:
% 0.74/1.16
% 0.74/1.16 Usable:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Sos:
% 0.74/1.16 7 (wt=5) [] composition(A,one) = A.
% 0.74/1.16 9 (wt=5) [] converse(converse(A)) = A.
% 0.74/1.16 15 (wt=5) [] -(join(sk1,top) = top).
% 0.74/1.16 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.74/1.16 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.74/1.16 1 (wt=7) [] join(A,B) = join(B,A).
% 0.74/1.16 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.74/1.16 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.74/1.16 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.74/1.16 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.74/1.16 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.74/1.16 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.74/1.16 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.74/1.16 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Demodulators:
% 0.74/1.16 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.74/1.16 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.74/1.16 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.74/1.16 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.74/1.16 7 (wt=5) [] composition(A,one) = A.
% 0.74/1.16 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.74/1.16 9 (wt=5) [] converse(converse(A)) = A.
% 0.74/1.16 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.74/1.16 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.74/1.16 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.74/1.16 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.74/1.16 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Passive:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 UNIT CONFLICT from 374 and 15 at 0.02 seconds.
% 0.74/1.16
% 0.74/1.16 ---------------- PROOF ----------------
% 0.74/1.16 % SZS output start Refutation
% See solution above
% 0.74/1.16 ------------ end of proof -------------
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 ------------- memory usage ------------
% 0.74/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.16 type (bytes each) gets frees in use avail bytes
% 0.74/1.16 sym_ent ( 96) 60 0 60 0 5.6 K
% 0.74/1.16 term ( 16) 21118 15960 5158 17 99.6 K
% 0.74/1.16 gen_ptr ( 8) 26558 6458 20100 47 157.4 K
% 0.74/1.16 context ( 808) 32329 32327 2 4 4.7 K
% 0.74/1.16 trail ( 12) 1673 1673 0 5 0.1 K
% 0.74/1.16 bt_node ( 68) 14741 14738 3 12 1.0 K
% 0.74/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.16 ac_match_free_vars_pos (4020)
% 0.74/1.16 0 0 0 0 0.0 K
% 0.74/1.16 discrim ( 12) 4658 1578 3080 232 38.8 K
% 0.74/1.16 flat ( 40) 35071 35071 0 23 0.9 K
% 0.74/1.16 discrim_pos ( 12) 1144 1144 0 1 0.0 K
% 0.74/1.16 fpa_head ( 12) 2090 0 2090 0 24.5 K
% 0.74/1.16 fpa_tree ( 28) 1418 1418 0 17 0.5 K
% 0.74/1.16 fpa_pos ( 36) 696 696 0 1 0.0 K
% 0.74/1.16 literal ( 12) 1383 1009 374 1 4.4 K
% 0.74/1.16 clause ( 24) 1383 1009 374 1 8.8 K
% 0.74/1.16 list ( 12) 381 324 57 3 0.7 K
% 0.74/1.16 list_pos ( 20) 1724 668 1056 23 21.1 K
% 0.74/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.16
% 0.74/1.16 -------------- statistics -------------
% 0.74/1.16 Clauses input 14
% 0.74/1.16 Usable input 0
% 0.74/1.16 Sos input 14
% 0.74/1.16 Demodulators input 0
% 0.74/1.16 Passive input 0
% 0.74/1.16
% 0.74/1.16 Processed BS (before search) 16
% 0.74/1.16 Forward subsumed BS 1
% 0.74/1.16 Kept BS 15
% 0.74/1.16 New demodulators BS 13
% 0.74/1.16 Back demodulated BS 1
% 0.74/1.16
% 0.74/1.16 Clauses or pairs given 3124
% 0.74/1.16 Clauses generated 894
% 0.74/1.16 Forward subsumed 535
% 0.74/1.16 Deleted by weight 0
% 0.74/1.16 Deleted by variable count 0
% 0.74/1.16 Kept 359
% 0.74/1.16 New demodulators 309
% 0.74/1.16 Back demodulated 131
% 0.74/1.16 Ordered paramod prunes 0
% 0.74/1.16 Basic paramod prunes 7323
% 0.74/1.16 Prime paramod prunes 30
% 0.74/1.16 Semantic prunes 0
% 0.74/1.16
% 0.74/1.16 Rewrite attmepts 8737
% 0.74/1.16 Rewrites 1032
% 0.74/1.16
% 0.74/1.16 FPA overloads 0
% 0.74/1.16 FPA underloads 0
% 0.74/1.16
% 0.74/1.16 Usable size 0
% 0.74/1.16 Sos size 241
% 0.74/1.16 Demodulators size 196
% 0.74/1.16 Passive size 0
% 0.74/1.16 Disabled size 132
% 0.74/1.16
% 0.74/1.16 Proofs found 1
% 0.74/1.16
% 0.74/1.16 ----------- times (seconds) ----------- Fri Jul 8 11:36:21 2022
% 0.74/1.16
% 0.74/1.16 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.74/1.16 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.74/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.16 input time 0.00
% 0.74/1.16 paramodulation time 0.00
% 0.74/1.16 demodulation time 0.00
% 0.74/1.16 orient time 0.00
% 0.74/1.16 weigh time 0.00
% 0.74/1.16 forward subsume time 0.00
% 0.74/1.16 back demod find time 0.00
% 0.74/1.16 conflict time 0.00
% 0.74/1.16 LRPO time 0.00
% 0.74/1.16 store clause time 0.00
% 0.74/1.16 disable clause time 0.00
% 0.74/1.16 prime paramod time 0.00
% 0.74/1.16 semantics time 0.00
% 0.74/1.16
% 0.74/1.16 EQP interrupted
%------------------------------------------------------------------------------