TSTP Solution File: GRP185-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP185-1 : 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:49 EDT 2022
% Result : Unsatisfiable 0.95s 1.31s
% Output : Refutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 6 RR)
% Number of literals : 24 ( 0 equ; 5 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 : 38 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP185-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP185-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP185-1.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP185-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP185-1.p',unknown),
[] ).
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-1.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP185-1.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP185-1.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP185-1.p',unknown),
[] ).
cnf(16,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(17,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(19,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(27,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,19]),7]),
[iquote('para(11,19),demod([7])')] ).
cnf(35,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,17]),
[iquote('para(2,17)')] ).
cnf(47,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[17,17]),
[iquote('para(17,17)')] ).
cnf(48,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),47]),
[iquote('back_demod(35),demod([47])')] ).
cnf(49,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)],[16]),48,48]),
[iquote('back_demod(16),demod([48,48])')] ).
cnf(98,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)],[27,7]),7,7]),1]),
[iquote('para(27,7),demod([7,7]),flip(1)')] ).
cnf(99,plain,
~ equal(least_upper_bound(multiply(a,b),least_upper_bound(identity,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)],[49]),98]),
[iquote('back_demod(49),demod([98])')] ).
cnf(101,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(para,[status(thm),theory(equality)],[7,27]),
[iquote('para(7,27)')] ).
cnf(102,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)],[99]),101]),
[iquote('back_demod(99),demod([101])')] ).
cnf(1403,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,102]),7]),
[iquote('para(5,102),demod([7])')] ).
cnf(1404,plain,
$false,
inference(conflict,[status(thm)],[1403]),
[iquote('xx_conflict(1403)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 08:19:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.95/1.31 ----- EQP 0.9e, May 2009 -----
% 0.95/1.31 The job began on n019.cluster.edu, Tue Jun 14 08:19:25 2022
% 0.95/1.31 The command was "./eqp09e".
% 0.95/1.31
% 0.95/1.31 set(prolog_style_variables).
% 0.95/1.31 set(lrpo).
% 0.95/1.31 set(basic_paramod).
% 0.95/1.31 set(functional_subsume).
% 0.95/1.31 set(ordered_paramod).
% 0.95/1.31 set(prime_paramod).
% 0.95/1.31 set(para_pairs).
% 0.95/1.31 assign(pick_given_ratio,4).
% 0.95/1.31 clear(print_kept).
% 0.95/1.31 clear(print_new_demod).
% 0.95/1.31 clear(print_back_demod).
% 0.95/1.31 clear(print_given).
% 0.95/1.31 assign(max_mem,64000).
% 0.95/1.31 end_of_commands.
% 0.95/1.31
% 0.95/1.31 Usable:
% 0.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Sos:
% 0.95/1.31 0 (wt=-1) [] multiply(identity,A) = A.
% 0.95/1.31 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.95/1.31 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.95/1.31 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.95/1.31 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.95/1.31 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.95/1.31 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.95/1.31 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.95/1.31 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.95/1.31 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.95/1.31 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.95/1.31 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 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.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Demodulators:
% 0.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Passive:
% 0.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Starting to process input.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.95/1.31 1 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.95/1.31 2 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.95/1.31 3 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.95/1.31 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.95/1.31
% 0.95/1.31 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.95/1.31 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.95/1.31
% 0.95/1.31 ** 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.95/1.31 6 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** 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.95/1.31 7 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.95/1.31 8 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.95/1.31 9 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.95/1.31 10 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.95/1.31 11 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 12 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 13 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 14 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 15 is a new demodulator.
% 0.95/1.31
% 0.95/1.31 ** KEPT: 16 (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.95/1.31 ---------------- PROOF FOUND ----------------
% 0.95/1.31 % SZS status Unsatisfiable
% 0.95/1.31
% 0.95/1.31
% 0.95/1.31 After processing input:
% 0.95/1.31
% 0.95/1.31 Usable:
% 0.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Sos:
% 0.95/1.31 1 (wt=5) [] multiply(identity,A) = A.
% 0.95/1.31 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.95/1.31 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.95/1.31 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.95/1.31 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.95/1.31 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.95/1.31 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.95/1.31 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.95/1.31 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.95/1.31 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.95/1.31 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.95/1.31 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 16 (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.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Demodulators:
% 0.95/1.31 1 (wt=5) [] multiply(identity,A) = A.
% 0.95/1.31 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.95/1.31 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.95/1.31 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.95/1.31 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.95/1.31 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.95/1.31 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.95/1.31 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.95/1.31 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.95/1.31 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.95/1.31 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 Passive:
% 0.95/1.31 end_of_list.
% 0.95/1.31
% 0.95/1.31 UNIT CONFLICT from 1403 and x=x at 0.09 seconds.
% 0.95/1.31
% 0.95/1.31 ---------------- PROOF ----------------
% 0.95/1.31 % SZS output start Refutation
% See solution above
% 0.95/1.31 ------------ end of proof -------------
% 0.95/1.31
% 0.95/1.31
% 0.95/1.31 ------------- memory usage ------------
% 0.95/1.31 Memory dynamically allocated (tp_alloc): 1953.
% 0.95/1.31 type (bytes each) gets frees in use avail bytes
% 0.95/1.31 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.95/1.31 term ( 16) 178170 151611 26559 35 513.9 K
% 0.95/1.31 gen_ptr ( 8) 139383 30345 109038 23 852.0 K
% 0.95/1.31 context ( 808) 140436 140434 2 5 5.5 K
% 0.95/1.31 trail ( 12) 11647 11647 0 5 0.1 K
% 0.95/1.31 bt_node ( 68) 57701 57698 3 14 1.1 K
% 0.95/1.31 ac_position (285432) 0 0 0 0 0.0 K
% 0.95/1.31 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.95/1.31 ac_match_free_vars_pos (4020)
% 0.95/1.31 0 0 0 0 0.0 K
% 0.95/1.31 discrim ( 12) 18939 657 18282 0 214.2 K
% 0.95/1.31 flat ( 40) 321137 321137 0 91 3.6 K
% 0.95/1.31 discrim_pos ( 12) 9493 9493 0 1 0.0 K
% 0.95/1.31 fpa_head ( 12) 3942 0 3942 0 46.2 K
% 0.95/1.31 fpa_tree ( 28) 3671 3671 0 39 1.1 K
% 0.95/1.31 fpa_pos ( 36) 2400 2400 0 1 0.0 K
% 0.95/1.31 literal ( 12) 9030 7627 1403 0 16.4 K
% 0.95/1.31 clause ( 24) 9030 7627 1403 0 32.9 K
% 0.95/1.31 list ( 12) 1057 1001 56 3 0.7 K
% 0.95/1.31 list_pos ( 20) 5362 320 5042 0 98.5 K
% 0.95/1.31 pair_index ( 40) 2 0 2 0 0.1 K
% 0.95/1.31
% 0.95/1.31 -------------- statistics -------------
% 0.95/1.31 Clauses input 16
% 0.95/1.31 Usable input 0
% 0.95/1.31 Sos input 16
% 0.95/1.31 Demodulators input 0
% 0.95/1.31 Passive input 0
% 0.95/1.31
% 0.95/1.31 Processed BS (before search) 18
% 0.95/1.31 Forward subsumed BS 2
% 0.95/1.31 Kept BS 16
% 0.95/1.31 New demodulators BS 13
% 0.95/1.31 Back demodulated BS 0
% 0.95/1.31
% 0.95/1.31 Clauses or pairs given 12950
% 0.95/1.31 Clauses generated 6014
% 0.95/1.31 Forward subsumed 4627
% 0.95/1.31 Deleted by weight 0
% 0.95/1.31 Deleted by variable count 0
% 0.95/1.31 Kept 1387
% 0.95/1.31 New demodulators 985
% 0.95/1.31 Back demodulated 71
% 0.95/1.31 Ordered paramod prunes 0
% 0.95/1.31 Basic paramod prunes 48473
% 0.95/1.31 Prime paramod prunes 185
% 0.95/1.31 Semantic prunes 0
% 0.95/1.31
% 0.95/1.31 Rewrite attmepts 56281
% 0.95/1.31 Rewrites 8058
% 0.95/1.31
% 0.95/1.31 FPA overloads 0
% 0.95/1.31 FPA underloads 0
% 0.95/1.31
% 0.95/1.31 Usable size 0
% 0.95/1.31 Sos size 1331
% 0.95/1.31 Demodulators size 978
% 0.95/1.31 Passive size 0
% 0.95/1.31 Disabled size 71
% 0.95/1.31
% 0.95/1.31 Proofs found 1
% 0.95/1.31
% 0.95/1.31 ----------- times (seconds) ----------- Tue Jun 14 08:19:25 2022
% 0.95/1.31
% 0.95/1.31 user CPU time 0.09 (0 hr, 0 min, 0 sec)
% 0.95/1.31 system CPU time 0.16 (0 hr, 0 min, 0 sec)
% 0.95/1.31 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.95/1.31 input time 0.00
% 0.95/1.31 paramodulation time 0.02
% 0.95/1.31 demodulation time 0.01
% 0.95/1.31 orient time 0.01
% 0.95/1.31 weigh time 0.00
% 0.95/1.31 forward subsume time 0.01
% 0.95/1.31 back demod find time 0.00
% 0.95/1.31 conflict time 0.00
% 0.95/1.31 LRPO time 0.01
% 0.95/1.31 store clause time 0.01
% 0.95/1.31 disable clause time 0.00
% 0.95/1.31 prime paramod time 0.01
% 0.95/1.31 semantics time 0.00
% 0.95/1.31
% 0.95/1.31 EQP interrupted
%------------------------------------------------------------------------------