TSTP Solution File: KLE090-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : KLE090-10 : TPTP v8.1.0. Released v7.3.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 : Sun Jul 17 01:52:13 EDT 2022
% Result : Unsatisfiable 2.71s 3.07s
% Output : Refutation 2.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 11 RR)
% Number of literals : 46 ( 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 : 11 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 62 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('KLE090-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('KLE090-10.p',unknown),
[] ).
cnf(3,plain,
equal(addition(A,B),addition(B,A)),
file('KLE090-10.p',unknown),
[] ).
cnf(4,plain,
equal(addition(addition(A,B),C),addition(A,addition(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(addition(A,zero),A),
file('KLE090-10.p',unknown),
[] ).
cnf(6,plain,
equal(addition(A,A),A),
file('KLE090-10.p',unknown),
[] ).
cnf(7,plain,
equal(multiplication(multiplication(A,B),C),multiplication(A,multiplication(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(multiplication(A,one),A),
file('KLE090-10.p',unknown),
[] ).
cnf(9,plain,
equal(multiplication(one,A),A),
file('KLE090-10.p',unknown),
[] ).
cnf(10,plain,
equal(multiplication(A,addition(B,C)),addition(multiplication(A,B),multiplication(A,C))),
file('KLE090-10.p',unknown),
[] ).
cnf(11,plain,
equal(multiplication(addition(A,B),C),addition(multiplication(A,C),multiplication(B,C))),
file('KLE090-10.p',unknown),
[] ).
cnf(13,plain,
equal(multiplication(zero,A),zero),
file('KLE090-10.p',unknown),
[] ).
cnf(14,plain,
equal(ifeq(leq(A,B),true,addition(A,B),B),B),
file('KLE090-10.p',unknown),
[] ).
cnf(15,plain,
equal(ifeq2(addition(A,B),B,leq(A,B),true),true),
file('KLE090-10.p',unknown),
[] ).
cnf(16,plain,
equal(multiplication(antidomain(A),A),zero),
file('KLE090-10.p',unknown),
[] ).
cnf(17,plain,
equal(addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))),antidomain(multiplication(A,antidomain(antidomain(B))))),
file('KLE090-10.p',unknown),
[] ).
cnf(18,plain,
equal(addition(antidomain(antidomain(A)),antidomain(A)),one),
file('KLE090-10.p',unknown),
[] ).
cnf(24,plain,
equal(addition(sK2_goals_X0,sK1_goals_X1),sK1_goals_X1),
file('KLE090-10.p',unknown),
[] ).
cnf(25,plain,
~ equal(addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)),antidomain(sK2_goals_X0)),
file('KLE090-10.p',unknown),
[] ).
cnf(26,plain,
equal(antidomain(one),zero),
inference(para,[status(thm),theory(equality)],[8,16]),
[iquote('para(8,16)')] ).
cnf(30,plain,
equal(addition(zero,A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,3]),1]),
[iquote('para(5,3),flip(1)')] ).
cnf(32,plain,
equal(addition(A,addition(A,B)),addition(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,4]),1]),
[iquote('para(6,4),flip(1)')] ).
cnf(35,plain,
equal(antidomain(zero),one),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,18]),26,5]),
[iquote('para(26,18),demod([26,5])')] ).
cnf(41,plain,
equal(addition(antidomain(A),antidomain(antidomain(A))),one),
inference(para,[status(thm),theory(equality)],[3,18]),
[iquote('para(3,18)')] ).
cnf(47,plain,
equal(multiplication(antidomain(A),multiplication(A,B)),zero),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,7]),13]),1]),
[iquote('para(16,7),demod([13]),flip(1)')] ).
cnf(48,plain,
equal(addition(multiplication(antidomain(addition(A,B)),A),multiplication(antidomain(addition(A,B)),B)),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,10]),1]),
[iquote('para(16,10),flip(1)')] ).
cnf(62,plain,
equal(addition(multiplication(A,antidomain(antidomain(B))),multiplication(A,antidomain(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,10]),8]),1]),
[iquote('para(18,10),demod([8]),flip(1)')] ).
cnf(63,plain,
equal(addition(multiplication(antidomain(antidomain(A)),B),multiplication(antidomain(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,11]),9]),1]),
[iquote('para(18,11),demod([9]),flip(1)')] ).
cnf(131,plain,
equal(leq(A,addition(A,B)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,15]),1]),
[iquote('para(32,15),demod([1])')] ).
cnf(141,plain,
equal(leq(A,addition(B,A)),true),
inference(para,[status(thm),theory(equality)],[3,131]),
[iquote('para(3,131)')] ).
cnf(173,plain,
equal(addition(antidomain(A),one),one),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,32]),41]),
[iquote('para(41,32),demod([41])')] ).
cnf(175,plain,
equal(addition(one,antidomain(A)),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[173,3]),1]),
[iquote('para(173,3),flip(1)')] ).
cnf(215,plain,
equal(antidomain(multiplication(antidomain(A),antidomain(antidomain(multiplication(A,B))))),one),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,17]),35,175]),1]),
[iquote('para(47,17),demod([35,175]),flip(1)')] ).
cnf(230,plain,
equal(multiplication(antidomain(addition(A,B)),A),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,32]),5,48]),
[iquote('para(48,32),demod([5,48])')] ).
cnf(240,plain,
equal(multiplication(antidomain(sK1_goals_X1),sK2_goals_X0),zero),
inference(para,[status(thm),theory(equality)],[24,230]),
[iquote('para(24,230)')] ).
cnf(304,plain,
equal(multiplication(antidomain(A),antidomain(antidomain(multiplication(A,B)))),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[215,16]),9]),
[iquote('para(215,16),demod([9])')] ).
cnf(423,plain,
equal(multiplication(antidomain(antidomain(antidomain(A))),antidomain(A)),antidomain(antidomain(antidomain(A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,62]),30]),
[iquote('para(16,62),demod([30])')] ).
cnf(440,plain,
equal(multiplication(antidomain(antidomain(A)),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,63]),5]),
[iquote('para(16,63),demod([5])')] ).
cnf(441,plain,
equal(antidomain(antidomain(antidomain(A))),antidomain(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[423]),440]),1]),
[iquote('back_demod(423),demod([440]),flip(1)')] ).
cnf(1728,plain,
equal(multiplication(antidomain(antidomain(sK1_goals_X1)),sK2_goals_X0),sK2_goals_X0),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[240,63]),5]),
[iquote('para(240,63),demod([5])')] ).
cnf(4909,plain,
equal(multiplication(antidomain(A),antidomain(multiplication(A,B))),antidomain(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[304,62]),30]),
[iquote('para(304,62),demod([30])')] ).
cnf(4913,plain,
equal(multiplication(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)),antidomain(sK1_goals_X1)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1728,4909]),441,441]),
[iquote('para(1728,4909),demod([441,441])')] ).
cnf(7680,plain,
equal(addition(multiplication(antidomain(antidomain(sK1_goals_X1)),antidomain(sK2_goals_X0)),antidomain(sK1_goals_X1)),antidomain(sK2_goals_X0)),
inference(para,[status(thm),theory(equality)],[4913,63]),
[iquote('para(4913,63)')] ).
cnf(7683,plain,
equal(leq(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)),true),
inference(para,[status(thm),theory(equality)],[7680,141]),
[iquote('para(7680,141)')] ).
cnf(7708,plain,
equal(addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)),antidomain(sK2_goals_X0)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7683,14]),2]),
[iquote('para(7683,14),demod([2])')] ).
cnf(7709,plain,
$false,
inference(conflict,[status(thm)],[7708,25]),
[iquote('conflict(7708,25)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : KLE090-10 : TPTP v8.1.0. Released v7.3.0.
% 0.08/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 14:00:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.10 ----- EQP 0.9e, May 2009 -----
% 0.69/1.10 The job began on n012.cluster.edu, Thu Jun 16 14:00:25 2022
% 0.69/1.10 The command was "./eqp09e".
% 0.69/1.10
% 0.69/1.10 set(prolog_style_variables).
% 0.69/1.10 set(lrpo).
% 0.69/1.10 set(basic_paramod).
% 0.69/1.10 set(functional_subsume).
% 0.69/1.10 set(ordered_paramod).
% 0.69/1.10 set(prime_paramod).
% 0.69/1.10 set(para_pairs).
% 0.69/1.10 assign(pick_given_ratio,4).
% 0.69/1.10 clear(print_kept).
% 0.69/1.10 clear(print_new_demod).
% 0.69/1.10 clear(print_back_demod).
% 0.69/1.10 clear(print_given).
% 0.69/1.10 assign(max_mem,64000).
% 0.69/1.10 end_of_commands.
% 0.69/1.10
% 0.69/1.10 Usable:
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Sos:
% 0.69/1.10 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.69/1.10 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.69/1.10 0 (wt=-1) [] addition(A,B) = addition(B,A).
% 0.69/1.10 0 (wt=-1) [] addition(A,addition(B,C)) = addition(addition(A,B),C).
% 0.69/1.10 0 (wt=-1) [] addition(A,zero) = A.
% 0.69/1.10 0 (wt=-1) [] addition(A,A) = A.
% 0.69/1.10 0 (wt=-1) [] multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C).
% 0.69/1.10 0 (wt=-1) [] multiplication(A,one) = A.
% 0.69/1.10 0 (wt=-1) [] multiplication(one,A) = A.
% 0.69/1.10 0 (wt=-1) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 0.69/1.10 0 (wt=-1) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 0.69/1.10 0 (wt=-1) [] multiplication(A,zero) = zero.
% 0.69/1.10 0 (wt=-1) [] multiplication(zero,A) = zero.
% 0.69/1.10 0 (wt=-1) [] ifeq(leq(A,B),true,addition(A,B),B) = B.
% 0.69/1.10 0 (wt=-1) [] ifeq2(addition(A,B),B,leq(A,B),true) = true.
% 0.69/1.10 0 (wt=-1) [] multiplication(antidomain(A),A) = zero.
% 0.69/1.10 0 (wt=-1) [] addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))) = antidomain(multiplication(A,antidomain(antidomain(B)))).
% 0.69/1.10 0 (wt=-1) [] addition(antidomain(antidomain(A)),antidomain(A)) = one.
% 0.69/1.10 0 (wt=-1) [] domain(A) = antidomain(antidomain(A)).
% 0.69/1.10 0 (wt=-1) [] multiplication(A,coantidomain(A)) = zero.
% 0.69/1.10 0 (wt=-1) [] addition(coantidomain(multiplication(A,B)),coantidomain(multiplication(coantidomain(coantidomain(A)),B))) = coantidomain(multiplication(coantidomain(coantidomain(A)),B)).
% 0.69/1.10 0 (wt=-1) [] addition(coantidomain(coantidomain(A)),coantidomain(A)) = one.
% 0.69/1.10 0 (wt=-1) [] codomain(A) = coantidomain(coantidomain(A)).
% 0.69/1.10 0 (wt=-1) [] addition(sK2_goals_X0,sK1_goals_X1) = sK1_goals_X1.
% 0.69/1.10 0 (wt=-1) [] -(addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)) = antidomain(sK2_goals_X0)).
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Demodulators:
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Passive:
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Starting to process input.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.69/1.10 1 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.10 2 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 3 (wt=7) [] addition(A,B) = addition(B,A).
% 0.69/1.10 clause forward subsumed: 0 (wt=7) [flip(3)] addition(B,A) = addition(A,B).
% 0.69/1.10
% 0.69/1.10 ** KEPT: 4 (wt=11) [flip(1)] addition(addition(A,B),C) = addition(A,addition(B,C)).
% 0.69/1.10 4 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 5 (wt=5) [] addition(A,zero) = A.
% 0.69/1.10 5 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 6 (wt=5) [] addition(A,A) = A.
% 0.69/1.10 6 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 7 (wt=11) [flip(1)] multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)).
% 0.69/1.10 7 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 8 (wt=5) [] multiplication(A,one) = A.
% 0.69/1.10 8 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 9 (wt=5) [] multiplication(one,A) = A.
% 0.69/1.10 9 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 10 (wt=13) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 0.69/1.10 10 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 11 (wt=13) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 0.69/1.10 11 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 12 (wt=5) [] multiplication(A,zero) = zero.
% 0.69/1.10 12 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 13 (wt=5) [] multiplication(zero,A) = zero.
% 0.69/1.10 13 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 14 (wt=11) [] ifeq(leq(A,B),true,addition(A,B),B) = B.
% 0.69/1.10 14 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 15 (wt=11) [] ifeq2(addition(A,B),B,leq(A,B),true) = true.
% 0.69/1.10 15 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 16 (wt=6) [] multiplication(antidomain(A),A) = zero.
% 0.69/1.10 16 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 17 (wt=18) [] addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))) = antidomain(multiplication(A,antidomain(antidomain(B)))).
% 0.69/1.10 17 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 18 (wt=8) [] addition(antidomain(antidomain(A)),antidomain(A)) = one.
% 0.69/1.10 18 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 19 (wt=6) [] domain(A) = antidomain(antidomain(A)).
% 0.69/1.10 19 is a new demodulator.
% 2.71/3.07
% 2.71/3.07 ** KEPT: 20 (wt=6) [] multiplication(A,coantidomain(A)) = zero.
% 2.71/3.07 20 is a new demodulator.
% 2.71/3.07
% 2.71/3.07 ** KEPT: 21 (wt=18) [] addition(coantidomain(multiplication(A,B)),coantidomain(multiplication(coantidomain(coantidomain(A)),B))) = coantidomain(multiplication(coantidomain(coantidomain(A)),B)).
% 2.71/3.07 21 is a new demodulator.
% 2.71/3.07
% 2.71/3.07 ** KEPT: 22 (wt=8) [] addition(coantidomain(coantidomain(A)),coantidomain(A)) = one.
% 2.71/3.07 22 is a new demodulator.
% 2.71/3.07
% 2.71/3.07 ** KEPT: 23 (wt=6) [] codomain(A) = coantidomain(coantidomain(A)).
% 2.71/3.07 23 is a new demodulator.
% 2.71/3.07
% 2.71/3.07 ** KEPT: 24 (wt=5) [] addition(sK2_goals_X0,sK1_goals_X1) = sK1_goals_X1.
% 2.71/3.07 24 is a new demodulator.
% 2.71/3.07
% 2.71/3.07 ** KEPT: 25 (wt=8) [] -(addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)) = antidomain(sK2_goals_X0)).
% 2.71/3.07 ---------------- PROOF FOUND ----------------
% 2.71/3.07 % SZS status Unsatisfiable
% 2.71/3.07
% 2.71/3.07
% 2.71/3.07 After processing input:
% 2.71/3.07
% 2.71/3.07 Usable:
% 2.71/3.07 end_of_list.
% 2.71/3.07
% 2.71/3.07 Sos:
% 2.71/3.07 5 (wt=5) [] addition(A,zero) = A.
% 2.71/3.07 6 (wt=5) [] addition(A,A) = A.
% 2.71/3.07 8 (wt=5) [] multiplication(A,one) = A.
% 2.71/3.07 9 (wt=5) [] multiplication(one,A) = A.
% 2.71/3.07 12 (wt=5) [] multiplication(A,zero) = zero.
% 2.71/3.07 13 (wt=5) [] multiplication(zero,A) = zero.
% 2.71/3.07 24 (wt=5) [] addition(sK2_goals_X0,sK1_goals_X1) = sK1_goals_X1.
% 2.71/3.07 16 (wt=6) [] multiplication(antidomain(A),A) = zero.
% 2.71/3.07 19 (wt=6) [] domain(A) = antidomain(antidomain(A)).
% 2.71/3.07 20 (wt=6) [] multiplication(A,coantidomain(A)) = zero.
% 2.71/3.07 23 (wt=6) [] codomain(A) = coantidomain(coantidomain(A)).
% 2.71/3.07 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 2.71/3.07 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 2.71/3.07 3 (wt=7) [] addition(A,B) = addition(B,A).
% 2.71/3.07 18 (wt=8) [] addition(antidomain(antidomain(A)),antidomain(A)) = one.
% 2.71/3.07 22 (wt=8) [] addition(coantidomain(coantidomain(A)),coantidomain(A)) = one.
% 2.71/3.07 25 (wt=8) [] -(addition(antidomain(sK1_goals_X1),antidomain(sK2_goals_X0)) = antidomain(sK2_goals_X0)).
% 2.71/3.07 4 (wt=11) [flip(1)] addition(addition(A,B),C) = addition(A,addition(B,C)).
% 2.71/3.07 7 (wt=11) [flip(1)] multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)).
% 2.71/3.07 14 (wt=11) [] ifeq(leq(A,B),true,addition(A,B),B) = B.
% 2.71/3.07 15 (wt=11) [] ifeq2(addition(A,B),B,leq(A,B),true) = true.
% 2.71/3.07 10 (wt=13) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 2.71/3.07 11 (wt=13) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 2.71/3.07 17 (wt=18) [] addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))) = antidomain(multiplication(A,antidomain(antidomain(B)))).
% 2.71/3.07 21 (wt=18) [] addition(coantidomain(multiplication(A,B)),coantidomain(multiplication(coantidomain(coantidomain(A)),B))) = coantidomain(multiplication(coantidomain(coantidomain(A)),B)).
% 2.71/3.07 end_of_list.
% 2.71/3.07
% 2.71/3.07 Demodulators:
% 2.71/3.07 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 2.71/3.07 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 2.71/3.07 4 (wt=11) [flip(1)] addition(addition(A,B),C) = addition(A,addition(B,C)).
% 2.71/3.07 5 (wt=5) [] addition(A,zero) = A.
% 2.71/3.07 6 (wt=5) [] addition(A,A) = A.
% 2.71/3.07 7 (wt=11) [flip(1)] multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)).
% 2.71/3.07 8 (wt=5) [] multiplication(A,one) = A.
% 2.71/3.07 9 (wt=5) [] multiplication(one,A) = A.
% 2.71/3.07 10 (wt=13) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 2.71/3.07 11 (wt=13) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 2.71/3.07 12 (wt=5) [] multiplication(A,zero) = zero.
% 2.71/3.07 13 (wt=5) [] multiplication(zero,A) = zero.
% 2.71/3.07 14 (wt=11) [] ifeq(leq(A,B),true,addition(A,B),B) = B.
% 2.71/3.07 15 (wt=11) [] ifeq2(addition(A,B),B,leq(A,B),true) = true.
% 2.71/3.07 16 (wt=6) [] multiplication(antidomain(A),A) = zero.
% 2.71/3.07 17 (wt=18) [] addition(antidomain(multiplication(A,B)),antidomain(multiplication(A,antidomain(antidomain(B))))) = antidomain(multiplication(A,antidomain(antidomain(B)))).
% 2.71/3.07 18 (wt=8) [] addition(antidomain(antidomain(A)),antidomain(A)) = one.
% 2.71/3.07 19 (wt=6) [] domain(A) = antidomain(antidomain(A)).
% 2.71/3.07 20 (wt=6) [] multiplication(A,coantidomain(A)) = zero.
% 2.71/3.07 21 (wt=18) [] addition(coantidomain(multiplication(A,B)),coantidomain(multiplication(coantidomain(coantidomain(A)),B))) = coantidomain(multiplication(coantidomain(coantidomain(A)),B)).
% 2.71/3.07 22 (wt=8) [] addition(coantidomain(coantidomain(A)),coantidomain(A)) = one.
% 2.71/3.07 23 (wt=6) [] codomain(A) = coantidomain(coantidomain(A)).
% 2.71/3.07 24 (wt=5) [] addition(sK2_goals_X0,sK1_goals_X1) = sK1_goals_X1.
% 2.71/3.07 end_of_list.
% 2.71/3.07
% 2.71/3.07 Passive:
% 2.71/3.07 end_of_list.
% 2.71/3.07
% 2.71/3.07 UNIT CONFLICT from 7708 and 25 at 1.10 seconds.
% 2.71/3.07
% 2.71/3.07 ---------------- PROOF ----------------
% 2.71/3.07 % SZS output start Refutation
% See solution above
% 2.71/3.07 ------------ end of proof -------------
% 2.71/3.07
% 2.71/3.07
% 2.71/3.07 ------------- memory usage ------------
% 2.71/3.07 Memory dynamically allocated (tp_alloc): 18554.
% 2.71/3.07 type (bytes each) gets frees in use avail bytes
% 2.71/3.07 sym_ent ( 96) 67 0 67 0 6.3 K
% 2.71/3.07 term ( 16) 1394585 1163170 231415 21 4490.1 K
% 2.71/3.07 gen_ptr ( 8) 1491642 301009 1190633 45 9302.2 K
% 2.71/3.07 context ( 808) 2796972 2796970 2 6 6.3 K
% 2.71/3.07 trail ( 12) 105508 105508 0 6 0.1 K
% 2.71/3.07 bt_node ( 68) 1325271 1325268 3 48 3.4 K
% 2.71/3.07 ac_position (285432) 0 0 0 0 0.0 K
% 2.71/3.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.71/3.07 ac_match_free_vars_pos (4020)
% 2.71/3.07 0 0 0 0 0.0 K
% 2.71/3.07 discrim ( 12) 234420 45348 189072 0 2215.7 K
% 2.71/3.07 flat ( 40) 3163231 3163231 0 115 4.5 K
% 2.71/3.07 discrim_pos ( 12) 84372 84372 0 1 0.0 K
% 2.71/3.07 fpa_head ( 12) 33228 0 33228 0 389.4 K
% 2.71/3.07 fpa_tree ( 28) 52190 52190 0 31 0.8 K
% 2.71/3.07 fpa_pos ( 36) 14410 14410 0 1 0.0 K
% 2.71/3.07 literal ( 12) 50725 43017 7708 1 90.3 K
% 2.71/3.07 clause ( 24) 50725 43017 7708 1 180.7 K
% 2.71/3.07 list ( 12) 6761 6705 56 5 0.7 K
% 2.71/3.07 list_pos ( 20) 33181 7840 25341 0 494.9 K
% 2.71/3.07 pair_index ( 40) 2 0 2 0 0.1 K
% 2.71/3.07
% 2.71/3.07 -------------- statistics -------------
% 2.71/3.07 Clauses input 25
% 2.71/3.07 Usable input 0
% 2.71/3.07 Sos input 25
% 2.71/3.07 Demodulators input 0
% 2.71/3.07 Passive input 0
% 2.71/3.07
% 2.71/3.07 Processed BS (before search) 26
% 2.71/3.07 Forward subsumed BS 1
% 2.71/3.07 Kept BS 25
% 2.71/3.07 New demodulators BS 23
% 2.71/3.07 Back demodulated BS 0
% 2.71/3.07
% 2.71/3.07 Clauses or pairs given 182541
% 2.71/3.07 Clauses generated 39285
% 2.71/3.07 Forward subsumed 31602
% 2.71/3.07 Deleted by weight 0
% 2.71/3.07 Deleted by variable count 0
% 2.71/3.07 Kept 7683
% 2.71/3.07 New demodulators 6679
% 2.71/3.07 Back demodulated 1644
% 2.71/3.07 Ordered paramod prunes 0
% 2.71/3.07 Basic paramod prunes 877444
% 2.71/3.07 Prime paramod prunes 2149
% 2.71/3.07 Semantic prunes 0
% 2.71/3.07
% 2.71/3.07 Rewrite attmepts 651505
% 2.71/3.07 Rewrites 79027
% 2.71/3.07
% 2.71/3.07 FPA overloads 0
% 2.71/3.07 FPA underloads 0
% 2.71/3.07
% 2.71/3.07 Usable size 0
% 2.71/3.07 Sos size 6063
% 2.71/3.07 Demodulators size 5508
% 2.71/3.07 Passive size 0
% 2.71/3.07 Disabled size 1644
% 2.71/3.07
% 2.71/3.07 Proofs found 1
% 2.71/3.07
% 2.71/3.07 ----------- times (seconds) ----------- Thu Jun 16 14:00:27 2022
% 2.71/3.07
% 2.71/3.07 user CPU time 1.10 (0 hr, 0 min, 1 sec)
% 2.71/3.07 system CPU time 0.88 (0 hr, 0 min, 0 sec)
% 2.71/3.07 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.71/3.07 input time 0.00
% 2.71/3.07 paramodulation time 0.24
% 2.71/3.07 demodulation time 0.09
% 2.71/3.07 orient time 0.07
% 2.71/3.07 weigh time 0.01
% 2.71/3.07 forward subsume time 0.03
% 2.71/3.07 back demod find time 0.03
% 2.71/3.07 conflict time 0.00
% 2.71/3.07 LRPO time 0.03
% 2.71/3.07 store clause time 0.33
% 2.71/3.07 disable clause time 0.05
% 2.71/3.07 prime paramod time 0.05
% 2.71/3.07 semantics time 0.00
% 2.71/3.07
% 2.71/3.07 EQP interrupted
%------------------------------------------------------------------------------