TSTP Solution File: GRP184-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP184-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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:49 EDT 2022
% Result : Unsatisfiable 0.69s 1.16s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 7 RR)
% Number of literals : 27 ( 0 equ; 5 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP184-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP184-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP184-4.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP184-4.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP184-4.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(7,plain,
equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(least_upper_bound(A,greatest_lower_bound(A,B)),A),
file('GRP184-4.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP184-4.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP184-4.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP184-4.p',unknown),
[] ).
cnf(16,plain,
equal(inverse(identity),identity),
file('GRP184-4.p',unknown),
[] ).
cnf(17,plain,
equal(inverse(inverse(A)),A),
file('GRP184-4.p',unknown),
[] ).
cnf(19,plain,
equal(inverse(greatest_lower_bound(A,B)),least_upper_bound(inverse(A),inverse(B))),
file('GRP184-4.p',unknown),
[] ).
cnf(21,plain,
~ equal(least_upper_bound(identity,least_upper_bound(a,least_upper_bound(multiply(inverse(a),identity),identity))),least_upper_bound(multiply(a,inverse(a)),least_upper_bound(inverse(a),least_upper_bound(multiply(a,identity),identity)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19,16,12,14,1,14,1,7,19,16,12,14,2,1,14,1,7]),1]),
[iquote('demod([19,16,12,14,1,14,1,7,19,16,12,14,2,1,14,1,7]),flip(1)')] ).
cnf(22,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[17,2]),
[iquote('para(17,2)')] ).
cnf(23,plain,
~ equal(least_upper_bound(identity,least_upper_bound(a,least_upper_bound(multiply(inverse(a),identity),identity))),least_upper_bound(identity,least_upper_bound(inverse(a),least_upper_bound(multiply(a,identity),identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[21]),22]),
[iquote('back_demod(21),demod([22])')] ).
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(least_upper_bound(A,greatest_lower_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(47,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,24]),17]),
[iquote('para(2,24),demod([17])')] ).
cnf(48,plain,
~ equal(least_upper_bound(identity,least_upper_bound(inverse(a),least_upper_bound(a,identity))),least_upper_bound(identity,least_upper_bound(a,least_upper_bound(inverse(a),identity)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),47,47]),1]),
[iquote('back_demod(23),demod([47,47]),flip(1)')] ).
cnf(59,plain,
equal(least_upper_bound(A,greatest_lower_bound(B,greatest_lower_bound(C,A))),A),
inference(para,[status(thm),theory(equality)],[6,25]),
[iquote('para(6,25)')] ).
cnf(61,plain,
equal(least_upper_bound(A,least_upper_bound(B,greatest_lower_bound(C,A))),least_upper_bound(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,59]),7]),
[iquote('para(11,59),demod([7])')] ).
cnf(115,plain,
equal(least_upper_bound(A,least_upper_bound(B,least_upper_bound(C,A))),least_upper_bound(A,least_upper_bound(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,61]),7,7]),
[iquote('para(11,61),demod([7,7])')] ).
cnf(116,plain,
~ equal(least_upper_bound(identity,least_upper_bound(inverse(a),a)),least_upper_bound(identity,least_upper_bound(a,inverse(a)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),115,115]),
[iquote('back_demod(48),demod([115,115])')] ).
cnf(416,plain,
~ equal(least_upper_bound(identity,least_upper_bound(a,inverse(a))),least_upper_bound(identity,least_upper_bound(a,inverse(a)))),
inference(para,[status(thm),theory(equality)],[5,116]),
[iquote('para(5,116)')] ).
cnf(417,plain,
$false,
inference(conflict,[status(thm)],[416]),
[iquote('xx_conflict(416)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP184-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n008.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 13 10:46:52 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.65/1.05 ----- EQP 0.9e, May 2009 -----
% 0.65/1.05 The job began on n008.cluster.edu, Mon Jun 13 10:46:53 2022
% 0.65/1.05 The command was "./eqp09e".
% 0.65/1.05
% 0.65/1.05 set(prolog_style_variables).
% 0.65/1.05 set(lrpo).
% 0.65/1.05 set(basic_paramod).
% 0.65/1.05 set(functional_subsume).
% 0.65/1.05 set(ordered_paramod).
% 0.65/1.05 set(prime_paramod).
% 0.65/1.05 set(para_pairs).
% 0.65/1.05 assign(pick_given_ratio,4).
% 0.65/1.05 clear(print_kept).
% 0.65/1.05 clear(print_new_demod).
% 0.65/1.05 clear(print_back_demod).
% 0.65/1.05 clear(print_given).
% 0.65/1.05 assign(max_mem,64000).
% 0.65/1.05 end_of_commands.
% 0.65/1.05
% 0.65/1.05 Usable:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Sos:
% 0.65/1.05 0 (wt=-1) [] multiply(identity,A) = A.
% 0.65/1.05 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.65/1.05 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.65/1.05 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.65/1.05 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.65/1.05 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.65/1.05 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.65/1.05 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.65/1.05 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.65/1.05 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.65/1.05 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.65/1.05 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.65/1.05 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.65/1.05 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.65/1.05 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.65/1.05 0 (wt=-1) [] inverse(identity) = identity.
% 0.65/1.05 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.65/1.05 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.65/1.05 0 (wt=-1) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 0.65/1.05 0 (wt=-1) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.65/1.05 0 (wt=-1) [] -(multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity))).
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Demodulators:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Passive:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Starting to process input.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.65/1.05 1 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.65/1.05 2 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.65/1.05 3 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.65/1.05 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.65/1.05
% 0.65/1.05 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.65/1.05 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.65/1.05
% 0.65/1.05 ** 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.65/1.05 6 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** 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.65/1.05 7 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.65/1.05 8 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.65/1.05 9 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.65/1.05 10 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.65/1.05 11 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.65/1.05 12 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.65/1.05 13 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.65/1.05 14 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.65/1.05 15 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.65/1.05 16 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.69/1.16 17 is a new demodulator.
% 0.69/1.16
% 0.69/1.16 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.69/1.16 18 is a new demodulator.
% 0.69/1.16
% 0.69/1.16 ** KEPT: 19 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 0.69/1.16 19 is a new demodulator.
% 0.69/1.16
% 0.69/1.16 ** KEPT: 20 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.69/1.16 20 is a new demodulator.
% 0.69/1.16
% 0.69/1.16 ** KEPT: 21 (wt=24) [demod([19,16,12,14,1,14,1,7,19,16,12,14,2,1,14,1,7]),flip(1)] -(least_upper_bound(identity,least_upper_bound(a,least_upper_bound(multiply(inverse(a),identity),identity))) = least_upper_bound(multiply(a,inverse(a)),least_upper_bound(inverse(a),least_upper_bound(multiply(a,identity),identity)))).
% 0.69/1.16 ---------------- PROOF FOUND ----------------
% 0.69/1.16 % SZS status Unsatisfiable
% 0.69/1.16
% 0.69/1.16
% 0.69/1.16 After processing input:
% 0.69/1.16
% 0.69/1.16 Usable:
% 0.69/1.16 end_of_list.
% 0.69/1.16
% 0.69/1.16 Sos:
% 0.69/1.16 16 (wt=4) [] inverse(identity) = identity.
% 0.69/1.16 1 (wt=5) [] multiply(identity,A) = A.
% 0.69/1.16 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.69/1.16 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.69/1.16 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.69/1.16 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.69/1.16 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.69/1.16 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.69/1.16 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.69/1.16 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.69/1.16 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.69/1.16 19 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 0.69/1.16 20 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.69/1.16 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.69/1.16 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.69/1.16 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.69/1.16 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.69/1.16 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.69/1.16 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.69/1.16 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.69/1.16 21 (wt=24) [demod([19,16,12,14,1,14,1,7,19,16,12,14,2,1,14,1,7]),flip(1)] -(least_upper_bound(identity,least_upper_bound(a,least_upper_bound(multiply(inverse(a),identity),identity))) = least_upper_bound(multiply(a,inverse(a)),least_upper_bound(inverse(a),least_upper_bound(multiply(a,identity),identity)))).
% 0.69/1.16 end_of_list.
% 0.69/1.16
% 0.69/1.16 Demodulators:
% 0.69/1.16 1 (wt=5) [] multiply(identity,A) = A.
% 0.69/1.16 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.69/1.16 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.69/1.16 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.69/1.16 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.69/1.16 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.69/1.16 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.69/1.16 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.69/1.16 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.69/1.16 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.69/1.16 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.69/1.16 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.69/1.16 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.69/1.16 16 (wt=4) [] inverse(identity) = identity.
% 0.69/1.16 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.69/1.16 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.69/1.16 19 (wt=10) [] inverse(greatest_lower_bound(A,B)) = least_upper_bound(inverse(A),inverse(B)).
% 0.69/1.16 20 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.69/1.16 end_of_list.
% 0.69/1.16
% 0.69/1.16 Passive:
% 0.69/1.16 end_of_list.
% 0.69/1.16
% 0.69/1.16 UNIT CONFLICT from 416 and x=x at 0.04 seconds.
% 0.69/1.16
% 0.69/1.16 ---------------- PROOF ----------------
% 0.69/1.16 % SZS output start Refutation
% See solution above
% 0.69/1.16 ------------ end of proof -------------
% 0.69/1.16
% 0.69/1.16
% 0.69/1.16 ------------- memory usage ------------
% 0.69/1.16 Memory dynamically allocated (tp_alloc): 976.
% 0.69/1.16 type (bytes each) gets frees in use avail bytes
% 0.69/1.16 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.69/1.16 term ( 16) 61654 54273 7381 27 143.1 K
% 0.69/1.16 gen_ptr ( 8) 40795 12069 28726 26 224.6 K
% 0.69/1.16 context ( 808) 53835 53833 2 5 5.5 K
% 0.69/1.16 trail ( 12) 2933 2933 0 5 0.1 K
% 0.69/1.16 bt_node ( 68) 22942 22939 3 12 1.0 K
% 0.69/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.16 ac_match_free_vars_pos (4020)
% 0.69/1.16 0 0 0 0 0.0 K
% 0.69/1.16 discrim ( 12) 6316 108 6208 0 72.8 K
% 0.69/1.16 flat ( 40) 93308 93308 0 35 1.4 K
% 0.69/1.16 discrim_pos ( 12) 4027 4027 0 1 0.0 K
% 0.69/1.16 fpa_head ( 12) 1621 0 1621 0 19.0 K
% 0.69/1.16 fpa_tree ( 28) 1565 1565 0 17 0.5 K
% 0.69/1.16 fpa_pos ( 36) 770 770 0 1 0.0 K
% 0.69/1.16 literal ( 12) 2929 2513 416 1 4.9 K
% 0.69/1.16 clause ( 24) 2929 2513 416 1 9.8 K
% 0.69/1.16 list ( 12) 414 358 56 3 0.7 K
% 0.69/1.16 list_pos ( 20) 1643 65 1578 0 30.8 K
% 0.69/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.16
% 0.69/1.16 -------------- statistics -------------
% 0.69/1.16 Clauses input 21
% 0.69/1.16 Usable input 0
% 0.69/1.16 Sos input 21
% 0.69/1.16 Demodulators input 0
% 0.69/1.16 Passive input 0
% 0.69/1.16
% 0.69/1.16 Processed BS (before search) 23
% 0.69/1.16 Forward subsumed BS 2
% 0.69/1.16 Kept BS 21
% 0.69/1.16 New demodulators BS 18
% 0.69/1.16 Back demodulated BS 0
% 0.69/1.16
% 0.69/1.16 Clauses or pairs given 4112
% 0.69/1.16 Clauses generated 2145
% 0.69/1.16 Forward subsumed 1750
% 0.69/1.16 Deleted by weight 0
% 0.69/1.16 Deleted by variable count 0
% 0.69/1.16 Kept 395
% 0.69/1.16 New demodulators 337
% 0.69/1.16 Back demodulated 11
% 0.69/1.16 Ordered paramod prunes 0
% 0.69/1.16 Basic paramod prunes 6922
% 0.69/1.16 Prime paramod prunes 65
% 0.69/1.16 Semantic prunes 0
% 0.69/1.16
% 0.69/1.16 Rewrite attmepts 20126
% 0.69/1.16 Rewrites 3697
% 0.69/1.16
% 0.69/1.16 FPA overloads 0
% 0.69/1.16 FPA underloads 0
% 0.69/1.16
% 0.69/1.16 Usable size 0
% 0.69/1.16 Sos size 404
% 0.69/1.16 Demodulators size 355
% 0.69/1.16 Passive size 0
% 0.69/1.16 Disabled size 11
% 0.69/1.16
% 0.69/1.16 Proofs found 1
% 0.69/1.16
% 0.69/1.16 ----------- times (seconds) ----------- Mon Jun 13 10:46:53 2022
% 0.69/1.16
% 0.69/1.16 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.69/1.16 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.69/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.16 input time 0.00
% 0.69/1.16 paramodulation time 0.01
% 0.69/1.16 demodulation time 0.01
% 0.69/1.16 orient time 0.00
% 0.69/1.16 weigh time 0.00
% 0.69/1.16 forward subsume time 0.00
% 0.69/1.16 back demod find time 0.00
% 0.69/1.16 conflict time 0.00
% 0.69/1.16 LRPO time 0.00
% 0.69/1.16 store clause time 0.00
% 0.69/1.16 disable clause time 0.00
% 0.69/1.16 prime paramod time 0.00
% 0.69/1.16 semantics time 0.00
% 0.69/1.16
% 0.69/1.16 EQP interrupted
%------------------------------------------------------------------------------