TSTP Solution File: GRP665-12 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n012.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:43 EDT 2022
% Result : Unsatisfiable 2.68s 3.11s
% Output : Refutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 9
% Syntax : Number of clauses : 76 ( 76 unt; 0 nHn; 3 RR)
% Number of literals : 76 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 138 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP665-12.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP665-12.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP665-12.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP665-12.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP665-12.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP665-12.p',unknown),
[] ).
cnf(7,plain,
equal(mult(rd(mult(A,B),A),mult(A,C)),mult(A,mult(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(mult(mult(A,B),C),mult(mult(A,C),ld(C,mult(B,C)))),
file('GRP665-12.p',unknown),
[] ).
cnf(9,plain,
equal(mult(mult(A,B),ld(B,mult(C,B))),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(10,plain,
equal(mult(op_c,A),mult(A,op_c)),
file('GRP665-12.p',unknown),
[] ).
cnf(11,plain,
equal(mult(A,op_c),mult(op_c,A)),
inference(flip,[status(thm),theory(equality)],[10]),
[iquote('flip(10)')] ).
cnf(12,plain,
~ equal(mult(mult(x0,x1),op_c),mult(x0,mult(x1,op_c))),
file('GRP665-12.p',unknown),
[] ).
cnf(13,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(15,plain,
equal(ld(unit,A),A),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(16,plain,
equal(ld(rd(A,B),A),B),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(19,plain,
equal(mult(rd(A,B),mult(B,C)),mult(B,mult(ld(B,A),C))),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(26,plain,
equal(mult(ld(op_c,A),op_c),A),
inference(para,[status(thm),theory(equality)],[10,1]),
[iquote('para(10,1)')] ).
cnf(32,plain,
equal(ld(op_c,mult(A,op_c)),A),
inference(para,[status(thm),theory(equality)],[10,2]),
[iquote('para(10,2)')] ).
cnf(34,plain,
equal(mult(mult(rd(A,B),C),B),mult(A,ld(B,mult(C,B)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,9]),1]),
[iquote('para(3,9),flip(1)')] ).
cnf(36,plain,
equal(rd(mult(A,op_c),A),op_c),
inference(para,[status(thm),theory(equality)],[10,4]),
[iquote('para(10,4)')] ).
cnf(38,plain,
equal(ld(A,mult(op_c,A)),op_c),
inference(para,[status(thm),theory(equality)],[11,2]),
[iquote('para(11,2)')] ).
cnf(59,plain,
equal(mult(mult(A,op_c),B),mult(op_c,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,8]),32]),1]),
[iquote('para(11,8),demod([32]),flip(1)')] ).
cnf(63,plain,
equal(mult(op_c,mult(A,ld(mult(A,op_c),B))),B),
inference(para,[status(thm),theory(equality)],[59,1]),
[iquote('para(59,1)')] ).
cnf(65,plain,
equal(mult(rd(A,B),C),mult(B,mult(ld(B,A),ld(B,C)))),
inference(para,[status(thm),theory(equality)],[1,19]),
[iquote('para(1,19)')] ).
cnf(66,plain,
equal(mult(mult(A,mult(ld(A,B),ld(A,C))),A),mult(B,ld(A,mult(C,A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[34]),65]),
[iquote('back_demod(34),demod([65])')] ).
cnf(72,plain,
equal(mult(op_c,mult(ld(op_c,A),B)),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,59]),1]),
[iquote('para(26,59),flip(1)')] ).
cnf(83,plain,
equal(mult(A,ld(mult(A,op_c),B)),ld(op_c,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,2]),1]),
[iquote('para(63,2),flip(1)')] ).
cnf(95,plain,
equal(mult(ld(op_c,A),B),ld(op_c,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,2]),1]),
[iquote('para(72,2),flip(1)')] ).
cnf(102,plain,
equal(ld(mult(A,op_c),B),ld(A,ld(op_c,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[83,2]),1]),
[iquote('para(83,2),flip(1)')] ).
cnf(107,plain,
equal(ld(op_c,mult(A,ld(ld(op_c,A),B))),B),
inference(para,[status(thm),theory(equality)],[95,1]),
[iquote('para(95,1)')] ).
cnf(108,plain,
equal(ld(op_c,ld(ld(op_c,unit),A)),A),
inference(para,[status(thm),theory(equality)],[6,107]),
[iquote('para(6,107)')] ).
cnf(109,plain,
equal(mult(op_c,A),ld(ld(op_c,unit),A)),
inference(para,[status(thm),theory(equality)],[108,1]),
[iquote('para(108,1)')] ).
cnf(117,plain,
equal(ld(A,ld(ld(op_c,unit),A)),op_c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),109]),
[iquote('back_demod(38),demod([109])')] ).
cnf(118,plain,
equal(mult(A,op_c),ld(ld(op_c,unit),A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),109]),
[iquote('back_demod(11),demod([109])')] ).
cnf(121,plain,
equal(ld(ld(ld(op_c,unit),A),B),ld(A,ld(op_c,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[102]),118]),
[iquote('back_demod(102),demod([118])')] ).
cnf(122,plain,
equal(rd(ld(ld(op_c,unit),A),A),op_c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[36]),118]),
[iquote('back_demod(36),demod([118])')] ).
cnf(123,plain,
~ equal(mult(x0,ld(ld(op_c,unit),x1)),ld(ld(op_c,unit),mult(x0,x1))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[12]),118,118]),1]),
[iquote('back_demod(12),demod([118,118]),flip(1)')] ).
cnf(160,plain,
equal(ld(ld(op_c,A),ld(op_c,mult(A,B))),B),
inference(para,[status(thm),theory(equality)],[95,2]),
[iquote('para(95,2)')] ).
cnf(188,plain,
equal(ld(ld(op_c,A),ld(op_c,B)),ld(A,B)),
inference(para,[status(thm),theory(equality)],[1,160]),
[iquote('para(1,160)')] ).
cnf(294,plain,
equal(rd(A,B),mult(B,mult(ld(B,A),ld(B,unit)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[65,5]),1]),
[iquote('para(65,5),flip(1)')] ).
cnf(313,plain,
equal(mult(A,ld(ld(op_c,unit),ld(A,unit))),op_c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[122]),294,117,109]),
[iquote('back_demod(122),demod([294,117,109])')] ).
cnf(327,plain,
equal(ld(mult(A,mult(ld(A,B),ld(A,unit))),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),294]),
[iquote('back_demod(16),demod([294])')] ).
cnf(377,plain,
equal(ld(ld(op_c,unit),ld(A,unit)),ld(A,op_c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[313,2]),1]),
[iquote('para(313,2),flip(1)')] ).
cnf(383,plain,
equal(ld(op_c,ld(A,op_c)),ld(A,unit)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[377,1]),95,6]),
[iquote('para(377,1),demod([95,6])')] ).
cnf(384,plain,
equal(ld(A,unit),ld(op_c,ld(A,op_c))),
inference(flip,[status(thm),theory(equality)],[383]),
[iquote('flip(383)')] ).
cnf(395,plain,
equal(mult(A,ld(op_c,ld(A,op_c))),unit),
inference(para,[status(thm),theory(equality)],[384,1]),
[iquote('para(384,1)')] ).
cnf(527,plain,
equal(ld(ld(op_c,A),ld(B,unit)),ld(A,ld(B,op_c))),
inference(para,[status(thm),theory(equality)],[383,188]),
[iquote('para(383,188)')] ).
cnf(594,plain,
equal(ld(mult(A,mult(B,ld(A,unit))),mult(A,B)),A),
inference(para,[status(thm),theory(equality)],[2,327]),
[iquote('para(2,327)')] ).
cnf(1035,plain,
equal(ld(mult(A,mult(ld(A,B),ld(A,C))),mult(B,ld(A,mult(C,A)))),A),
inference(para,[status(thm),theory(equality)],[66,2]),
[iquote('para(66,2)')] ).
cnf(1036,plain,
equal(mult(mult(A,mult(B,ld(A,C))),A),mult(mult(A,B),ld(A,mult(C,A)))),
inference(para,[status(thm),theory(equality)],[2,66]),
[iquote('para(2,66)')] ).
cnf(1046,plain,
equal(ld(mult(A,mult(B,ld(op_c,ld(A,op_c)))),mult(A,B)),A),
inference(para,[status(thm),theory(equality)],[384,594]),
[iquote('para(384,594)')] ).
cnf(2309,plain,
equal(ld(mult(A,mult(ld(A,unit),ld(A,B))),ld(A,mult(B,A))),A),
inference(para,[status(thm),theory(equality)],[6,1035]),
[iquote('para(6,1035)')] ).
cnf(2415,plain,
equal(ld(ld(A,unit),ld(op_c,B)),ld(ld(A,op_c),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[527,121]),15]),1]),
[iquote('para(527,121),demod([15]),flip(1)')] ).
cnf(2418,plain,
equal(ld(ld(A,unit),B),ld(ld(A,op_c),ld(ld(op_c,unit),B))),
inference(para,[status(thm),theory(equality)],[108,2415]),
[iquote('para(108,2415)')] ).
cnf(2442,plain,
equal(ld(ld(A,op_c),ld(ld(op_c,unit),mult(ld(A,unit),B))),B),
inference(para,[status(thm),theory(equality)],[2418,2]),
[iquote('para(2418,2)')] ).
cnf(2468,plain,
equal(ld(ld(op_c,unit),mult(ld(A,unit),B)),mult(ld(A,op_c),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2442,1]),1]),
[iquote('para(2442,1),flip(1)')] ).
cnf(2480,plain,
equal(mult(ld(A,unit),B),ld(op_c,mult(ld(A,op_c),B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2468,1]),95,6]),1]),
[iquote('para(2468,1),demod([95,6]),flip(1)')] ).
cnf(2483,plain,
equal(ld(mult(A,ld(op_c,mult(ld(A,op_c),ld(A,B)))),ld(A,mult(B,A))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2309]),2480]),
[iquote('back_demod(2309),demod([2480])')] ).
cnf(3933,plain,
equal(ld(mult(A,ld(op_c,mult(B,ld(op_c,ld(A,op_c))))),mult(A,ld(op_c,B))),A),
inference(para,[status(thm),theory(equality)],[95,1046]),
[iquote('para(95,1046)')] ).
cnf(7257,plain,
equal(mult(mult(A,mult(B,C)),A),mult(mult(A,B),ld(A,mult(mult(A,C),A)))),
inference(para,[status(thm),theory(equality)],[2,1036]),
[iquote('para(2,1036)')] ).
cnf(7347,plain,
equal(ld(mult(A,ld(op_c,mult(ld(A,op_c),B))),ld(A,mult(mult(A,B),A))),A),
inference(para,[status(thm),theory(equality)],[2,2483]),
[iquote('para(2,2483)')] ).
cnf(7701,plain,
equal(mult(mult(A,ld(op_c,mult(B,ld(op_c,ld(A,op_c))))),A),mult(A,ld(op_c,B))),
inference(para,[status(thm),theory(equality)],[3933,1]),
[iquote('para(3933,1)')] ).
cnf(8118,plain,
equal(mult(mult(A,B),ld(A,mult(mult(A,ld(B,C)),A))),mult(mult(A,C),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,7257]),1]),
[iquote('para(1,7257),flip(1)')] ).
cnf(8164,plain,
equal(ld(mult(A,ld(op_c,B)),ld(A,mult(mult(A,ld(ld(A,op_c),B)),A))),A),
inference(para,[status(thm),theory(equality)],[1,7347]),
[iquote('para(1,7347)')] ).
cnf(8469,plain,
equal(ld(A,mult(mult(A,ld(B,C)),A)),ld(mult(A,B),mult(mult(A,C),A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8118,2]),1]),
[iquote('para(8118,2),flip(1)')] ).
cnf(8470,plain,
equal(ld(mult(A,ld(op_c,B)),ld(op_c,mult(mult(A,B),A))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8164]),8469,1]),
[iquote('back_demod(8164),demod([8469,1])')] ).
cnf(8481,plain,
equal(mult(mult(A,ld(op_c,B)),A),ld(op_c,mult(mult(A,B),A))),
inference(para,[status(thm),theory(equality)],[8470,1]),
[iquote('para(8470,1)')] ).
cnf(8482,plain,
equal(mult(A,ld(op_c,B)),ld(op_c,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7701]),8481,7257,395,6,13,5]),1]),
[iquote('back_demod(7701),demod([8481,7257,395,6,13,5]),flip(1)')] ).
cnf(8630,plain,
equal(ld(A,ld(op_c,mult(A,B))),ld(op_c,B)),
inference(para,[status(thm),theory(equality)],[8482,2]),
[iquote('para(8482,2)')] ).
cnf(8645,plain,
equal(ld(A,ld(op_c,B)),ld(op_c,ld(A,B))),
inference(para,[status(thm),theory(equality)],[1,8630]),
[iquote('para(1,8630)')] ).
cnf(8874,plain,
equal(ld(op_c,ld(ld(op_c,A),B)),ld(A,B)),
inference(para,[status(thm),theory(equality)],[8645,188]),
[iquote('para(8645,188)')] ).
cnf(8885,plain,
equal(ld(ld(op_c,unit),ld(A,B)),ld(ld(op_c,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8874,1]),109]),
[iquote('para(8874,1),demod([109])')] ).
cnf(8934,plain,
equal(ld(ld(op_c,A),mult(A,B)),ld(ld(op_c,unit),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,8885]),1]),
[iquote('para(2,8885),flip(1)')] ).
cnf(8982,plain,
equal(ld(op_c,mult(A,ld(ld(op_c,unit),B))),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8934,1]),95]),
[iquote('para(8934,1),demod([95])')] ).
cnf(9036,plain,
equal(mult(A,ld(ld(op_c,unit),B)),ld(ld(op_c,unit),mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8982,1]),109]),1]),
[iquote('para(8982,1),demod([109]),flip(1)')] ).
cnf(9037,plain,
$false,
inference(conflict,[status(thm)],[9036,123]),
[iquote('conflict(9036,123)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP665-12 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n012.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 19:49:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.68/3.11 ----- EQP 0.9e, May 2009 -----
% 2.68/3.11 The job began on n012.cluster.edu, Mon Jun 13 19:49:11 2022
% 2.68/3.11 The command was "./eqp09e".
% 2.68/3.11
% 2.68/3.11 set(prolog_style_variables).
% 2.68/3.11 set(lrpo).
% 2.68/3.11 set(basic_paramod).
% 2.68/3.11 set(functional_subsume).
% 2.68/3.11 set(ordered_paramod).
% 2.68/3.11 set(prime_paramod).
% 2.68/3.11 set(para_pairs).
% 2.68/3.11 assign(pick_given_ratio,4).
% 2.68/3.11 clear(print_kept).
% 2.68/3.11 clear(print_new_demod).
% 2.68/3.11 clear(print_back_demod).
% 2.68/3.11 clear(print_given).
% 2.68/3.11 assign(max_mem,64000).
% 2.68/3.11 end_of_commands.
% 2.68/3.11
% 2.68/3.11 Usable:
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Sos:
% 2.68/3.11 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 2.68/3.11 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 2.68/3.11 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 2.68/3.11 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 2.68/3.11 0 (wt=-1) [] mult(A,unit) = A.
% 2.68/3.11 0 (wt=-1) [] mult(unit,A) = A.
% 2.68/3.11 0 (wt=-1) [] mult(A,mult(B,C)) = mult(rd(mult(A,B),A),mult(A,C)).
% 2.68/3.11 0 (wt=-1) [] mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))).
% 2.68/3.11 0 (wt=-1) [] mult(op_c,A) = mult(A,op_c).
% 2.68/3.11 0 (wt=-1) [] -(mult(mult(x0,x1),op_c) = mult(x0,mult(x1,op_c))).
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Demodulators:
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Passive:
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Starting to process input.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 2.68/3.11 1 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 2.68/3.11 2 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 2.68/3.11 3 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 2.68/3.11 4 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 2.68/3.11 5 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 2.68/3.11 6 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 7 (wt=15) [flip(1)] mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)).
% 2.68/3.11 7 is a new demodulator.
% 2.68/3.11
% 2.68/3.11 ** KEPT: 8 (wt=15) [] mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))).
% 2.68/3.11
% 2.68/3.11 ** KEPT: 9 (wt=15) [flip(8)] mult(mult(A,B),ld(B,mult(C,B))) = mult(mult(A,C),B).
% 2.68/3.11 clause forward subsumed: 0 (wt=15) [flip(9)] mult(mult(A,C),B) = mult(mult(A,B),ld(B,mult(C,B))).
% 2.68/3.11
% 2.68/3.11 ** KEPT: 10 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 2.68/3.11
% 2.68/3.11 ** KEPT: 11 (wt=7) [flip(10)] mult(A,op_c) = mult(op_c,A).
% 2.68/3.11 clause forward subsumed: 0 (wt=7) [flip(11)] mult(op_c,A) = mult(A,op_c).
% 2.68/3.11
% 2.68/3.11 ** KEPT: 12 (wt=11) [] -(mult(mult(x0,x1),op_c) = mult(x0,mult(x1,op_c))).
% 2.68/3.11 ---------------- PROOF FOUND ----------------
% 2.68/3.11 % SZS status Unsatisfiable
% 2.68/3.11
% 2.68/3.11
% 2.68/3.11 After processing input:
% 2.68/3.11
% 2.68/3.11 Usable:
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Sos:
% 2.68/3.11 5 (wt=5) [] mult(A,unit) = A.
% 2.68/3.11 6 (wt=5) [] mult(unit,A) = A.
% 2.68/3.11 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 2.68/3.11 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 2.68/3.11 3 (wt=7) [] mult(rd(A,B),B) = A.
% 2.68/3.11 4 (wt=7) [] rd(mult(A,B),B) = A.
% 2.68/3.11 10 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 2.68/3.11 11 (wt=7) [flip(10)] mult(A,op_c) = mult(op_c,A).
% 2.68/3.11 12 (wt=11) [] -(mult(mult(x0,x1),op_c) = mult(x0,mult(x1,op_c))).
% 2.68/3.11 7 (wt=15) [flip(1)] mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)).
% 2.68/3.11 8 (wt=15) [] mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))).
% 2.68/3.11 9 (wt=15) [flip(8)] mult(mult(A,B),ld(B,mult(C,B))) = mult(mult(A,C),B).
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Demodulators:
% 2.68/3.11 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 2.68/3.11 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 2.68/3.11 3 (wt=7) [] mult(rd(A,B),B) = A.
% 2.68/3.11 4 (wt=7) [] rd(mult(A,B),B) = A.
% 2.68/3.11 5 (wt=5) [] mult(A,unit) = A.
% 2.68/3.11 6 (wt=5) [] mult(unit,A) = A.
% 2.68/3.11 7 (wt=15) [flip(1)] mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)).
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 Passive:
% 2.68/3.11 end_of_list.
% 2.68/3.11
% 2.68/3.11 UNIT CONFLICT from 9036 and 123 at 1.82 seconds.
% 2.68/3.11
% 2.68/3.11 ---------------- PROOF ----------------
% 2.68/3.11 % SZS output start Refutation
% See solution above
% 2.68/3.11 ------------ end of proof -------------
% 2.68/3.11
% 2.68/3.11
% 2.68/3.11 ------------- memory usage ------------
% 2.68/3.11 Memory dynamically allocated (tp_alloc): 47851.
% 2.68/3.11 type (bytes each) gets frees in use avail bytes
% 2.68/3.11 sym_ent ( 96) 58 0 58 0 5.4 K
% 2.68/3.11 term ( 16) 1303273 692627 610646 94 11893.2 K
% 2.68/3.11 gen_ptr ( 8) 3658138 68668 3589470 75 28043.3 K
% 2.68/3.11 context ( 808) 766405 766403 2 6 6.3 K
% 2.68/3.11 trail ( 12) 86165 86165 0 7 0.1 K
% 2.68/3.11 bt_node ( 68) 139972 139969 3 48 3.4 K
% 2.68/3.11 ac_position (285432) 0 0 0 0 0.0 K
% 2.68/3.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.68/3.11 ac_match_free_vars_pos (4020)
% 2.68/3.11 0 0 0 0 0.0 K
% 2.68/3.11 discrim ( 12) 496264 15601 480663 0 5632.8 K
% 2.68/3.11 flat ( 40) 4578066 4578066 0 511 20.0 K
% 2.68/3.11 discrim_pos ( 12) 22352 22352 0 1 0.0 K
% 2.68/3.11 fpa_head ( 12) 21272 0 21272 0 249.3 K
% 2.68/3.11 fpa_tree ( 28) 30250 30250 0 77 2.1 K
% 2.68/3.11 fpa_pos ( 36) 11245 11245 0 1 0.0 K
% 2.68/3.11 literal ( 12) 32073 23037 9036 1 105.9 K
% 2.68/3.11 clause ( 24) 32073 23037 9036 1 211.8 K
% 2.68/3.11 list ( 12) 2268 2212 56 4 0.7 K
% 2.68/3.11 list_pos ( 20) 30512 2771 27741 0 541.8 K
% 2.68/3.11 pair_index ( 40) 2 0 2 0 0.1 K
% 2.68/3.11
% 2.68/3.11 -------------- statistics -------------
% 2.68/3.11 Clauses input 10
% 2.68/3.11 Usable input 0
% 2.68/3.11 Sos input 10
% 2.68/3.11 Demodulators input 0
% 2.68/3.11 Passive input 0
% 2.68/3.11
% 2.68/3.11 Processed BS (before search) 14
% 2.68/3.11 Forward subsumed BS 2
% 2.68/3.11 Kept BS 12
% 2.68/3.11 New demodulators BS 7
% 2.68/3.11 Back demodulated BS 0
% 2.68/3.11
% 2.68/3.11 Clauses or pairs given 13299
% 2.68/3.11 Clauses generated 17270
% 2.68/3.11 Forward subsumed 8246
% 2.68/3.11 Deleted by weight 0
% 2.68/3.11 Deleted by variable count 0
% 2.68/3.11 Kept 9024
% 2.68/3.11 New demodulators 2202
% 2.68/3.11 Back demodulated 590
% 2.68/3.11 Ordered paramod prunes 0
% 2.68/3.11 Basic paramod prunes 74220
% 2.68/3.11 Prime paramod prunes 886
% 2.68/3.11 Semantic prunes 0
% 2.68/3.11
% 2.68/3.11 Rewrite attmepts 555216
% 2.68/3.11 Rewrites 16329
% 2.68/3.11
% 2.68/3.11 FPA overloads 0
% 2.68/3.11 FPA underloads 0
% 2.68/3.11
% 2.68/3.11 Usable size 0
% 2.68/3.11 Sos size 8445
% 2.68/3.11 Demodulators size 1816
% 2.68/3.11 Passive size 0
% 2.68/3.11 Disabled size 590
% 2.68/3.11
% 2.68/3.11 Proofs found 1
% 2.68/3.11
% 2.68/3.11 ----------- times (seconds) ----------- Mon Jun 13 19:49:13 2022
% 2.68/3.11
% 2.68/3.11 user CPU time 1.82 (0 hr, 0 min, 1 sec)
% 2.68/3.11 system CPU time 0.25 (0 hr, 0 min, 0 sec)
% 2.68/3.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.68/3.11 input time 0.00
% 2.68/3.11 paramodulation time 0.09
% 2.68/3.11 demodulation time 0.17
% 2.68/3.11 orient time 0.06
% 2.68/3.11 weigh time 0.01
% 2.68/3.11 forward subsume time 0.09
% 2.68/3.11 back demod find time 0.11
% 2.68/3.11 conflict time 0.01
% 2.68/3.11 LRPO time 0.04
% 2.68/3.11 store clause time 1.14
% 2.68/3.11 disable clause time 0.04
% 2.68/3.11 prime paramod time 0.03
% 2.68/3.11 semantics time 0.00
% 2.68/3.11
% 2.68/3.11 EQP interrupted
%------------------------------------------------------------------------------