TSTP Solution File: GRP184-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP184-1 : 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:48 EDT 2022
% Result : Unknown 11.90s 12.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP184-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n011.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 : Mon Jun 13 13:49:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 11.89/12.27 ----- EQP 0.9e, May 2009 -----
% 11.89/12.27 The job began on n011.cluster.edu, Mon Jun 13 13:49:04 2022
% 11.89/12.27 The command was "./eqp09e".
% 11.89/12.27
% 11.89/12.27 set(prolog_style_variables).
% 11.89/12.27 set(lrpo).
% 11.89/12.27 set(basic_paramod).
% 11.89/12.27 set(functional_subsume).
% 11.89/12.27 set(ordered_paramod).
% 11.89/12.27 set(prime_paramod).
% 11.89/12.27 set(para_pairs).
% 11.89/12.27 assign(pick_given_ratio,4).
% 11.89/12.27 clear(print_kept).
% 11.89/12.27 clear(print_new_demod).
% 11.89/12.27 clear(print_back_demod).
% 11.89/12.27 clear(print_given).
% 11.89/12.27 assign(max_mem,64000).
% 11.89/12.27 end_of_commands.
% 11.89/12.27
% 11.89/12.27 Usable:
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Sos:
% 11.89/12.27 0 (wt=-1) [] multiply(identity,A) = A.
% 11.89/12.27 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 11.89/12.27 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.89/12.27 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.89/12.27 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.89/12.27 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 11.89/12.27 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 11.89/12.27 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 11.89/12.27 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 11.89/12.27 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.89/12.27 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.89/12.27 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 0 (wt=-1) [] -(multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity))).
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Demodulators:
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Passive:
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Starting to process input.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 11.89/12.27 1 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.89/12.27 2 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.89/12.27 3 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.89/12.27 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 11.89/12.27
% 11.89/12.27 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.89/12.27 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 11.89/12.27
% 11.89/12.27 ** 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.89/12.27 6 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** 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.89/12.27 7 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.89/12.27 8 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.89/12.27 9 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.89/12.27 10 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.89/12.27 11 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 12 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 13 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 14 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 15 is a new demodulator.
% 11.89/12.27
% 11.89/12.27 ** KEPT: 16 (wt=25) [demod([14,1,12]),flip(1)] -(least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)) = least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))).
% 11.89/12.27
% 11.89/12.27 After processing input:
% 11.89/12.27
% 11.89/12.27 Usable:
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Sos:
% 11.89/12.27 1 (wt=5) [] multiply(identity,A) = A.
% 11.89/12.27 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.89/12.27 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.89/12.27 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.89/12.27 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.89/12.27 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.89/12.27 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.89/12.27 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.89/12.27 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.89/12.27 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.89/12.27 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.89/12.27 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 16 (wt=25) [demod([14,1,12]),flip(1)] -(least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)) = least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))).
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Demodulators:
% 11.89/12.27 1 (wt=5) [] multiply(identity,A) = A.
% 11.89/12.27 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.89/12.27 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.89/12.27 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.89/12.27 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.89/12.27 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.89/12.27 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.89/12.27 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.89/12.27 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.89/12.27 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.89/12.27 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 Passive:
% 11.89/12.27 end_of_list.
% 11.89/12.27
% 11.89/12.27 ------------- memory usage ------------
% 11.89/12.27 Memory dynamically allocated (tp_alloc): 63964.
% 11.89/12.27 type (bytes each) gets frees in use avail bytes
% 11.89/12.27 sym_ent ( 96) 57 0 57 0 5.3 K
% 11.89/12.27 term ( 16) 5627603 4795658 831945 1 16149.8 K
% 11.89/12.27 gen_ptr ( 8) 4940359 645464 4294895 0 33553.9 K
% 11.89/12.27 context ( 808) 4537545 4537543 2 7 7.1 K
% 11.89/12.27 trail ( 12) 812065 812065 0 7 0.1 K
% 11.89/12.27 bt_node ( 68) 1931996 1931989 7 25 2.1 K
% 11.89/12.27 ac_position (285432) 0 0 0 0 0.0 K
% 11.89/12.27 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.89/12.27 ac_match_free_vars_pos (4020)
% 11.89/12.27 0 0 0 0 0.0 K
% 11.89/12.27 discrim ( 12) 757603 18606 738997 0 8660.1 K
% 11.89/12.27 flat ( 40) 12178724 12178724 0 228 8.9 K
% 11.89/12.27 discrim_pos ( 12) 253925 253925 0 1 0.0 K
% 11.89/12.27 fpa_head ( 12) 46659 0 46659 0 546.8 K
% 11.89/12.27 fpa_tree ( 28) 161202 161202 0 83 2.3 K
% 11.89/12.27 fpa_pos ( 36) 46208 46208 0 1 0.0 K
% 11.89/12.27 literal ( 12) 157373 132000 25373 1 297.4 K
% 11.89/12.27 clause ( 24) 157373 132000 25373 1 594.7 K
% 11.89/12.27 list ( 12) 20894 20838 56
% 11.89/12.27
% 11.89/12.27 ********** ABNORMAL END **********
% 11.89/12.27 ********** in tp_alloc, max_mem parameter exceeded.
% 11.89/12.27 3 0.7 K
% 11.89/12.27 list_pos ( 20) 99316 5107 94209 0 1840.0 K
% 11.90/12.28 pair_index ( 40) 2 0 2 0 0.1 K
% 11.90/12.28
% 11.90/12.28 -------------- statistics -------------
% 11.90/12.28 Clauses input 16
% 11.90/12.28 Usable input 0
% 11.90/12.28 Sos input 16
% 11.90/12.28 Demodulators input 0
% 11.90/12.28 Passive input 0
% 11.90/12.28
% 11.90/12.28 Processed BS (before search) 18
% 11.90/12.28 Forward subsumed BS 2
% 11.90/12.28 Kept BS 16
% 11.90/12.28 New demodulators BS 13
% 11.90/12.28 Back demodulated BS 0
% 11.90/12.28
% 11.90/12.28 Clauses or pairs given 355385
% 11.90/12.28 Clauses generated 112026
% 11.90/12.28 Forward subsumed 86669
% 11.90/12.28 Deleted by weight 0
% 11.90/12.28 Deleted by variable count 0
% 11.90/12.28 Kept 25357
% 11.90/12.28 New demodulators 20822
% 11.90/12.28 Back demodulated 1172
% 11.90/12.28 Ordered paramod prunes 0
% 11.90/12.28 Basic paramod prunes 2127892
% 11.90/12.28 Prime paramod prunes 9213
% 11.90/12.28 Semantic prunes 0
% 11.90/12.28
% 11.90/12.28 Rewrite attmepts 1767246
% 11.90/12.28 Rewrites 230229
% 11.90/12.28
% 11.90/12.28 FPA overloads 0
% 11.90/12.28 FPA underloads 0
% 11.90/12.28
% 11.90/12.28 Usable size 0
% 11.90/12.28 Sos size 24201
% 11.90/12.28 Demodulators size 20434
% 11.90/12.28 Passive size 0
% 11.90/12.28 Disabled size 1172
% 11.90/12.28
% 11.90/12.28 Proofs found 0
% 11.90/12.28
% 11.90/12.28 ----------- times (seconds) ----------- Mon Jun 13 13:49:15 2022
% 11.90/12.28
% 11.90/12.28 user CPU time 9.16 (0 hr, 0 min, 9 sec)
% 11.90/12.28 system CPU time 2.02 (0 hr, 0 min, 2 sec)
% 11.90/12.28 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 11.90/12.28 input time 0.00
% 11.90/12.28 paramodulation time 0.81
% 11.90/12.28 demodulation time 0.56
% 11.90/12.28 orient time 0.19
% 11.90/12.28 weigh time 0.07
% 11.90/12.28 forward subsume time 0.13
% 11.90/12.28 back demod find time 1.21
% 11.90/12.28 conflict time 0.01
% 11.90/12.28 LRPO time 0.09
% 11.90/12.28 store clause time 5.21
% 11.90/12.28 disable clause time 0.24
% 11.90/12.28 prime paramod time 0.18
% 11.90/12.28 semantics time 0.00
% 11.90/12.28
% 11.90/12.28 EQP interrupted
%------------------------------------------------------------------------------