TSTP Solution File: RNG020-7 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG020-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:25:31 EDT 2022
% Result : Unsatisfiable 0.71s 1.13s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 2 RR)
% Number of literals : 21 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG020-7.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG020-7.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG020-7.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG020-7.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG020-7.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG020-7.p',unknown),
[] ).
cnf(11,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
equal(add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(17,plain,
equal(additive_inverse(multiply(A,B)),multiply(additive_inverse(A),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(19,plain,
equal(add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),17]),
[iquote('back_demod(14),demod([17])')] ).
cnf(24,plain,
~ equal(add(associator(x,u,y),associator(x,v,y)),associator(x,add(u,v),y)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(32,plain,
equal(add(additive_inverse(A),add(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,11]),1]),1]),
[iquote('para(5,11),demod([1]),flip(1)')] ).
cnf(35,plain,
equal(add(additive_inverse(A),add(B,A)),B),
inference(para,[status(thm),theory(equality)],[10,32]),
[iquote('para(10,32)')] ).
cnf(36,plain,
equal(add(A,add(B,additive_inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,32]),11]),
[iquote('para(10,32),demod([11])')] ).
cnf(58,plain,
equal(add(multiply(A,B),add(C,multiply(additive_inverse(A),B))),C),
inference(para,[status(thm),theory(equality)],[17,36]),
[iquote('para(17,36)')] ).
cnf(86,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(A,D),C),add(multiply(additive_inverse(A),multiply(B,C)),multiply(additive_inverse(A),multiply(D,C))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,19]),9,9,8,11]),
[iquote('para(8,19),demod([9,9,8,11])')] ).
cnf(254,plain,
equal(multiply(multiply(A,B),C),add(multiply(A,multiply(B,C)),associator(A,B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,35]),17,7]),1]),
[iquote('para(19,35),demod([17,7]),flip(1)')] ).
cnf(285,plain,
equal(add(multiply(A,multiply(B,C)),add(associator(A,B,C),add(multiply(A,multiply(D,C)),add(associator(A,D,C),add(multiply(additive_inverse(A),multiply(B,C)),multiply(additive_inverse(A),multiply(D,C))))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),254,254,11,11]),
[iquote('back_demod(86),demod([254,254,11,11])')] ).
cnf(367,plain,
equal(add(multiply(A,B),add(C,add(D,multiply(additive_inverse(A),B)))),add(C,D)),
inference(para,[status(thm),theory(equality)],[11,58]),
[iquote('para(11,58)')] ).
cnf(368,plain,
equal(add(associator(A,B,C),associator(A,D,C)),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[285]),367,367]),
[iquote('back_demod(285),demod([367,367])')] ).
cnf(369,plain,
$false,
inference(conflict,[status(thm)],[368,24]),
[iquote('conflict(368,24)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG020-7 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.20/0.35 % DateTime : Mon May 30 07:40:10 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.44/1.07 ----- EQP 0.9e, May 2009 -----
% 0.44/1.07 The job began on n019.cluster.edu, Mon May 30 07:40:11 2022
% 0.44/1.07 The command was "./eqp09e".
% 0.44/1.07
% 0.44/1.07 set(prolog_style_variables).
% 0.44/1.07 set(lrpo).
% 0.44/1.07 set(basic_paramod).
% 0.44/1.07 set(functional_subsume).
% 0.44/1.07 set(ordered_paramod).
% 0.44/1.07 set(prime_paramod).
% 0.44/1.07 set(para_pairs).
% 0.44/1.07 assign(pick_given_ratio,4).
% 0.44/1.07 clear(print_kept).
% 0.44/1.07 clear(print_new_demod).
% 0.44/1.07 clear(print_back_demod).
% 0.44/1.07 clear(print_given).
% 0.44/1.07 assign(max_mem,64000).
% 0.44/1.07 end_of_commands.
% 0.44/1.07
% 0.44/1.07 Usable:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Sos:
% 0.44/1.07 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.44/1.07 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.44/1.07 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.44/1.07 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.44/1.07 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.44/1.07 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.44/1.07 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.44/1.07 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.44/1.07 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.44/1.07 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.44/1.07 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.44/1.07 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.44/1.07 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.44/1.07 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.44/1.07 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.44/1.07 0 (wt=-1) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.44/1.07 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.44/1.07 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.44/1.07 0 (wt=-1) [] multiply(A,add(B,additive_inverse(C))) = add(multiply(A,B),additive_inverse(multiply(A,C))).
% 0.44/1.07 0 (wt=-1) [] multiply(add(A,additive_inverse(B)),C) = add(multiply(A,C),additive_inverse(multiply(B,C))).
% 0.44/1.07 0 (wt=-1) [] multiply(additive_inverse(A),add(B,C)) = add(additive_inverse(multiply(A,B)),additive_inverse(multiply(A,C))).
% 0.44/1.07 0 (wt=-1) [] multiply(add(A,B),additive_inverse(C)) = add(additive_inverse(multiply(A,C)),additive_inverse(multiply(B,C))).
% 0.44/1.07 0 (wt=-1) [] -(associator(x,add(u,v),y) = add(associator(x,u,y),associator(x,v,y))).
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Demodulators:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Passive:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Starting to process input.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.44/1.07 1 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.44/1.07 2 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.44/1.07 3 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.44/1.07 4 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.44/1.07 5 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.44/1.07 6 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.44/1.07 7 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.44/1.07 8 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.44/1.07 9 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.44/1.07 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.44/1.07
% 0.44/1.07 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.44/1.07 11 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.44/1.07 12 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.44/1.07 13 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.44/1.07 14 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.44/1.07 15 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.44/1.07 16 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.44/1.07 17 is a new demodulator.
% 0.44/1.07 -> 17 back demodulating 15.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.71/1.13 18 is a new demodulator.
% 0.71/1.13 -> 17 back demodulating 14.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.71/1.13 19 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.71/1.13
% 0.71/1.13 ** KEPT: 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.71/1.13 clause forward subsumed: 0 (wt=9) [flip(21)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.71/1.13 clause forward subsumed: 0 (wt=17) [demod([8,17])] add(multiply(A,B),multiply(A,additive_inverse(C))) = add(multiply(A,B),multiply(additive_inverse(A),C)).
% 0.71/1.13 clause forward subsumed: 0 (wt=17) [demod([9,17])] add(multiply(A,C),multiply(additive_inverse(B),C)) = add(multiply(A,C),multiply(additive_inverse(B),C)).
% 0.71/1.13 clause forward subsumed: 0 (wt=19) [demod([8,17,17])] add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)).
% 0.71/1.13
% 0.71/1.13 ** KEPT: 22 (wt=19) [demod([9,17,17])] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.71/1.13
% 0.71/1.13 ** KEPT: 23 (wt=19) [flip(22)] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)) = add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 0.71/1.13 clause forward subsumed: 0 (wt=19) [flip(23)] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.71/1.13
% 0.71/1.13 ** KEPT: 24 (wt=16) [flip(1)] -(add(associator(x,u,y),associator(x,v,y)) = associator(x,add(u,v),y)).
% 0.71/1.13 ---------------- PROOF FOUND ----------------
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 After processing input:
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 1 (wt=5) [] add(additive_identity,A) = A.
% 0.71/1.13 2 (wt=5) [] add(A,additive_identity) = A.
% 0.71/1.13 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.71/1.13 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.71/1.13 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.71/1.13 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.71/1.13 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.71/1.13 10 (wt=7) [] add(A,B) = add(B,A).
% 0.71/1.13 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.71/1.13 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.71/1.13 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.71/1.13 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.71/1.13 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.71/1.13 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.71/1.13 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.71/1.13 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.71/1.13 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.71/1.13 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.71/1.13 24 (wt=16) [flip(1)] -(add(associator(x,u,y),associator(x,v,y)) = associator(x,add(u,v),y)).
% 0.71/1.13 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.71/1.13 22 (wt=19) [demod([9,17,17])] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.71/1.13 23 (wt=19) [flip(22)] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)) = add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 1 (wt=5) [] add(additive_identity,A) = A.
% 0.71/1.13 2 (wt=5) [] add(A,additive_identity) = A.
% 0.71/1.13 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.71/1.13 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.71/1.13 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.71/1.13 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.71/1.13 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.71/1.13 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.71/1.13 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.71/1.13 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.71/1.13 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.71/1.13 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.71/1.13 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.71/1.13 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.71/1.13 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.71/1.13 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 UNIT CONFLICT from 368 and 24 at 0.03 seconds.
% 0.71/1.13
% 0.71/1.13 ---------------- PROOF ----------------
% 0.71/1.13 % SZS output start Refutation
% See solution above
% 0.71/1.13 ------------ end of proof -------------
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 ------------- memory usage ------------
% 0.71/1.13 Memory dynamically allocated (tp_alloc): 976.
% 0.71/1.13 type (bytes each) gets frees in use avail bytes
% 0.71/1.13 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.71/1.13 term ( 16) 38239 30179 8060 43 156.8 K
% 0.71/1.13 gen_ptr ( 8) 41486 7948 33538 39 262.3 K
% 0.71/1.13 context ( 808) 30500 30498 2 6 6.3 K
% 0.71/1.13 trail ( 12) 2100 2100 0 4 0.0 K
% 0.71/1.13 bt_node ( 68) 10808 10805 3 12 1.0 K
% 0.71/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_free_vars_pos (4020)
% 0.71/1.13 0 0 0 0 0.0 K
% 0.71/1.13 discrim ( 12) 6381 1739 4642 91 55.5 K
% 0.71/1.13 flat ( 40) 69247 69247 0 57 2.2 K
% 0.71/1.13 discrim_pos ( 12) 2112 2112 0 1 0.0 K
% 0.71/1.13 fpa_head ( 12) 1717 0 1717 0 20.1 K
% 0.71/1.13 fpa_tree ( 28) 833 833 0 19 0.5 K
% 0.71/1.13 fpa_pos ( 36) 554 554 0 1 0.0 K
% 0.71/1.13 literal ( 12) 1893 1525 368 1 4.3 K
% 0.71/1.13 clause ( 24) 1893 1525 368 1 8.6 K
% 0.71/1.13 list ( 12) 245 188 57 3 0.7 K
% 0.71/1.13 list_pos ( 20) 1509 481 1028 8 20.2 K
% 0.71/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.13
% 0.71/1.13 -------------- statistics -------------
% 0.71/1.13 Clauses input 23
% 0.71/1.13 Usable input 0
% 0.71/1.13 Sos input 23
% 0.71/1.13 Demodulators input 0
% 0.71/1.13 Passive input 0
% 0.71/1.13
% 0.71/1.13 Processed BS (before search) 30
% 0.71/1.13 Forward subsumed BS 6
% 0.71/1.13 Kept BS 24
% 0.71/1.13 New demodulators BS 18
% 0.71/1.13 Back demodulated BS 2
% 0.71/1.13
% 0.71/1.13 Clauses or pairs given 2405
% 0.71/1.13 Clauses generated 1121
% 0.71/1.13 Forward subsumed 777
% 0.71/1.13 Deleted by weight 0
% 0.71/1.13 Deleted by variable count 0
% 0.71/1.13 Kept 344
% 0.71/1.13 New demodulators 168
% 0.71/1.13 Back demodulated 94
% 0.71/1.13 Ordered paramod prunes 0
% 0.71/1.13 Basic paramod prunes 3156
% 0.71/1.13 Prime paramod prunes 72
% 0.71/1.13 Semantic prunes 0
% 0.71/1.13
% 0.71/1.13 Rewrite attmepts 13286
% 0.71/1.13 Rewrites 1780
% 0.71/1.13
% 0.71/1.13 FPA overloads 0
% 0.71/1.13 FPA underloads 0
% 0.71/1.13
% 0.71/1.13 Usable size 0
% 0.71/1.13 Sos size 271
% 0.71/1.13 Demodulators size 116
% 0.71/1.13 Passive size 0
% 0.71/1.13 Disabled size 96
% 0.71/1.13
% 0.71/1.13 Proofs found 1
% 0.71/1.13
% 0.71/1.13 ----------- times (seconds) ----------- Mon May 30 07:40:11 2022
% 0.71/1.13
% 0.71/1.13 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.71/1.13 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.13 input time 0.00
% 0.71/1.13 paramodulation time 0.00
% 0.71/1.13 demodulation time 0.00
% 0.71/1.13 orient time 0.00
% 0.71/1.13 weigh time 0.00
% 0.71/1.13 forward subsume time 0.00
% 0.71/1.13 back demod find time 0.00
% 0.71/1.13 conflict time 0.00
% 0.71/1.13 LRPO time 0.00
% 0.71/1.13 store clause time 0.00
% 0.71/1.13 disable clause time 0.00
% 0.71/1.13 prime paramod time 0.00
% 0.71/1.13 semantics time 0.00
% 0.71/1.13
% 0.71/1.13 EQP interrupted
%------------------------------------------------------------------------------