TSTP Solution File: GRP181-3 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP181-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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 6.83s 7.27s
% Output : Refutation 6.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 11 RR)
% Number of literals : 42 ( 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-3.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP181-3.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP181-3.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP181-3.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP181-3.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP181-3.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP181-3.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP181-3.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP181-3.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(b,c),greatest_lower_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(17,plain,
equal(least_upper_bound(b,c),least_upper_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(18,plain,
equal(inverse(greatest_lower_bound(A,B)),least_upper_bound(inverse(A),inverse(B))),
file('GRP181-3.p',unknown),
[] ).
cnf(19,plain,
equal(inverse(least_upper_bound(A,B)),greatest_lower_bound(inverse(A),inverse(B))),
file('GRP181-3.p',unknown),
[] ).
cnf(20,plain,
~ equal(b,a),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(21,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(35,plain,
equal(least_upper_bound(c,b),least_upper_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,5]),1]),
[iquote('para(17,5),flip(1)')] ).
cnf(59,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(63,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)],[16,15]),15]),1]),
[iquote('para(16,15),demod([15]),flip(1)')] ).
cnf(65,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)],[17,12]),12]),1]),
[iquote('para(17,12),demod([12]),flip(1)')] ).
cnf(66,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,21]),
[iquote('para(2,21)')] ).
cnf(76,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[21,21]),
[iquote('para(21,21)')] ).
cnf(77,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),76]),
[iquote('back_demod(66),demod([76])')] ).
cnf(78,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,21]),19,12,15,21,15,21]),
[iquote('para(14,21),demod([19,12,15,21,15,21])')] ).
cnf(79,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,21]),18,13,14,21,14,21]),
[iquote('para(15,21),demod([18,13,14,21,14,21])')] ).
cnf(83,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[76,77]),77]),1]),
[iquote('para(76,77),demod([77]),flip(1)')] ).
cnf(84,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[83,2]),
[iquote('para(83,2)')] ).
cnf(254,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)],[84,3]),1]),1]),
[iquote('para(84,3),demod([1]),flip(1)')] ).
cnf(488,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,65]),2]),
[iquote('para(2,65),demod([2])')] ).
cnf(585,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)],[77,59]),77,77,77]),
[iquote('para(77,59),demod([77,77,77])')] ).
cnf(590,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,78]),77,83]),
[iquote('para(2,78),demod([77,83])')] ).
cnf(624,plain,
equal(greatest_lower_bound(least_upper_bound(A,inverse(B)),least_upper_bound(multiply(A,multiply(B,A)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,79]),77,83]),
[iquote('para(2,79),demod([77,83])')] ).
cnf(994,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)],[83,590]),
[iquote('para(83,590)')] ).
cnf(998,plain,
equal(greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(multiply(A,multiply(inverse(B),A)),A)),A),
inference(para,[status(thm),theory(equality)],[83,624]),
[iquote('para(83,624)')] ).
cnf(5161,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)],[254,63]),254]),
[iquote('para(254,63),demod([254])')] ).
cnf(8052,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)],[16,994]),5161]),
[iquote('para(16,994),demod([5161])')] ).
cnf(8895,plain,
equal(least_upper_bound(greatest_lower_bound(c,a),greatest_lower_bound(multiply(a,multiply(inverse(c),b)),b)),b),
inference(para,[status(thm),theory(equality)],[4,8052]),
[iquote('para(4,8052)')] ).
cnf(9148,plain,
equal(least_upper_bound(greatest_lower_bound(c,a),greatest_lower_bound(b,multiply(a,multiply(inverse(c),b)))),b),
inference(para,[status(thm),theory(equality)],[4,8895]),
[iquote('para(4,8895)')] ).
cnf(15494,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)],[488,12]),12,77,77]),1]),
[iquote('para(488,12),demod([12,77,77]),flip(1)')] ).
cnf(19075,plain,
equal(least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(C,multiply(B,multiply(inverse(A),C)))),greatest_lower_bound(least_upper_bound(A,C),least_upper_bound(B,multiply(B,multiply(inverse(A),C))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[254,585]),254]),
[iquote('para(254,585),demod([254])')] ).
cnf(19076,plain,
equal(greatest_lower_bound(least_upper_bound(a,c),least_upper_bound(a,multiply(a,multiply(inverse(c),b)))),b),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9148]),19075,35]),
[iquote('back_demod(9148),demod([19075,35])')] ).
cnf(19084,plain,
equal(b,a),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,19076]),15494,998]),1]),
[iquote('para(5,19076),demod([15494,998]),flip(1)')] ).
cnf(19085,plain,
$false,
inference(conflict,[status(thm)],[19084,20]),
[iquote('conflict(19084,20)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP181-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 23:10:24 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/1.07 ----- EQP 0.9e, May 2009 -----
% 0.43/1.07 The job began on n019.cluster.edu, Mon Jun 13 23:10:25 2022
% 0.43/1.07 The command was "./eqp09e".
% 0.43/1.07
% 0.43/1.07 set(prolog_style_variables).
% 0.43/1.07 set(lrpo).
% 0.43/1.07 set(basic_paramod).
% 0.43/1.07 set(functional_subsume).
% 0.43/1.07 set(ordered_paramod).
% 0.43/1.07 set(prime_paramod).
% 0.43/1.07 set(para_pairs).
% 0.43/1.07 assign(pick_given_ratio,4).
% 0.43/1.07 clear(print_kept).
% 0.43/1.07 clear(print_new_demod).
% 0.43/1.07 clear(print_back_demod).
% 0.43/1.07 clear(print_given).
% 0.43/1.07 assign(max_mem,64000).
% 0.43/1.07 end_of_commands.
% 0.43/1.07
% 0.43/1.07 Usable:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Sos:
% 0.43/1.07 0 (wt=-1) [] multiply(identity,A) = A.
% 0.43/1.07 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 0 (wt=-1) [] greatest_lower_bound(a,c) = greatest_lower_bound(b,c).
% 0.43/1.07 0 (wt=-1) [] least_upper_bound(a,c) = least_upper_bound(b,c).
% 0.43/1.07 0 (wt=-1) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 0.43/1.07 0 (wt=-1) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.43/1.07 0 (wt=-1) [] -(a = b).
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Demodulators:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Passive:
% 0.43/1.07 end_of_list.
% 0.43/1.07
% 0.43/1.07 Starting to process input.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.07 1 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.07 2 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.07 3 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.07 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.43/1.07
% 0.43/1.07 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.07 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.43/1.07
% 0.43/1.07 ** 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.43/1.07 6 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** 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.43/1.07 7 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.07 8 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.07 9 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.07 10 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.07 11 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 12 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.07 13 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 14 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.07 15 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 16 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 0.43/1.07 16 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 17 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 0.43/1.07 17 is a new demodulator.
% 0.43/1.07
% 0.43/1.07 ** KEPT: 18 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 6.83/7.27 18 is a new demodulator.
% 6.83/7.27
% 6.83/7.27 ** KEPT: 19 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 6.83/7.27 19 is a new demodulator.
% 6.83/7.27
% 6.83/7.27 ** KEPT: 20 (wt=3) [flip(1)] -(b = a).
% 6.83/7.27 ---------------- PROOF FOUND ----------------
% 6.83/7.27 % SZS status Unsatisfiable
% 6.83/7.27
% 6.83/7.27
% 6.83/7.27 After processing input:
% 6.83/7.27
% 6.83/7.27 Usable:
% 6.83/7.27 end_of_list.
% 6.83/7.27
% 6.83/7.27 Sos:
% 6.83/7.27 20 (wt=3) [flip(1)] -(b = a).
% 6.83/7.27 1 (wt=5) [] multiply(identity,A) = A.
% 6.83/7.27 8 (wt=5) [] least_upper_bound(A,A) = A.
% 6.83/7.27 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 6.83/7.27 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 6.83/7.27 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 6.83/7.27 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 6.83/7.27 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 6.83/7.27 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 6.83/7.27 16 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 6.83/7.27 17 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 6.83/7.27 18 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 6.83/7.27 19 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 6.83/7.27 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 6.83/7.27 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 6.83/7.27 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 6.83/7.27 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 6.83/7.27 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 6.83/7.27 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 6.83/7.27 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 6.83/7.27 end_of_list.
% 6.83/7.27
% 6.83/7.27 Demodulators:
% 6.83/7.27 1 (wt=5) [] multiply(identity,A) = A.
% 6.83/7.27 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 6.83/7.27 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 6.83/7.27 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 6.83/7.27 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 6.83/7.27 8 (wt=5) [] least_upper_bound(A,A) = A.
% 6.83/7.27 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 6.83/7.27 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 6.83/7.27 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 6.83/7.27 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 6.83/7.27 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 6.83/7.27 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 6.83/7.27 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 6.83/7.27 16 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 6.83/7.27 17 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 6.83/7.27 18 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 6.83/7.27 19 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 6.83/7.27 end_of_list.
% 6.83/7.27
% 6.83/7.27 Passive:
% 6.83/7.27 end_of_list.
% 6.83/7.27
% 6.83/7.27 UNIT CONFLICT from 19084 and 20 at 4.29 seconds.
% 6.83/7.27
% 6.83/7.27 ---------------- PROOF ----------------
% 6.83/7.27 % SZS output start Refutation
% See solution above
% 6.83/7.27 ------------ end of proof -------------
% 6.83/7.27
% 6.83/7.27
% 6.83/7.27 ------------- memory usage ------------
% 6.83/7.27 Memory dynamically allocated (tp_alloc): 33203.
% 6.83/7.27 type (bytes each) gets frees in use avail bytes
% 6.83/7.27 sym_ent ( 96) 59 0 59 0 5.5 K
% 6.83/7.27 term ( 16) 3241243 2774531 466712 34 9041.6 K
% 6.83/7.27 gen_ptr ( 8) 2654214 539430 2114784 41 16522.1 K
% 6.83/7.27 context ( 808) 5847303 5847301 2 9 8.7 K
% 6.83/7.27 trail ( 12) 244395 244395 0 7 0.1 K
% 6.83/7.27 bt_node ( 68) 3299785 3299782 3 24 1.8 K
% 6.83/7.27 ac_position (285432) 0 0 0 0 0.0 K
% 6.83/7.27 ac_match_pos (14044) 0 0 0 0 0.0 K
% 6.83/7.27 ac_match_free_vars_pos (4020)
% 6.83/7.27 0 0 0 0 0.0 K
% 6.83/7.27 discrim ( 12) 370266 29043 341223 0 3998.7 K
% 6.83/7.27 flat ( 40) 7087491 7087491 0 79 3.1 K
% 6.83/7.27 discrim_pos ( 12) 183152 183152 0 1 0.0 K
% 6.83/7.27 fpa_head ( 12) 21499 0 21499 0 251.9 K
% 6.83/7.27 fpa_tree ( 28) 105569 105569 0 33 0.9 K
% 6.83/7.27 fpa_pos ( 36) 33548 33548 0 1 0.0 K
% 6.83/7.27 literal ( 12) 126683 107599 19084 1 223.7 K
% 6.83/7.27 clause ( 24) 126683 107599 19084 1 447.3 K
% 6.83/7.27 list ( 12) 14523 14467 56 4 0.7 K
% 6.83/7.27 list_pos ( 20) 76575 10867 65708 0 1283.4 K
% 6.83/7.27 pair_index ( 40) 2 0 2 0 0.1 K
% 6.83/7.27
% 6.83/7.27 -------------- statistics -------------
% 6.83/7.27 Clauses input 20
% 6.83/7.27 Usable input 0
% 6.83/7.27 Sos input 20
% 6.83/7.27 Demodulators input 0
% 6.83/7.27 Passive input 0
% 6.83/7.27
% 6.83/7.27 Processed BS (before search) 22
% 6.83/7.27 Forward subsumed BS 2
% 6.83/7.27 Kept BS 20
% 6.83/7.27 New demodulators BS 17
% 6.83/7.27 Back demodulated BS 0
% 6.83/7.27
% 6.83/7.27 Clauses or pairs given 388273
% 6.83/7.27 Clauses generated 88123
% 6.83/7.27 Forward subsumed 69059
% 6.83/7.27 Deleted by weight 0
% 6.83/7.27 Deleted by variable count 0
% 6.83/7.27 Kept 19064
% 6.83/7.27 New demodulators 14447
% 6.83/7.27 Back demodulated 2417
% 6.83/7.27 Ordered paramod prunes 0
% 6.83/7.27 Basic paramod prunes 2048564
% 6.83/7.27 Prime paramod prunes 6301
% 6.83/7.27 Semantic prunes 0
% 6.83/7.27
% 6.83/7.27 Rewrite attmepts 1361638
% 6.83/7.27 Rewrites 163693
% 6.83/7.27
% 6.83/7.27 FPA overloads 0
% 6.83/7.27 FPA underloads 0
% 6.83/7.27
% 6.83/7.27 Usable size 0
% 6.83/7.27 Sos size 16666
% 6.83/7.27 Demodulators size 13293
% 6.83/7.27 Passive size 0
% 6.83/7.27 Disabled size 2417
% 6.83/7.27
% 6.83/7.27 Proofs found 1
% 6.83/7.27
% 6.83/7.27 ----------- times (seconds) ----------- Mon Jun 13 23:10:31 2022
% 6.83/7.27
% 6.83/7.27 user CPU time 4.29 (0 hr, 0 min, 4 sec)
% 6.83/7.27 system CPU time 1.92 (0 hr, 0 min, 1 sec)
% 6.83/7.27 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.83/7.27 input time 0.00
% 6.83/7.27 paramodulation time 0.66
% 6.83/7.27 demodulation time 0.30
% 6.83/7.27 orient time 0.17
% 6.83/7.27 weigh time 0.03
% 6.83/7.27 forward subsume time 0.09
% 6.83/7.27 back demod find time 0.22
% 6.83/7.27 conflict time 0.01
% 6.83/7.27 LRPO time 0.07
% 6.83/7.27 store clause time 1.92
% 6.83/7.27 disable clause time 0.27
% 6.83/7.27 prime paramod time 0.12
% 6.83/7.27 semantics time 0.00
% 6.83/7.27
% 6.83/7.27 EQP interrupted
%------------------------------------------------------------------------------