TSTP Solution File: RNG025-7 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG025-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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.76s 2.12s
% Output : Refutation 1.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 2 RR)
% Number of literals : 32 ( 0 equ; 1 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 79 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG025-7.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG025-7.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG025-7.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG025-7.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG025-7.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG025-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(12,plain,
equal(multiply(multiply(A,B),B),multiply(A,multiply(B,B))),
file('RNG025-7.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(multiply(A,A),B),multiply(A,multiply(A,B))),
file('RNG025-7.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(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(associator(x,y,x),additive_identity),
file('RNG025-7.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(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(57,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(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(88,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(D,B),C),add(multiply(additive_inverse(D),multiply(B,C)),multiply(additive_inverse(A),multiply(B,C))))),associator(add(A,D),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,19]),9,57,9,11]),
[iquote('para(9,19),demod([9,57,9,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(91,plain,
equal(add(multiply(multiply(A,B),C),add(associator(D,B,C),multiply(additive_inverse(A),multiply(B,C)))),associator(add(A,D),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[88]),90]),
[iquote('back_demod(88),demod([90])')] ).
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(96,plain,
equal(associator(A,A,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,19]),29]),1]),
[iquote('para(13,19),demod([29]),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(292,plain,
equal(add(associator(A,B,C),associator(D,B,C)),associator(add(D,A),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[91]),291]),
[iquote('back_demod(91),demod([291])')] ).
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(3654,plain,
equal(associator(add(A,B),B,C),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[96,292]),1]),1]),
[iquote('para(96,292),demod([1]),flip(1)')] ).
cnf(5852,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(5860,plain,
equal(associator(A,B,A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5852,96]),3654]),
[iquote('para(5852,96),demod([3654])')] ).
cnf(5861,plain,
$false,
inference(conflict,[status(thm)],[5860,24]),
[iquote('conflict(5860,24)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : RNG025-7 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n028.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 May 30 06:20:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.08 ----- EQP 0.9e, May 2009 -----
% 0.42/1.08 The job began on n028.cluster.edu, Mon May 30 06:20:05 2022
% 0.42/1.08 The command was "./eqp09e".
% 0.42/1.08
% 0.42/1.08 set(prolog_style_variables).
% 0.42/1.08 set(lrpo).
% 0.42/1.08 set(basic_paramod).
% 0.42/1.08 set(functional_subsume).
% 0.42/1.08 set(ordered_paramod).
% 0.42/1.08 set(prime_paramod).
% 0.42/1.08 set(para_pairs).
% 0.42/1.08 assign(pick_given_ratio,4).
% 0.42/1.08 clear(print_kept).
% 0.42/1.08 clear(print_new_demod).
% 0.42/1.08 clear(print_back_demod).
% 0.42/1.08 clear(print_given).
% 0.42/1.08 assign(max_mem,64000).
% 0.42/1.08 end_of_commands.
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.42/1.08 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.42/1.08 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.42/1.08 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.42/1.08 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.42/1.08 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.42/1.08 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.42/1.08 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.42/1.08 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.42/1.08 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.42/1.08 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.42/1.08 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.42/1.08 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.42/1.08 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.42/1.08 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.42/1.08 0 (wt=-1) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.42/1.08 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.42/1.08 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.42/1.08 0 (wt=-1) [] multiply(A,add(B,additive_inverse(C))) = add(multiply(A,B),additive_inverse(multiply(A,C))).
% 0.42/1.08 0 (wt=-1) [] multiply(add(A,additive_inverse(B)),C) = add(multiply(A,C),additive_inverse(multiply(B,C))).
% 0.42/1.08 0 (wt=-1) [] multiply(additive_inverse(A),add(B,C)) = add(additive_inverse(multiply(A,B)),additive_inverse(multiply(A,C))).
% 0.42/1.08 0 (wt=-1) [] multiply(add(A,B),additive_inverse(C)) = add(additive_inverse(multiply(A,C)),additive_inverse(multiply(B,C))).
% 0.42/1.08 0 (wt=-1) [] -(associator(x,y,x) = additive_identity).
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Starting to process input.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.42/1.08 1 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.42/1.08 2 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.42/1.08 3 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.42/1.08 4 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.42/1.08 5 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.42/1.08 6 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.42/1.08 7 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.42/1.08 8 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.42/1.08 9 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.42/1.08 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.42/1.08
% 0.42/1.08 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.42/1.08 11 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.42/1.08 12 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.42/1.08 13 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.42/1.08 14 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.42/1.08 15 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.42/1.08 16 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.42/1.08 17 is a new demodulator.
% 0.42/1.08 -> 17 back demodulating 15.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 1.76/2.12 18 is a new demodulator.
% 1.76/2.12 -> 17 back demodulating 14.
% 1.76/2.12
% 1.76/2.12 ** 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.76/2.12 19 is a new demodulator.
% 1.76/2.12
% 1.76/2.12 ** KEPT: 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 1.76/2.12
% 1.76/2.12 ** KEPT: 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 1.76/2.12 clause forward subsumed: 0 (wt=9) [flip(21)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 1.76/2.12 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.76/2.12 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.76/2.12 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.76/2.12
% 1.76/2.12 ** 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.76/2.12
% 1.76/2.12 ** 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.76/2.12 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.76/2.12
% 1.76/2.12 ** KEPT: 24 (wt=6) [] -(associator(x,y,x) = additive_identity).
% 1.76/2.12 ---------------- PROOF FOUND ----------------
% 1.76/2.12 % SZS status Unsatisfiable
% 1.76/2.12
% 1.76/2.12
% 1.76/2.12 After processing input:
% 1.76/2.12
% 1.76/2.12 Usable:
% 1.76/2.12 end_of_list.
% 1.76/2.12
% 1.76/2.12 Sos:
% 1.76/2.12 1 (wt=5) [] add(additive_identity,A) = A.
% 1.76/2.12 2 (wt=5) [] add(A,additive_identity) = A.
% 1.76/2.12 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.76/2.12 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.76/2.12 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.76/2.12 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.76/2.12 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.76/2.12 24 (wt=6) [] -(associator(x,y,x) = additive_identity).
% 1.76/2.12 10 (wt=7) [] add(A,B) = add(B,A).
% 1.76/2.12 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 1.76/2.12 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 1.76/2.12 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 1.76/2.12 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 1.76/2.12 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.76/2.12 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.76/2.12 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.76/2.12 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 1.76/2.12 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.76/2.12 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.76/2.12 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.76/2.12 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.76/2.12 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.76/2.12 end_of_list.
% 1.76/2.12
% 1.76/2.12 Demodulators:
% 1.76/2.12 1 (wt=5) [] add(additive_identity,A) = A.
% 1.76/2.12 2 (wt=5) [] add(A,additive_identity) = A.
% 1.76/2.12 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.76/2.12 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.76/2.12 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.76/2.12 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.76/2.12 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.76/2.12 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.76/2.12 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.76/2.12 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.76/2.12 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.76/2.12 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.76/2.12 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 1.76/2.12 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 1.76/2.12 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 1.76/2.12 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.76/2.12 end_of_list.
% 1.76/2.12
% 1.76/2.12 Passive:
% 1.76/2.12 end_of_list.
% 1.76/2.12
% 1.76/2.12 UNIT CONFLICT from 5860 and 24 at 0.64 seconds.
% 1.76/2.12
% 1.76/2.12 ---------------- PROOF ----------------
% 1.76/2.12 % SZS output start Refutation
% See solution above
% 1.76/2.12 ------------ end of proof -------------
% 1.76/2.12
% 1.76/2.12
% 1.76/2.12 ------------- memory usage ------------
% 1.76/2.12 Memory dynamically allocated (tp_alloc): 15136.
% 1.76/2.12 type (bytes each) gets frees in use avail bytes
% 1.76/2.12 sym_ent ( 96) 59 0 59 0 5.5 K
% 1.76/2.12 term ( 16) 1020751 800587 220164 37 4277.9 K
% 1.76/2.12 gen_ptr ( 8) 1199178 133342 1065836 31 8327.1 K
% 1.76/2.12 context ( 808) 904981 904979 2 7 7.1 K
% 1.76/2.12 trail ( 12) 22202 22202 0 5 0.1 K
% 1.76/2.12 bt_node ( 68) 392797 392793 4 19 1.5 K
% 1.76/2.12 ac_position (285432) 0 0 0 0 0.0 K
% 1.76/2.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.76/2.12 ac_match_free_vars_pos (4020)
% 1.76/2.12 0 0 0 0 0.0 K
% 1.76/2.12 discrim ( 12) 122737 5980 116757 107 1369.5 K
% 1.76/2.12 flat ( 40) 2525620 2525620 0 131 5.1 K
% 1.76/2.12 discrim_pos ( 12) 56193 56193 0 1 0.0 K
% 1.76/2.12 fpa_head ( 12) 4655 0 4655 0 54.6 K
% 1.76/2.12 fpa_tree ( 28) 6082 6082 0 23 0.6 K
% 1.76/2.12 fpa_pos ( 36) 7043 7043 0 1 0.0 K
% 1.76/2.12 literal ( 12) 39722 33862 5860 1 68.7 K
% 1.76/2.12 clause ( 24) 39722 33862 5860 1 137.4 K
% 1.76/2.12 list ( 12) 1242 1186 56 4 0.7 K
% 1.76/2.12 list_pos ( 20) 19774 2353 17421 44 341.1 K
% 1.76/2.12 pair_index ( 40) 2 0 2 0 0.1 K
% 1.76/2.12
% 1.76/2.12 -------------- statistics -------------
% 1.76/2.12 Clauses input 23
% 1.76/2.12 Usable input 0
% 1.76/2.12 Sos input 23
% 1.76/2.12 Demodulators input 0
% 1.76/2.12 Passive input 0
% 1.76/2.12
% 1.76/2.12 Processed BS (before search) 30
% 1.76/2.12 Forward subsumed BS 6
% 1.76/2.12 Kept BS 24
% 1.76/2.12 New demodulators BS 18
% 1.76/2.12 Back demodulated BS 2
% 1.76/2.12
% 1.76/2.12 Clauses or pairs given 48358
% 1.76/2.12 Clauses generated 23420
% 1.76/2.12 Forward subsumed 17584
% 1.76/2.12 Deleted by weight 0
% 1.76/2.12 Deleted by variable count 0
% 1.76/2.12 Kept 5836
% 1.76/2.12 New demodulators 1165
% 1.76/2.12 Back demodulated 483
% 1.76/2.12 Ordered paramod prunes 0
% 1.76/2.12 Basic paramod prunes 118139
% 1.76/2.12 Prime paramod prunes 2615
% 1.76/2.12 Semantic prunes 0
% 1.76/2.12
% 1.76/2.12 Rewrite attmepts 408306
% 1.76/2.12 Rewrites 46900
% 1.76/2.12
% 1.76/2.12 FPA overloads 0
% 1.76/2.12 FPA underloads 0
% 1.76/2.12
% 1.76/2.12 Usable size 0
% 1.76/2.12 Sos size 5374
% 1.76/2.12 Demodulators size 814
% 1.76/2.12 Passive size 0
% 1.76/2.12 Disabled size 485
% 1.76/2.12
% 1.76/2.12 Proofs found 1
% 1.76/2.12
% 1.76/2.12 ----------- times (seconds) ----------- Mon May 30 06:20:06 2022
% 1.76/2.12
% 1.76/2.12 user CPU time 0.64 (0 hr, 0 min, 0 sec)
% 1.76/2.12 system CPU time 0.41 (0 hr, 0 min, 0 sec)
% 1.76/2.12 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.76/2.12 input time 0.00
% 1.76/2.12 paramodulation time 0.12
% 1.76/2.12 demodulation time 0.08
% 1.76/2.12 orient time 0.05
% 1.76/2.12 weigh time 0.01
% 1.76/2.12 forward subsume time 0.05
% 1.76/2.12 back demod find time 0.01
% 1.76/2.12 conflict time 0.01
% 1.76/2.12 LRPO time 0.02
% 1.76/2.12 store clause time 0.17
% 1.76/2.12 disable clause time 0.02
% 1.76/2.12 prime paramod time 0.02
% 1.76/2.12 semantics time 0.00
% 1.76/2.12
% 1.76/2.12 EQP interrupted
%------------------------------------------------------------------------------