TSTP Solution File: GRP186-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP186-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:50 EDT 2022
% Result : Unknown 12.49s 12.84s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP186-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n018.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 18:53:43 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.41/1.05 ----- EQP 0.9e, May 2009 -----
% 0.41/1.05 The job began on n018.cluster.edu, Mon Jun 13 18:53:43 2022
% 0.41/1.05 The command was "./eqp09e".
% 0.41/1.05
% 0.41/1.05 set(prolog_style_variables).
% 0.41/1.05 set(lrpo).
% 0.41/1.05 set(basic_paramod).
% 0.41/1.05 set(functional_subsume).
% 0.41/1.05 set(ordered_paramod).
% 0.41/1.05 set(prime_paramod).
% 0.41/1.05 set(para_pairs).
% 0.41/1.05 assign(pick_given_ratio,4).
% 0.41/1.05 clear(print_kept).
% 0.41/1.05 clear(print_new_demod).
% 0.41/1.05 clear(print_back_demod).
% 0.41/1.05 clear(print_given).
% 0.41/1.05 assign(max_mem,64000).
% 0.41/1.05 end_of_commands.
% 0.41/1.05
% 0.41/1.05 Usable:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Sos:
% 0.41/1.05 0 (wt=-1) [] multiply(identity,A) = A.
% 0.41/1.05 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.41/1.05 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.41/1.05 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.41/1.05 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.41/1.05 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 0 (wt=-1) [] inverse(identity) = identity.
% 0.41/1.05 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.41/1.05 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.41/1.05 0 (wt=-1) [] -(least_upper_bound(multiply(a,b),identity) = multiply(a,inverse(greatest_lower_bound(a,inverse(b))))).
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Demodulators:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Passive:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Starting to process input.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.41/1.05 1 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.41/1.05 2 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.41/1.05 3 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.41/1.05 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.41/1.05
% 0.41/1.05 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.41/1.05 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.41/1.05
% 0.41/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.41/1.05 6 is a new demodulator.
% 0.41/1.05
% 0.41/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.41/1.05 7 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.41/1.05 8 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.41/1.05 9 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.41/1.05 10 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.41/1.05 11 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 12 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.41/1.05 13 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 14 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.41/1.05 15 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.41/1.05 16 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.41/1.05 17 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.41/1.05 18 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 19 (wt=13) [flip(1)] -(multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) = least_upper_bound(multiply(a,b),identity)).
% 12.38/12.84
% 12.38/12.84 After processing input:
% 12.38/12.84
% 12.38/12.84 Usable:
% 12.38/12.84 end_of_list.
% 12.38/12.84
% 12.38/12.84 Sos:
% 12.38/12.84 16 (wt=4) [] inverse(identity) = identity.
% 12.38/12.84 1 (wt=5) [] multiply(identity,A) = A.
% 12.38/12.84 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.38/12.84 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.38/12.84 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.38/12.84 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.38/12.84 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.38/12.84 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.38/12.84 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.38/12.84 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.38/12.84 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.38/12.84 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.38/12.84 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.38/12.84 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.38/12.84 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.38/12.84 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.38/12.84 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.38/12.84 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.38/12.84 19 (wt=13) [flip(1)] -(multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) = least_upper_bound(multiply(a,b),identity)).
% 12.38/12.84 end_of_list.
% 12.38/12.84
% 12.38/12.84 Demodulators:
% 12.38/12.84 1 (wt=5) [] multiply(identity,A) = A.
% 12.38/12.84 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.38/12.84 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.38/12.84 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.38/12.84 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.38/12.84 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.38/12.84 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.38/12.84 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.38/12.84 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.38/12.84 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.38/12.84 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.38/12.84 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.38/12.84 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.38/12.84 16 (wt=4) [] inverse(identity) = identity.
% 12.38/12.84 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.38/12.84 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.38/12.84 end_of_list.
% 12.38/12.84
% 12.38/12.84 Passive:
% 12.38/12.84 end_of_list.
% 12.38/12.84
% 12.38/12.84 ------------- memory usage ------------
% 12.38/12.84 Memory dynamically allocated (tp_alloc): 63964.
% 12.38/12.84 type (bytes each) gets frees in use avail bytes
% 12.38/12.84 sym_ent ( 96) 58 0 58 0 5.4 K
% 12.38/12.84 term ( 16) 4628536 3741612 886924 1 17213.3 K
% 12.38/12.84 gen_ptr ( 8) 4868580 591344 4277236 0 33415.9 K
% 12.38/12.84 context ( 808) 4512418 4512416 2 7 7.1 K
% 12.38/12.84 trail ( 12) 516137 516137 0 7 0.1 K
% 12.38/12.84 bt_node ( 68) 1996092 1996089 3 24 1.8 K
% 12.38/12.84 ac_position (285432) 0 0 0 0 0.0 K
% 12.38/12.84 ac_match_pos (14044) 0 0 0 0 0.0 K
% 12.38/12.84 ac_match_free_vars_pos (4020)
% 12.38/12.84 0 0 0 0 0.0 K
% 12.38/12.84 discrim ( 12) 703863 25499 678364 0 7949.6 K
% 12.38/12.84 flat ( 40) 11175091 11175091 0 185 7.2 K
% 12.38/12.84 discrim_pos ( 12) 206219 206219 0 1 0.0 K
% 12.38/12.84 fpa_head ( 12) 49018 0 49018 0 574.4 K
% 12.38/12.84 fpa_tree ( 28) 112200 112200 0 83 2.3 K
% 12.38/12.84 fpa_pos ( 36) 47855 47855 0 1 0.0 K
% 12.38/12.84 literal ( 12) 161247 133233 28014 1 3
% 12.38/12.84
% 12.38/12.84 ********** ABNORMAL END **********
% 12.38/12.84 ********** in tp_alloc, max_mem parameter exceeded.
% 12.38/12.84 28.3 K
% 12.38/12.84 clause ( 24) 161247 133233 28014 1 656.6 K
% 12.38/12.84 list ( 12) 19900 19844 56 3 0.7 K
% 12.38/12.84 list_pos ( 20) 107156 7020 100136 0 1955.8 K
% 12.38/12.84 pair_index ( 40) 2 0 2 0 0.1 K
% 12.38/12.84
% 12.38/12.84 -------------- statistics -------------
% 12.38/12.84 Clauses input 19
% 12.38/12.84 Usable input 0
% 12.38/12.84 Sos input 19
% 12.38/12.84 Demodulators input 0
% 12.38/12.84 Passive input 0
% 12.38/12.84
% 12.38/12.84 Processed BS (before search) 21
% 12.38/12.84 Forward subsumed BS 2
% 12.38/12.84 Kept BS 19
% 12.38/12.84 New demodulators BS 16
% 12.38/12.84 Back demodulated BS 0
% 12.38/12.84
% 12.38/12.84 Clauses or pairs given 385190
% 12.38/12.84 Clauses generated 110701
% 12.38/12.84 Forward subsumed 82706
% 12.38/12.84 Deleted by weight 0
% 12.38/12.84 Deleted by variable count 0
% 12.38/12.84 Kept 27995
% 12.38/12.84 New demodulators 19825
% 12.38/12.84 Back demodulated 1627
% 12.38/12.84 Ordered paramod prunes 0
% 12.38/12.84 Basic paramod prunes 2359213
% 12.38/12.84 Prime paramod prunes 9655
% 12.38/12.84 Semantic prunes 0
% 12.38/12.84
% 12.38/12.84 Rewrite attmepts 1611429
% 12.38/12.84 Rewrites 179473
% 12.38/12.84
% 12.38/12.84 FPA overloads 0
% 12.38/12.84 FPA underloads 0
% 12.38/12.84
% 12.38/12.84 Usable size 0
% 12.38/12.84 Sos size 26387
% 12.38/12.84 Demodulators size 19348
% 12.38/12.84 Passive size 0
% 12.38/12.84 Disabled size 1627
% 12.38/12.84
% 12.38/12.84 Proofs found 0
% 12.38/12.84
% 12.38/12.84 ----------- times (seconds) ----------- Mon Jun 13 18:53:55 2022
% 12.38/12.84
% 12.38/12.84 user CPU time 9.75 (0 hr, 0 min, 9 sec)
% 12.38/12.84 system CPU time 2.04 (0 hr, 0 min, 2 sec)
% 12.38/12.84 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.38/12.84 input time 0.00
% 12.38/12.84 paramodulation time 0.86
% 12.38/12.84 demodulation time 0.52
% 12.38/12.84 orient time 0.22
% 12.38/12.84 weigh time 0.05
% 12.38/12.84 forward subsume time 0.15
% 12.38/12.84 back demod find time 0.66
% 12.38/12.84 conflict time 0.03
% 12.38/12.84 LRPO time 0.11
% 12.38/12.84 store clause time 6.22
% 12.38/12.84 disable clause time 0.25
% 12.38/12.84 prime paramod time 0.20
% 12.38/12.84 semantics time 0.00
% 12.38/12.84
% 12.38/12.84 EQP interrupted
%------------------------------------------------------------------------------