TSTP Solution File: GRP687-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP687-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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:53 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 9 RR)
% Number of literals : 57 ( 0 equ; 8 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 114 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP687-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP687-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP687-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP687-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP687-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,mult(A,B)),C),mult(mult(A,A),mult(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
~ equal(mult(mult(a,mult(b,b)),c),mult(a,mult(b,mult(b,c)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(16,plain,
equal(mult(mult(A,B),C),mult(mult(A,A),mult(ld(A,B),C))),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(17,plain,
equal(mult(mult(A,A),mult(ld(A,B),C)),mult(mult(A,B),C)),
inference(flip,[status(thm),theory(equality)],[16]),
[iquote('flip(16)')] ).
cnf(18,plain,
equal(ld(mult(A,mult(A,B)),mult(mult(A,A),mult(B,C))),C),
inference(para,[status(thm),theory(equality)],[7,2]),
[iquote('para(7,2)')] ).
cnf(20,plain,
equal(rd(mult(mult(A,A),mult(B,C)),C),mult(A,mult(A,B))),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(21,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,5]),5]),
[iquote('para(7,5),demod([5])')] ).
cnf(22,plain,
equal(rd(mult(A,mult(A,mult(B,C))),C),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),21]),
[iquote('back_demod(20),demod([21])')] ).
cnf(24,plain,
equal(ld(mult(A,mult(A,B)),mult(A,mult(A,mult(B,C)))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),21]),
[iquote('back_demod(18),demod([21])')] ).
cnf(25,plain,
equal(mult(mult(A,B),C),mult(A,mult(A,mult(ld(A,B),C)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),21]),1]),
[iquote('back_demod(17),demod([21]),flip(1)')] ).
cnf(27,plain,
~ equal(mult(a,mult(a,mult(ld(a,mult(b,b)),c))),mult(a,mult(b,mult(b,c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),25]),
[iquote('back_demod(8),demod([25])')] ).
cnf(29,plain,
equal(rd(mult(A,mult(A,B)),B),mult(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,22]),5]),
[iquote('para(6,22),demod([5])')] ).
cnf(30,plain,
equal(rd(mult(A,B),ld(A,B)),mult(A,A)),
inference(para,[status(thm),theory(equality)],[1,29]),
[iquote('para(1,29)')] ).
cnf(34,plain,
equal(ld(mult(A,mult(A,B)),mult(A,mult(A,C))),ld(B,C)),
inference(para,[status(thm),theory(equality)],[1,24]),
[iquote('para(1,24)')] ).
cnf(35,plain,
equal(mult(A,mult(A,mult(ld(A,B),ld(mult(A,B),C)))),C),
inference(para,[status(thm),theory(equality)],[25,1]),
[iquote('para(25,1)')] ).
cnf(36,plain,
equal(mult(A,mult(A,mult(ld(A,ld(A,B)),C))),mult(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,25]),1]),
[iquote('para(1,25),flip(1)')] ).
cnf(39,plain,
equal(rd(A,ld(B,ld(B,A))),mult(B,B)),
inference(para,[status(thm),theory(equality)],[1,30]),
[iquote('para(1,30)')] ).
cnf(40,plain,
equal(mult(A,mult(A,mult(ld(A,unit),B))),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,25]),1]),
[iquote('para(5,25),flip(1)')] ).
cnf(42,plain,
equal(mult(A,mult(A,B)),mult(A,ld(ld(A,unit),B))),
inference(para,[status(thm),theory(equality)],[1,40]),
[iquote('para(1,40)')] ).
cnf(45,plain,
equal(mult(A,ld(ld(A,unit),mult(ld(A,ld(A,B)),C))),mult(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[36]),42]),
[iquote('back_demod(36),demod([42])')] ).
cnf(46,plain,
equal(mult(A,ld(ld(A,unit),mult(ld(A,B),ld(mult(A,B),C)))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),42]),
[iquote('back_demod(35),demod([42])')] ).
cnf(47,plain,
equal(ld(mult(A,ld(ld(A,unit),B)),mult(A,ld(ld(A,unit),C))),ld(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[34]),42,42]),
[iquote('back_demod(34),demod([42,42])')] ).
cnf(50,plain,
~ equal(mult(a,ld(ld(a,unit),mult(ld(a,mult(b,b)),c))),mult(a,mult(b,ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[27]),42,42]),
[iquote('back_demod(27),demod([42,42])')] ).
cnf(52,plain,
equal(mult(mult(A,B),C),mult(A,ld(ld(A,unit),mult(ld(A,B),C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),42]),
[iquote('back_demod(25),demod([42])')] ).
cnf(53,plain,
equal(mult(A,ld(ld(A,unit),unit)),mult(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,42]),1]),
[iquote('para(5,42),flip(1)')] ).
cnf(54,plain,
equal(ld(ld(A,unit),unit),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[53,2]),2]),1]),
[iquote('para(53,2),demod([2]),flip(1)')] ).
cnf(55,plain,
equal(mult(ld(A,unit),A),unit),
inference(para,[status(thm),theory(equality)],[54,1]),
[iquote('para(54,1)')] ).
cnf(57,plain,
equal(rd(unit,A),ld(A,unit)),
inference(para,[status(thm),theory(equality)],[55,4]),
[iquote('para(55,4)')] ).
cnf(59,plain,
equal(mult(A,A),ld(ld(A,ld(A,unit)),unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,39]),1]),
[iquote('para(57,39),flip(1)')] ).
cnf(60,plain,
~ equal(mult(a,ld(ld(a,unit),mult(ld(a,ld(ld(b,ld(b,unit)),unit)),c))),mult(a,mult(b,ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[50]),59]),
[iquote('back_demod(50),demod([59])')] ).
cnf(66,plain,
equal(mult(A,B),ld(ld(A,unit),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,2]),2]),1]),
[iquote('para(42,2),demod([2]),flip(1)')] ).
cnf(69,plain,
~ equal(ld(ld(a,unit),ld(ld(a,unit),ld(ld(ld(a,ld(ld(b,ld(b,unit)),unit)),unit),c))),ld(ld(a,unit),ld(ld(b,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[60]),66,66,66,66]),
[iquote('back_demod(60),demod([66,66,66,66])')] ).
cnf(70,plain,
equal(ld(ld(A,ld(A,unit)),unit),ld(ld(A,unit),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[59]),66]),1]),
[iquote('back_demod(59),demod([66]),flip(1)')] ).
cnf(71,plain,
~ equal(ld(ld(a,unit),ld(ld(a,unit),ld(ld(ld(a,ld(ld(b,unit),b)),unit),c))),ld(ld(a,unit),ld(ld(b,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[69]),70]),
[iquote('back_demod(69),demod([70])')] ).
cnf(76,plain,
equal(ld(ld(ld(ld(A,unit),B),unit),C),ld(ld(A,unit),ld(ld(A,unit),ld(ld(ld(A,B),unit),C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[52]),66,66,66,66]),
[iquote('back_demod(52),demod([66,66,66,66])')] ).
cnf(80,plain,
equal(ld(ld(ld(A,unit),ld(ld(A,unit),B)),ld(ld(A,unit),ld(ld(A,unit),C))),ld(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),66,66]),
[iquote('back_demod(47),demod([66,66])')] ).
cnf(81,plain,
equal(ld(ld(A,unit),ld(ld(A,unit),ld(ld(ld(A,B),unit),ld(ld(ld(A,unit),B),C)))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),66,66,66]),
[iquote('back_demod(46),demod([66,66,66])')] ).
cnf(82,plain,
equal(ld(ld(A,unit),ld(ld(A,unit),ld(ld(ld(A,ld(A,B)),unit),C))),ld(ld(B,unit),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[45]),66,66,66]),
[iquote('back_demod(45),demod([66,66,66])')] ).
cnf(87,plain,
equal(ld(A,ld(ld(A,unit),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2]),66]),
[iquote('back_demod(2),demod([66])')] ).
cnf(88,plain,
equal(ld(ld(A,unit),ld(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),66]),
[iquote('back_demod(1),demod([66])')] ).
cnf(144,plain,
equal(ld(ld(A,ld(A,B)),ld(A,ld(A,C))),ld(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[54,80]),54,54,54]),
[iquote('para(54,80),demod([54,54,54])')] ).
cnf(181,plain,
equal(ld(ld(ld(A,B),unit),ld(ld(ld(A,B),unit),ld(ld(ld(ld(A,B),ld(ld(ld(A,unit),B),C)),unit),D))),ld(A,ld(A,ld(ld(C,unit),D)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[81,82]),54,54,76]),1]),
[iquote('para(81,82),demod([54,54,76]),flip(1)')] ).
cnf(196,plain,
equal(ld(ld(ld(A,unit),B),C),ld(ld(A,B),ld(A,ld(A,C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[87,144]),1]),
[iquote('para(87,144),flip(1)')] ).
cnf(198,plain,
equal(ld(ld(ld(A,ld(A,B)),unit),C),ld(A,ld(A,ld(ld(B,unit),C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[181]),196,82]),
[iquote('back_demod(181),demod([196,82])')] ).
cnf(207,plain,
equal(ld(ld(A,ld(A,B)),ld(A,C)),ld(B,ld(ld(A,unit),C))),
inference(para,[status(thm),theory(equality)],[87,144]),
[iquote('para(87,144)')] ).
cnf(210,plain,
equal(ld(ld(A,ld(A,B)),unit),ld(B,ld(ld(A,unit),A))),
inference(para,[status(thm),theory(equality)],[9,207]),
[iquote('para(9,207)')] ).
cnf(211,plain,
equal(ld(ld(A,ld(ld(B,unit),B)),C),ld(B,ld(B,ld(ld(A,unit),C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[198]),210]),
[iquote('back_demod(198),demod([210])')] ).
cnf(212,plain,
~ equal(ld(ld(a,unit),ld(ld(a,unit),ld(ld(b,ld(b,a)),c))),ld(ld(a,unit),ld(ld(b,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[71]),211,54]),
[iquote('back_demod(71),demod([211,54])')] ).
cnf(266,plain,
equal(ld(ld(A,ld(A,B)),C),ld(B,ld(ld(A,unit),ld(ld(A,unit),C)))),
inference(para,[status(thm),theory(equality)],[87,207]),
[iquote('para(87,207)')] ).
cnf(268,plain,
~ equal(ld(ld(a,unit),ld(ld(b,unit),ld(ld(b,unit),c))),ld(ld(a,unit),ld(ld(b,unit),ld(ld(b,unit),c)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[212]),266,88]),
[iquote('back_demod(212),demod([266,88])')] ).
cnf(269,plain,
$false,
inference(conflict,[status(thm)],[268]),
[iquote('xx_conflict(268)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP687-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n024.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 : Mon Jun 13 12:44:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.09 ----- EQP 0.9e, May 2009 -----
% 0.68/1.09 The job began on n024.cluster.edu, Mon Jun 13 12:44:49 2022
% 0.68/1.09 The command was "./eqp09e".
% 0.68/1.09
% 0.68/1.09 set(prolog_style_variables).
% 0.68/1.09 set(lrpo).
% 0.68/1.09 set(basic_paramod).
% 0.68/1.09 set(functional_subsume).
% 0.68/1.09 set(ordered_paramod).
% 0.68/1.09 set(prime_paramod).
% 0.68/1.09 set(para_pairs).
% 0.68/1.09 assign(pick_given_ratio,4).
% 0.68/1.09 clear(print_kept).
% 0.68/1.09 clear(print_new_demod).
% 0.68/1.09 clear(print_back_demod).
% 0.68/1.09 clear(print_given).
% 0.68/1.09 assign(max_mem,64000).
% 0.68/1.09 end_of_commands.
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.68/1.09 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.68/1.09 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.68/1.09 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.68/1.09 0 (wt=-1) [] mult(A,unit) = A.
% 0.68/1.09 0 (wt=-1) [] mult(unit,A) = A.
% 0.68/1.09 0 (wt=-1) [] mult(mult(A,A),mult(B,C)) = mult(mult(A,mult(A,B)),C).
% 0.68/1.09 0 (wt=-1) [] -(mult(a,mult(b,mult(b,c))) = mult(mult(a,mult(b,b)),c)).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Starting to process input.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.68/1.09 1 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.68/1.09 2 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.68/1.09 3 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.68/1.09 4 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.68/1.09 5 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.68/1.09 6 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(A,mult(A,B)),C) = mult(mult(A,A),mult(B,C)).
% 0.68/1.09 7 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 8 (wt=15) [flip(1)] -(mult(mult(a,mult(b,b)),c) = mult(a,mult(b,mult(b,c)))).
% 0.68/1.09 ---------------- PROOF FOUND ----------------
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 After processing input:
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 5 (wt=5) [] mult(A,unit) = A.
% 0.68/1.09 6 (wt=5) [] mult(unit,A) = A.
% 0.68/1.09 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.68/1.09 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.68/1.09 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.68/1.09 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.68/1.09 7 (wt=15) [flip(1)] mult(mult(A,mult(A,B)),C) = mult(mult(A,A),mult(B,C)).
% 0.68/1.09 8 (wt=15) [flip(1)] -(mult(mult(a,mult(b,b)),c) = mult(a,mult(b,mult(b,c)))).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.68/1.09 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.68/1.09 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.68/1.09 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.68/1.09 5 (wt=5) [] mult(A,unit) = A.
% 0.68/1.09 6 (wt=5) [] mult(unit,A) = A.
% 0.68/1.09 7 (wt=15) [flip(1)] mult(mult(A,mult(A,B)),C) = mult(mult(A,A),mult(B,C)).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 UNIT CONFLICT from 268 and x=x at 0.03 seconds.
% 0.68/1.09
% 0.68/1.09 ---------------- PROOF ----------------
% 0.68/1.09 % SZS output start Refutation
% See solution above
% 0.68/1.09 ------------ end of proof -------------
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 ------------- memory usage ------------
% 0.68/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.68/1.09 type (bytes each) gets frees in use avail bytes
% 0.68/1.09 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.68/1.09 term ( 16) 40227 34953 5274 38 102.7 K
% 0.68/1.09 gen_ptr ( 8) 34616 12028 22588 56 176.9 K
% 0.68/1.09 context ( 808) 29598 29596 2 4 4.7 K
% 0.68/1.09 trail ( 12) 1443 1443 0 4 0.0 K
% 0.68/1.09 bt_node ( 68) 10178 10175 3 18 1.4 K
% 0.68/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_free_vars_pos (4020)
% 0.68/1.09 0 0 0 0 0.0 K
% 0.68/1.09 discrim ( 12) 5163 3475 1688 237 22.6 K
% 0.68/1.09 flat ( 40) 71854 71854 0 37 1.4 K
% 0.68/1.09 discrim_pos ( 12) 3027 3027 0 1 0.0 K
% 0.68/1.09 fpa_head ( 12) 2056 0 2056 0 24.1 K
% 0.68/1.09 fpa_tree ( 28) 1269 1269 0 57 1.6 K
% 0.68/1.09 fpa_pos ( 36) 495 495 0 1 0.0 K
% 0.68/1.09 literal ( 12) 1346 1078 268 0 3.1 K
% 0.68/1.09 clause ( 24) 1346 1078 268 0 6.3 K
% 0.68/1.09 list ( 12) 287 230 57 2 0.7 K
% 0.68/1.09 list_pos ( 20) 1409 897 512 27 10.5 K
% 0.68/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.68/1.09
% 0.68/1.09 -------------- statistics -------------
% 0.68/1.09 Clauses input 8
% 0.68/1.09 Usable input 0
% 0.68/1.09 Sos input 8
% 0.68/1.09 Demodulators input 0
% 0.68/1.09 Passive input 0
% 0.68/1.09
% 0.68/1.09 Processed BS (before search) 8
% 0.68/1.09 Forward subsumed BS 0
% 0.68/1.09 Kept BS 8
% 0.68/1.09 New demodulators BS 7
% 0.68/1.09 Back demodulated BS 0
% 0.68/1.09
% 0.68/1.09 Clauses or pairs given 1396
% 0.68/1.09 Clauses generated 983
% 0.68/1.09 Forward subsumed 723
% 0.68/1.09 Deleted by weight 0
% 0.68/1.09 Deleted by variable count 0
% 0.68/1.09 Kept 260
% 0.68/1.09 New demodulators 221
% 0.68/1.09 Back demodulated 181
% 0.68/1.09 Ordered paramod prunes 0
% 0.68/1.09 Basic paramod prunes 4105
% 0.68/1.09 Prime paramod prunes 174
% 0.68/1.09 Semantic prunes 0
% 0.68/1.09
% 0.68/1.09 Rewrite attmepts 15970
% 0.68/1.09 Rewrites 2802
% 0.68/1.09
% 0.68/1.09 FPA overloads 0
% 0.68/1.09 FPA underloads 0
% 0.68/1.09
% 0.68/1.09 Usable size 0
% 0.68/1.09 Sos size 86
% 0.68/1.09 Demodulators size 66
% 0.68/1.09 Passive size 0
% 0.68/1.09 Disabled size 181
% 0.68/1.09
% 0.68/1.09 Proofs found 1
% 0.68/1.09
% 0.68/1.09 ----------- times (seconds) ----------- Mon Jun 13 12:44:49 2022
% 0.68/1.09
% 0.68/1.09 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.68/1.09 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.68/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.68/1.09 input time 0.00
% 0.68/1.09 paramodulation time 0.01
% 0.68/1.09 demodulation time 0.00
% 0.68/1.09 orient time 0.00
% 0.68/1.09 weigh time 0.00
% 0.68/1.09 forward subsume time 0.00
% 0.68/1.09 back demod find time 0.00
% 0.68/1.09 conflict time 0.00
% 0.68/1.09 LRPO time 0.00
% 0.68/1.09 store clause time 0.00
% 0.68/1.09 disable clause time 0.00
% 0.68/1.09 prime paramod time 0.00
% 0.68/1.09 semantics time 0.00
% 0.68/1.09
% 0.68/1.09 EQP interrupted
%------------------------------------------------------------------------------