TSTP Solution File: GRP399-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP399-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:46:30 EDT 2022
% Result : Unknown 11.15s 11.54s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP399-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n009.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 13:25:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 11.15/11.54 ----- EQP 0.9e, May 2009 -----
% 11.15/11.54 The job began on n009.cluster.edu, Tue Jun 14 13:25:53 2022
% 11.15/11.54 The command was "./eqp09e".
% 11.15/11.54
% 11.15/11.54 set(prolog_style_variables).
% 11.15/11.54 set(lrpo).
% 11.15/11.54 set(basic_paramod).
% 11.15/11.54 set(functional_subsume).
% 11.15/11.54 set(ordered_paramod).
% 11.15/11.54 set(prime_paramod).
% 11.15/11.54 set(para_pairs).
% 11.15/11.54 assign(pick_given_ratio,4).
% 11.15/11.54 clear(print_kept).
% 11.15/11.54 clear(print_new_demod).
% 11.15/11.54 clear(print_back_demod).
% 11.15/11.54 clear(print_given).
% 11.15/11.54 assign(max_mem,64000).
% 11.15/11.54 end_of_commands.
% 11.15/11.54
% 11.15/11.54 Usable:
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Sos:
% 11.15/11.54 0 (wt=-1) [] multiply(identity,A) = A.
% 11.15/11.54 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 11.15/11.54 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.15/11.54 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.15/11.54 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.15/11.54 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 11.15/11.54 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 11.15/11.54 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 11.15/11.54 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 11.15/11.54 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.15/11.54 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.15/11.54 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Demodulators:
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Passive:
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Starting to process input.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 11.15/11.54 1 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.15/11.54 2 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.15/11.54 3 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.15/11.54 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 11.15/11.54
% 11.15/11.54 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.15/11.54 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 11.15/11.54
% 11.15/11.54 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.15/11.54 6 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.15/11.54 7 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.15/11.54 8 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.15/11.54 9 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.15/11.54 10 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.15/11.54 11 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 12 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 13 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 14 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 15 is a new demodulator.
% 11.15/11.54
% 11.15/11.54 After processing input:
% 11.15/11.54
% 11.15/11.54 Usable:
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Sos:
% 11.15/11.54 1 (wt=5) [] multiply(identity,A) = A.
% 11.15/11.54 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.15/11.54 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.15/11.54 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.15/11.54 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.15/11.54 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.15/11.54 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.15/11.54 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.15/11.54 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.15/11.54 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.15/11.54 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.15/11.54 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Demodulators:
% 11.15/11.54 1 (wt=5) [] multiply(identity,A) = A.
% 11.15/11.54 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.15/11.54 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.15/11.54 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.15/11.54 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.15/11.54 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.15/11.54 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.15/11.54 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.15/11.54 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.15/11.54 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.15/11.54 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 Passive:
% 11.15/11.54 end_of_list.
% 11.15/11.54
% 11.15/11.54 ------------- memory usage ------------
% 11.15/11.54 Memory dynamically allocated (tp_alloc): 63964.
% 11.15/11.54 type (bytes each) gets frees in use avail bytes
% 11.15/11.54 sym_ent ( 96) 55 0 55 0 5.2 K
% 11.15/11.54 term ( 16) 5458437 4633711 824726 197 16016.9 K
% 11.15/11.54 gen_ptr ( 8) 4920178 606560 4313618 0 33700.1 K
% 11.15/11.54 context ( 808) 4317578 4317576 2 7 7.1 K
% 11.15/11.54 trail ( 12) 890969 890969 0 7 0.1 K
% 11.15/11.54 bt_node ( 68) 1817013 1817010 3 29 2.1 K
% 11.15/11.54 ac_position (285432) 0 0 0 0 0.0 K
% 11.15/11.54 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.15/11.54 ac_match_free_vars_pos (4020)
% 11.15/11.54 0 0 0 0 0.0 K
% 11.15/11.54 discrim ( 12) 766073 16575 749498 0 8783.2 K
% 11.15/11.54 flat ( 40) 11834964 11834964 0 228 8.9 K
% 11.15/11.54 discrim_pos ( 12) 245567 245567 0 1 0.0 K
% 11.15/11.54 fpa_head ( 12) 45052 0 45052 0 528.0 K
% 11.15/11.54 fpa_tree ( 28) 163633 163633 0 83 2.3 K
% 11.15/11.54 fpa_pos ( 36) 44215 44215 0 1 0.0 K
% 11.15/11.54 literal ( 12) 148350 124058 24292 1 284.7 K
% 11.15/11.54 clause ( 24) 148350 124058 24292 1 569.4 K
% 11.15/11.54 list ( 12) 19982 19926 56 3 0.7 K
% 11.15/11.54 list_pos ( 20) 94884 4503 90381 0 1765.3 K
% 11.15/11.54 pair_index ( 40) 2 0 2 0 0.1 K
% 11.15/11.54
% 11.15/11.54 -------------- statistics -------------
% 11.15/11.54 Clauses input 15
% 11.15/11.54 Usable input 0
% 11.15/11.54 Sos inp
% 11.15/11.54
% 11.15/11.54 ********** ABNORMAL END **********
% 11.15/11.54 ********** in tp_alloc, max_mem parameter exceeded.
% 11.15/11.54 ut 15
% 11.15/11.54 Demodulators input 0
% 11.15/11.54 Passive input 0
% 11.15/11.54
% 11.15/11.54 Processed BS (before search) 17
% 11.15/11.54 Forward subsumed BS 2
% 11.15/11.54 Kept BS 15
% 11.15/11.54 New demodulators BS 13
% 11.15/11.54 Back demodulated BS 0
% 11.15/11.54
% 11.15/11.54 Clauses or pairs given 329330
% 11.15/11.54 Clauses generated 105189
% 11.15/11.54 Forward subsumed 80912
% 11.15/11.54 Deleted by weight 0
% 11.15/11.54 Deleted by variable count 0
% 11.15/11.54 Kept 24277
% 11.15/11.54 New demodulators 19910
% 11.15/11.54 Back demodulated 1034
% 11.15/11.54 Ordered paramod prunes 0
% 11.15/11.54 Basic paramod prunes 1962132
% 11.15/11.54 Prime paramod prunes 8845
% 11.15/11.54 Semantic prunes 0
% 11.15/11.54
% 11.15/11.54 Rewrite attmepts 1710437
% 11.15/11.54 Rewrites 223044
% 11.15/11.54
% 11.15/11.54 FPA overloads 0
% 11.15/11.54 FPA underloads 0
% 11.15/11.54
% 11.15/11.54 Usable size 0
% 11.15/11.54 Sos size 23258
% 11.15/11.54 Demodulators size 19573
% 11.15/11.54 Passive size 0
% 11.15/11.54 Disabled size 1034
% 11.15/11.54
% 11.15/11.54 Proofs found 0
% 11.15/11.54
% 11.15/11.54 ----------- times (seconds) ----------- Tue Jun 14 13:26:04 2022
% 11.15/11.54
% 11.15/11.54 user CPU time 8.66 (0 hr, 0 min, 8 sec)
% 11.15/11.54 system CPU time 1.80 (0 hr, 0 min, 1 sec)
% 11.15/11.54 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 11.15/11.54 input time 0.00
% 11.15/11.54 paramodulation time 0.76
% 11.15/11.54 demodulation time 0.59
% 11.15/11.54 orient time 0.21
% 11.15/11.54 weigh time 0.05
% 11.15/11.54 forward subsume time 0.13
% 11.15/11.54 back demod find time 1.19
% 11.15/11.54 conflict time 0.02
% 11.15/11.54 LRPO time 0.10
% 11.15/11.54 store clause time 4.85
% 11.15/11.54 disable clause time 0.19
% 11.15/11.54 prime paramod time 0.18
% 11.15/11.54 semantics time 0.00
% 11.15/11.54
% 11.15/11.54 EQP interrupted
%------------------------------------------------------------------------------