TSTP Solution File: GRP181-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP181-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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:45:46 EDT 2022
% Result : Unsatisfiable 5.60s 5.99s
% Output : Refutation 5.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 12 RR)
% Number of literals : 43 ( 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP181-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP181-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP181-4.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP181-4.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP181-4.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP181-4.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP181-4.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP181-4.p',unknown),
[] ).
cnf(16,plain,
equal(inverse(identity),identity),
file('GRP181-4.p',unknown),
[] ).
cnf(17,plain,
equal(inverse(inverse(A)),A),
file('GRP181-4.p',unknown),
[] ).
cnf(18,plain,
equal(inverse(multiply(A,B)),multiply(inverse(B),inverse(A))),
file('GRP181-4.p',unknown),
[] ).
cnf(19,plain,
equal(greatest_lower_bound(b,c),greatest_lower_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(20,plain,
equal(least_upper_bound(b,c),least_upper_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(21,plain,
equal(inverse(greatest_lower_bound(A,B)),least_upper_bound(inverse(A),inverse(B))),
file('GRP181-4.p',unknown),
[] ).
cnf(22,plain,
equal(inverse(least_upper_bound(A,B)),greatest_lower_bound(inverse(A),inverse(B))),
file('GRP181-4.p',unknown),
[] ).
cnf(23,plain,
~ equal(b,a),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(24,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),1]),1]),
[iquote('para(2,3),demod([1]),flip(1)')] ).
cnf(25,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[17,2]),
[iquote('para(17,2)')] ).
cnf(45,plain,
equal(least_upper_bound(c,b),least_upper_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,5]),1]),
[iquote('para(20,5),flip(1)')] ).
cnf(61,plain,
equal(least_upper_bound(greatest_lower_bound(multiply(A,B),multiply(C,B)),greatest_lower_bound(multiply(A,D),multiply(C,D))),greatest_lower_bound(least_upper_bound(multiply(A,B),multiply(A,D)),least_upper_bound(multiply(C,B),multiply(C,D)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,12]),12,12,15,15]),1]),
[iquote('para(15,12),demod([12,12,15,15]),flip(1)')] ).
cnf(64,plain,
equal(multiply(inverse(A),identity),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,18]),16]),1]),
[iquote('para(1,18),demod([16]),flip(1)')] ).
cnf(65,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,64]),17]),
[iquote('para(17,64),demod([17])')] ).
cnf(68,plain,
equal(greatest_lower_bound(multiply(b,A),multiply(c,A)),greatest_lower_bound(multiply(a,A),multiply(c,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,15]),15]),1]),
[iquote('para(19,15),demod([15]),flip(1)')] ).
cnf(70,plain,
equal(least_upper_bound(multiply(A,b),multiply(A,c)),least_upper_bound(multiply(A,a),multiply(A,c))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,12]),12]),1]),
[iquote('para(20,12),demod([12]),flip(1)')] ).
cnf(82,plain,
equal(least_upper_bound(greatest_lower_bound(A,multiply(inverse(B),multiply(C,A))),greatest_lower_bound(multiply(inverse(C),multiply(B,A)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,24]),22,12,15,24,15,24]),
[iquote('para(14,24),demod([22,12,15,24,15,24])')] ).
cnf(83,plain,
equal(greatest_lower_bound(least_upper_bound(A,multiply(inverse(B),multiply(C,A))),least_upper_bound(multiply(inverse(C),multiply(B,A)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,24]),21,13,14,24,14,24]),
[iquote('para(15,24),demod([21,13,14,24,14,24])')] ).
cnf(84,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,3]),1]),1]),
[iquote('para(25,3),demod([1]),flip(1)')] ).
cnf(413,plain,
equal(least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(multiply(A,C),multiply(B,C))),greatest_lower_bound(least_upper_bound(A,multiply(A,C)),least_upper_bound(B,multiply(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[65,61]),65,65,65]),
[iquote('para(65,61),demod([65,65,65])')] ).
cnf(494,plain,
equal(least_upper_bound(multiply(inverse(c),b),identity),least_upper_bound(multiply(inverse(c),a),identity)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,70]),2]),
[iquote('para(2,70),demod([2])')] ).
cnf(624,plain,
equal(least_upper_bound(greatest_lower_bound(A,inverse(B)),greatest_lower_bound(multiply(A,multiply(B,A)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,82]),65,17]),
[iquote('para(2,82),demod([65,17])')] ).
cnf(657,plain,
equal(greatest_lower_bound(least_upper_bound(A,multiply(A,multiply(B,A))),least_upper_bound(inverse(B),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,83]),17,65]),
[iquote('para(2,83),demod([17,65])')] ).
cnf(703,plain,
equal(greatest_lower_bound(multiply(b,multiply(inverse(c),A)),A),greatest_lower_bound(multiply(a,multiply(inverse(c),A)),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[84,68]),84]),
[iquote('para(84,68),demod([84])')] ).
cnf(951,plain,
equal(least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(multiply(A,multiply(inverse(B),A)),A)),A),
inference(para,[status(thm),theory(equality)],[17,624]),
[iquote('para(17,624)')] ).
cnf(8069,plain,
equal(greatest_lower_bound(least_upper_bound(multiply(A,multiply(B,A)),A),least_upper_bound(inverse(B),A)),A),
inference(para,[status(thm),theory(equality)],[5,657]),
[iquote('para(5,657)')] ).
cnf(8071,plain,
equal(greatest_lower_bound(least_upper_bound(multiply(A,multiply(inverse(B),A)),A),least_upper_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[17,8069]),
[iquote('para(17,8069)')] ).
cnf(8076,plain,
equal(least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(multiply(a,multiply(inverse(c),b)),b)),b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,951]),703]),
[iquote('para(19,951),demod([703])')] ).
cnf(14690,plain,
equal(least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(multiply(A,multiply(inverse(B),C)),C)),greatest_lower_bound(least_upper_bound(A,multiply(A,multiply(inverse(B),C))),least_upper_bound(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[84,413]),84]),
[iquote('para(84,413),demod([84])')] ).
cnf(14691,plain,
equal(greatest_lower_bound(least_upper_bound(a,multiply(a,multiply(inverse(c),b))),least_upper_bound(a,c)),b),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8076]),14690,45]),
[iquote('back_demod(8076),demod([14690,45])')] ).
cnf(14704,plain,
equal(greatest_lower_bound(least_upper_bound(multiply(a,multiply(inverse(c),b)),a),least_upper_bound(a,c)),b),
inference(para,[status(thm),theory(equality)],[5,14691]),
[iquote('para(5,14691)')] ).
cnf(14718,plain,
equal(greatest_lower_bound(least_upper_bound(multiply(a,multiply(inverse(c),b)),a),least_upper_bound(c,a)),b),
inference(para,[status(thm),theory(equality)],[5,14704]),
[iquote('para(5,14704)')] ).
cnf(16898,plain,
equal(least_upper_bound(multiply(A,multiply(inverse(c),b)),A),least_upper_bound(multiply(A,multiply(inverse(c),a)),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[494,12]),12,65,65]),1]),
[iquote('para(494,12),demod([12,65,65]),flip(1)')] ).
cnf(16899,plain,
equal(b,a),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14718]),16898,8071]),1]),
[iquote('back_demod(14718),demod([16898,8071]),flip(1)')] ).
cnf(16900,plain,
$false,
inference(conflict,[status(thm)],[16899,23]),
[iquote('conflict(16899,23)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP181-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n029.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 : Mon Jun 13 08:37:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.08 ----- EQP 0.9e, May 2009 -----
% 0.70/1.08 The job began on n029.cluster.edu, Mon Jun 13 08:37:55 2022
% 0.70/1.08 The command was "./eqp09e".
% 0.70/1.08
% 0.70/1.08 set(prolog_style_variables).
% 0.70/1.08 set(lrpo).
% 0.70/1.08 set(basic_paramod).
% 0.70/1.08 set(functional_subsume).
% 0.70/1.08 set(ordered_paramod).
% 0.70/1.08 set(prime_paramod).
% 0.70/1.08 set(para_pairs).
% 0.70/1.08 assign(pick_given_ratio,4).
% 0.70/1.08 clear(print_kept).
% 0.70/1.08 clear(print_new_demod).
% 0.70/1.08 clear(print_back_demod).
% 0.70/1.08 clear(print_given).
% 0.70/1.08 assign(max_mem,64000).
% 0.70/1.08 end_of_commands.
% 0.70/1.08
% 0.70/1.08 Usable:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Sos:
% 0.70/1.08 0 (wt=-1) [] multiply(identity,A) = A.
% 0.70/1.08 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.70/1.08 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.08 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.08 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.08 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.70/1.08 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.70/1.08 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.70/1.08 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.70/1.08 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.08 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.08 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.08 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.08 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.08 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.08 0 (wt=-1) [] inverse(identity) = identity.
% 0.70/1.08 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.70/1.08 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.70/1.08 0 (wt=-1) [] greatest_lower_bound(a,c) = greatest_lower_bound(b,c).
% 0.70/1.08 0 (wt=-1) [] least_upper_bound(a,c) = least_upper_bound(b,c).
% 0.70/1.08 0 (wt=-1) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 0.70/1.08 0 (wt=-1) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.70/1.08 0 (wt=-1) [] -(a = b).
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Demodulators:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Passive:
% 0.70/1.08 end_of_list.
% 0.70/1.08
% 0.70/1.08 Starting to process input.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.70/1.08 1 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.70/1.08 2 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.08 3 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.08 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.70/1.08
% 0.70/1.08 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.08 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.70/1.08
% 0.70/1.08 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.70/1.08 6 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.70/1.08 7 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.70/1.08 8 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.70/1.08 9 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.08 10 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.08 11 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.08 12 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.08 13 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.08 14 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.08 15 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.70/1.08 16 is a new demodulator.
% 0.70/1.08
% 0.70/1.08 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.70/1.08 17 is a new demodulator.
% 5.60/5.99
% 5.60/5.99 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 5.60/5.99 18 is a new demodulator.
% 5.60/5.99
% 5.60/5.99 ** KEPT: 19 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 5.60/5.99 19 is a new demodulator.
% 5.60/5.99
% 5.60/5.99 ** KEPT: 20 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 5.60/5.99 20 is a new demodulator.
% 5.60/5.99
% 5.60/5.99 ** KEPT: 21 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 5.60/5.99 21 is a new demodulator.
% 5.60/5.99
% 5.60/5.99 ** KEPT: 22 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 5.60/5.99 22 is a new demodulator.
% 5.60/5.99
% 5.60/5.99 ** KEPT: 23 (wt=3) [flip(1)] -(b = a).
% 5.60/5.99 ---------------- PROOF FOUND ----------------
% 5.60/5.99 % SZS status Unsatisfiable
% 5.60/5.99
% 5.60/5.99
% 5.60/5.99 After processing input:
% 5.60/5.99
% 5.60/5.99 Usable:
% 5.60/5.99 end_of_list.
% 5.60/5.99
% 5.60/5.99 Sos:
% 5.60/5.99 23 (wt=3) [flip(1)] -(b = a).
% 5.60/5.99 16 (wt=4) [] inverse(identity) = identity.
% 5.60/5.99 1 (wt=5) [] multiply(identity,A) = A.
% 5.60/5.99 8 (wt=5) [] least_upper_bound(A,A) = A.
% 5.60/5.99 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 5.60/5.99 17 (wt=5) [] inverse(inverse(A)) = A.
% 5.60/5.99 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 5.60/5.99 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 5.60/5.99 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 5.60/5.99 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 5.60/5.99 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 5.60/5.99 19 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 5.60/5.99 20 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 5.60/5.99 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 5.60/5.99 21 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 5.60/5.99 22 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 5.60/5.99 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 5.60/5.99 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 5.60/5.99 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 5.60/5.99 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 5.60/5.99 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 5.60/5.99 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 5.60/5.99 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 5.60/5.99 end_of_list.
% 5.60/5.99
% 5.60/5.99 Demodulators:
% 5.60/5.99 1 (wt=5) [] multiply(identity,A) = A.
% 5.60/5.99 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 5.60/5.99 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 5.60/5.99 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 5.60/5.99 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 5.60/5.99 8 (wt=5) [] least_upper_bound(A,A) = A.
% 5.60/5.99 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 5.60/5.99 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 5.60/5.99 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 5.60/5.99 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 5.60/5.99 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 5.60/5.99 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 5.60/5.99 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 5.60/5.99 16 (wt=4) [] inverse(identity) = identity.
% 5.60/5.99 17 (wt=5) [] inverse(inverse(A)) = A.
% 5.60/5.99 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 5.60/5.99 19 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 5.60/5.99 20 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 5.60/5.99 21 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 5.60/5.99 22 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 5.60/5.99 end_of_list.
% 5.60/5.99
% 5.60/5.99 Passive:
% 5.60/5.99 end_of_list.
% 5.60/5.99
% 5.60/5.99 UNIT CONFLICT from 16899 and 23 at 3.37 seconds.
% 5.60/5.99
% 5.60/5.99 ---------------- PROOF ----------------
% 5.60/5.99 % SZS output start Refutation
% See solution above
% 5.60/5.99 ------------ end of proof -------------
% 5.60/5.99
% 5.60/5.99
% 5.60/5.99 ------------- memory usage ------------
% 5.60/5.99 Memory dynamically allocated (tp_alloc): 30273.
% 5.60/5.99 type (bytes each) gets frees in use avail bytes
% 5.60/5.99 sym_ent ( 96) 59 0 59 0 5.5 K
% 5.60/5.99 term ( 16) 2818313 2394026 424287 34 8221.5 K
% 5.60/5.99 gen_ptr ( 8) 2374925 449973 1924952 42 15039.0 K
% 5.60/5.99 context ( 808) 4794927 4794925 2 9 8.7 K
% 5.60/5.99 trail ( 12) 215058 215058 0 7 0.1 K
% 5.60/5.99 bt_node ( 68) 2651128 2651125 3 24 1.8 K
% 5.60/5.99 ac_position (285432) 0 0 0 0 0.0 K
% 5.60/5.99 ac_match_pos (14044) 0 0 0 0 0.0 K
% 5.60/5.99 ac_match_free_vars_pos (4020)
% 5.60/5.99 0 0 0 0 0.0 K
% 5.60/5.99 discrim ( 12) 337322 18803 318519 5 3732.7 K
% 5.60/5.99 flat ( 40) 6150951 6150951 0 79 3.1 K
% 5.60/5.99 discrim_pos ( 12) 159035 159035 0 1 0.0 K
% 5.60/5.99 fpa_head ( 12) 19383 0 19383 0 227.1 K
% 5.60/5.99 fpa_tree ( 28) 92127 92127 0 31 0.8 K
% 5.60/5.99 fpa_pos ( 36) 29673 29673 0 1 0.0 K
% 5.60/5.99 literal ( 12) 109424 92525 16899 1 198.0 K
% 5.60/5.99 clause ( 24) 109424 92525 16899 1 396.1 K
% 5.60/5.99 list ( 12) 12833 12776 57 2 0.7 K
% 5.60/5.99 list_pos ( 20) 67041 7952 59089 4 1154.2 K
% 5.60/5.99 pair_index ( 40) 2 0 2 0 0.1 K
% 5.60/5.99
% 5.60/5.99 -------------- statistics -------------
% 5.60/5.99 Clauses input 23
% 5.60/5.99 Usable input 0
% 5.60/5.99 Sos input 23
% 5.60/5.99 Demodulators input 0
% 5.60/5.99 Passive input 0
% 5.60/5.99
% 5.60/5.99 Processed BS (before search) 25
% 5.60/5.99 Forward subsumed BS 2
% 5.60/5.99 Kept BS 23
% 5.60/5.99 New demodulators BS 20
% 5.60/5.99 Back demodulated BS 0
% 5.60/5.99
% 5.60/5.99 Clauses or pairs given 315250
% 5.60/5.99 Clauses generated 75730
% 5.60/5.99 Forward subsumed 58854
% 5.60/5.99 Deleted by weight 0
% 5.60/5.99 Deleted by variable count 0
% 5.60/5.99 Kept 16876
% 5.60/5.99 New demodulators 12754
% 5.60/5.99 Back demodulated 1773
% 5.60/5.99 Ordered paramod prunes 0
% 5.60/5.99 Basic paramod prunes 1554129
% 5.60/5.99 Prime paramod prunes 5294
% 5.60/5.99 Semantic prunes 0
% 5.60/5.99
% 5.60/5.99 Rewrite attmepts 1166448
% 5.60/5.99 Rewrites 142454
% 5.60/5.99
% 5.60/5.99 FPA overloads 0
% 5.60/5.99 FPA underloads 0
% 5.60/5.99
% 5.60/5.99 Usable size 0
% 5.60/5.99 Sos size 15125
% 5.60/5.99 Demodulators size 11937
% 5.60/5.99 Passive size 0
% 5.60/5.99 Disabled size 1773
% 5.60/5.99
% 5.60/5.99 Proofs found 1
% 5.60/5.99
% 5.60/5.99 ----------- times (seconds) ----------- Mon Jun 13 08:38:00 2022
% 5.60/5.99
% 5.60/5.99 user CPU time 3.37 (0 hr, 0 min, 3 sec)
% 5.60/5.99 system CPU time 1.54 (0 hr, 0 min, 1 sec)
% 5.60/5.99 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 5.60/5.99 input time 0.00
% 5.60/5.99 paramodulation time 0.55
% 5.60/5.99 demodulation time 0.24
% 5.60/5.99 orient time 0.12
% 5.60/5.99 weigh time 0.02
% 5.60/5.99 forward subsume time 0.07
% 5.60/5.99 back demod find time 0.16
% 5.60/5.99 conflict time 0.01
% 5.60/5.99 LRPO time 0.06
% 5.60/5.99 store clause time 1.52
% 5.60/5.99 disable clause time 0.14
% 5.60/5.99 prime paramod time 0.10
% 5.60/5.99 semantics time 0.00
% 5.60/5.99
% 5.60/5.99 EQP interrupted
%------------------------------------------------------------------------------