%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL015-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n003.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:25 EDT 2022
% Result : Unsatisfiable 0.86s 1.22s
% Output : Refutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of clauses : 49 ( 49 unt; 0 nHn; 8 RR)
% Number of literals : 49 ( 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 : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 59 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL015-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('REL015-1.p',unknown),
[] ).
cnf(8,plain,
equal(join(composition(A,B),composition(C,B)),composition(join(A,C),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL015-1.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL015-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL015-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(composition(top,top),top),
file('REL015-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(65,plain,
equal(join(meet(A,A),zero),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,1]),1]),
[iquote('para(64,1),flip(1)')] ).
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(139,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[19,59]),
[iquote('para(19,59)')] ).
cnf(141,plain,
equal(join(meet(A,B),complement(join(A,complement(B)))),B),
inference(para,[status(thm),theory(equality)],[19,24]),
[iquote('para(19,24)')] ).
cnf(146,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[139,1]),1]),
[iquote('para(139,1),flip(1)')] ).
cnf(147,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]),146]),1]),
[iquote('para(25,28),demod([146]),flip(1)')] ).
cnf(150,plain,
equal(complement(join(zero,A)),meet(top,complement(A))),
inference(para,[status(thm),theory(equality)],[147,44]),
[iquote('para(147,44)')] ).
cnf(153,plain,
equal(meet(top,complement(zero)),meet(top,top)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),150]),
[iquote('back_demod(46),demod([150])')] ).
cnf(177,plain,
equal(complement(join(A,complement(B))),meet(complement(A),B)),
inference(para,[status(thm),theory(equality)],[147,4]),
[iquote('para(147,4)')] ).
cnf(178,plain,
equal(join(meet(A,B),meet(complement(A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[141]),177]),
[iquote('back_demod(141),demod([177])')] ).
cnf(202,plain,
equal(join(meet(top,A),meet(zero,A)),A),
inference(para,[status(thm),theory(equality)],[37,178]),
[iquote('para(37,178)')] ).
cnf(212,plain,
equal(complement(zero),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,202]),153,65]),1]),
[iquote('para(14,202),demod([153,65]),flip(1)')] ).
cnf(213,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(217,plain,
equal(join(A,composition(B,A)),composition(join(one,B),A)),
inference(para,[status(thm),theory(equality)],[32,8]),
[iquote('para(32,8)')] ).
cnf(232,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[147,213]),147,147]),
[iquote('para(147,213),demod([147,147])')] ).
cnf(289,plain,
equal(complement(join(A,top)),meet(complement(A),zero)),
inference(para,[status(thm),theory(equality)],[212,177]),
[iquote('para(212,177)')] ).
cnf(327,plain,
equal(join(A,join(top,meet(complement(A),zero))),top),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[289,13]),2]),
[iquote('para(289,13),demod([2])')] ).
cnf(362,plain,
equal(join(top,A),top),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[232,103]),20]),1]),
[iquote('para(232,103),demod([20]),flip(1)')] ).
cnf(364,plain,
equal(join(A,top),top),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[327]),362]),
[iquote('back_demod(327),demod([362])')] ).
cnf(770,plain,
equal(composition(join(one,A),top),top),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[362,217]),1]),
[iquote('para(362,217),flip(1)')] ).
cnf(773,plain,
equal(composition(top,top),top),
inference(para,[status(thm),theory(equality)],[364,770]),
[iquote('para(364,770)')] ).
cnf(774,plain,
$false,
inference(conflict,[status(thm)],[773,15]),
[iquote('conflict(773,15)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL015-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n003.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 10:37:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.86/1.22 ----- EQP 0.9e, May 2009 -----
% 0.86/1.22 The job began on n003.cluster.edu, Fri Jul 8 10:37:28 2022
% 0.86/1.22 The command was "./eqp09e".
% 0.86/1.22
% 0.86/1.22 set(prolog_style_variables).
% 0.86/1.22 set(lrpo).
% 0.86/1.22 set(basic_paramod).
% 0.86/1.22 set(functional_subsume).
% 0.86/1.22 set(ordered_paramod).
% 0.86/1.22 set(prime_paramod).
% 0.86/1.22 set(para_pairs).
% 0.86/1.22 assign(pick_given_ratio,4).
% 0.86/1.22 clear(print_kept).
% 0.86/1.22 clear(print_new_demod).
% 0.86/1.22 clear(print_back_demod).
% 0.86/1.22 clear(print_given).
% 0.86/1.22 assign(max_mem,64000).
% 0.86/1.22 end_of_commands.
% 0.86/1.22
% 0.86/1.22 Usable:
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Sos:
% 0.86/1.22 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.86/1.22 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.86/1.22 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.86/1.22 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.86/1.22 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.86/1.22 0 (wt=-1) [] composition(A,one) = A.
% 0.86/1.22 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.86/1.22 0 (wt=-1) [] converse(converse(A)) = A.
% 0.86/1.22 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.86/1.22 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.86/1.22 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.86/1.22 0 (wt=-1) [] top = join(A,complement(A)).
% 0.86/1.22 0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.86/1.22 0 (wt=-1) [] -(composition(top,top) = top).
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Demodulators:
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Passive:
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Starting to process input.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.86/1.22 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.86/1.22
% 0.86/1.22 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.86/1.22 2 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.86/1.22 3 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.86/1.22 4 is a new demodulator.
% 0.86/1.22 -> 4 back demodulating 3.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.86/1.22 5 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.86/1.22 6 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.86/1.22 7 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.86/1.22 8 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.86/1.22 9 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.86/1.22 10 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.86/1.22 11 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.86/1.22 12 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.86/1.22 13 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.86/1.22 14 is a new demodulator.
% 0.86/1.22
% 0.86/1.22 ** KEPT: 15 (wt=5) [] -(composition(top,top) = top).
% 0.86/1.22 ---------------- PROOF FOUND ----------------
% 0.86/1.22 % SZS status Unsatisfiable
% 0.86/1.22
% 0.86/1.22
% 0.86/1.22 After processing input:
% 0.86/1.22
% 0.86/1.22 Usable:
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Sos:
% 0.86/1.22 7 (wt=5) [] composition(A,one) = A.
% 0.86/1.22 9 (wt=5) [] converse(converse(A)) = A.
% 0.86/1.22 15 (wt=5) [] -(composition(top,top) = top).
% 0.86/1.22 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.86/1.22 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.86/1.22 1 (wt=7) [] join(A,B) = join(B,A).
% 0.86/1.22 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.86/1.22 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.86/1.22 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.86/1.22 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.86/1.22 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.86/1.22 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.86/1.22 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.86/1.22 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Demodulators:
% 0.86/1.22 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.86/1.22 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.86/1.22 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.86/1.22 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.86/1.22 7 (wt=5) [] composition(A,one) = A.
% 0.86/1.22 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.86/1.22 9 (wt=5) [] converse(converse(A)) = A.
% 0.86/1.22 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.86/1.22 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.86/1.22 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.86/1.22 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.86/1.22 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 Passive:
% 0.86/1.22 end_of_list.
% 0.86/1.22
% 0.86/1.22 UNIT CONFLICT from 773 and 15 at 0.05 seconds.
% 0.86/1.22
% 0.86/1.22 ---------------- PROOF ----------------
% 0.86/1.22 % SZS output start Refutation
% See solution above
% 0.86/1.22 ------------ end of proof -------------
% 0.86/1.22
% 0.86/1.22
% 0.86/1.22 ------------- memory usage ------------
% 0.86/1.22 Memory dynamically allocated (tp_alloc): 1464.
% 0.86/1.22 type (bytes each) gets frees in use avail bytes
% 0.86/1.22 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.86/1.22 term ( 16) 61008 46703 14305 18 276.7 K
% 0.86/1.22 gen_ptr ( 8) 74630 12754 61876 48 483.8 K
% 0.86/1.22 context ( 808) 71197 71195 2 4 4.7 K
% 0.86/1.22 trail ( 12) 7987 7987 0 5 0.1 K
% 0.86/1.22 bt_node ( 68) 29389 29386 3 19 1.5 K
% 0.86/1.22 ac_position (285432) 0 0 0 0 0.0 K
% 0.86/1.22 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.86/1.22 ac_match_free_vars_pos (4020)
% 0.86/1.22 0 0 0 0 0.0 K
% 0.86/1.22 discrim ( 12) 10681 2000 8681 0 101.7 K
% 0.86/1.22 flat ( 40) 119831 119831 0 41 1.6 K
% 0.86/1.22 discrim_pos ( 12) 3328 3328 0 1 0.0 K
% 0.86/1.22 fpa_head ( 12) 3130 0 3130 0 36.7 K
% 0.86/1.22 fpa_tree ( 28) 2436 2436 0 21 0.6 K
% 0.86/1.22 fpa_pos ( 36) 1252 1252 0 1 0.0 K
% 0.86/1.22 literal ( 12) 3580 2807 773 1 9.1 K
% 0.86/1.22 clause ( 24) 3580 2807 773 1 18.1 K
% 0.86/1.22 list ( 12) 538 482 56 4 0.7 K
% 0.86/1.22 list_pos ( 20) 3200 972 2228 0 43.5 K
% 0.86/1.22 pair_index ( 40) 2 0 2 0 0.1 K
% 0.86/1.22
% 0.86/1.22 -------------- statistics -------------
% 0.86/1.22 Clauses input 14
% 0.86/1.22 Usable input 0
% 0.86/1.22 Sos input 14
% 0.86/1.22 Demodulators input 0
% 0.86/1.22 Passive input 0
% 0.86/1.22
% 0.86/1.22 Processed BS (before search) 16
% 0.86/1.22 Forward subsumed BS 1
% 0.86/1.22 Kept BS 15
% 0.86/1.22 New demodulators BS 13
% 0.86/1.22 Back demodulated BS 1
% 0.86/1.22
% 0.86/1.22 Clauses or pairs given 5958
% 0.86/1.22 Clauses generated 2231
% 0.86/1.22 Forward subsumed 1473
% 0.86/1.22 Deleted by weight 0
% 0.86/1.22 Deleted by variable count 0
% 0.86/1.22 Kept 758
% 0.86/1.22 New demodulators 466
% 0.86/1.22 Back demodulated 192
% 0.86/1.22 Ordered paramod prunes 0
% 0.86/1.22 Basic paramod prunes 14014
% 0.86/1.22 Prime paramod prunes 90
% 0.86/1.22 Semantic prunes 0
% 0.86/1.22
% 0.86/1.22 Rewrite attmepts 24045
% 0.86/1.22 Rewrites 2733
% 0.86/1.22
% 0.86/1.22 FPA overloads 0
% 0.86/1.22 FPA underloads 0
% 0.86/1.22
% 0.86/1.22 Usable size 0
% 0.86/1.22 Sos size 579
% 0.86/1.22 Demodulators size 298
% 0.86/1.22 Passive size 0
% 0.86/1.22 Disabled size 193
% 0.86/1.22
% 0.86/1.22 Proofs found 1
% 0.86/1.22
% 0.86/1.22 ----------- times (seconds) ----------- Fri Jul 8 10:37:28 2022
% 0.86/1.22
% 0.86/1.22 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.86/1.22 system CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.86/1.22 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.86/1.22 input time 0.00
% 0.86/1.22 paramodulation time 0.01
% 0.86/1.22 demodulation time 0.00
% 0.86/1.22 orient time 0.01
% 0.86/1.22 weigh time 0.00
% 0.86/1.22 forward subsume time 0.00
% 0.86/1.22 back demod find time 0.00
% 0.86/1.22 conflict time 0.00
% 0.86/1.22 LRPO time 0.00
% 0.86/1.22 store clause time 0.01
% 0.86/1.22 disable clause time 0.00
% 0.86/1.22 prime paramod time 0.00
% 0.86/1.22 semantics time 0.00
% 0.86/1.22
% 0.86/1.22 EQP interrupted
%------------------------------------------------------------------------------