%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP177-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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:44 EDT 2022
% Result : Unsatisfiable 0.61s 1.05s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 8 RR)
% Number of literals : 31 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP177-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP177-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP177-2.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP177-2.p',unknown),
[] ).
cnf(6,plain,
equal(greatest_lower_bound(greatest_lower_bound(A,B),C),greatest_lower_bound(A,greatest_lower_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(greatest_lower_bound(A,A),A),
file('GRP177-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP177-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP177-2.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(identity,a),identity),
file('GRP177-2.p',unknown),
[] ).
cnf(17,plain,
equal(greatest_lower_bound(identity,b),identity),
file('GRP177-2.p',unknown),
[] ).
cnf(18,plain,
equal(greatest_lower_bound(identity,c),identity),
file('GRP177-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c)))))),greatest_lower_bound(a,multiply(b,c))),
inference(demod,[status(thm),theory(equality)],[13,15,15,6,6]),
[iquote('demod([13,15,15,6,6])')] ).
cnf(20,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(24,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(B,C)),greatest_lower_bound(C,greatest_lower_bound(A,B))),
inference(para,[status(thm),theory(equality)],[6,4]),
[iquote('para(6,4)')] ).
cnf(25,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(B,C)),greatest_lower_bound(B,greatest_lower_bound(C,A))),
inference(flip,[status(thm),theory(equality)],[24]),
[iquote('flip(24)')] ).
cnf(26,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(B,C)),greatest_lower_bound(B,greatest_lower_bound(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,6]),6]),
[iquote('para(4,6),demod([6])')] ).
cnf(35,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(A,B)),greatest_lower_bound(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,6]),1]),
[iquote('para(9,6),flip(1)')] ).
cnf(58,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,20]),
[iquote('para(2,20)')] ).
cnf(64,plain,
equal(greatest_lower_bound(A,multiply(a,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,15]),1,1]),1]),
[iquote('para(16,15),demod([1,1]),flip(1)')] ).
cnf(67,plain,
equal(greatest_lower_bound(A,multiply(b,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,15]),1,1]),1]),
[iquote('para(17,15),demod([1,1]),flip(1)')] ).
cnf(69,plain,
equal(greatest_lower_bound(multiply(A,identity),multiply(A,c)),multiply(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,13]),1]),
[iquote('para(18,13),flip(1)')] ).
cnf(84,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[20,20]),
[iquote('para(20,20)')] ).
cnf(85,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[58]),84]),
[iquote('back_demod(58),demod([84])')] ).
cnf(86,plain,
equal(greatest_lower_bound(A,multiply(A,c)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[69]),85,85]),
[iquote('back_demod(69),demod([85,85])')] ).
cnf(132,plain,
~ equal(greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c)))))),greatest_lower_bound(a,multiply(b,c))),
inference(para,[status(thm),theory(equality)],[26,19]),
[iquote('para(26,19)')] ).
cnf(177,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(B,greatest_lower_bound(C,A))),greatest_lower_bound(A,greatest_lower_bound(B,C))),
inference(para,[status(thm),theory(equality)],[25,35]),
[iquote('para(25,35)')] ).
cnf(421,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(multiply(a,A),B)),greatest_lower_bound(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,6]),1]),
[iquote('para(64,6),flip(1)')] ).
cnf(423,plain,
~ equal(greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c))))),greatest_lower_bound(a,multiply(b,c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[132]),421]),
[iquote('back_demod(132),demod([421])')] ).
cnf(450,plain,
equal(greatest_lower_bound(A,greatest_lower_bound(multiply(b,A),B)),greatest_lower_bound(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[67,6]),1]),
[iquote('para(67,6),flip(1)')] ).
cnf(452,plain,
~ equal(greatest_lower_bound(multiply(b,c),a),greatest_lower_bound(a,multiply(b,c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[423]),450,177,86]),
[iquote('back_demod(423),demod([450,177,86])')] ).
cnf(453,plain,
$false,
inference(conflict,[status(thm)],[452,4]),
[iquote('conflict(452,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : GRP177-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.07 % Command : tptp2X_and_run_eqp %s
% 0.06/0.25 % Computer : n018.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 600
% 0.06/0.25 % DateTime : Mon Jun 13 14:26:42 EDT 2022
% 0.06/0.25 % CPUTime :
% 0.56/0.97 ----- EQP 0.9e, May 2009 -----
% 0.56/0.97 The job began on n018.cluster.edu, Mon Jun 13 14:26:43 2022
% 0.56/0.97 The command was "./eqp09e".
% 0.56/0.97
% 0.56/0.97 set(prolog_style_variables).
% 0.56/0.97 set(lrpo).
% 0.56/0.97 set(basic_paramod).
% 0.56/0.97 set(functional_subsume).
% 0.56/0.97 set(ordered_paramod).
% 0.56/0.97 set(prime_paramod).
% 0.56/0.97 set(para_pairs).
% 0.56/0.97 assign(pick_given_ratio,4).
% 0.56/0.97 clear(print_kept).
% 0.56/0.97 clear(print_new_demod).
% 0.56/0.97 clear(print_back_demod).
% 0.56/0.97 clear(print_given).
% 0.56/0.97 assign(max_mem,64000).
% 0.56/0.97 end_of_commands.
% 0.56/0.97
% 0.56/0.97 Usable:
% 0.56/0.97 end_of_list.
% 0.56/0.97
% 0.56/0.97 Sos:
% 0.56/0.97 0 (wt=-1) [] multiply(identity,A) = A.
% 0.56/0.97 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.56/0.97 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.56/0.97 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.56/0.97 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.56/0.97 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.56/0.97 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.56/0.97 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.56/0.97 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.56/0.97 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.56/0.97 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(identity,a) = identity.
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(identity,b) = identity.
% 0.56/0.97 0 (wt=-1) [] greatest_lower_bound(identity,c) = identity.
% 0.56/0.97 0 (wt=-1) [] -(greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = greatest_lower_bound(a,multiply(b,c))).
% 0.56/0.97 end_of_list.
% 0.56/0.97
% 0.56/0.97 Demodulators:
% 0.56/0.97 end_of_list.
% 0.56/0.97
% 0.56/0.97 Passive:
% 0.56/0.97 end_of_list.
% 0.56/0.97
% 0.56/0.97 Starting to process input.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.56/0.97 1 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.56/0.97 2 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.56/0.97 3 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.56/0.97 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.56/0.97
% 0.56/0.97 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.56/0.97 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.56/0.97
% 0.56/0.97 ** 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.56/0.97 6 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** 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.56/0.97 7 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.56/0.97 8 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.56/0.97 9 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.56/0.97 10 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.56/0.97 11 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.56/0.97 12 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.56/0.97 13 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.56/0.97 14 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.56/0.97 15 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.56/0.97 16 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.56/0.97 17 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 18 (wt=5) [] greatest_lower_bound(identity,c) = identity.
% 0.56/0.97 18 is a new demodulator.
% 0.56/0.97
% 0.56/0.97 ** KEPT: 19 (wt=27) [demod([13,15,15,6,6])] -(greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c)))))) = greatest_lower_bound(a,multiply(b,c))).
% 0.61/1.05 ---------------- PROOF FOUND ----------------
% 0.61/1.05 % SZS status Unsatisfiable
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 After processing input:
% 0.61/1.05
% 0.61/1.05 Usable:
% 0.61/1.05 end_of_list.
% 0.61/1.05
% 0.61/1.05 Sos:
% 0.61/1.05 1 (wt=5) [] multiply(identity,A) = A.
% 0.61/1.05 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.61/1.05 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.61/1.05 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.61/1.05 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.61/1.05 18 (wt=5) [] greatest_lower_bound(identity,c) = identity.
% 0.61/1.05 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.61/1.05 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.61/1.05 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.61/1.05 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.61/1.05 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.61/1.05 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.61/1.05 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.61/1.05 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.61/1.05 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.61/1.05 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.61/1.05 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.61/1.05 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.61/1.05 19 (wt=27) [demod([13,15,15,6,6])] -(greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c)))))) = greatest_lower_bound(a,multiply(b,c))).
% 0.61/1.05 end_of_list.
% 0.61/1.05
% 0.61/1.05 Demodulators:
% 0.61/1.05 1 (wt=5) [] multiply(identity,A) = A.
% 0.61/1.05 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.61/1.05 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.61/1.05 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.61/1.05 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.61/1.05 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.61/1.05 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.61/1.05 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.61/1.05 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.61/1.05 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.61/1.05 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.61/1.05 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.61/1.05 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.61/1.05 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.61/1.05 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.61/1.05 18 (wt=5) [] greatest_lower_bound(identity,c) = identity.
% 0.61/1.05 end_of_list.
% 0.61/1.05
% 0.61/1.05 Passive:
% 0.61/1.05 end_of_list.
% 0.61/1.05
% 0.61/1.05 UNIT CONFLICT from 452 and 4 at 0.02 seconds.
% 0.61/1.05
% 0.61/1.05 ---------------- PROOF ----------------
% 0.61/1.05 % SZS output start Refutation
% See solution above
% 0.61/1.05 ------------ end of proof -------------
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 ------------- memory usage ------------
% 0.61/1.05 Memory dynamically allocated (tp_alloc): 976.
% 0.61/1.05 type (bytes each) gets frees in use avail bytes
% 0.61/1.05 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.61/1.05 term ( 16) 35662 28738 6924 30 134.0 K
% 0.61/1.05 gen_ptr ( 8) 33790 6705 27085 30 211.8 K
% 0.61/1.05 context ( 808) 46997 46995 2 5 5.5 K
% 0.61/1.05 trail ( 12) 2165 2165 0 5 0.1 K
% 0.61/1.05 bt_node ( 68) 23677 23674 3 12 1.0 K
% 0.61/1.05 ac_position (285432) 0 0 0 0 0.0 K
% 0.61/1.05 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.61/1.05 ac_match_free_vars_pos (4020)
% 0.61/1.05 0 0 0 0 0.0 K
% 0.61/1.05 discrim ( 12) 5798 349 5449 28 64.2 K
% 0.61/1.05 flat ( 40) 58867 58867 0 35 1.4 K
% 0.61/1.05 discrim_pos ( 12) 1868 1868 0 1 0.0 K
% 0.61/1.05 fpa_head ( 12) 1870 0 1870 0 21.9 K
% 0.61/1.05 fpa_tree ( 28) 1707 1707 0 37 1.0 K
% 0.61/1.05 fpa_pos ( 36) 803 803 0 1 0.0 K
% 0.61/1.05 literal ( 12) 2114 1662 452 0 5.3 K
% 0.61/1.05 clause ( 24) 2114 1662 452 0 10.6 K
% 0.61/1.05 list ( 12) 410 353 57 2 0.7 K
% 0.61/1.05 list_pos ( 20) 1816 217 1599 7 31.4 K
% 0.61/1.05 pair_index ( 40) 2 0 2 0 0.1 K
% 0.61/1.05
% 0.61/1.05 -------------- statistics -------------
% 0.61/1.05 Clauses input 19
% 0.61/1.05 Usable input 0
% 0.61/1.05 Sos input 19
% 0.61/1.05 Demodulators input 0
% 0.61/1.05 Passive input 0
% 0.61/1.05
% 0.61/1.05 Processed BS (before search) 21
% 0.61/1.05 Forward subsumed BS 2
% 0.61/1.05 Kept BS 19
% 0.61/1.05 New demodulators BS 16
% 0.61/1.05 Back demodulated BS 0
% 0.61/1.05
% 0.61/1.05 Clauses or pairs given 6350
% 0.61/1.05 Clauses generated 1398
% 0.61/1.05 Forward subsumed 965
% 0.61/1.05 Deleted by weight 0
% 0.61/1.05 Deleted by variable count 0
% 0.61/1.05 Kept 433
% 0.61/1.05 New demodulators 335
% 0.61/1.05 Back demodulated 46
% 0.61/1.05 Ordered paramod prunes 0
% 0.61/1.05 Basic paramod prunes 20738
% 0.61/1.05 Prime paramod prunes 59
% 0.61/1.05 Semantic prunes 0
% 0.61/1.05
% 0.61/1.05 Rewrite attmepts 13078
% 0.61/1.05 Rewrites 1635
% 0.61/1.05
% 0.61/1.05 FPA overloads 0
% 0.61/1.05 FPA underloads 0
% 0.61/1.05
% 0.61/1.05 Usable size 0
% 0.61/1.05 Sos size 405
% 0.61/1.05 Demodulators size 337
% 0.61/1.05 Passive size 0
% 0.61/1.05 Disabled size 46
% 0.61/1.05
% 0.61/1.05 Proofs found 1
% 0.61/1.05
% 0.61/1.05 ----------- times (seconds) ----------- Mon Jun 13 14:26:43 2022
% 0.61/1.05
% 0.61/1.05 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.61/1.05 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.61/1.05 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.61/1.05 input time 0.00
% 0.61/1.05 paramodulation time 0.01
% 0.61/1.05 demodulation time 0.00
% 0.61/1.05 orient time 0.00
% 0.61/1.05 weigh time 0.00
% 0.61/1.05 forward subsume time 0.00
% 0.61/1.05 back demod find time 0.00
% 0.61/1.05 conflict time 0.00
% 0.61/1.05 LRPO time 0.00
% 0.61/1.05 store clause time 0.00
% 0.61/1.05 disable clause time 0.00
% 0.61/1.05 prime paramod time 0.01
% 0.61/1.05 semantics time 0.00
% 0.61/1.05
% 0.61/1.05 EQP interrupted
%------------------------------------------------------------------------------