TSTP Solution File: RNG025-5 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG025-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:32 EDT 2022
% Result : Unsatisfiable 1.61s 2.02s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 13
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 3 RR)
% Number of literals : 61 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 152 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG025-5.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG025-5.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(additive_identity,A),additive_identity),
file('RNG025-5.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG025-5.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG025-5.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG025-5.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG025-5.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG025-5.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG025-5.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG025-5.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(12,plain,
equal(multiply(multiply(A,B),B),multiply(A,multiply(B,B))),
file('RNG025-5.p',unknown),
[] ).
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(16,plain,
equal(multiply(additive_inverse(A),additive_inverse(B)),multiply(A,B)),
file('RNG025-5.p',unknown),
[] ).
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(20,plain,
equal(multiply(A,additive_inverse(B)),multiply(additive_inverse(A),B)),
inference(demod,[status(thm),theory(equality)],[17]),
[iquote('demod([17])')] ).
cnf(21,plain,
equal(multiply(additive_inverse(A),B),multiply(A,additive_inverse(B))),
inference(flip,[status(thm),theory(equality)],[20]),
[iquote('flip(20)')] ).
cnf(24,plain,
~ equal(add(associator(x,y,z),associator(x,z,y)),additive_identity),
file('RNG025-5.p',unknown),
[] ).
cnf(29,plain,
equal(add(multiply(A,B),multiply(additive_inverse(A),B)),additive_identity),
inference(para,[status(thm),theory(equality)],[17,6]),
[iquote('para(17,6)')] ).
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(34,plain,
equal(add(A,add(additive_inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,11]),1]),1]),
[iquote('para(6,11),demod([1]),flip(1)')] ).
cnf(35,plain,
equal(add(A,add(B,C)),add(C,add(A,B))),
inference(para,[status(thm),theory(equality)],[11,10]),
[iquote('para(11,10)')] ).
cnf(37,plain,
equal(add(A,add(B,C)),add(B,add(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),11]),
[iquote('para(10,11),demod([11])')] ).
cnf(38,plain,
equal(add(additive_inverse(A),add(B,A)),B),
inference(para,[status(thm),theory(equality)],[10,32]),
[iquote('para(10,32)')] ).
cnf(41,plain,
equal(add(additive_inverse(add(A,B)),B),additive_inverse(A)),
inference(para,[status(thm),theory(equality)],[32,38]),
[iquote('para(32,38)')] ).
cnf(58,plain,
equal(multiply(additive_inverse(A),multiply(additive_inverse(B),C)),multiply(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[17,16]),
[iquote('para(17,16)')] ).
cnf(59,plain,
equal(additive_inverse(add(A,B)),add(additive_inverse(B),additive_inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,38]),1]),
[iquote('para(41,38),flip(1)')] ).
cnf(81,plain,
equal(associator(A,additive_identity,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,19]),4,3,4,2]),1]),
[iquote('para(3,19),demod([4,3,4,2]),flip(1)')] ).
cnf(85,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(86,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(A,B),D),add(multiply(additive_inverse(A),multiply(B,C)),multiply(additive_inverse(A),multiply(B,D))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,19]),8,8,11]),
[iquote('para(8,19),demod([8,8,11])')] ).
cnf(90,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(additive_inverse(A),multiply(B,C)),D)),add(associator(A,B,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,11]),1]),
[iquote('para(19,11),flip(1)')] ).
cnf(93,plain,
equal(associator(A,B,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,19]),29]),1]),
[iquote('para(12,19),demod([29]),flip(1)')] ).
cnf(113,plain,
equal(add(multiply(multiply(additive_inverse(A),B),C),multiply(additive_inverse(A),multiply(B,additive_inverse(C)))),associator(A,B,additive_inverse(C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,19]),17]),
[iquote('para(20,19),demod([17])')] ).
cnf(262,plain,
equal(add(multiply(additive_inverse(A),B),add(C,multiply(A,B))),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,35]),2]),1]),
[iquote('para(29,35),demod([2]),flip(1)')] ).
cnf(291,plain,
equal(add(multiply(multiply(A,B),C),add(D,multiply(additive_inverse(A),multiply(B,C)))),add(D,associator(A,B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,37]),1]),
[iquote('para(19,37),flip(1)')] ).
cnf(294,plain,
equal(add(associator(A,B,C),associator(A,B,D)),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),291,90]),
[iquote('back_demod(86),demod([291,90])')] ).
cnf(295,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)],[85]),291,90]),
[iquote('back_demod(85),demod([291,90])')] ).
cnf(311,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,38]),17,7]),1]),
[iquote('para(19,38),demod([17,7]),flip(1)')] ).
cnf(335,plain,
equal(add(multiply(additive_inverse(A),multiply(B,C)),add(associator(additive_inverse(A),B,C),multiply(additive_inverse(A),multiply(B,additive_inverse(C))))),associator(A,B,additive_inverse(C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[113]),311,11]),
[iquote('back_demod(113),demod([311,11])')] ).
cnf(372,plain,
equal(multiply(additive_inverse(A),multiply(B,additive_inverse(C))),multiply(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[21,58]),
[iquote('para(21,58)')] ).
cnf(374,plain,
equal(associator(additive_inverse(A),B,C),associator(A,B,additive_inverse(C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[335]),372,262]),
[iquote('back_demod(335),demod([372,262])')] ).
cnf(377,plain,
equal(associator(additive_inverse(A),B,additive_inverse(C)),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,374]),1]),
[iquote('para(7,374),flip(1)')] ).
cnf(4681,plain,
equal(associator(A,B,add(B,C)),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[93,294]),1]),1]),
[iquote('para(93,294),demod([1]),flip(1)')] ).
cnf(4682,plain,
equal(associator(A,B,add(C,B)),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[93,294]),2]),1]),
[iquote('para(93,294),demod([2]),flip(1)')] ).
cnf(4841,plain,
equal(associator(additive_inverse(A),B,C),associator(A,B,add(additive_inverse(C),additive_inverse(B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4681,374]),59]),
[iquote('para(4681,374),demod([59])')] ).
cnf(4842,plain,
equal(associator(A,B,add(additive_inverse(C),additive_inverse(B))),associator(additive_inverse(A),B,C)),
inference(flip,[status(thm),theory(equality)],[4841]),
[iquote('flip(4841)')] ).
cnf(4843,plain,
equal(associator(A,B,add(C,additive_inverse(B))),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,4842]),377]),
[iquote('para(7,4842),demod([377])')] ).
cnf(4845,plain,
equal(associator(A,additive_inverse(B),add(C,B)),associator(A,additive_inverse(B),C)),
inference(para,[status(thm),theory(equality)],[7,4843]),
[iquote('para(7,4843)')] ).
cnf(4851,plain,
equal(associator(A,additive_inverse(B),add(B,C)),associator(A,additive_inverse(B),C)),
inference(para,[status(thm),theory(equality)],[10,4845]),
[iquote('para(10,4845)')] ).
cnf(4865,plain,
equal(associator(A,add(additive_inverse(B),C),B),associator(A,add(additive_inverse(B),C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,4845]),59,7,59,7]),
[iquote('para(34,4845),demod([59,7,59,7])')] ).
cnf(4869,plain,
equal(associator(A,add(B,C),additive_inverse(B)),associator(A,add(B,C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,4865]),7]),
[iquote('para(7,4865),demod([7])')] ).
cnf(4870,plain,
equal(associator(A,add(B,C),C),associator(A,add(B,C),additive_inverse(B))),
inference(flip,[status(thm),theory(equality)],[4869]),
[iquote('flip(4869)')] ).
cnf(4963,plain,
equal(associator(A,add(B,C),B),associator(A,add(C,B),additive_inverse(C))),
inference(para,[status(thm),theory(equality)],[10,4870]),
[iquote('para(10,4870)')] ).
cnf(4964,plain,
equal(associator(A,add(B,C),additive_inverse(B)),associator(A,add(C,B),C)),
inference(flip,[status(thm),theory(equality)],[4963]),
[iquote('flip(4963)')] ).
cnf(5769,plain,
equal(associator(A,add(B,C),B),associator(A,C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[93,295]),1]),1]),
[iquote('para(93,295),demod([1]),flip(1)')] ).
cnf(5774,plain,
equal(associator(A,add(B,C),additive_inverse(B)),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4964]),5769]),
[iquote('back_demod(4964),demod([5769])')] ).
cnf(5775,plain,
equal(associator(A,add(B,C),C),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4870]),5774]),
[iquote('back_demod(4870),demod([5774])')] ).
cnf(5929,plain,
equal(associator(A,B,C),associator(A,additive_inverse(C),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,5775]),4682,4851]),
[iquote('para(32,5775),demod([4682,4851])')] ).
cnf(6802,plain,
~ equal(additive_identity,additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5929,24]),295,5,81]),
[iquote('para(5929,24),demod([295,5,81])')] ).
cnf(6803,plain,
$false,
inference(conflict,[status(thm)],[6802]),
[iquote('xx_conflict(6802)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.07 % Problem : RNG025-5 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.08 % Command : tptp2X_and_run_eqp %s
% 0.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 600
% 0.07/0.26 % DateTime : Mon May 30 19:05:57 EDT 2022
% 0.07/0.26 % CPUTime :
% 0.43/0.84 ----- EQP 0.9e, May 2009 -----
% 0.43/0.84 The job began on n032.cluster.edu, Mon May 30 19:05:58 2022
% 0.43/0.84 The command was "./eqp09e".
% 0.43/0.84
% 0.43/0.84 set(prolog_style_variables).
% 0.43/0.84 set(lrpo).
% 0.43/0.84 set(basic_paramod).
% 0.43/0.84 set(functional_subsume).
% 0.43/0.84 set(ordered_paramod).
% 0.43/0.84 set(prime_paramod).
% 0.43/0.84 set(para_pairs).
% 0.43/0.84 assign(pick_given_ratio,4).
% 0.43/0.84 clear(print_kept).
% 0.43/0.84 clear(print_new_demod).
% 0.43/0.84 clear(print_back_demod).
% 0.43/0.84 clear(print_given).
% 0.43/0.84 assign(max_mem,64000).
% 0.43/0.84 end_of_commands.
% 0.43/0.84
% 0.43/0.84 Usable:
% 0.43/0.84 end_of_list.
% 0.43/0.84
% 0.43/0.84 Sos:
% 0.43/0.84 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.43/0.84 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.43/0.84 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.43/0.84 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.43/0.84 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.43/0.84 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.43/0.84 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.43/0.84 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/0.84 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.43/0.84 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.43/0.84 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.43/0.84 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.43/0.84 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.43/0.84 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.43/0.84 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.43/0.84 0 (wt=-1) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.43/0.84 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.43/0.84 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.43/0.84 0 (wt=-1) [] multiply(A,add(B,additive_inverse(C))) = add(multiply(A,B),additive_inverse(multiply(A,C))).
% 0.43/0.84 0 (wt=-1) [] multiply(add(A,additive_inverse(B)),C) = add(multiply(A,C),additive_inverse(multiply(B,C))).
% 0.43/0.84 0 (wt=-1) [] multiply(additive_inverse(A),add(B,C)) = add(additive_inverse(multiply(A,B)),additive_inverse(multiply(A,C))).
% 0.43/0.84 0 (wt=-1) [] multiply(add(A,B),additive_inverse(C)) = add(additive_inverse(multiply(A,C)),additive_inverse(multiply(B,C))).
% 0.43/0.84 0 (wt=-1) [] -(add(associator(x,y,z),associator(x,z,y)) = additive_identity).
% 0.43/0.84 end_of_list.
% 0.43/0.84
% 0.43/0.84 Demodulators:
% 0.43/0.84 end_of_list.
% 0.43/0.84
% 0.43/0.84 Passive:
% 0.43/0.84 end_of_list.
% 0.43/0.84
% 0.43/0.84 Starting to process input.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.43/0.84 1 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.43/0.84 2 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.43/0.84 3 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.43/0.84 4 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.43/0.84 5 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.43/0.84 6 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.43/0.84 7 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/0.84 8 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.43/0.84 9 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.43/0.84 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.43/0.84
% 0.43/0.84 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.43/0.84 11 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.43/0.84 12 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.43/0.84 13 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.43/0.84 14 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.43/0.84 15 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.43/0.84 16 is a new demodulator.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.43/0.84 17 is a new demodulator.
% 0.43/0.84 -> 17 back demodulating 15.
% 0.43/0.84
% 0.43/0.84 ** KEPT: 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 1.61/2.02 18 is a new demodulator.
% 1.61/2.02 -> 17 back demodulating 14.
% 1.61/2.02
% 1.61/2.02 ** 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).
% 1.61/2.02 19 is a new demodulator.
% 1.61/2.02
% 1.61/2.02 ** KEPT: 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 1.61/2.02
% 1.61/2.02 ** KEPT: 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 1.61/2.02 clause forward subsumed: 0 (wt=9) [flip(21)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 1.61/2.02 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)).
% 1.61/2.02 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)).
% 1.61/2.02 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)).
% 1.61/2.02
% 1.61/2.02 ** 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)).
% 1.61/2.02
% 1.61/2.02 ** 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))).
% 1.61/2.02 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)).
% 1.61/2.02
% 1.61/2.02 ** KEPT: 24 (wt=11) [] -(add(associator(x,y,z),associator(x,z,y)) = additive_identity).
% 1.61/2.02 ---------------- PROOF FOUND ----------------
% 1.61/2.02 % SZS status Unsatisfiable
% 1.61/2.02
% 1.61/2.02
% 1.61/2.02 After processing input:
% 1.61/2.02
% 1.61/2.02 Usable:
% 1.61/2.02 end_of_list.
% 1.61/2.02
% 1.61/2.02 Sos:
% 1.61/2.02 1 (wt=5) [] add(additive_identity,A) = A.
% 1.61/2.02 2 (wt=5) [] add(A,additive_identity) = A.
% 1.61/2.02 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.61/2.02 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.61/2.02 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.61/2.02 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.61/2.02 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.61/2.02 10 (wt=7) [] add(A,B) = add(B,A).
% 1.61/2.02 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 1.61/2.02 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 1.61/2.02 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 1.61/2.02 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 1.61/2.02 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.61/2.02 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.61/2.02 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.61/2.02 24 (wt=11) [] -(add(associator(x,y,z),associator(x,z,y)) = additive_identity).
% 1.61/2.02 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 1.61/2.02 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.61/2.02 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.61/2.02 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).
% 1.61/2.02 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)).
% 1.61/2.02 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))).
% 1.61/2.02 end_of_list.
% 1.61/2.02
% 1.61/2.02 Demodulators:
% 1.61/2.02 1 (wt=5) [] add(additive_identity,A) = A.
% 1.61/2.02 2 (wt=5) [] add(A,additive_identity) = A.
% 1.61/2.02 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.61/2.02 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.61/2.02 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.61/2.02 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.61/2.02 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.61/2.02 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.61/2.02 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.61/2.02 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.61/2.02 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.61/2.02 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.61/2.02 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 1.61/2.02 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 1.61/2.02 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 1.61/2.02 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).
% 1.61/2.02 end_of_list.
% 1.61/2.02
% 1.61/2.02 Passive:
% 1.61/2.02 end_of_list.
% 1.61/2.02
% 1.61/2.02 UNIT CONFLICT from 6802 and x=x at 0.76 seconds.
% 1.61/2.02
% 1.61/2.02 ---------------- PROOF ----------------
% 1.61/2.02 % SZS output start Refutation
% See solution above
% 1.61/2.02 ------------ end of proof -------------
% 1.61/2.02
% 1.61/2.02
% 1.61/2.02 ------------- memory usage ------------
% 1.61/2.02 Memory dynamically allocated (tp_alloc): 17089.
% 1.61/2.02 type (bytes each) gets frees in use avail bytes
% 1.61/2.02 sym_ent ( 96) 60 0 60 0 5.6 K
% 1.61/2.02 term ( 16) 1163605 907812 255793 37 4970.1 K
% 1.61/2.02 gen_ptr ( 8) 1387308 149237 1238071 60 9672.9 K
% 1.61/2.02 context ( 808) 1028869 1028867 2 10 9.5 K
% 1.61/2.02 trail ( 12) 28022 28022 0 5 0.1 K
% 1.61/2.02 bt_node ( 68) 449162 449158 4 19 1.5 K
% 1.61/2.02 ac_position (285432) 0 0 0 0 0.0 K
% 1.61/2.02 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.61/2.02 ac_match_free_vars_pos (4020)
% 1.61/2.02 0 0 0 0 0.0 K
% 1.61/2.02 discrim ( 12) 140422 8541 131881 0 1545.5 K
% 1.61/2.02 flat ( 40) 2882386 2882386 0 131 5.1 K
% 1.61/2.02 discrim_pos ( 12) 62962 62962 0 1 0.0 K
% 1.61/2.02 fpa_head ( 12) 5351 0 5351 0 62.7 K
% 1.61/2.02 fpa_tree ( 28) 7385 7385 0 29 0.8 K
% 1.61/2.02 fpa_pos ( 36) 8152 8152 0 1 0.0 K
% 1.61/2.02 literal ( 12) 44964 38162 6802 0 79.7 K
% 1.61/2.02 clause ( 24) 44964 38162 6802 0 159.4 K
% 1.61/2.02 list ( 12) 1410 1354 56 4 0.7 K
% 1.61/2.02 list_pos ( 20) 22852 2553 20299 0 396.5 K
% 1.61/2.02 pair_index ( 40) 2 0 2 0 0.1 K
% 1.61/2.02
% 1.61/2.02 -------------- statistics -------------
% 1.61/2.02 Clauses input 23
% 1.61/2.02 Usable input 0
% 1.61/2.02 Sos input 23
% 1.61/2.02 Demodulators input 0
% 1.61/2.02 Passive input 0
% 1.61/2.02
% 1.61/2.02 Processed BS (before search) 30
% 1.61/2.02 Forward subsumed BS 6
% 1.61/2.02 Kept BS 24
% 1.61/2.02 New demodulators BS 18
% 1.61/2.02 Back demodulated BS 2
% 1.61/2.02
% 1.61/2.02 Clauses or pairs given 55081
% 1.61/2.02 Clauses generated 26353
% 1.61/2.02 Forward subsumed 19575
% 1.61/2.02 Deleted by weight 0
% 1.61/2.02 Deleted by variable count 0
% 1.61/2.02 Kept 6778
% 1.61/2.02 New demodulators 1333
% 1.61/2.02 Back demodulated 525
% 1.61/2.02 Ordered paramod prunes 0
% 1.61/2.02 Basic paramod prunes 137263
% 1.61/2.02 Prime paramod prunes 3047
% 1.61/2.02 Semantic prunes 0
% 1.61/2.02
% 1.61/2.02 Rewrite attmepts 463402
% 1.61/2.02 Rewrites 52428
% 1.61/2.02
% 1.61/2.02 FPA overloads 0
% 1.61/2.02 FPA underloads 0
% 1.61/2.02
% 1.61/2.02 Usable size 0
% 1.61/2.02 Sos size 6274
% 1.61/2.02 Demodulators size 950
% 1.61/2.02 Passive size 0
% 1.61/2.02 Disabled size 527
% 1.61/2.02
% 1.61/2.02 Proofs found 1
% 1.61/2.02
% 1.61/2.02 ----------- times (seconds) ----------- Mon May 30 19:05:59 2022
% 1.61/2.02
% 1.61/2.02 user CPU time 0.76 (0 hr, 0 min, 0 sec)
% 1.61/2.02 system CPU time 0.42 (0 hr, 0 min, 0 sec)
% 1.61/2.02 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.61/2.02 input time 0.00
% 1.61/2.02 paramodulation time 0.09
% 1.61/2.02 demodulation time 0.11
% 1.61/2.02 orient time 0.05
% 1.61/2.02 weigh time 0.01
% 1.61/2.02 forward subsume time 0.05
% 1.61/2.02 back demod find time 0.01
% 1.61/2.02 conflict time 0.00
% 1.61/2.02 LRPO time 0.03
% 1.61/2.02 store clause time 0.31
% 1.61/2.02 disable clause time 0.03
% 1.61/2.02 prime paramod time 0.03
% 1.61/2.02 semantics time 0.00
% 1.61/2.02
% 1.61/2.02 EQP interrupted
%------------------------------------------------------------------------------