TSTP Solution File: ROB022-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ROB022-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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 20:51:40 EDT 2022
% Result : Unsatisfiable 0.79s 1.18s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of clauses : 68 ( 68 unt; 0 nHn; 14 RR)
% Number of literals : 68 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('ROB022-1.p',unknown),
[] ).
cnf(2,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('ROB022-1.p',unknown),
[] ).
cnf(3,plain,
equal(negate(add(negate(add(A,B)),negate(add(A,negate(B))))),A),
file('ROB022-1.p',unknown),
[] ).
cnf(4,plain,
equal(add(c,negate(c)),c),
file('ROB022-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))),b),
file('ROB022-1.p',unknown),
[] ).
cnf(6,plain,
equal(add(negate(c),c),c),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(7,plain,
equal(add(c,add(negate(c),A)),add(c,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,2]),1]),
[iquote('para(4,2),flip(1)')] ).
cnf(11,plain,
equal(add(c,add(A,negate(c))),add(c,A)),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(12,plain,
equal(add(negate(c),add(A,c)),add(c,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,7]),2]),
[iquote('para(1,7),demod([2])')] ).
cnf(13,plain,
equal(add(negate(c),add(c,A)),add(c,A)),
inference(para,[status(thm),theory(equality)],[1,12]),
[iquote('para(1,12)')] ).
cnf(14,plain,
equal(negate(add(negate(add(A,B)),negate(add(B,negate(A))))),B),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(15,plain,
equal(negate(add(negate(add(A,B)),negate(add(negate(B),A)))),A),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(17,plain,
equal(negate(add(negate(add(A,add(B,C))),negate(add(A,add(B,negate(C)))))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),2]),
[iquote('para(2,3),demod([2])')] ).
cnf(19,plain,
equal(negate(add(negate(add(A,add(negate(add(B,C)),negate(add(B,negate(C)))))),negate(add(A,B)))),A),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(22,plain,
equal(negate(add(negate(add(c,c)),negate(c))),c),
inference(para,[status(thm),theory(equality)],[4,3]),
[iquote('para(4,3)')] ).
cnf(24,plain,
~ equal(add(negate(add(negate(b),a)),negate(add(negate(a),negate(b)))),b),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(36,plain,
equal(negate(add(negate(add(A,B)),negate(add(negate(A),B)))),B),
inference(para,[status(thm),theory(equality)],[1,14]),
[iquote('para(1,14)')] ).
cnf(63,plain,
~ equal(add(negate(add(negate(b),a)),negate(add(negate(b),negate(a)))),b),
inference(para,[status(thm),theory(equality)],[1,24]),
[iquote('para(1,24)')] ).
cnf(71,plain,
equal(negate(add(negate(add(c,A)),negate(add(negate(c),add(A,negate(c)))))),add(negate(c),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,14]),2]),
[iquote('para(7,14),demod([2])')] ).
cnf(77,plain,
equal(negate(add(negate(add(c,A)),negate(add(A,add(negate(c),negate(c)))))),add(A,negate(c))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,14]),2]),
[iquote('para(11,14),demod([2])')] ).
cnf(108,plain,
equal(negate(add(negate(add(A,add(c,c))),negate(add(c,A)))),add(A,c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,15]),2]),
[iquote('para(12,15),demod([2])')] ).
cnf(138,plain,
equal(negate(add(negate(add(A,c)),negate(add(A,add(negate(c),negate(c)))))),add(A,negate(c))),
inference(para,[status(thm),theory(equality)],[6,17]),
[iquote('para(6,17)')] ).
cnf(142,plain,
equal(negate(add(negate(add(A,add(negate(add(c,c)),negate(c)))),negate(add(A,c)))),A),
inference(para,[status(thm),theory(equality)],[22,3]),
[iquote('para(22,3)')] ).
cnf(143,plain,
equal(negate(add(negate(add(negate(add(c,c)),c)),c)),negate(add(c,c))),
inference(para,[status(thm),theory(equality)],[22,3]),
[iquote('para(22,3)')] ).
cnf(146,plain,
equal(negate(add(c,negate(add(negate(add(c,c)),c)))),negate(add(c,c))),
inference(para,[status(thm),theory(equality)],[1,143]),
[iquote('para(1,143)')] ).
cnf(163,plain,
equal(negate(add(negate(add(c,c)),c)),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,15]),12]),
[iquote('para(22,15),demod([12])')] ).
cnf(164,plain,
equal(negate(add(c,c)),negate(c)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[146]),163,4]),1]),
[iquote('back_demod(146),demod([163,4]),flip(1)')] ).
cnf(170,plain,
equal(negate(add(negate(add(A,add(negate(c),negate(c)))),negate(add(A,c)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[142]),164]),
[iquote('back_demod(142),demod([164])')] ).
cnf(181,plain,
equal(negate(add(negate(add(A,add(c,c))),negate(add(A,negate(c))))),A),
inference(para,[status(thm),theory(equality)],[164,3]),
[iquote('para(164,3)')] ).
cnf(189,plain,
equal(negate(add(negate(add(c,add(c,c))),negate(c))),c),
inference(para,[status(thm),theory(equality)],[4,181]),
[iquote('para(4,181)')] ).
cnf(197,plain,
equal(negate(add(negate(add(c,add(negate(add(negate(c),A)),negate(add(negate(c),negate(A)))))),negate(c))),c),
inference(para,[status(thm),theory(equality)],[4,19]),
[iquote('para(4,19)')] ).
cnf(206,plain,
equal(negate(add(negate(add(negate(c),add(negate(add(A,add(c,B))),negate(add(A,add(c,negate(B))))))),negate(add(c,A)))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,19]),2,2]),
[iquote('para(12,19),demod([2,2])')] ).
cnf(207,plain,
equal(negate(add(negate(add(negate(c),add(negate(add(c,add(A,B))),negate(add(c,add(A,negate(B))))))),negate(add(c,A)))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,19]),2,2]),
[iquote('para(13,19),demod([2,2])')] ).
cnf(302,plain,
equal(add(c,c),c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[164,108]),189]),1]),
[iquote('para(164,108),demod([189]),flip(1)')] ).
cnf(306,plain,
equal(add(c,add(c,A)),add(c,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[302,2]),1]),
[iquote('para(302,2),flip(1)')] ).
cnf(355,plain,
equal(negate(add(negate(add(c,A)),negate(add(negate(add(c,A)),c)))),c),
inference(para,[status(thm),theory(equality)],[306,15]),
[iquote('para(306,15)')] ).
cnf(380,plain,
equal(negate(add(negate(add(A,c)),negate(add(negate(add(c,A)),c)))),c),
inference(para,[status(thm),theory(equality)],[1,355]),
[iquote('para(1,355)')] ).
cnf(392,plain,
equal(negate(add(negate(add(negate(add(c,A)),c)),negate(add(A,c)))),c),
inference(para,[status(thm),theory(equality)],[1,380]),
[iquote('para(1,380)')] ).
cnf(540,plain,
equal(negate(add(negate(add(A,add(negate(c),negate(c)))),negate(add(c,A)))),A),
inference(para,[status(thm),theory(equality)],[1,170]),
[iquote('para(1,170)')] ).
cnf(541,plain,
equal(add(A,negate(c)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,170]),138]),
[iquote('para(1,170),demod([138])')] ).
cnf(542,plain,
equal(negate(add(negate(A),negate(add(c,A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[540]),541,541]),
[iquote('back_demod(540),demod([541,541])')] ).
cnf(552,plain,
equal(negate(negate(add(c,add(negate(add(negate(c),A)),negate(add(negate(c),negate(A))))))),c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[197]),541]),
[iquote('back_demod(197),demod([541])')] ).
cnf(559,plain,
equal(negate(add(negate(add(c,A)),negate(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[77]),541,541,541]),
[iquote('back_demod(77),demod([541,541,541])')] ).
cnf(560,plain,
equal(add(negate(c),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[71]),541,36]),1]),
[iquote('back_demod(71),demod([541,36]),flip(1)')] ).
cnf(561,plain,
equal(negate(negate(add(c,add(negate(A),negate(negate(A)))))),c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[552]),560,560]),
[iquote('back_demod(552),demod([560,560])')] ).
cnf(563,plain,
equal(negate(add(c,add(A,negate(add(c,A))))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[207]),560,17,2]),
[iquote('back_demod(207),demod([560,17,2])')] ).
cnf(564,plain,
equal(negate(add(A,add(c,negate(add(c,A))))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[206]),560,17,2]),
[iquote('back_demod(206),demod([560,17,2])')] ).
cnf(571,plain,
equal(negate(negate(add(c,add(negate(negate(A)),negate(A))))),c),
inference(para,[status(thm),theory(equality)],[1,561]),
[iquote('para(1,561)')] ).
cnf(575,plain,
equal(negate(add(c,add(A,negate(add(A,c))))),negate(c)),
inference(para,[status(thm),theory(equality)],[1,563]),
[iquote('para(1,563)')] ).
cnf(581,plain,
equal(negate(add(A,add(c,negate(add(A,c))))),negate(c)),
inference(para,[status(thm),theory(equality)],[1,564]),
[iquote('para(1,564)')] ).
cnf(589,plain,
equal(negate(add(A,add(negate(add(A,c)),c))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,575]),2]),
[iquote('para(1,575),demod([2])')] ).
cnf(606,plain,
equal(negate(add(negate(add(A,c)),add(c,A))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,589]),2]),
[iquote('para(1,589),demod([2])')] ).
cnf(609,plain,
equal(negate(add(negate(A),negate(negate(A)))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[541,14]),560]),
[iquote('para(541,14),demod([560])')] ).
cnf(635,plain,
equal(negate(add(A,negate(A))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[542,609]),542]),
[iquote('para(542,609),demod([542])')] ).
cnf(637,plain,
equal(negate(add(negate(A),A)),negate(c)),
inference(para,[status(thm),theory(equality)],[1,635]),
[iquote('para(1,635)')] ).
cnf(659,plain,
equal(negate(add(negate(add(c,A)),add(negate(A),A))),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[559,635]),2]),
[iquote('para(559,635),demod([2])')] ).
cnf(660,plain,
equal(negate(negate(add(c,add(negate(A),A)))),add(negate(A),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[637,542]),560]),
[iquote('para(637,542),demod([560])')] ).
cnf(661,plain,
equal(add(negate(negate(A)),negate(A)),c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[571]),660]),
[iquote('back_demod(571),demod([660])')] ).
cnf(669,plain,
equal(add(negate(A),A),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[542,661]),542]),
[iquote('para(542,661),demod([542])')] ).
cnf(671,plain,
equal(negate(add(negate(add(c,A)),c)),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[659]),669]),
[iquote('back_demod(659),demod([669])')] ).
cnf(672,plain,
equal(negate(negate(add(A,c))),c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[392]),671,560]),
[iquote('back_demod(392),demod([671,560])')] ).
cnf(680,plain,
equal(add(c,negate(add(A,c))),c),
inference(para,[status(thm),theory(equality)],[672,669]),
[iquote('para(672,669)')] ).
cnf(681,plain,
equal(negate(add(A,c)),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[581]),680]),
[iquote('back_demod(581),demod([680])')] ).
cnf(684,plain,
equal(negate(add(c,A)),negate(c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[606]),681,560]),
[iquote('back_demod(606),demod([681,560])')] ).
cnf(685,plain,
equal(negate(negate(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[559]),684,560]),
[iquote('back_demod(559),demod([684,560])')] ).
cnf(761,plain,
equal(add(negate(add(A,B)),negate(add(A,negate(B)))),negate(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,685]),1]),
[iquote('para(3,685),flip(1)')] ).
cnf(763,plain,
~ equal(b,b),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[63]),761,685]),
[iquote('back_demod(63),demod([761,685])')] ).
cnf(764,plain,
$false,
inference(conflict,[status(thm)],[763]),
[iquote('xx_conflict(763)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ROB022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n021.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 : Thu Jun 9 13:56:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.79/1.18 ----- EQP 0.9e, May 2009 -----
% 0.79/1.18 The job began on n021.cluster.edu, Thu Jun 9 13:56:09 2022
% 0.79/1.18 The command was "./eqp09e".
% 0.79/1.18
% 0.79/1.18 set(prolog_style_variables).
% 0.79/1.18 set(lrpo).
% 0.79/1.18 set(basic_paramod).
% 0.79/1.18 set(functional_subsume).
% 0.79/1.18 set(ordered_paramod).
% 0.79/1.18 set(prime_paramod).
% 0.79/1.18 set(para_pairs).
% 0.79/1.18 assign(pick_given_ratio,4).
% 0.79/1.18 clear(print_kept).
% 0.79/1.18 clear(print_new_demod).
% 0.79/1.18 clear(print_back_demod).
% 0.79/1.18 clear(print_given).
% 0.79/1.18 assign(max_mem,64000).
% 0.79/1.18 end_of_commands.
% 0.79/1.18
% 0.79/1.18 Usable:
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Sos:
% 0.79/1.18 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.79/1.18 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.79/1.18 0 (wt=-1) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.79/1.18 0 (wt=-1) [] add(c,negate(c)) = c.
% 0.79/1.18 0 (wt=-1) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Demodulators:
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Passive:
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Starting to process input.
% 0.79/1.18
% 0.79/1.18 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.79/1.18 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.79/1.18
% 0.79/1.18 ** KEPT: 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.79/1.18 2 is a new demodulator.
% 0.79/1.18
% 0.79/1.18 ** KEPT: 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.79/1.18 3 is a new demodulator.
% 0.79/1.18
% 0.79/1.18 ** KEPT: 4 (wt=6) [] add(c,negate(c)) = c.
% 0.79/1.18 4 is a new demodulator.
% 0.79/1.18
% 0.79/1.18 ** KEPT: 5 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.79/1.18 ---------------- PROOF FOUND ----------------
% 0.79/1.18 % SZS status Unsatisfiable
% 0.79/1.18
% 0.79/1.18
% 0.79/1.18 After processing input:
% 0.79/1.18
% 0.79/1.18 Usable:
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Sos:
% 0.79/1.18 4 (wt=6) [] add(c,negate(c)) = c.
% 0.79/1.18 1 (wt=7) [] add(A,B) = add(B,A).
% 0.79/1.18 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.79/1.18 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.79/1.18 5 (wt=14) [] -(add(negate(add(a,negate(b))),negate(add(negate(a),negate(b)))) = b).
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Demodulators:
% 0.79/1.18 2 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.79/1.18 3 (wt=13) [] negate(add(negate(add(A,B)),negate(add(A,negate(B))))) = A.
% 0.79/1.18 4 (wt=6) [] add(c,negate(c)) = c.
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 Passive:
% 0.79/1.18 end_of_list.
% 0.79/1.18
% 0.79/1.18 UNIT CONFLICT from 763 and x=x at 0.06 seconds.
% 0.79/1.18
% 0.79/1.18 ---------------- PROOF ----------------
% 0.79/1.18 % SZS output start Refutation
% See solution above
% 0.79/1.18 ------------ end of proof -------------
% 0.79/1.18
% 0.79/1.18
% 0.79/1.18 ------------- memory usage ------------
% 0.79/1.18 Memory dynamically allocated (tp_alloc): 1464.
% 0.79/1.18 type (bytes each) gets frees in use avail bytes
% 0.79/1.18 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.79/1.18 term ( 16) 67199 52512 14687 49 284.8 K
% 0.79/1.18 gen_ptr ( 8) 97898 23233 74665 74 583.9 K
% 0.79/1.18 context ( 808) 68337 68335 2 4 4.7 K
% 0.79/1.18 trail ( 12) 8206 8206 0 5 0.1 K
% 0.79/1.18 bt_node ( 68) 26885 26883 2 17 1.3 K
% 0.79/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.18 ac_match_free_vars_pos (4020)
% 0.79/1.18 0 0 0 0 0.0 K
% 0.79/1.18 discrim ( 12) 9730 5398 4332 2161 76.1 K
% 0.79/1.18 flat ( 40) 141702 141702 0 36 1.4 K
% 0.79/1.18 discrim_pos ( 12) 3847 3847 0 1 0.0 K
% 0.79/1.18 fpa_head ( 12) 2075 0 2075 0 24.3 K
% 0.79/1.18 fpa_tree ( 28) 2559 2559 0 11 0.3 K
% 0.79/1.18 fpa_pos ( 36) 1345 1345 0 1 0.0 K
% 0.79/1.18 literal ( 12) 4284 3521 763 0 8.9 K
% 0.79/1.18 clause ( 24) 4284 3521 763 0 17.9 K
% 0.79/1.18 list ( 12) 642 585 57 5 0.7 K
% 0.79/1.18 list_pos ( 20) 3679 1926 1753 162 37.4 K
% 0.79/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.18
% 0.79/1.18 -------------- statistics -------------
% 0.79/1.18 Clauses input 5
% 0.79/1.18 Usable input 0
% 0.79/1.18 Sos input 5
% 0.79/1.18 Demodulators input 0
% 0.79/1.18 Passive input 0
% 0.79/1.18
% 0.79/1.18 Processed BS (before search) 6
% 0.79/1.18 Forward subsumed BS 1
% 0.79/1.18 Kept BS 5
% 0.79/1.18 New demodulators BS 3
% 0.79/1.18 Back demodulated BS 0
% 0.79/1.18
% 0.79/1.18 Clauses or pairs given 2454
% 0.79/1.18 Clauses generated 2532
% 0.79/1.18 Forward subsumed 1774
% 0.79/1.18 Deleted by weight 0
% 0.79/1.18 Deleted by variable count 0
% 0.79/1.18 Kept 758
% 0.79/1.18 New demodulators 580
% 0.79/1.18 Back demodulated 384
% 0.79/1.18 Ordered paramod prunes 0
% 0.79/1.18 Basic paramod prunes 11289
% 0.79/1.18 Prime paramod prunes 61
% 0.79/1.18 Semantic prunes 0
% 0.79/1.18
% 0.79/1.18 Rewrite attmepts 32520
% 0.79/1.18 Rewrites 3168
% 0.79/1.18
% 0.79/1.18 FPA overloads 0
% 0.79/1.18 FPA underloads 0
% 0.79/1.18
% 0.79/1.18 Usable size 0
% 0.79/1.18 Sos size 378
% 0.79/1.18 Demodulators size 233
% 0.79/1.18 Passive size 0
% 0.79/1.18 Disabled size 384
% 0.79/1.18
% 0.79/1.18 Proofs found 1
% 0.79/1.18
% 0.79/1.18 ----------- times (seconds) ----------- Thu Jun 9 13:56:09 2022
% 0.79/1.18
% 0.79/1.18 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.79/1.18 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.79/1.18 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.18 input time 0.00
% 0.79/1.18 paramodulation time 0.01
% 0.79/1.18 demodulation time 0.01
% 0.79/1.18 orient time 0.01
% 0.79/1.18 weigh time 0.00
% 0.79/1.18 forward subsume time 0.00
% 0.79/1.18 back demod find time 0.00
% 0.79/1.18 conflict time 0.00
% 0.79/1.18 LRPO time 0.01
% 0.79/1.18 store clause time 0.01
% 0.79/1.18 disable clause time 0.00
% 0.79/1.18 prime paramod time 0.00
% 0.79/1.18 semantics time 0.00
% 0.79/1.18
% 0.79/1.18 EQP interrupted
%------------------------------------------------------------------------------