TSTP Solution File: GRP186-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP186-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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 11.54s 11.93s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP186-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n014.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 05:53:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 11.54/11.92 ----- EQP 0.9e, May 2009 -----
% 11.54/11.92 The job began on n014.cluster.edu, Tue Jun 14 05:53:22 2022
% 11.54/11.92 The command was "./eqp09e".
% 11.54/11.92
% 11.54/11.92 set(prolog_style_variables).
% 11.54/11.92 set(lrpo).
% 11.54/11.92 set(basic_paramod).
% 11.54/11.92 set(functional_subsume).
% 11.54/11.92 set(ordered_paramod).
% 11.54/11.92 set(prime_paramod).
% 11.54/11.92 set(para_pairs).
% 11.54/11.92 assign(pick_given_ratio,4).
% 11.54/11.92 clear(print_kept).
% 11.54/11.92 clear(print_new_demod).
% 11.54/11.92 clear(print_back_demod).
% 11.54/11.92 clear(print_given).
% 11.54/11.92 assign(max_mem,64000).
% 11.54/11.92 end_of_commands.
% 11.54/11.92
% 11.54/11.92 Usable:
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Sos:
% 11.54/11.92 0 (wt=-1) [] multiply(identity,A) = A.
% 11.54/11.92 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 11.54/11.92 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.54/11.92 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.54/11.92 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.54/11.92 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 11.54/11.92 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 11.54/11.92 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 11.54/11.92 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 11.54/11.92 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.54/11.92 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.54/11.92 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 0 (wt=-1) [] -(least_upper_bound(multiply(a,b),identity) = multiply(a,inverse(greatest_lower_bound(a,inverse(b))))).
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Demodulators:
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Passive:
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Starting to process input.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 11.54/11.92 1 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.54/11.92 2 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.54/11.92 3 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.54/11.92 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 11.54/11.92
% 11.54/11.92 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.54/11.92 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 11.54/11.92
% 11.54/11.92 ** 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.54/11.92 6 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** 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.54/11.92 7 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.54/11.92 8 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.54/11.92 9 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.54/11.92 10 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.54/11.92 11 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 12 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 13 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 14 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 15 is a new demodulator.
% 11.54/11.92
% 11.54/11.92 ** KEPT: 16 (wt=13) [flip(1)] -(multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) = least_upper_bound(multiply(a,b),identity)).
% 11.54/11.92
% 11.54/11.92 After processing input:
% 11.54/11.92
% 11.54/11.92 Usable:
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Sos:
% 11.54/11.92 1 (wt=5) [] multiply(identity,A) = A.
% 11.54/11.92 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.54/11.92 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.54/11.92 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.54/11.92 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.54/11.92 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.54/11.92 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.54/11.92 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.54/11.92 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.54/11.92 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.54/11.92 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.54/11.92 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 16 (wt=13) [flip(1)] -(multiply(a,inverse(greatest_lower_bound(a,inverse(b)))) = least_upper_bound(multiply(a,b),identity)).
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Demodulators:
% 11.54/11.92 1 (wt=5) [] multiply(identity,A) = A.
% 11.54/11.92 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.54/11.92 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.54/11.92 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.54/11.92 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.54/11.92 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.54/11.92 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.54/11.92 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.54/11.92 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.54/11.92 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.54/11.92 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 Passive:
% 11.54/11.92 end_of_list.
% 11.54/11.92
% 11.54/11.92 ------------- memory usage ------------
% 11.54/11.92 Memory dynamically allocated (tp_alloc): 63964.
% 11.54/11.92 type (bytes each) gets frees in use avail bytes
% 11.54/11.92 sym_ent ( 96) 58 0 58 0 5.4 K
% 11.54/11.92 term ( 16) 5528905 4675774 853131 4 16556.3 K
% 11.54/11.92 gen_ptr ( 8) 4897858 655648 4242210 0 33142.3 K
% 11.54/11.92 context ( 808) 4682246 4682244 2 7 7.1 K
% 11.54/11.92 trail ( 12) 687028 687028 0 7 0.1 K
% 11.54/11.92 bt_node ( 68) 2031327 2031322 5 27 2.1 K
% 11.54/11.92 ac_position (285432) 0 0 0 0 0.0 K
% 11.54/11.92 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.54/11.92 ac_match_free_vars_pos (4020)
% 11.54/11.92 0 0 0 0 0.0 K
% 11.54/11.92 discrim ( 12) 747378 19839 727539 0 8525.8 K
% 11.54/11.92 flat ( 40) 12046916 12046916 0 228 8.9 K
% 11.54/11.92 discrim_pos ( 12) 247443 247443 0 1 0.0 K
% 11.54/11.92 fpa_head ( 12) 48151 0 48151 0 564.3 K
% 11.54/11.92 fpa_tree ( 28) 152772 152772 0 83 2.3 K
% 11.54/11.92 fpa_pos ( 36) 49593 49593 0 1 0.0 K
% 11.54/11.92 literal ( 12) 165993 138731 27262 1 319.5 K
% 11.54/11.92 clause ( 24) 165993 138731 27262 1 639.0 K
% 11.54/11.92 list ( 12) 22390 22334 56 3 0.7 K
% 11.54/11.92 list_pos ( 20) 106643 5433 101210 0 1976.8 K
% 11.54/11.92 pair_index ( 40) 2 0 2 0
% 11.54/11.92
% 11.54/11.92 ********** ABNORMAL END **********
% 11.54/11.92 ********** in tp_alloc, max_mem parameter exceeded.
% 11.54/11.92 0.1 K
% 11.54/11.92
% 11.54/11.92 -------------- statistics -------------
% 11.54/11.92 Clauses input 16
% 11.54/11.92 Usable input 0
% 11.54/11.92 Sos input 16
% 11.54/11.92 Demodulators input 0
% 11.54/11.92 Passive input 0
% 11.54/11.92
% 11.54/11.92 Processed BS (before search) 18
% 11.54/11.92 Forward subsumed BS 2
% 11.54/11.92 Kept BS 16
% 11.54/11.93 New demodulators BS 13
% 11.54/11.93 Back demodulated BS 0
% 11.54/11.93
% 11.54/11.93 Clauses or pairs given 381470
% 11.54/11.93 Clauses generated 116797
% 11.54/11.93 Forward subsumed 89551
% 11.54/11.93 Deleted by weight 0
% 11.54/11.93 Deleted by variable count 0
% 11.54/11.93 Kept 27246
% 11.54/11.93 New demodulators 22318
% 11.54/11.93 Back demodulated 1253
% 11.54/11.93 Ordered paramod prunes 0
% 11.54/11.93 Basic paramod prunes 2305063
% 11.54/11.93 Prime paramod prunes 9840
% 11.54/11.93 Semantic prunes 0
% 11.54/11.93
% 11.54/11.93 Rewrite attmepts 1766494
% 11.54/11.93 Rewrites 221924
% 11.54/11.93
% 11.54/11.93 FPA overloads 0
% 11.54/11.93 FPA underloads 0
% 11.54/11.93
% 11.54/11.93 Usable size 0
% 11.54/11.93 Sos size 26009
% 11.54/11.93 Demodulators size 21930
% 11.54/11.93 Passive size 0
% 11.54/11.93 Disabled size 1253
% 11.54/11.93
% 11.54/11.93 Proofs found 0
% 11.54/11.93
% 11.54/11.93 ----------- times (seconds) ----------- Tue Jun 14 05:53:33 2022
% 11.54/11.93
% 11.54/11.93 user CPU time 8.77 (0 hr, 0 min, 8 sec)
% 11.54/11.93 system CPU time 2.09 (0 hr, 0 min, 2 sec)
% 11.54/11.93 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 11.54/11.93 input time 0.00
% 11.54/11.93 paramodulation time 0.86
% 11.54/11.93 demodulation time 0.52
% 11.54/11.93 orient time 0.23
% 11.54/11.93 weigh time 0.05
% 11.54/11.93 forward subsume time 0.11
% 11.54/11.93 back demod find time 0.80
% 11.54/11.93 conflict time 0.02
% 11.54/11.93 LRPO time 0.09
% 11.54/11.93 store clause time 5.17
% 11.54/11.93 disable clause time 0.23
% 11.54/11.93 prime paramod time 0.21
% 11.54/11.93 semantics time 0.00
% 11.54/11.93
% 11.54/11.93 EQP interrupted
%------------------------------------------------------------------------------