%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : HEN010-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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 12:51:12 EDT 2022
% Result : Unsatisfiable 3.11s 3.58s
% Output : Refutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 18 RR)
% Number of literals : 46 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-4 aty)
% Number of variables : 78 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('HEN010-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('HEN010-10.p',unknown),
[] ).
cnf(4,plain,
equal(ifeq(quotient(A,B,zero),true,less_equal(A,B),true),true),
file('HEN010-10.p',unknown),
[] ).
cnf(5,plain,
equal(ifeq(quotient(A,B,C),true,less_equal(C,A),true),true),
file('HEN010-10.p',unknown),
[] ).
cnf(6,plain,
equal(ifeq(quotient(A,B,C),true,ifeq(quotient(D,E,F),true,ifeq(quotient(G,E,B),true,ifeq(quotient(H,E,A),true,ifeq(quotient(H,G,D),true,less_equal(C,F),true),true),true),true),true),true),
file('HEN010-10.p',unknown),
[] ).
cnf(8,plain,
equal(ifeq2(less_equal(A,B),true,ifeq2(less_equal(B,A),true,B,A),A),A),
file('HEN010-10.p',unknown),
[] ).
cnf(10,plain,
equal(quotient(A,B,divide(A,B)),true),
file('HEN010-10.p',unknown),
[] ).
cnf(11,plain,
equal(ifeq2(quotient(A,B,C),true,ifeq2(quotient(A,B,D),true,D,C),C),C),
file('HEN010-10.p',unknown),
[] ).
cnf(14,plain,
equal(quotient(A,A,zero),true),
file('HEN010-10.p',unknown),
[] ).
cnf(15,plain,
equal(quotient(A,zero,A),true),
file('HEN010-10.p',unknown),
[] ).
cnf(16,plain,
equal(ifeq(less_equal(A,B),true,ifeq(less_equal(C,A),true,less_equal(C,B),true),true),true),
file('HEN010-10.p',unknown),
[] ).
cnf(17,plain,
equal(ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(E,B),true,less_equal(C,D),true),true),true),true),
file('HEN010-10.p',unknown),
[] ).
cnf(18,plain,
equal(ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(D,B),true,less_equal(C,E),true),true),true),true),
file('HEN010-10.p',unknown),
[] ).
cnf(20,plain,
equal(quotient(identity,a,idQa),true),
file('HEN010-10.p',unknown),
[] ).
cnf(21,plain,
equal(quotient(identity,idQa,idQ_idQa),true),
file('HEN010-10.p',unknown),
[] ).
cnf(22,plain,
equal(quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa),true),
file('HEN010-10.p',unknown),
[] ).
cnf(23,plain,
~ equal(idQa_Q__idQ_idQa,idQa),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(34,plain,
equal(less_equal(divide(A,B),A),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,5]),2]),
[iquote('para(10,5),demod([2])')] ).
cnf(42,plain,
equal(ifeq2(quotient(A,B,C),true,divide(A,B),C),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),1]),
[iquote('para(10,11),demod([1])')] ).
cnf(58,plain,
equal(less_equal(A,A),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,4]),2]),
[iquote('para(14,4),demod([2])')] ).
cnf(66,plain,
equal(ifeq(quotient(A,B,C),true,ifeq(quotient(D,B,zero),true,ifeq(quotient(E,B,F),true,ifeq(quotient(E,D,A),true,less_equal(F,C),true),true),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,6]),2]),
[iquote('para(15,6),demod([2])')] ).
cnf(83,plain,
equal(ifeq(quotient(A,B,C),true,ifeq(less_equal(C,D),true,less_equal(divide(A,D),B),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,17]),2]),
[iquote('para(10,17),demod([2])')] ).
cnf(92,plain,
equal(ifeq(quotient(A,B,C),true,ifeq(less_equal(B,D),true,less_equal(divide(A,D),C),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,18]),2]),
[iquote('para(10,18),demod([2])')] ).
cnf(111,plain,
equal(divide(identity,a),idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,42]),1]),
[iquote('para(20,42),demod([1])')] ).
cnf(125,plain,
equal(ifeq2(quotient(identity,idQa,A),true,A,idQ_idQa),idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,11]),1]),
[iquote('para(21,11),demod([1])')] ).
cnf(133,plain,
equal(less_equal(idQa_Q__idQ_idQa,idQa),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,5]),2]),
[iquote('para(22,5),demod([2])')] ).
cnf(139,plain,
equal(ifeq2(quotient(idQa,idQ_idQa,A),true,A,idQa_Q__idQ_idQa),idQa_Q__idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,11]),1]),
[iquote('para(22,11),demod([1])')] ).
cnf(148,plain,
equal(divide(identity,idQa),idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,125]),1]),
[iquote('para(10,125),demod([1])')] ).
cnf(153,plain,
equal(ifeq(less_equal(A,B),true,less_equal(divide(A,C),B),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,16]),2]),
[iquote('para(34,16),demod([2])')] ).
cnf(161,plain,
equal(divide(idQa,idQ_idQa),idQa_Q__idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,139]),1]),
[iquote('para(10,139),demod([1])')] ).
cnf(242,plain,
equal(ifeq(less_equal(idQa,A),true,less_equal(idQa_Q__idQ_idQa,A),true),true),
inference(para,[status(thm),theory(equality)],[161,153]),
[iquote('para(161,153)')] ).
cnf(334,plain,
equal(ifeq2(less_equal(idQa,idQa_Q__idQ_idQa),true,idQa,idQa_Q__idQ_idQa),idQa_Q__idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[133,8]),1]),
[iquote('para(133,8),demod([1])')] ).
cnf(426,plain,
equal(ifeq(quotient(A,a,B),true,ifeq(quotient(C,a,zero),true,ifeq(quotient(identity,C,A),true,less_equal(idQa,B),true),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,66]),2]),
[iquote('para(20,66),demod([2])')] ).
cnf(489,plain,
equal(ifeq(less_equal(divide(A,B),C),true,less_equal(divide(A,C),B),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,83]),2]),
[iquote('para(10,83),demod([2])')] ).
cnf(490,plain,
equal(less_equal(divide(A,divide(A,B)),B),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[58,489]),2]),
[iquote('para(58,489),demod([2])')] ).
cnf(491,plain,
equal(less_equal(idQ_idQa,a),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[111,490]),148]),
[iquote('para(111,490),demod([148])')] ).
cnf(531,plain,
equal(ifeq(less_equal(idQ_idQa,A),true,less_equal(divide(idQa,A),idQa_Q__idQ_idQa),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,92]),2]),
[iquote('para(22,92),demod([2])')] ).
cnf(539,plain,
equal(less_equal(divide(idQa,a),idQa_Q__idQ_idQa),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[491,531]),2]),
[iquote('para(491,531),demod([2])')] ).
cnf(1985,plain,
equal(ifeq2(less_equal(idQa_Q__idQ_idQa,divide(idQa,a)),true,divide(idQa,a),idQa_Q__idQ_idQa),idQa_Q__idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[539,8]),1]),
[iquote('para(539,8),demod([1])')] ).
cnf(3905,plain,
equal(ifeq(quotient(idQa,a,A),true,less_equal(idQa,A),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,426]),14,2,2]),
[iquote('para(20,426),demod([14,2,2])')] ).
cnf(3907,plain,
equal(less_equal(idQa,divide(idQa,a)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,3905]),2]),
[iquote('para(10,3905),demod([2])')] ).
cnf(3908,plain,
equal(less_equal(idQa_Q__idQ_idQa,divide(idQa,a)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3907,242]),2]),
[iquote('para(3907,242),demod([2])')] ).
cnf(3909,plain,
equal(divide(idQa,a),idQa_Q__idQ_idQa),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1985]),3908,1]),
[iquote('back_demod(1985),demod([3908,1])')] ).
cnf(3910,plain,
equal(less_equal(idQa,idQa_Q__idQ_idQa),true),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3907]),3909]),
[iquote('back_demod(3907),demod([3909])')] ).
cnf(3911,plain,
equal(idQa_Q__idQ_idQa,idQa),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[334]),3910,1]),1]),
[iquote('back_demod(334),demod([3910,1]),flip(1)')] ).
cnf(3912,plain,
$false,
inference(conflict,[status(thm)],[3911,23]),
[iquote('conflict(3911,23)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : HEN010-10 : TPTP v8.1.0. Released v7.3.0.
% 0.00/0.07 % Command : tptp2X_and_run_eqp %s
% 0.06/0.26 % Computer : n015.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Fri Jul 1 14:35:43 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.61/1.00 ----- EQP 0.9e, May 2009 -----
% 0.61/1.00 The job began on n015.cluster.edu, Fri Jul 1 14:35:43 2022
% 0.61/1.00 The command was "./eqp09e".
% 0.61/1.00
% 0.61/1.00 set(prolog_style_variables).
% 0.61/1.00 set(lrpo).
% 0.61/1.00 set(basic_paramod).
% 0.61/1.00 set(functional_subsume).
% 0.61/1.00 set(ordered_paramod).
% 0.61/1.00 set(prime_paramod).
% 0.61/1.00 set(para_pairs).
% 0.61/1.00 assign(pick_given_ratio,4).
% 0.61/1.00 clear(print_kept).
% 0.61/1.00 clear(print_new_demod).
% 0.61/1.00 clear(print_back_demod).
% 0.61/1.00 clear(print_given).
% 0.61/1.00 assign(max_mem,64000).
% 0.61/1.00 end_of_commands.
% 0.61/1.00
% 0.61/1.00 Usable:
% 0.61/1.00 end_of_list.
% 0.61/1.00
% 0.61/1.00 Sos:
% 0.61/1.00 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.61/1.00 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.61/1.00 0 (wt=-1) [] ifeq(less_equal(A,B),true,quotient(A,B,zero),true) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(quotient(A,B,zero),true,less_equal(A,B),true) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(quotient(A,B,C),true,less_equal(C,A),true) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,E,F),true,ifeq(quotient(G,E,B),true,ifeq(quotient(H,E,A),true,ifeq(quotient(H,G,D),true,less_equal(C,F),true),true),true),true),true) = true.
% 0.61/1.00 0 (wt=-1) [] less_equal(zero,A) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq2(less_equal(A,B),true,ifeq2(less_equal(B,A),true,B,A),A) = A.
% 0.61/1.00 0 (wt=-1) [] less_equal(A,identity) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(A,B,divide(A,B)) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq2(quotient(A,B,C),true,ifeq2(quotient(A,B,D),true,D,C),C) = C.
% 0.61/1.00 0 (wt=-1) [] quotient(A,identity,zero) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(zero,A,zero) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(A,A,zero) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(A,zero,A) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(less_equal(A,B),true,ifeq(less_equal(C,A),true,less_equal(C,B),true),true) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(E,B),true,less_equal(C,D),true),true),true) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(D,B),true,less_equal(C,E),true),true),true) = true.
% 0.61/1.00 0 (wt=-1) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,B,E),true,ifeq(less_equal(D,A),true,less_equal(E,C),true),true),true) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(identity,a,idQa) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(identity,idQa,idQ_idQa) = true.
% 0.61/1.00 0 (wt=-1) [] quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa) = true.
% 0.61/1.00 0 (wt=-1) [] -(idQa = idQa_Q__idQ_idQa).
% 0.61/1.00 end_of_list.
% 0.61/1.00
% 0.61/1.00 Demodulators:
% 0.61/1.00 end_of_list.
% 0.61/1.00
% 0.61/1.00 Passive:
% 0.61/1.00 end_of_list.
% 0.61/1.00
% 0.61/1.00 Starting to process input.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.61/1.00 1 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.61/1.00 2 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 3 (wt=12) [] ifeq(less_equal(A,B),true,quotient(A,B,zero),true) = true.
% 0.61/1.00 3 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 4 (wt=12) [] ifeq(quotient(A,B,zero),true,less_equal(A,B),true) = true.
% 0.61/1.00 4 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 5 (wt=12) [] ifeq(quotient(A,B,C),true,less_equal(C,A),true) = true.
% 0.61/1.00 5 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 6 (wt=40) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,E,F),true,ifeq(quotient(G,E,B),true,ifeq(quotient(H,E,A),true,ifeq(quotient(H,G,D),true,less_equal(C,F),true),true),true),true),true) = true.
% 0.61/1.00 6 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 7 (wt=5) [] less_equal(zero,A) = true.
% 0.61/1.00 7 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 8 (wt=15) [] ifeq2(less_equal(A,B),true,ifeq2(less_equal(B,A),true,B,A),A) = A.
% 0.61/1.00 8 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 9 (wt=5) [] less_equal(A,identity) = true.
% 0.61/1.00 9 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 10 (wt=8) [] quotient(A,B,divide(A,B)) = true.
% 0.61/1.00 10 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 11 (wt=17) [] ifeq2(quotient(A,B,C),true,ifeq2(quotient(A,B,D),true,D,C),C) = C.
% 0.61/1.00 11 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 12 (wt=6) [] quotient(A,identity,zero) = true.
% 0.61/1.00 12 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 13 (wt=6) [] quotient(zero,A,zero) = true.
% 0.61/1.00 13 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 14 (wt=6) [] quotient(A,A,zero) = true.
% 0.61/1.00 14 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 15 (wt=6) [] quotient(A,zero,A) = true.
% 0.61/1.00 15 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 16 (wt=17) [] ifeq(less_equal(A,B),true,ifeq(less_equal(C,A),true,less_equal(C,B),true),true) = true.
% 0.61/1.00 16 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 17 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(E,B),true,less_equal(C,D),true),true),true) = true.
% 0.61/1.00 17 is a new demodulator.
% 0.61/1.00
% 0.61/1.00 ** KEPT: 18 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(D,B),true,less_equal(C,E),true),true),true) = true.
% 0.61/1.00 18 is a new demodulator.
% 3.11/3.58
% 3.11/3.58 ** KEPT: 19 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,B,E),true,ifeq(less_equal(D,A),true,less_equal(E,C),true),true),true) = true.
% 3.11/3.58 19 is a new demodulator.
% 3.11/3.58
% 3.11/3.58 ** KEPT: 20 (wt=6) [] quotient(identity,a,idQa) = true.
% 3.11/3.58 20 is a new demodulator.
% 3.11/3.58
% 3.11/3.58 ** KEPT: 21 (wt=6) [] quotient(identity,idQa,idQ_idQa) = true.
% 3.11/3.58 21 is a new demodulator.
% 3.11/3.58
% 3.11/3.58 ** KEPT: 22 (wt=6) [] quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa) = true.
% 3.11/3.58 22 is a new demodulator.
% 3.11/3.58
% 3.11/3.58 ** KEPT: 23 (wt=3) [flip(1)] -(idQa_Q__idQ_idQa = idQa).
% 3.11/3.58 ---------------- PROOF FOUND ----------------
% 3.11/3.58 % SZS status Unsatisfiable
% 3.11/3.58
% 3.11/3.58
% 3.11/3.58 After processing input:
% 3.11/3.58
% 3.11/3.58 Usable:
% 3.11/3.58 end_of_list.
% 3.11/3.58
% 3.11/3.58 Sos:
% 3.11/3.58 23 (wt=3) [flip(1)] -(idQa_Q__idQ_idQa = idQa).
% 3.11/3.58 7 (wt=5) [] less_equal(zero,A) = true.
% 3.11/3.58 9 (wt=5) [] less_equal(A,identity) = true.
% 3.11/3.58 12 (wt=6) [] quotient(A,identity,zero) = true.
% 3.11/3.58 13 (wt=6) [] quotient(zero,A,zero) = true.
% 3.11/3.58 14 (wt=6) [] quotient(A,A,zero) = true.
% 3.11/3.58 15 (wt=6) [] quotient(A,zero,A) = true.
% 3.11/3.58 20 (wt=6) [] quotient(identity,a,idQa) = true.
% 3.11/3.58 21 (wt=6) [] quotient(identity,idQa,idQ_idQa) = true.
% 3.11/3.58 22 (wt=6) [] quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa) = true.
% 3.11/3.58 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 3.11/3.58 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 3.11/3.58 10 (wt=8) [] quotient(A,B,divide(A,B)) = true.
% 3.11/3.58 3 (wt=12) [] ifeq(less_equal(A,B),true,quotient(A,B,zero),true) = true.
% 3.11/3.58 4 (wt=12) [] ifeq(quotient(A,B,zero),true,less_equal(A,B),true) = true.
% 3.11/3.58 5 (wt=12) [] ifeq(quotient(A,B,C),true,less_equal(C,A),true) = true.
% 3.11/3.58 8 (wt=15) [] ifeq2(less_equal(A,B),true,ifeq2(less_equal(B,A),true,B,A),A) = A.
% 3.11/3.58 11 (wt=17) [] ifeq2(quotient(A,B,C),true,ifeq2(quotient(A,B,D),true,D,C),C) = C.
% 3.11/3.58 16 (wt=17) [] ifeq(less_equal(A,B),true,ifeq(less_equal(C,A),true,less_equal(C,B),true),true) = true.
% 3.11/3.58 17 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(E,B),true,less_equal(C,D),true),true),true) = true.
% 3.11/3.58 18 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(D,B),true,less_equal(C,E),true),true),true) = true.
% 3.11/3.58 19 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,B,E),true,ifeq(less_equal(D,A),true,less_equal(E,C),true),true),true) = true.
% 3.11/3.58 6 (wt=40) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,E,F),true,ifeq(quotient(G,E,B),true,ifeq(quotient(H,E,A),true,ifeq(quotient(H,G,D),true,less_equal(C,F),true),true),true),true),true) = true.
% 3.11/3.58 end_of_list.
% 3.11/3.58
% 3.11/3.58 Demodulators:
% 3.11/3.58 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 3.11/3.58 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 3.11/3.58 3 (wt=12) [] ifeq(less_equal(A,B),true,quotient(A,B,zero),true) = true.
% 3.11/3.58 4 (wt=12) [] ifeq(quotient(A,B,zero),true,less_equal(A,B),true) = true.
% 3.11/3.58 5 (wt=12) [] ifeq(quotient(A,B,C),true,less_equal(C,A),true) = true.
% 3.11/3.58 6 (wt=40) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,E,F),true,ifeq(quotient(G,E,B),true,ifeq(quotient(H,E,A),true,ifeq(quotient(H,G,D),true,less_equal(C,F),true),true),true),true),true) = true.
% 3.11/3.58 7 (wt=5) [] less_equal(zero,A) = true.
% 3.11/3.58 8 (wt=15) [] ifeq2(less_equal(A,B),true,ifeq2(less_equal(B,A),true,B,A),A) = A.
% 3.11/3.58 9 (wt=5) [] less_equal(A,identity) = true.
% 3.11/3.58 10 (wt=8) [] quotient(A,B,divide(A,B)) = true.
% 3.11/3.58 11 (wt=17) [] ifeq2(quotient(A,B,C),true,ifeq2(quotient(A,B,D),true,D,C),C) = C.
% 3.11/3.58 12 (wt=6) [] quotient(A,identity,zero) = true.
% 3.11/3.58 13 (wt=6) [] quotient(zero,A,zero) = true.
% 3.11/3.58 14 (wt=6) [] quotient(A,A,zero) = true.
% 3.11/3.58 15 (wt=6) [] quotient(A,zero,A) = true.
% 3.11/3.58 16 (wt=17) [] ifeq(less_equal(A,B),true,ifeq(less_equal(C,A),true,less_equal(C,B),true),true) = true.
% 3.11/3.58 17 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(E,B),true,less_equal(C,D),true),true),true) = true.
% 3.11/3.58 18 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(A,D,E),true,ifeq(less_equal(D,B),true,less_equal(C,E),true),true),true) = true.
% 3.11/3.58 19 (wt=25) [] ifeq(quotient(A,B,C),true,ifeq(quotient(D,B,E),true,ifeq(less_equal(D,A),true,less_equal(E,C),true),true),true) = true.
% 3.11/3.58 20 (wt=6) [] quotient(identity,a,idQa) = true.
% 3.11/3.58 21 (wt=6) [] quotient(identity,idQa,idQ_idQa) = true.
% 3.11/3.58 22 (wt=6) [] quotient(idQa,idQ_idQa,idQa_Q__idQ_idQa) = true.
% 3.11/3.58 end_of_list.
% 3.11/3.58
% 3.11/3.58 Passive:
% 3.11/3.58 end_of_list.
% 3.11/3.58
% 3.11/3.58 UNIT CONFLICT from 3911 and 23 at 1.00 seconds.
% 3.11/3.58
% 3.11/3.58 ---------------- PROOF ----------------
% 3.11/3.58 % SZS output start Refutation
% See solution above
% 3.11/3.58 ------------ end of proof -------------
% 3.11/3.58
% 3.11/3.58
% 3.11/3.58 ------------- memory usage ------------
% 3.11/3.58 Memory dynamically allocated (tp_alloc): 5859.
% 3.11/3.58 type (bytes each) gets frees in use avail bytes
% 3.11/3.58 sym_ent ( 96) 74 0 74 0 6.9 K
% 3.11/3.58 term ( 16) 1430838 1355255 75583 44 1461.8 K
% 3.11/3.58 gen_ptr ( 8) 708983 388348 320635 45 2505.3 K
% 3.11/3.58 context ( 808) 10407582 10407580 2 2 3.2 K
% 3.11/3.58 trail ( 12) 21187 21187 0 8 0.1 K
% 3.11/3.58 bt_node ( 68) 8069954 8069951 3 35 2.5 K
% 3.11/3.58 ac_position (285432) 0 0 0 0 0.0 K
% 3.11/3.58 ac_match_pos (14044) 0 0 0 0 0.0 K
% 3.11/3.58 ac_match_free_vars_pos (4020)
% 3.11/3.58 0 0 0 0 0.0 K
% 3.11/3.58 discrim ( 12) 66424 3701 62723 47 735.6 K
% 3.11/3.58 flat ( 40) 2257865 2257865 0 38 1.5 K
% 3.11/3.58 discrim_pos ( 12) 110354 110354 0 1 0.0 K
% 3.11/3.58 fpa_head ( 12) 3190 0 3190 0 37.4 K
% 3.11/3.58 fpa_tree ( 28) 51460 51460 0 31 0.8 K
% 3.11/3.58 fpa_pos ( 36) 7820 7820 0 1 0.0 K
% 3.11/3.58 literal ( 12) 64568 60657 3911 1 45.8 K
% 3.11/3.58 clause ( 24) 64568 60657 3911 1 91.7 K
% 3.11/3.58 list ( 12) 3968 3909 59 0 0.7 K
% 3.11/3.58 list_pos ( 20) 16370 1648 14722 16 287.9 K
% 3.11/3.58 pair_index ( 40) 2 0 2 0 0.1 K
% 3.11/3.58
% 3.11/3.58 -------------- statistics -------------
% 3.11/3.58 Clauses input 23
% 3.11/3.58 Usable input 0
% 3.11/3.58 Sos input 23
% 3.11/3.58 Demodulators input 0
% 3.11/3.58 Passive input 0
% 3.11/3.58
% 3.11/3.58 Processed BS (before search) 23
% 3.11/3.58 Forward subsumed BS 0
% 3.11/3.58 Kept BS 23
% 3.11/3.58 New demodulators BS 22
% 3.11/3.58 Back demodulated BS 0
% 3.11/3.58
% 3.11/3.58 Clauses or pairs given 389952
% 3.11/3.58 Clauses generated 60635
% 3.11/3.58 Forward subsumed 56747
% 3.11/3.58 Deleted by weight 0
% 3.11/3.58 Deleted by variable count 0
% 3.11/3.58 Kept 3888
% 3.11/3.58 New demodulators 3887
% 3.11/3.58 Back demodulated 325
% 3.11/3.58 Ordered paramod prunes 0
% 3.11/3.58 Basic paramod prunes 1122328
% 3.11/3.58 Prime paramod prunes 3530
% 3.11/3.58 Semantic prunes 0
% 3.11/3.58
% 3.11/3.58 Rewrite attmepts 727662
% 3.11/3.58 Rewrites 106824
% 3.11/3.58
% 3.11/3.58 FPA overloads 0
% 3.11/3.58 FPA underloads 0
% 3.11/3.58
% 3.11/3.58 Usable size 0
% 3.11/3.58 Sos size 3585
% 3.11/3.58 Demodulators size 3584
% 3.11/3.58 Passive size 0
% 3.11/3.58 Disabled size 325
% 3.11/3.58
% 3.11/3.58 Proofs found 1
% 3.11/3.58
% 3.11/3.58 ----------- times (seconds) ----------- Fri Jul 1 14:35:46 2022
% 3.11/3.58
% 3.11/3.58 user CPU time 1.00 (0 hr, 0 min, 1 sec)
% 3.11/3.58 system CPU time 1.58 (0 hr, 0 min, 1 sec)
% 3.11/3.58 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.11/3.58 input time 0.00
% 3.11/3.58 paramodulation time 0.45
% 3.11/3.58 demodulation time 0.05
% 3.11/3.58 orient time 0.06
% 3.11/3.58 weigh time 0.01
% 3.11/3.58 forward subsume time 0.02
% 3.11/3.58 back demod find time 0.03
% 3.11/3.58 conflict time 0.00
% 3.11/3.58 LRPO time 0.02
% 3.11/3.58 store clause time 0.05
% 3.11/3.58 disable clause time 0.00
% 3.11/3.58 prime paramod time 0.05
% 3.11/3.58 semantics time 0.00
% 3.11/3.58
% 3.11/3.58 EQP interrupted
%------------------------------------------------------------------------------