TSTP Solution File: GRP185-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP185-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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.73s 1.56s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 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; 3 con; 0-2 aty)
% Number of variables : 45 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP185-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP185-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP185-2.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP185-2.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP185-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(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('GRP185-2.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP185-2.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP185-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP185-2.p',unknown),
[] ).
cnf(17,plain,
equal(inverse(inverse(A)),A),
file('GRP185-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity))))),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity)))),
inference(demod,[status(thm),theory(equality)],[12,14,1,14,1,7,7,12,14,1,14,1,7]),
[iquote('demod([12,14,1,14,1,7,7,12,14,1,14,1,7])')] ).
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(22,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(33,plain,
equal(least_upper_bound(A,least_upper_bound(B,A)),least_upper_bound(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,22]),7]),
[iquote('para(11,22),demod([7])')] ).
cnf(44,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,21]),17]),
[iquote('para(2,21),demod([17])')] ).
cnf(45,plain,
~ equal(least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(a,identity))))),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(a,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),44,44]),
[iquote('back_demod(19),demod([44,44])')] ).
cnf(63,plain,
equal(least_upper_bound(A,greatest_lower_bound(B,greatest_lower_bound(C,A))),A),
inference(para,[status(thm),theory(equality)],[6,22]),
[iquote('para(6,22)')] ).
cnf(68,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,63]),7]),
[iquote('para(11,63),demod([7])')] ).
cnf(119,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,68]),7,7]),
[iquote('para(11,68),demod([7,7])')] ).
cnf(125,plain,
equal(least_upper_bound(A,least_upper_bound(B,least_upper_bound(A,C))),least_upper_bound(A,least_upper_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,7]),7,7]),1]),
[iquote('para(33,7),demod([7,7]),flip(1)')] ).
cnf(126,plain,
~ equal(least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(b,a))),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(a,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[45]),125,119]),
[iquote('back_demod(45),demod([125,119])')] ).
cnf(2895,plain,
~ equal(least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(a,identity))),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(a,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,126]),7]),
[iquote('para(5,126),demod([7])')] ).
cnf(2896,plain,
$false,
inference(conflict,[status(thm)],[2895]),
[iquote('xx_conflict(2895)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP185-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n011.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 07:14:48 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.73/1.08 ----- EQP 0.9e, May 2009 -----
% 0.73/1.08 The job began on n011.cluster.edu, Mon Jun 13 07:14:49 2022
% 0.73/1.08 The command was "./eqp09e".
% 0.73/1.08
% 0.73/1.08 set(prolog_style_variables).
% 0.73/1.08 set(lrpo).
% 0.73/1.08 set(basic_paramod).
% 0.73/1.08 set(functional_subsume).
% 0.73/1.08 set(ordered_paramod).
% 0.73/1.08 set(prime_paramod).
% 0.73/1.08 set(para_pairs).
% 0.73/1.08 assign(pick_given_ratio,4).
% 0.73/1.08 clear(print_kept).
% 0.73/1.08 clear(print_new_demod).
% 0.73/1.08 clear(print_back_demod).
% 0.73/1.08 clear(print_given).
% 0.73/1.08 assign(max_mem,64000).
% 0.73/1.08 end_of_commands.
% 0.73/1.08
% 0.73/1.08 Usable:
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Sos:
% 0.73/1.08 0 (wt=-1) [] multiply(identity,A) = A.
% 0.73/1.08 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.73/1.08 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.08 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.73/1.08 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.73/1.08 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.73/1.08 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.73/1.08 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.73/1.08 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.73/1.08 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.08 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.08 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.08 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.08 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.08 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.08 0 (wt=-1) [] inverse(identity) = identity.
% 0.73/1.08 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.73/1.08 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.73/1.08 0 (wt=-1) [] -(least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) = multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))).
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Demodulators:
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Passive:
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Starting to process input.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.73/1.08 1 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.73/1.08 2 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.08 3 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.73/1.08 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.73/1.08
% 0.73/1.08 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.73/1.08 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.73/1.08
% 0.73/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.73/1.08 6 is a new demodulator.
% 0.73/1.08
% 0.73/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.73/1.08 7 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.73/1.08 8 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.73/1.08 9 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.08 10 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.08 11 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.08 12 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.08 13 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.08 14 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.08 15 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.73/1.08 16 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.73/1.08 17 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.73/1.08 18 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 19 (wt=29) [demod([12,14,1,14,1,7,7,12,14,1,14,1,7])] -(least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity))))) = least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity)))).
% 0.73/1.56 ---------------- PROOF FOUND ----------------
% 0.73/1.56 % SZS status Unsatisfiable
% 0.73/1.56
% 0.73/1.56
% 0.73/1.56 After processing input:
% 0.73/1.56
% 0.73/1.56 Usable:
% 0.73/1.56 end_of_list.
% 0.73/1.56
% 0.73/1.56 Sos:
% 0.73/1.56 16 (wt=4) [] inverse(identity) = identity.
% 0.73/1.56 1 (wt=5) [] multiply(identity,A) = A.
% 0.73/1.56 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.73/1.56 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.73/1.56 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.73/1.56 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.73/1.56 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.73/1.56 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.73/1.56 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.56 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.56 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.73/1.56 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.56 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.73/1.56 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.73/1.56 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.56 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.56 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.56 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.56 19 (wt=29) [demod([12,14,1,14,1,7,7,12,14,1,14,1,7])] -(least_upper_bound(multiply(a,b),least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity))))) = least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity)))).
% 0.73/1.56 end_of_list.
% 0.73/1.56
% 0.73/1.56 Demodulators:
% 0.73/1.56 1 (wt=5) [] multiply(identity,A) = A.
% 0.73/1.56 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.73/1.56 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.56 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.73/1.56 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.73/1.56 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.73/1.56 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.73/1.56 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.56 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.56 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.56 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.56 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.56 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.56 16 (wt=4) [] inverse(identity) = identity.
% 0.73/1.56 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.73/1.56 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.73/1.56 end_of_list.
% 0.73/1.56
% 0.73/1.56 Passive:
% 0.73/1.56 end_of_list.
% 0.73/1.56
% 0.73/1.56 UNIT CONFLICT from 2895 and x=x at 0.19 seconds.
% 0.73/1.56
% 0.73/1.56 ---------------- PROOF ----------------
% 0.73/1.56 % SZS output start Refutation
% See solution above
% 0.73/1.56 ------------ end of proof -------------
% 0.73/1.56
% 0.73/1.56
% 0.73/1.56 ------------- memory usage ------------
% 0.73/1.56 Memory dynamically allocated (tp_alloc): 4394.
% 0.73/1.56 type (bytes each) gets frees in use avail bytes
% 0.73/1.56 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.73/1.56 term ( 16) 348152 291891 56261 32 1088.2 K
% 0.73/1.56 gen_ptr ( 8) 288043 56289 231754 24 1810.8 K
% 0.73/1.56 context ( 808) 307199 307197 2 5 5.5 K
% 0.73/1.56 trail ( 12) 24176 24176 0 5 0.1 K
% 0.73/1.56 bt_node ( 68) 129341 129338 3 14 1.1 K
% 0.73/1.56 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.56 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.56 ac_match_free_vars_pos (4020)
% 0.73/1.56 0 0 0 0 0.0 K
% 0.73/1.56 discrim ( 12) 37863 1370 36493 0 427.7 K
% 0.73/1.56 flat ( 40) 680906 680906 0 63 2.5 K
% 0.73/1.56 discrim_pos ( 12) 18577 18577 0 1 0.0 K
% 0.73/1.56 fpa_head ( 12) 6439 0 6439 0 75.5 K
% 0.73/1.56 fpa_tree ( 28) 7100 7100 0 35 1.0 K
% 0.73/1.56 fpa_pos ( 36) 4828 4828 0 1 0.0 K
% 0.73/1.56 literal ( 12) 17724 14829 2895 0 33.9 K
% 0.73/1.56 clause ( 24) 17724 14829 2895 0 67.9 K
% 0.73/1.56 list ( 12) 1993 1937 56 3 0.7 K
% 0.73/1.56 list_pos ( 20) 10945 668 10277 0 200.7 K
% 0.73/1.56 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.56
% 0.73/1.56 -------------- statistics -------------
% 0.73/1.56 Clauses input 19
% 0.73/1.56 Usable input 0
% 0.73/1.56 Sos input 19
% 0.73/1.56 Demodulators input 0
% 0.73/1.56 Passive input 0
% 0.73/1.56
% 0.73/1.56 Processed BS (before search) 21
% 0.73/1.56 Forward subsumed BS 2
% 0.73/1.56 Kept BS 19
% 0.73/1.56 New demodulators BS 16
% 0.73/1.56 Back demodulated BS 0
% 0.73/1.56
% 0.73/1.56 Clauses or pairs given 28940
% 0.73/1.56 Clauses generated 11384
% 0.73/1.56 Forward subsumed 8508
% 0.73/1.56 Deleted by weight 0
% 0.73/1.56 Deleted by variable count 0
% 0.73/1.56 Kept 2876
% 0.73/1.56 New demodulators 1918
% 0.73/1.56 Back demodulated 155
% 0.73/1.56 Ordered paramod prunes 0
% 0.73/1.56 Basic paramod prunes 118112
% 0.73/1.56 Prime paramod prunes 549
% 0.73/1.56 Semantic prunes 0
% 0.73/1.56
% 0.73/1.56 Rewrite attmepts 114471
% 0.73/1.56 Rewrites 15281
% 0.73/1.56
% 0.73/1.56 FPA overloads 0
% 0.73/1.56 FPA underloads 0
% 0.73/1.56
% 0.73/1.56 Usable size 0
% 0.73/1.56 Sos size 2739
% 0.73/1.56 Demodulators size 1905
% 0.73/1.56 Passive size 0
% 0.73/1.56 Disabled size 155
% 0.73/1.56
% 0.73/1.56 Proofs found 1
% 0.73/1.56
% 0.73/1.56 ----------- times (seconds) ----------- Mon Jun 13 07:14:49 2022
% 0.73/1.56
% 0.73/1.56 user CPU time 0.19 (0 hr, 0 min, 0 sec)
% 0.73/1.56 system CPU time 0.29 (0 hr, 0 min, 0 sec)
% 0.73/1.56 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.56 input time 0.00
% 0.73/1.56 paramodulation time 0.05
% 0.73/1.56 demodulation time 0.02
% 0.73/1.56 orient time 0.01
% 0.73/1.56 weigh time 0.00
% 0.73/1.56 forward subsume time 0.01
% 0.73/1.56 back demod find time 0.01
% 0.73/1.56 conflict time 0.01
% 0.73/1.56 LRPO time 0.01
% 0.73/1.56 store clause time 0.02
% 0.73/1.56 disable clause time 0.00
% 0.73/1.56 prime paramod time 0.01
% 0.73/1.56 semantics time 0.00
% 0.73/1.56
% 0.73/1.56 EQP interrupted
%------------------------------------------------------------------------------