TSTP Solution File: ALG236-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ALG236-1 : TPTP v8.1.0. Released v4.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 : Thu Jul 14 15:38:49 EDT 2022
% Result : Unsatisfiable 0.95s 1.36s
% Output : Refutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 60 ( 60 unt; 0 nHn; 2 RR)
% Number of literals : 60 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 240 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,mult(B,mult(A,B))),mult(A,B)),
file('ALG236-1.p',unknown),
[] ).
cnf(2,plain,
equal(mult(A,mult(B,mult(C,D))),mult(C,mult(B,mult(A,D)))),
file('ALG236-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(mult(A,mult(B,mult(C,B))),D),mult(A,mult(D,mult(mult(C,B),D)))),
file('ALG236-1.p',unknown),
[] ).
cnf(4,plain,
equal(mult(A,mult(B,mult(mult(C,D),B))),mult(mult(A,mult(D,mult(C,D))),B)),
inference(flip,[status(thm),theory(equality)],[3]),
[iquote('flip(3)')] ).
cnf(5,plain,
~ equal(mult(a,mult(c,mult(mult(d,b),e))),mult(mult(a,b),mult(c,mult(d,e)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(mult(A,mult(B,mult(C,D))),mult(C,mult(B,mult(A,mult(D,mult(C,D)))))),
inference(para,[status(thm),theory(equality)],[1,2]),
[iquote('para(1,2)')] ).
cnf(8,plain,
equal(mult(A,mult(B,mult(C,mult(D,mult(A,D))))),mult(C,mult(B,mult(A,D)))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(9,plain,
equal(mult(A,mult(B,mult(C,mult(B,A)))),mult(C,mult(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
[iquote('para(1,2),flip(1)')] ).
cnf(10,plain,
equal(mult(A,mult(mult(B,mult(C,D)),mult(C,mult(B,mult(A,D))))),mult(A,mult(B,mult(C,D)))),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(14,plain,
equal(mult(mult(A,B),mult(B,mult(A,B))),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,9]),1]),
[iquote('para(1,9),demod([1])')] ).
cnf(17,plain,
equal(mult(A,mult(B,mult(C,mult(D,E)))),mult(C,mult(D,mult(A,mult(B,E))))),
inference(para,[status(thm),theory(equality)],[2,2]),
[iquote('para(2,2)')] ).
cnf(22,plain,
equal(mult(A,mult(B,mult(mult(A,B),B))),mult(A,B)),
inference(para,[status(thm),theory(equality)],[2,14]),
[iquote('para(2,14)')] ).
cnf(23,plain,
equal(mult(A,mult(B,mult(C,D))),mult(mult(C,D),mult(B,mult(A,mult(D,mult(C,D)))))),
inference(para,[status(thm),theory(equality)],[14,2]),
[iquote('para(14,2)')] ).
cnf(24,plain,
equal(mult(mult(A,B),mult(C,mult(D,mult(B,mult(A,B))))),mult(D,mult(C,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[23]),
[iquote('flip(23)')] ).
cnf(29,plain,
equal(mult(A,mult(B,mult(mult(A,C),B))),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),1]),
[iquote('para(1,3),flip(1)')] ).
cnf(30,plain,
equal(mult(mult(A,B),B),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),29]),
[iquote('back_demod(22),demod([29])')] ).
cnf(33,plain,
equal(mult(mult(A,mult(B,mult(C,D))),mult(B,mult(A,D))),mult(C,mult(B,mult(A,D)))),
inference(para,[status(thm),theory(equality)],[2,30]),
[iquote('para(2,30)')] ).
cnf(35,plain,
equal(mult(A,mult(B,mult(C,D))),mult(mult(C,D),mult(B,mult(A,D)))),
inference(para,[status(thm),theory(equality)],[30,2]),
[iquote('para(30,2)')] ).
cnf(36,plain,
equal(mult(mult(A,B),mult(C,mult(D,B))),mult(D,mult(C,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[35]),
[iquote('flip(35)')] ).
cnf(61,plain,
equal(mult(mult(A,B),mult(C,mult(D,B))),mult(A,mult(C,mult(D,B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,30]),33]),1]),
[iquote('para(36,30),demod([33]),flip(1)')] ).
cnf(83,plain,
equal(mult(mult(A,mult(B,mult(C,B))),D),mult(mult(C,B),mult(D,mult(A,D)))),
inference(para,[status(thm),theory(equality)],[4,2]),
[iquote('para(4,2)')] ).
cnf(107,plain,
equal(mult(mult(A,mult(B,mult(C,D))),mult(B,mult(A,mult(D,mult(C,D))))),mult(C,mult(B,mult(A,mult(D,mult(C,D)))))),
inference(para,[status(thm),theory(equality)],[8,30]),
[iquote('para(8,30)')] ).
cnf(111,plain,
equal(mult(mult(A,mult(B,mult(C,mult(D,E)))),mult(D,mult(A,mult(B,E)))),mult(C,mult(D,mult(A,mult(B,E))))),
inference(para,[status(thm),theory(equality)],[17,30]),
[iquote('para(17,30)')] ).
cnf(113,plain,
equal(mult(A,mult(B,mult(C,mult(D,E)))),mult(mult(C,mult(D,E)),mult(D,mult(A,mult(B,E))))),
inference(para,[status(thm),theory(equality)],[30,17]),
[iquote('para(30,17)')] ).
cnf(114,plain,
equal(mult(mult(A,mult(B,C)),mult(B,mult(D,mult(E,C)))),mult(D,mult(E,mult(A,mult(B,C))))),
inference(flip,[status(thm),theory(equality)],[113]),
[iquote('flip(113)')] ).
cnf(137,plain,
equal(mult(A,mult(B,mult(C,mult(D,mult(A,B))))),mult(C,mult(D,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,2]),1]),
[iquote('para(9,2),flip(1)')] ).
cnf(138,plain,
equal(mult(A,mult(B,mult(A,mult(C,mult(D,B))))),mult(A,mult(C,mult(D,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[137,30]),61,137]),
[iquote('para(137,30),demod([61,137])')] ).
cnf(142,plain,
equal(mult(mult(A,B),mult(C,mult(A,C))),mult(mult(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,2]),1]),
[iquote('para(29,2),flip(1)')] ).
cnf(152,plain,
equal(mult(A,mult(B,mult(C,mult(B,mult(A,D))))),mult(C,mult(B,mult(A,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,29]),30,9]),
[iquote('para(9,29),demod([30,9])')] ).
cnf(161,plain,
equal(mult(A,mult(mult(B,C),D)),mult(D,mult(mult(B,C),mult(A,mult(B,D))))),
inference(para,[status(thm),theory(equality)],[142,2]),
[iquote('para(142,2)')] ).
cnf(163,plain,
equal(mult(mult(A,B),mult(mult(C,mult(D,E)),mult(D,mult(C,mult(A,E))))),mult(mult(A,B),mult(C,mult(D,E)))),
inference(para,[status(thm),theory(equality)],[2,142]),
[iquote('para(2,142)')] ).
cnf(164,plain,
equal(mult(mult(A,B),mult(C,mult(A,mult(C,D)))),mult(mult(A,B),mult(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,142]),30]),
[iquote('para(2,142),demod([30])')] ).
cnf(176,plain,
equal(mult(A,mult(B,mult(C,mult(D,mult(A,D))))),mult(A,mult(B,mult(C,D)))),
inference(para,[status(thm),theory(equality)],[7,2]),
[iquote('para(7,2)')] ).
cnf(180,plain,
equal(mult(mult(A,mult(B,mult(C,D))),mult(B,mult(A,mult(D,mult(C,D))))),mult(C,mult(B,mult(A,D)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[107]),176]),
[iquote('back_demod(107),demod([176])')] ).
cnf(221,plain,
equal(mult(A,mult(B,mult(A,mult(C,D)))),mult(A,mult(B,mult(D,mult(C,D))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,10]),61,138,138]),
[iquote('para(3,10),demod([61,138,138])')] ).
cnf(223,plain,
equal(mult(A,mult(B,mult(C,mult(D,A)))),mult(C,mult(B,mult(C,mult(D,A))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[221,30]),33]),
[iquote('para(221,30),demod([33])')] ).
cnf(231,plain,
equal(mult(A,mult(mult(mult(B,C),D),mult(D,mult(mult(B,C),mult(A,mult(B,D)))))),mult(A,mult(mult(B,C),D))),
inference(para,[status(thm),theory(equality)],[161,1]),
[iquote('para(161,1)')] ).
cnf(238,plain,
equal(mult(mult(A,B),mult(C,mult(D,mult(B,mult(A,B))))),mult(A,mult(C,mult(D,B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,30]),180]),1]),
[iquote('para(24,30),demod([180]),flip(1)')] ).
cnf(370,plain,
equal(mult(mult(A,B),mult(B,mult(A,mult(C,mult(D,B))))),mult(A,mult(C,mult(D,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[238,1]),111,238]),
[iquote('para(238,1),demod([111,238])')] ).
cnf(371,plain,
equal(mult(A,mult(mult(B,C),mult(A,mult(B,D)))),mult(A,mult(mult(B,C),D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[231]),370]),
[iquote('back_demod(231),demod([370])')] ).
cnf(374,plain,
equal(mult(mult(A,mult(B,C)),mult(mult(B,D),C)),mult(A,mult(mult(B,D),C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,371]),61,371]),1]),
[iquote('para(30,371),demod([61,371]),flip(1)')] ).
cnf(444,plain,
equal(mult(mult(A,mult(B,C)),mult(B,mult(D,mult(E,C)))),mult(A,mult(B,mult(D,mult(E,C))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[114,30]),111]),1]),
[iquote('para(114,30),demod([111]),flip(1)')] ).
cnf(458,plain,
equal(mult(mult(A,B),mult(C,mult(D,mult(C,mult(A,E))))),mult(mult(A,B),mult(C,mult(D,E)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[163]),444]),
[iquote('back_demod(163),demod([444])')] ).
cnf(886,plain,
equal(mult(mult(mult(A,B),C),D),mult(mult(A,C),mult(D,mult(mult(A,B),D)))),
inference(para,[status(thm),theory(equality)],[142,83]),
[iquote('para(142,83)')] ).
cnf(887,plain,
equal(mult(mult(A,B),mult(C,mult(mult(A,D),C))),mult(mult(mult(A,D),B),C)),
inference(flip,[status(thm),theory(equality)],[886]),
[iquote('flip(886)')] ).
cnf(904,plain,
equal(mult(mult(mult(A,B),C),B),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,887]),142]),1]),
[iquote('para(30,887),demod([142]),flip(1)')] ).
cnf(1015,plain,
equal(mult(mult(mult(A,B),C),mult(D,mult(E,B))),mult(mult(A,C),mult(D,mult(E,B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,904]),904]),1]),
[iquote('para(61,904),demod([904]),flip(1)')] ).
cnf(1152,plain,
equal(mult(mult(A,B),mult(C,mult(D,E))),mult(mult(D,B),mult(C,mult(A,E)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[152,904]),1015,164,458]),
[iquote('para(152,904),demod([1015,164,458])')] ).
cnf(1155,plain,
equal(mult(mult(A,B),mult(C,mult(D,E))),mult(mult(D,B),mult(C,mult(mult(A,B),E)))),
inference(para,[status(thm),theory(equality)],[30,1152]),
[iquote('para(30,1152)')] ).
cnf(1156,plain,
equal(mult(mult(A,B),mult(C,mult(mult(D,B),E))),mult(mult(D,B),mult(C,mult(A,E)))),
inference(flip,[status(thm),theory(equality)],[1155]),
[iquote('flip(1155)')] ).
cnf(1157,plain,
equal(mult(mult(A,B),mult(mult(C,mult(D,E)),mult(mult(D,B),mult(C,mult(A,E))))),mult(mult(A,B),mult(C,mult(D,E)))),
inference(para,[status(thm),theory(equality)],[1152,1]),
[iquote('para(1152,1)')] ).
cnf(1171,plain,
equal(mult(mult(A,B),mult(C,mult(mult(D,B),E))),mult(A,mult(C,mult(mult(D,B),E)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1156,30]),33]),1]),
[iquote('para(1156,30),demod([33]),flip(1)')] ).
cnf(1172,plain,
equal(mult(A,mult(mult(B,mult(C,D)),mult(mult(C,E),mult(B,mult(A,D))))),mult(mult(A,E),mult(B,mult(C,D)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1157]),1171]),
[iquote('back_demod(1157),demod([1171])')] ).
cnf(1173,plain,
equal(mult(mult(A,B),mult(C,mult(D,E))),mult(A,mult(mult(C,mult(D,E)),mult(mult(D,B),mult(C,mult(A,E)))))),
inference(flip,[status(thm),theory(equality)],[1172]),
[iquote('flip(1172)')] ).
cnf(1981,plain,
equal(mult(mult(A,B),mult(mult(C,D),mult(E,mult(C,mult(A,B))))),mult(A,mult(mult(C,D),mult(E,B)))),
inference(para,[status(thm),theory(equality)],[161,2]),
[iquote('para(161,2)')] ).
cnf(2327,plain,
equal(mult(mult(A,B),mult(C,mult(D,mult(E,mult(A,B))))),mult(A,mult(C,mult(D,mult(E,mult(A,B)))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[223,29]),164,30]),1]),
[iquote('para(223,29),demod([164,30]),flip(1)')] ).
cnf(2332,plain,
equal(mult(A,mult(mult(B,C),mult(D,mult(B,mult(A,E))))),mult(A,mult(mult(B,C),mult(D,E)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1981]),2327]),
[iquote('back_demod(1981),demod([2327])')] ).
cnf(2333,plain,
equal(mult(mult(A,B),mult(C,mult(D,E))),mult(A,mult(C,mult(mult(D,B),E)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1173]),2332,374]),
[iquote('back_demod(1173),demod([2332,374])')] ).
cnf(2334,plain,
equal(mult(A,mult(B,mult(mult(C,D),E))),mult(mult(A,D),mult(B,mult(C,E)))),
inference(flip,[status(thm),theory(equality)],[2333]),
[iquote('flip(2333)')] ).
cnf(2335,plain,
$false,
inference(conflict,[status(thm)],[2334,5]),
[iquote('conflict(2334,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ALG236-1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 8 15:19:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.95/1.36 ----- EQP 0.9e, May 2009 -----
% 0.95/1.36 The job began on n025.cluster.edu, Wed Jun 8 15:19:05 2022
% 0.95/1.36 The command was "./eqp09e".
% 0.95/1.36
% 0.95/1.36 set(prolog_style_variables).
% 0.95/1.36 set(lrpo).
% 0.95/1.36 set(basic_paramod).
% 0.95/1.36 set(functional_subsume).
% 0.95/1.36 set(ordered_paramod).
% 0.95/1.36 set(prime_paramod).
% 0.95/1.36 set(para_pairs).
% 0.95/1.36 assign(pick_given_ratio,4).
% 0.95/1.36 clear(print_kept).
% 0.95/1.36 clear(print_new_demod).
% 0.95/1.36 clear(print_back_demod).
% 0.95/1.36 clear(print_given).
% 0.95/1.36 assign(max_mem,64000).
% 0.95/1.36 end_of_commands.
% 0.95/1.36
% 0.95/1.36 Usable:
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Sos:
% 0.95/1.36 0 (wt=-1) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.95/1.36 0 (wt=-1) [] mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))).
% 0.95/1.36 0 (wt=-1) [] mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))).
% 0.95/1.36 0 (wt=-1) [] -(mult(mult(a,b),mult(c,mult(d,e))) = mult(a,mult(c,mult(mult(d,b),e)))).
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Demodulators:
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Passive:
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Starting to process input.
% 0.95/1.36
% 0.95/1.36 ** KEPT: 1 (wt=11) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.95/1.36 1 is a new demodulator.
% 0.95/1.36
% 0.95/1.36 ** KEPT: 2 (wt=15) [] mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))).
% 0.95/1.36 clause forward subsumed: 0 (wt=15) [flip(2)] mult(C,mult(B,mult(A,D))) = mult(A,mult(B,mult(C,D))).
% 0.95/1.36
% 0.95/1.36 ** KEPT: 3 (wt=19) [] mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))).
% 0.95/1.36
% 0.95/1.36 ** KEPT: 4 (wt=19) [flip(3)] mult(A,mult(B,mult(mult(C,D),B))) = mult(mult(A,mult(D,mult(C,D))),B).
% 0.95/1.36 clause forward subsumed: 0 (wt=19) [flip(4)] mult(mult(A,mult(D,mult(C,D))),B) = mult(A,mult(B,mult(mult(C,D),B))).
% 0.95/1.36
% 0.95/1.36 ** KEPT: 5 (wt=19) [flip(1)] -(mult(a,mult(c,mult(mult(d,b),e))) = mult(mult(a,b),mult(c,mult(d,e)))).
% 0.95/1.36 ---------------- PROOF FOUND ----------------
% 0.95/1.36 % SZS status Unsatisfiable
% 0.95/1.36
% 0.95/1.36
% 0.95/1.36 After processing input:
% 0.95/1.36
% 0.95/1.36 Usable:
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Sos:
% 0.95/1.36 1 (wt=11) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.95/1.36 2 (wt=15) [] mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))).
% 0.95/1.36 3 (wt=19) [] mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))).
% 0.95/1.36 4 (wt=19) [flip(3)] mult(A,mult(B,mult(mult(C,D),B))) = mult(mult(A,mult(D,mult(C,D))),B).
% 0.95/1.36 5 (wt=19) [flip(1)] -(mult(a,mult(c,mult(mult(d,b),e))) = mult(mult(a,b),mult(c,mult(d,e)))).
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Demodulators:
% 0.95/1.36 1 (wt=11) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 Passive:
% 0.95/1.36 end_of_list.
% 0.95/1.36
% 0.95/1.36 UNIT CONFLICT from 2334 and 5 at 0.22 seconds.
% 0.95/1.36
% 0.95/1.36 ---------------- PROOF ----------------
% 0.95/1.36 % SZS output start Refutation
% See solution above
% 0.95/1.36 ------------ end of proof -------------
% 0.95/1.36
% 0.95/1.36
% 0.95/1.36 ------------- memory usage ------------
% 0.95/1.36 Memory dynamically allocated (tp_alloc): 4882.
% 0.95/1.36 type (bytes each) gets frees in use avail bytes
% 0.95/1.36 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.95/1.36 term ( 16) 281421 209285 72136 30 1400.4 K
% 0.95/1.36 gen_ptr ( 8) 386579 37986 348593 59 2723.8 K
% 0.95/1.36 context ( 808) 137214 137212 2 4 4.7 K
% 0.95/1.36 trail ( 12) 66156 66156 0 8 0.1 K
% 0.95/1.36 bt_node ( 68) 20297 20294 3 12 1.0 K
% 0.95/1.36 ac_position (285432) 0 0 0 0 0.0 K
% 0.95/1.36 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.95/1.36 ac_match_free_vars_pos (4020)
% 0.95/1.36 0 0 0 0 0.0 K
% 0.95/1.36 discrim ( 12) 40986 8416 32570 207 384.1 K
% 0.95/1.36 flat ( 40) 910434 910434 0 61 2.4 K
% 0.95/1.36 discrim_pos ( 12) 8172 8172 0 1 0.0 K
% 0.95/1.36 fpa_head ( 12) 1057 0 1057 0 12.4 K
% 0.95/1.36 fpa_tree ( 28) 2096 2096 0 23 0.6 K
% 0.95/1.36 fpa_pos ( 36) 2912 2912 0 1 0.0 K
% 0.95/1.36 literal ( 12) 11620 9286 2334 1 27.4 K
% 0.95/1.36 clause ( 24) 11620 9286 2334 1 54.7 K
% 0.95/1.36 list ( 12) 637 579 58 1 0.7 K
% 0.95/1.36 list_pos ( 20) 8517 2074 6443 26 126.3 K
% 0.95/1.36 pair_index ( 40) 2 0 2 0 0.1 K
% 0.95/1.36
% 0.95/1.36 -------------- statistics -------------
% 0.95/1.36 Clauses input 4
% 0.95/1.36 Usable input 0
% 0.95/1.36 Sos input 4
% 0.95/1.36 Demodulators input 0
% 0.95/1.36 Passive input 0
% 0.95/1.36
% 0.95/1.36 Processed BS (before search) 7
% 0.95/1.36 Forward subsumed BS 2
% 0.95/1.36 Kept BS 5
% 0.95/1.36 New demodulators BS 1
% 0.95/1.36 Back demodulated BS 0
% 0.95/1.36
% 0.95/1.36 Clauses or pairs given 867
% 0.95/1.36 Clauses generated 6088
% 0.95/1.36 Forward subsumed 3759
% 0.95/1.36 Deleted by weight 0
% 0.95/1.36 Deleted by variable count 0
% 0.95/1.36 Kept 2329
% 0.95/1.36 New demodulators 577
% 0.95/1.36 Back demodulated 463
% 0.95/1.36 Ordered paramod prunes 0
% 0.95/1.36 Basic paramod prunes 1051
% 0.95/1.36 Prime paramod prunes 29
% 0.95/1.36 Semantic prunes 0
% 0.95/1.36
% 0.95/1.36 Rewrite attmepts 103118
% 0.95/1.36 Rewrites 5825
% 0.95/1.36
% 0.95/1.36 FPA overloads 0
% 0.95/1.36 FPA underloads 0
% 0.95/1.36
% 0.95/1.36 Usable size 0
% 0.95/1.36 Sos size 1870
% 0.95/1.36 Demodulators size 362
% 0.95/1.36 Passive size 0
% 0.95/1.36 Disabled size 463
% 0.95/1.36
% 0.95/1.36 Proofs found 1
% 0.95/1.36
% 0.95/1.36 ----------- times (seconds) ----------- Wed Jun 8 15:19:05 2022
% 0.95/1.36
% 0.95/1.36 user CPU time 0.22 (0 hr, 0 min, 0 sec)
% 0.95/1.36 system CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.95/1.36 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.95/1.36 input time 0.00
% 0.95/1.36 paramodulation time 0.03
% 0.95/1.36 demodulation time 0.05
% 0.95/1.36 orient time 0.03
% 0.95/1.36 weigh time 0.00
% 0.95/1.36 forward subsume time 0.01
% 0.95/1.36 back demod find time 0.03
% 0.95/1.36 conflict time 0.00
% 0.95/1.36 LRPO time 0.02
% 0.95/1.36 store clause time 0.05
% 0.95/1.36 disable clause time 0.01
% 0.95/1.36 prime paramod time 0.01
% 0.95/1.36 semantics time 0.00
% 0.95/1.36
% 0.95/1.36 EQP interrupted
%------------------------------------------------------------------------------