TSTP Solution File: REL023-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL023-2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:37 EDT 2022
% Result : Unsatisfiable 0.73s 1.50s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 6 RR)
% Number of literals : 32 ( 0 equ; 3 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 : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 41 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL023-2.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('REL023-2.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('REL023-2.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL023-2.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL023-2.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(18,plain,
~ equal(composition(join(meet(sk1,converse(sk2)),sk1),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))),
inference(demod,[status(thm),theory(equality)],[8]),
[iquote('demod([8])')] ).
cnf(23,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(24,plain,
equal(meet(complement(A),A),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,23]),1]),
[iquote('para(14,23),flip(1)')] ).
cnf(31,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(32,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(33,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,32]),9]),
[iquote('para(9,32),demod([9])')] ).
cnf(34,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,7]),1]),
[iquote('para(33,7),flip(1)')] ).
cnf(35,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[33]),34]),
[iquote('back_demod(33),demod([34])')] ).
cnf(38,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(66,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),38]),
[iquote('para(13,5),demod([38])')] ).
cnf(112,plain,
~ equal(composition(join(sk1,meet(sk1,converse(sk2))),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))),
inference(para,[status(thm),theory(equality)],[1,18]),
[iquote('para(1,18)')] ).
cnf(143,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[23,66]),
[iquote('para(23,66)')] ).
cnf(200,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[143,1]),1]),
[iquote('para(143,1),flip(1)')] ).
cnf(202,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,31]),200]),1]),
[iquote('para(24,31),demod([200]),flip(1)')] ).
cnf(254,plain,
equal(join(meet(A,complement(B)),join(meet(A,B),C)),join(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,2]),1]),
[iquote('para(31,2),flip(1)')] ).
cnf(263,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,12]),35,35]),
[iquote('para(34,12),demod([35,35])')] ).
cnf(275,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[202,263]),202,202]),
[iquote('para(202,263),demod([202,202])')] ).
cnf(2583,plain,
equal(join(A,meet(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[275,254]),31]),1]),
[iquote('para(275,254),demod([31]),flip(1)')] ).
cnf(2590,plain,
~ equal(composition(sk1,meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[112]),2583]),
[iquote('back_demod(112),demod([2583])')] ).
cnf(2591,plain,
$false,
inference(conflict,[status(thm)],[2590]),
[iquote('xx_conflict(2590)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL023-2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n009.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 12:21:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.07 ----- EQP 0.9e, May 2009 -----
% 0.46/1.07 The job began on n009.cluster.edu, Fri Jul 8 12:21:52 2022
% 0.46/1.07 The command was "./eqp09e".
% 0.46/1.07
% 0.46/1.07 set(prolog_style_variables).
% 0.46/1.07 set(lrpo).
% 0.46/1.07 set(basic_paramod).
% 0.46/1.07 set(functional_subsume).
% 0.46/1.07 set(ordered_paramod).
% 0.46/1.07 set(prime_paramod).
% 0.46/1.07 set(para_pairs).
% 0.46/1.07 assign(pick_given_ratio,4).
% 0.46/1.07 clear(print_kept).
% 0.46/1.07 clear(print_new_demod).
% 0.46/1.07 clear(print_back_demod).
% 0.46/1.07 clear(print_given).
% 0.46/1.07 assign(max_mem,64000).
% 0.46/1.07 end_of_commands.
% 0.46/1.07
% 0.46/1.07 Usable:
% 0.46/1.07 end_of_list.
% 0.46/1.07
% 0.46/1.07 Sos:
% 0.46/1.07 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.46/1.07 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 0.46/1.07 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 0.46/1.07 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 0.46/1.07 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 0.46/1.07 0 (wt=-1) [] composition(A,one) = A.
% 0.46/1.07 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 0.46/1.07 0 (wt=-1) [] converse(converse(A)) = A.
% 0.46/1.07 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.46/1.07 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.46/1.07 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.46/1.07 0 (wt=-1) [] top = join(A,complement(A)).
% 0.46/1.07 0 (wt=-1) [] zero = meet(A,complement(A)).
% 0.46/1.07 0 (wt=-1) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.46/1.07 0 (wt=-1) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.46/1.07 0 (wt=-1) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.46/1.07 0 (wt=-1) [] -(join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) = composition(sk1,meet(sk2,sk3))).
% 0.46/1.07 end_of_list.
% 0.46/1.07
% 0.46/1.07 Demodulators:
% 0.46/1.07 end_of_list.
% 0.46/1.07
% 0.46/1.07 Passive:
% 0.46/1.07 end_of_list.
% 0.46/1.07
% 0.46/1.07 Starting to process input.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 0.46/1.07 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 0.46/1.07
% 0.46/1.07 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.46/1.07 2 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 0.46/1.07 3 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.46/1.07 4 is a new demodulator.
% 0.46/1.07 -> 4 back demodulating 3.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.46/1.07 5 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.46/1.07 6 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 0.46/1.07 7 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.46/1.07 8 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 0.46/1.07 9 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.46/1.07 10 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.46/1.07 11 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.46/1.07 12 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.46/1.07 13 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.46/1.07 14 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.46/1.07 15 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.46/1.07 16 is a new demodulator.
% 0.46/1.07
% 0.46/1.07 ** KEPT: 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.73/1.50 17 is a new demodulator.
% 0.73/1.50
% 0.73/1.50 ** KEPT: 18 (wt=16) [demod([8])] -(composition(join(meet(sk1,converse(sk2)),sk1),meet(sk2,sk3)) = composition(sk1,meet(sk2,sk3))).
% 0.73/1.50 ---------------- PROOF FOUND ----------------
% 0.73/1.50 % SZS status Unsatisfiable
% 0.73/1.50
% 0.73/1.50
% 0.73/1.50 After processing input:
% 0.73/1.50
% 0.73/1.50 Usable:
% 0.73/1.50 end_of_list.
% 0.73/1.50
% 0.73/1.50 Sos:
% 0.73/1.50 7 (wt=5) [] composition(A,one) = A.
% 0.73/1.50 9 (wt=5) [] converse(converse(A)) = A.
% 0.73/1.50 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.73/1.50 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.73/1.50 1 (wt=7) [] join(A,B) = join(B,A).
% 0.73/1.50 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.73/1.50 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.73/1.50 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.73/1.50 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.73/1.50 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.73/1.50 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.73/1.50 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.73/1.50 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.73/1.50 18 (wt=16) [demod([8])] -(composition(join(meet(sk1,converse(sk2)),sk1),meet(sk2,sk3)) = composition(sk1,meet(sk2,sk3))).
% 0.73/1.50 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.73/1.50 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.73/1.50 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.73/1.50 end_of_list.
% 0.73/1.50
% 0.73/1.50 Demodulators:
% 0.73/1.50 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 0.73/1.50 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 0.73/1.50 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 0.73/1.50 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 0.73/1.50 7 (wt=5) [] composition(A,one) = A.
% 0.73/1.50 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 0.73/1.50 9 (wt=5) [] converse(converse(A)) = A.
% 0.73/1.50 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 0.73/1.50 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 0.73/1.50 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 0.73/1.50 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 0.73/1.50 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 0.73/1.50 15 (wt=33) [] join(meet(composition(A,B),C),composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C)))) = composition(meet(A,composition(C,converse(B))),meet(B,composition(converse(A),C))).
% 0.73/1.50 16 (wt=27) [] join(meet(composition(A,B),C),meet(composition(A,meet(B,composition(converse(A),C))),C)) = meet(composition(A,meet(B,composition(converse(A),C))),C).
% 0.73/1.50 17 (wt=27) [] join(meet(composition(A,B),C),meet(composition(meet(A,composition(C,converse(B))),B),C)) = meet(composition(meet(A,composition(C,converse(B))),B),C).
% 0.73/1.50 end_of_list.
% 0.73/1.50
% 0.73/1.50 Passive:
% 0.73/1.50 end_of_list.
% 0.73/1.50
% 0.73/1.50 UNIT CONFLICT from 2590 and x=x at 0.23 seconds.
% 0.73/1.50
% 0.73/1.50 ---------------- PROOF ----------------
% 0.73/1.50 % SZS output start Refutation
% See solution above
% 0.73/1.50 ------------ end of proof -------------
% 0.73/1.50
% 0.73/1.50
% 0.73/1.50 ------------- memory usage ------------
% 0.73/1.50 Memory dynamically allocated (tp_alloc): 5371.
% 0.73/1.50 type (bytes each) gets frees in use avail bytes
% 0.73/1.50 sym_ent ( 96) 62 0 62 0 5.8 K
% 0.73/1.50 term ( 16) 289414 220614 68800 20 1334.0 K
% 0.73/1.50 gen_ptr ( 8) 384043 59771 324272 31 2533.6 K
% 0.73/1.50 context ( 808) 352807 352805 2 4 4.7 K
% 0.73/1.50 trail ( 12) 22646 22646 0 6 0.1 K
% 0.73/1.50 bt_node ( 68) 148348 148345 3 33 2.4 K
% 0.73/1.50 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.50 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.50 ac_match_free_vars_pos (4020)
% 0.73/1.50 0 0 0 0 0.0 K
% 0.73/1.50 discrim ( 12) 56969 12650 44319 1658 538.8 K
% 0.73/1.50 flat ( 40) 579839 579839 0 63 2.5 K
% 0.73/1.50 discrim_pos ( 12) 14312 14312 0 1 0.0 K
% 0.73/1.50 fpa_head ( 12) 14722 0 14722 0 172.5 K
% 0.73/1.50 fpa_tree ( 28) 9085 9085 0 25 0.7 K
% 0.73/1.50 fpa_pos ( 36) 4094 4094 0 1 0.0 K
% 0.73/1.50 literal ( 12) 13297 10707 2590 0 30.4 K
% 0.73/1.50 clause ( 24) 13297 10707 2590 0 60.7 K
% 0.73/1.50 list ( 12) 1564 1507 57 3 0.7 K
% 0.73/1.50 list_pos ( 20) 10500 2868 7632 109 151.2 K
% 0.73/1.50 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.50
% 0.73/1.50 -------------- statistics -------------
% 0.73/1.50 Clauses input 17
% 0.73/1.50 Usable input 0
% 0.73/1.50 Sos input 17
% 0.73/1.50 Demodulators input 0
% 0.73/1.50 Passive input 0
% 0.73/1.50
% 0.73/1.50 Processed BS (before search) 19
% 0.73/1.50 Forward subsumed BS 1
% 0.73/1.50 Kept BS 18
% 0.73/1.50 New demodulators BS 16
% 0.73/1.50 Back demodulated BS 1
% 0.73/1.50
% 0.73/1.50 Clauses or pairs given 25055
% 0.73/1.50 Clauses generated 8811
% 0.73/1.50 Forward subsumed 6239
% 0.73/1.50 Deleted by weight 0
% 0.73/1.50 Deleted by variable count 0
% 0.73/1.50 Kept 2572
% 0.73/1.50 New demodulators 1489
% 0.73/1.50 Back demodulated 595
% 0.73/1.50 Ordered paramod prunes 0
% 0.73/1.50 Basic paramod prunes 80486
% 0.73/1.50 Prime paramod prunes 643
% 0.73/1.50 Semantic prunes 0
% 0.73/1.50
% 0.73/1.50 Rewrite attmepts 118251
% 0.73/1.50 Rewrites 12012
% 0.73/1.50
% 0.73/1.50 FPA overloads 0
% 0.73/1.50 FPA underloads 0
% 0.73/1.50
% 0.73/1.50 Usable size 0
% 0.73/1.50 Sos size 1993
% 0.73/1.50 Demodulators size 1057
% 0.73/1.50 Passive size 0
% 0.73/1.50 Disabled size 596
% 0.73/1.50
% 0.73/1.50 Proofs found 1
% 0.73/1.50
% 0.73/1.50 ----------- times (seconds) ----------- Fri Jul 8 12:21:53 2022
% 0.73/1.50
% 0.73/1.50 user CPU time 0.23 (0 hr, 0 min, 0 sec)
% 0.73/1.50 system CPU time 0.20 (0 hr, 0 min, 0 sec)
% 0.73/1.50 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.73/1.50 input time 0.00
% 0.73/1.50 paramodulation time 0.06
% 0.73/1.50 demodulation time 0.03
% 0.73/1.50 orient time 0.02
% 0.73/1.50 weigh time 0.00
% 0.73/1.50 forward subsume time 0.01
% 0.73/1.50 back demod find time 0.01
% 0.73/1.50 conflict time 0.00
% 0.73/1.50 LRPO time 0.01
% 0.73/1.50 store clause time 0.04
% 0.73/1.50 disable clause time 0.00
% 0.73/1.50 prime paramod time 0.01
% 0.73/1.50 semantics time 0.00
% 0.73/1.50
% 0.73/1.50 EQP interrupted
%------------------------------------------------------------------------------