TSTP Solution File: GRP658-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n012.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 : Sat Jul 16 08:48:40 EDT 2022
% Result : Unsatisfiable 0.74s 1.46s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 6
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 5 RR)
% Number of literals : 62 ( 0 equ; 4 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; 0 con; 1-2 aty)
% Number of variables : 153 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP658-10.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP658-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP658-10.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP658-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(mult(A,mult(B,B)),C),mult(mult(A,B),mult(B,C))),
file('GRP658-10.p',unknown),
[] ).
cnf(6,plain,
~ equal(tuple(mult(A,x1(A)),mult(x1_2(A),A)),tuple(x1(A),x1_2(A))),
file('GRP658-10.p',unknown),
[] ).
cnf(7,plain,
equal(ld(rd(A,B),A),B),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(8,plain,
equal(rd(A,ld(B,A)),B),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(11,plain,
equal(mult(mult(rd(A,mult(B,B)),B),mult(B,C)),mult(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,5]),1]),
[iquote('para(3,5),flip(1)')] ).
cnf(12,plain,
equal(rd(mult(mult(A,B),mult(B,C)),C),mult(A,mult(B,B))),
inference(para,[status(thm),theory(equality)],[5,4]),
[iquote('para(5,4)')] ).
cnf(20,plain,
equal(mult(mult(rd(A,mult(B,B)),B),C),mult(A,ld(B,C))),
inference(para,[status(thm),theory(equality)],[1,11]),
[iquote('para(1,11)')] ).
cnf(23,plain,
equal(rd(mult(A,mult(B,C)),C),mult(rd(A,B),mult(B,B))),
inference(para,[status(thm),theory(equality)],[3,12]),
[iquote('para(3,12)')] ).
cnf(26,plain,
equal(mult(A,ld(B,ld(mult(rd(A,mult(B,B)),B),C))),C),
inference(para,[status(thm),theory(equality)],[20,1]),
[iquote('para(20,1)')] ).
cnf(34,plain,
equal(rd(mult(A,B),C),mult(rd(A,rd(B,C)),mult(rd(B,C),rd(B,C)))),
inference(para,[status(thm),theory(equality)],[3,23]),
[iquote('para(3,23)')] ).
cnf(36,plain,
equal(mult(rd(A,rd(B,B)),mult(rd(B,B),rd(B,B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),34]),
[iquote('back_demod(4),demod([34])')] ).
cnf(37,plain,
equal(mult(rd(rd(A,mult(B,C)),B),mult(B,B)),rd(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,23]),1]),
[iquote('para(3,23),flip(1)')] ).
cnf(41,plain,
equal(ld(mult(rd(A,mult(A,A)),A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,1]),1]),
[iquote('para(26,1),flip(1)')] ).
cnf(47,plain,
equal(ld(A,ld(mult(rd(B,mult(A,A)),A),C)),ld(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,2]),1]),
[iquote('para(26,2),flip(1)')] ).
cnf(50,plain,
equal(mult(rd(A,A),rd(A,A)),rd(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,2]),7]),1]),
[iquote('para(36,2),demod([7]),flip(1)')] ).
cnf(54,plain,
equal(ld(rd(A,A),rd(A,A)),rd(A,A)),
inference(para,[status(thm),theory(equality)],[50,2]),
[iquote('para(50,2)')] ).
cnf(74,plain,
equal(ld(rd(rd(A,mult(B,C)),B),rd(A,C)),mult(B,B)),
inference(para,[status(thm),theory(equality)],[37,2]),
[iquote('para(37,2)')] ).
cnf(75,plain,
equal(mult(A,ld(B,C)),ld(mult(rd(B,mult(A,A)),A),C)),
inference(para,[status(thm),theory(equality)],[47,1]),
[iquote('para(47,1)')] ).
cnf(80,plain,
equal(ld(rd(rd(A,mult(B,ld(C,A))),B),C),mult(B,B)),
inference(para,[status(thm),theory(equality)],[8,74]),
[iquote('para(8,74)')] ).
cnf(86,plain,
equal(mult(mult(A,ld(B,mult(C,C))),D),mult(mult(A,ld(B,C)),mult(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,5]),20]),
[iquote('para(20,5),demod([20])')] ).
cnf(93,plain,
equal(mult(A,B),ld(mult(rd(C,mult(C,C)),mult(rd(C,mult(A,A)),A)),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,75]),34,5,3]),
[iquote('para(41,75),demod([34,5,3])')] ).
cnf(94,plain,
equal(ld(mult(rd(A,mult(A,A)),mult(rd(A,mult(B,B)),B)),C),mult(B,C)),
inference(flip,[status(thm),theory(equality)],[93]),
[iquote('flip(93)')] ).
cnf(105,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,86]),1]),
[iquote('para(1,86),demod([1])')] ).
cnf(109,plain,
equal(mult(A,mult(A,ld(mult(A,A),B))),B),
inference(para,[status(thm),theory(equality)],[105,1]),
[iquote('para(105,1)')] ).
cnf(111,plain,
equal(mult(A,ld(mult(A,A),B)),ld(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[109,2]),1]),
[iquote('para(109,2),flip(1)')] ).
cnf(113,plain,
equal(ld(mult(A,A),B),ld(A,ld(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[111,2]),1]),
[iquote('para(111,2),flip(1)')] ).
cnf(127,plain,
equal(mult(rd(A,mult(B,C)),mult(B,D)),mult(rd(A,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[37,5]),3]),1]),
[iquote('para(37,5),demod([3]),flip(1)')] ).
cnf(128,plain,
equal(mult(rd(A,ld(B,C)),D),mult(rd(A,C),mult(B,D))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,127]),1]),
[iquote('para(1,127),flip(1)')] ).
cnf(132,plain,
equal(mult(rd(A,mult(B,C)),D),mult(rd(A,C),ld(B,D))),
inference(para,[status(thm),theory(equality)],[1,127]),
[iquote('para(1,127)')] ).
cnf(148,plain,
equal(ld(mult(rd(A,A),ld(A,mult(rd(A,B),ld(B,B)))),C),mult(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[94]),132,132]),
[iquote('back_demod(94),demod([132,132])')] ).
cnf(149,plain,
equal(mult(A,B),ld(mult(rd(C,C),ld(C,mult(rd(C,A),ld(A,A)))),B)),
inference(flip,[status(thm),theory(equality)],[148]),
[iquote('flip(148)')] ).
cnf(161,plain,
equal(ld(mult(rd(A,A),ld(A,A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[41]),132]),
[iquote('back_demod(41),demod([132])')] ).
cnf(165,plain,
equal(ld(rd(A,A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[54,161]),3]),
[iquote('para(54,161),demod([3])')] ).
cnf(167,plain,
equal(mult(rd(A,A),B),B),
inference(para,[status(thm),theory(equality)],[165,1]),
[iquote('para(165,1)')] ).
cnf(168,plain,
equal(ld(ld(A,A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[161]),167]),
[iquote('back_demod(161),demod([167])')] ).
cnf(169,plain,
equal(mult(A,B),ld(ld(C,mult(rd(C,A),ld(A,A))),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[149]),167]),
[iquote('back_demod(149),demod([167])')] ).
cnf(170,plain,
equal(ld(ld(A,mult(rd(A,B),ld(B,B))),C),mult(B,C)),
inference(flip,[status(thm),theory(equality)],[169]),
[iquote('flip(169)')] ).
cnf(248,plain,
~ equal(tuple(x1(rd(A,A)),mult(x1_2(rd(A,A)),rd(A,A))),tuple(x1(rd(A,A)),x1_2(rd(A,A)))),
inference(para,[status(thm),theory(equality)],[167,6]),
[iquote('para(167,6)')] ).
cnf(249,plain,
equal(mult(rd(ld(A,B),B),mult(A,C)),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[167,128]),1]),
[iquote('para(167,128),flip(1)')] ).
cnf(250,plain,
equal(mult(rd(ld(A,B),B),C),ld(A,C)),
inference(para,[status(thm),theory(equality)],[1,249]),
[iquote('para(1,249)')] ).
cnf(251,plain,
equal(ld(A,ld(rd(ld(A,B),B),C)),C),
inference(para,[status(thm),theory(equality)],[250,1]),
[iquote('para(250,1)')] ).
cnf(252,plain,
equal(ld(rd(ld(A,B),B),ld(A,C)),C),
inference(para,[status(thm),theory(equality)],[250,2]),
[iquote('para(250,2)')] ).
cnf(253,plain,
equal(mult(A,B),ld(rd(ld(A,C),C),B)),
inference(para,[status(thm),theory(equality)],[251,1]),
[iquote('para(251,1)')] ).
cnf(254,plain,
equal(ld(rd(ld(A,B),B),C),mult(A,C)),
inference(flip,[status(thm),theory(equality)],[253]),
[iquote('flip(253)')] ).
cnf(276,plain,
equal(ld(rd(ld(A,ld(A,B)),B),C),mult(A,mult(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[253,105]),113]),
[iquote('para(253,105),demod([113])')] ).
cnf(277,plain,
equal(mult(A,mult(A,B)),ld(rd(ld(A,ld(A,C)),C),B)),
inference(flip,[status(thm),theory(equality)],[276]),
[iquote('flip(276)')] ).
cnf(312,plain,
equal(mult(A,B),ld(ld(A,ld(A,A)),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[167,170]),1]),
[iquote('para(167,170),flip(1)')] ).
cnf(340,plain,
equal(ld(rd(ld(A,ld(A,B)),B),C),ld(ld(A,ld(A,A)),ld(ld(A,ld(A,A)),C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[277]),312,312]),1]),
[iquote('back_demod(277),demod([312,312]),flip(1)')] ).
cnf(361,plain,
equal(ld(rd(ld(A,B),B),C),ld(ld(A,ld(A,A)),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[254]),312]),
[iquote('back_demod(254),demod([312])')] ).
cnf(365,plain,
equal(ld(ld(A,ld(A,A)),ld(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[252]),361]),
[iquote('back_demod(252),demod([361])')] ).
cnf(368,plain,
~ equal(tuple(x1(rd(A,A)),ld(ld(x1_2(rd(A,A)),ld(x1_2(rd(A,A)),x1_2(rd(A,A)))),rd(A,A))),tuple(x1(rd(A,A)),x1_2(rd(A,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[248]),312]),
[iquote('back_demod(248),demod([312])')] ).
cnf(457,plain,
equal(ld(rd(rd(A,ld(ld(B,ld(B,B)),ld(C,A))),B),C),ld(ld(B,ld(B,B)),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[80]),312,312]),
[iquote('back_demod(80),demod([312,312])')] ).
cnf(486,plain,
equal(ld(ld(A,ld(A,A)),ld(ld(A,ld(A,A)),rd(B,B))),ld(ld(A,ld(A,A)),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[165,457]),8,340]),
[iquote('para(165,457),demod([8,340])')] ).
cnf(497,plain,
equal(rd(A,A),ld(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[168,486]),168,168,168,168,168,168,168,168]),
[iquote('para(168,486),demod([168,168,168,168,168,168,168,168])')] ).
cnf(498,plain,
equal(ld(A,A),rd(B,B)),
inference(flip,[status(thm),theory(equality)],[497]),
[iquote('flip(497)')] ).
cnf(509,plain,
equal(ld(ld(A,ld(A,A)),rd(B,B)),A),
inference(para,[status(thm),theory(equality)],[498,365]),
[iquote('para(498,365)')] ).
cnf(510,plain,
~ equal(tuple(x1(rd(A,A)),x1_2(rd(A,A))),tuple(x1(rd(A,A)),x1_2(rd(A,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[368]),509]),
[iquote('back_demod(368),demod([509])')] ).
cnf(511,plain,
$false,
inference(conflict,[status(thm)],[510]),
[iquote('xx_conflict(510)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP658-10 : TPTP v8.1.0. Released v8.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n012.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 : Tue Jun 14 02:00:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.46 ----- EQP 0.9e, May 2009 -----
% 0.74/1.46 The job began on n012.cluster.edu, Tue Jun 14 02:00:11 2022
% 0.74/1.46 The command was "./eqp09e".
% 0.74/1.46
% 0.74/1.46 set(prolog_style_variables).
% 0.74/1.46 set(lrpo).
% 0.74/1.46 set(basic_paramod).
% 0.74/1.46 set(functional_subsume).
% 0.74/1.46 set(ordered_paramod).
% 0.74/1.46 set(prime_paramod).
% 0.74/1.46 set(para_pairs).
% 0.74/1.46 assign(pick_given_ratio,4).
% 0.74/1.46 clear(print_kept).
% 0.74/1.46 clear(print_new_demod).
% 0.74/1.46 clear(print_back_demod).
% 0.74/1.46 clear(print_given).
% 0.74/1.46 assign(max_mem,64000).
% 0.74/1.46 end_of_commands.
% 0.74/1.46
% 0.74/1.46 Usable:
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Sos:
% 0.74/1.46 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.74/1.46 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.74/1.46 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.74/1.46 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.74/1.46 0 (wt=-1) [] mult(mult(A,mult(B,B)),C) = mult(mult(A,B),mult(B,C)).
% 0.74/1.46 0 (wt=-1) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Demodulators:
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Passive:
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Starting to process input.
% 0.74/1.46
% 0.74/1.46 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.46 1 is a new demodulator.
% 0.74/1.46
% 0.74/1.46 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.46 2 is a new demodulator.
% 0.74/1.46
% 0.74/1.46 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.46 3 is a new demodulator.
% 0.74/1.46
% 0.74/1.46 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.46 4 is a new demodulator.
% 0.74/1.46
% 0.74/1.46 ** KEPT: 5 (wt=15) [] mult(mult(A,mult(B,B)),C) = mult(mult(A,B),mult(B,C)).
% 0.74/1.46 5 is a new demodulator.
% 0.74/1.46
% 0.74/1.46 ** KEPT: 6 (wt=15) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 0.74/1.46 ---------------- PROOF FOUND ----------------
% 0.74/1.46 % SZS status Unsatisfiable
% 0.74/1.46
% 0.74/1.46
% 0.74/1.46 After processing input:
% 0.74/1.46
% 0.74/1.46 Usable:
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Sos:
% 0.74/1.46 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.46 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.46 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.46 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.46 5 (wt=15) [] mult(mult(A,mult(B,B)),C) = mult(mult(A,B),mult(B,C)).
% 0.74/1.46 6 (wt=15) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Demodulators:
% 0.74/1.46 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.46 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.46 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.46 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.46 5 (wt=15) [] mult(mult(A,mult(B,B)),C) = mult(mult(A,B),mult(B,C)).
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 Passive:
% 0.74/1.46 end_of_list.
% 0.74/1.46
% 0.74/1.46 UNIT CONFLICT from 510 and x=x at 0.36 seconds.
% 0.74/1.46
% 0.74/1.46 ---------------- PROOF ----------------
% 0.74/1.46 % SZS output start Refutation
% See solution above
% 0.74/1.46 ------------ end of proof -------------
% 0.74/1.46
% 0.74/1.46
% 0.74/1.46 ------------- memory usage ------------
% 0.74/1.46 Memory dynamically allocated (tp_alloc): 18554.
% 0.74/1.46 type (bytes each) gets frees in use avail bytes
% 0.74/1.46 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.46 term ( 16) 1152425 987957 164468 6262 3333.2 K
% 0.74/1.46 gen_ptr ( 8) 1358663 30408 1328255 61 10377.5 K
% 0.74/1.46 context ( 808) 128025 128023 2 36 30.0 K
% 0.74/1.46 trail ( 12) 55503 55503 0 6 0.1 K
% 0.74/1.46 bt_node ( 68) 9120 9117 3 84 5.8 K
% 0.74/1.46 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.46 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.46 ac_match_free_vars_pos (4020)
% 0.74/1.46 0 0 0 0 0.0 K
% 0.74/1.46 discrim ( 12) 189459 19552 169907 44 1991.6 K
% 0.74/1.46 flat ( 40) 921204 921204 0 42327 1653.4 K
% 0.74/1.46 discrim_pos ( 12) 7908 7908 0 1 0.0 K
% 0.74/1.46 fpa_head ( 12) 18238 0 18238 0 213.7 K
% 0.74/1.46 fpa_tree ( 28) 6615 6615 0 161 4.4 K
% 0.74/1.46 fpa_pos ( 36) 904 904 0 1 0.0 K
% 0.74/1.46 literal ( 12) 1583 1073 510 0 6.0 K
% 0.74/1.46 clause ( 24) 1583 1073 510 0 12.0 K
% 0.74/1.46 list ( 12) 454 397 57 2 0.7 K
% 0.74/1.46 list_pos ( 20) 2580 1559 1021 7 20.1 K
% 0.74/1.46 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.46
% 0.74/1.46 -------------- statistics -------------
% 0.74/1.46 Clauses input 6
% 0.74/1.46 Usable input 0
% 0.74/1.46 Sos input 6
% 0.74/1.46 Demodulators input 0
% 0.74/1.46 Passive input 0
% 0.74/1.46
% 0.74/1.46 Processed BS (before search) 6
% 0.74/1.46 Forward subsumed BS 0
% 0.74/1.46 Kept BS 6
% 0.74/1.46 New demodulators BS 5
% 0.74/1.46 Back demodulated BS 0
% 0.74/1.46
% 0.74/1.46 Clauses or pairs given 818
% 0.74/1.46 Clauses generated 1069
% 0.74/1.46 Forward subsumed 565
% 0.74/1.46 Deleted by weight 0
% 0.74/1.46 Deleted by variable count 0
% 0.74/1.46 Kept 504
% 0.74/1.46 New demodulators 390
% 0.74/1.46 Back demodulated 325
% 0.74/1.46 Ordered paramod prunes 0
% 0.74/1.46 Basic paramod prunes 2335
% 0.74/1.46 Prime paramod prunes 229
% 0.74/1.46 Semantic prunes 0
% 0.74/1.46
% 0.74/1.46 Rewrite attmepts 112235
% 0.74/1.46 Rewrites 7607
% 0.74/1.46
% 0.74/1.46 FPA overloads 0
% 0.74/1.46 FPA underloads 0
% 0.74/1.46
% 0.74/1.46 Usable size 0
% 0.74/1.46 Sos size 184
% 0.74/1.46 Demodulators size 144
% 0.74/1.46 Passive size 0
% 0.74/1.46 Disabled size 325
% 0.74/1.46
% 0.74/1.46 Proofs found 1
% 0.74/1.46
% 0.74/1.46 ----------- times (seconds) ----------- Tue Jun 14 02:00:11 2022
% 0.74/1.46
% 0.74/1.46 user CPU time 0.36 (0 hr, 0 min, 0 sec)
% 0.74/1.46 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.74/1.46 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.46 input time 0.00
% 0.74/1.46 paramodulation time 0.01
% 0.74/1.46 demodulation time 0.06
% 0.74/1.46 orient time 0.01
% 0.74/1.46 weigh time 0.00
% 0.74/1.46 forward subsume time 0.00
% 0.74/1.46 back demod find time 0.04
% 0.74/1.46 conflict time 0.00
% 0.74/1.46 LRPO time 0.01
% 0.74/1.46 store clause time 0.22
% 0.74/1.46 disable clause time 0.00
% 0.74/1.46 prime paramod time 0.00
% 0.74/1.46 semantics time 0.00
% 0.74/1.46
% 0.74/1.46 EQP interrupted
%------------------------------------------------------------------------------