TSTP Solution File: GRP183-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP183-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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 12.55s 12.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP183-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n021.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 : Tue Jun 14 04:09:12 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.64/1.02 ----- EQP 0.9e, May 2009 -----
% 0.64/1.02 The job began on n021.cluster.edu, Tue Jun 14 04:09:13 2022
% 0.64/1.02 The command was "./eqp09e".
% 0.64/1.02
% 0.64/1.02 set(prolog_style_variables).
% 0.64/1.02 set(lrpo).
% 0.64/1.02 set(basic_paramod).
% 0.64/1.02 set(functional_subsume).
% 0.64/1.02 set(ordered_paramod).
% 0.64/1.02 set(prime_paramod).
% 0.64/1.02 set(para_pairs).
% 0.64/1.02 assign(pick_given_ratio,4).
% 0.64/1.02 clear(print_kept).
% 0.64/1.02 clear(print_new_demod).
% 0.64/1.02 clear(print_back_demod).
% 0.64/1.02 clear(print_given).
% 0.64/1.02 assign(max_mem,64000).
% 0.64/1.02 end_of_commands.
% 0.64/1.02
% 0.64/1.02 Usable:
% 0.64/1.02 end_of_list.
% 0.64/1.02
% 0.64/1.02 Sos:
% 0.64/1.02 0 (wt=-1) [] multiply(identity,A) = A.
% 0.64/1.02 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.64/1.02 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.64/1.02 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.64/1.02 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.64/1.02 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.64/1.02 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.64/1.02 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.64/1.02 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.64/1.02 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.64/1.02 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.64/1.02 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.64/1.02 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.64/1.02 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.64/1.02 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.64/1.02 0 (wt=-1) [] inverse(identity) = identity.
% 0.64/1.02 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.64/1.02 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.64/1.02 0 (wt=-1) [] -(greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) = identity).
% 0.64/1.02 end_of_list.
% 0.64/1.02
% 0.64/1.02 Demodulators:
% 0.64/1.02 end_of_list.
% 0.64/1.02
% 0.64/1.02 Passive:
% 0.64/1.02 end_of_list.
% 0.64/1.02
% 0.64/1.02 Starting to process input.
% 0.64/1.02
% 0.64/1.02 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.64/1.02 1 is a new demodulator.
% 0.64/1.02
% 0.64/1.02 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.64/1.03 2 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.64/1.03 3 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.64/1.03 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.64/1.03
% 0.64/1.03 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.64/1.03 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.64/1.03
% 0.64/1.03 ** 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.64/1.03 6 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** 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.64/1.03 7 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.64/1.03 8 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.64/1.03 9 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.64/1.03 10 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.64/1.03 11 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.64/1.03 12 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.64/1.03 13 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.64/1.03 14 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.64/1.03 15 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.64/1.03 16 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.64/1.03 17 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.64/1.03 18 is a new demodulator.
% 0.64/1.03
% 0.64/1.03 ** KEPT: 19 (wt=10) [] -(greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) = identity).
% 12.55/12.98
% 12.55/12.98 After processing input:
% 12.55/12.98
% 12.55/12.98 Usable:
% 12.55/12.98 end_of_list.
% 12.55/12.98
% 12.55/12.98 Sos:
% 12.55/12.98 16 (wt=4) [] inverse(identity) = identity.
% 12.55/12.98 1 (wt=5) [] multiply(identity,A) = A.
% 12.55/12.98 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.55/12.98 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.55/12.98 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.55/12.98 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.55/12.98 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.55/12.98 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.55/12.98 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.55/12.98 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.55/12.98 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.55/12.98 19 (wt=10) [] -(greatest_lower_bound(least_upper_bound(a,identity),least_upper_bound(inverse(a),identity)) = identity).
% 12.55/12.98 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.55/12.98 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.55/12.98 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.55/12.98 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.55/12.98 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.55/12.98 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.55/12.98 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.55/12.98 end_of_list.
% 12.55/12.98
% 12.55/12.98 Demodulators:
% 12.55/12.98 1 (wt=5) [] multiply(identity,A) = A.
% 12.55/12.98 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.55/12.98 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.55/12.98 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.55/12.98 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.55/12.98 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.55/12.98 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.55/12.98 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.55/12.98 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.55/12.98 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.55/12.98 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.55/12.98 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.55/12.98 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.55/12.98 16 (wt=4) [] inverse(identity) = identity.
% 12.55/12.98 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.55/12.98 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.55/12.98 end_of_list.
% 12.55/12.98
% 12.55/12.98 Passive:
% 12.55/12.98 end_of_list.
% 12.55/12.98
% 12.55/12.98 ------------- memory usage ------------
% 12.55/12.98 Memory dynamically allocated (tp_alloc): 63964.
% 12.55/12.98 type (bytes each) gets frees in use avail bytes
% 12.55/12.98 sym_ent ( 96) 57 0 57 0 5.3 K
% 12.55/12.98 term ( 16) 4681579 3794164 887415 1 17222.1 K
% 12.55/12.98 gen_ptr ( 8) 4872352 601629 4270723 0 33365.0 K
% 12.55/12.99 context ( 808) 4665410 4665408 2 7 7.1 K
% 12.55/12.99 trail ( 12) 515565 515565 0 7 0.1 K
% 12.55/12.99 bt_node ( 68) 2102796 2102793 3 24 1.8 K
% 12.55/12.99 ac_position (285432) 0 0 0 0 0.0 K
% 12.55/12.99 ac_match_pos (14044) 0 0 0 0 0.0 K
% 12.55/12.99 ac_match_free_vars_pos (4020)
% 12.55/12.99 0 0 0 0 0.0 K
% 12.55/12.99 discrim ( 12) 702580 24934 677646 0 7941.2 K
% 12.55/12.99 flat ( 40) 11258946 11258946 0 185 7.2 K
% 12.55/12.99 discrim_pos ( 12) 209654 209654 0 1 0.0 K
% 12.55/12.99 fpa_head ( 12) 49334 0 49334 0 578.1 K
% 12.55/12.99 fpa_tree ( 28) 114264 114264 0 83 2.3 K
% 12.55/12.99 fpa_pos ( 36) 48369 48369 0 1 0.0 K
% 12.55/12.99 literal ( 12) 163224 134992 28232 1 330.9
% 12.55/12.99
% 12.55/12.99 ********** ABNORMAL END **********
% 12.55/12.99 ********** in tp_alloc, max_mem parameter exceeded.
% 12.55/12.99 K
% 12.55/12.99 clause ( 24) 163224 134992 28232 1 661.7 K
% 12.55/12.99 list ( 12) 20196 20140 56 3 0.7 K
% 12.55/12.99 list_pos ( 20) 108234 7282 100952 0 1971.7 K
% 12.55/12.99 pair_index ( 40) 2 0 2 0 0.1 K
% 12.55/12.99
% 12.55/12.99 -------------- statistics -------------
% 12.55/12.99 Clauses input 19
% 12.55/12.99 Usable input 0
% 12.55/12.99 Sos input 19
% 12.55/12.99 Demodulators input 0
% 12.55/12.99 Passive input 0
% 12.55/12.99
% 12.55/12.99 Processed BS (before search) 21
% 12.55/12.99 Forward subsumed BS 2
% 12.55/12.99 Kept BS 19
% 12.55/12.99 New demodulators BS 16
% 12.55/12.99 Back demodulated BS 0
% 12.55/12.99
% 12.55/12.99 Clauses or pairs given 400975
% 12.55/12.99 Clauses generated 112190
% 12.55/12.99 Forward subsumed 83977
% 12.55/12.99 Deleted by weight 0
% 12.55/12.99 Deleted by variable count 0
% 12.55/12.99 Kept 28213
% 12.55/12.99 New demodulators 20121
% 12.55/12.99 Back demodulated 1691
% 12.55/12.99 Ordered paramod prunes 0
% 12.55/12.99 Basic paramod prunes 2435407
% 12.55/12.99 Prime paramod prunes 9603
% 12.55/12.99 Semantic prunes 0
% 12.55/12.99
% 12.55/12.99 Rewrite attmepts 1631778
% 12.55/12.99 Rewrites 182857
% 12.55/12.99
% 12.55/12.99 FPA overloads 0
% 12.55/12.99 FPA underloads 0
% 12.55/12.99
% 12.55/12.99 Usable size 0
% 12.55/12.99 Sos size 26541
% 12.55/12.99 Demodulators size 19638
% 12.55/12.99 Passive size 0
% 12.55/12.99 Disabled size 1691
% 12.55/12.99
% 12.55/12.99 Proofs found 0
% 12.55/12.99
% 12.55/12.99 ----------- times (seconds) ----------- Tue Jun 14 04:09:25 2022
% 12.55/12.99
% 12.55/12.99 user CPU time 9.80 (0 hr, 0 min, 9 sec)
% 12.55/12.99 system CPU time 2.16 (0 hr, 0 min, 2 sec)
% 12.55/12.99 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.55/12.99 input time 0.00
% 12.55/12.99 paramodulation time 0.82
% 12.55/12.99 demodulation time 0.42
% 12.55/12.99 orient time 0.22
% 12.55/12.99 weigh time 0.05
% 12.55/12.99 forward subsume time 0.11
% 12.55/12.99 back demod find time 0.67
% 12.55/12.99 conflict time 0.02
% 12.55/12.99 LRPO time 0.10
% 12.55/12.99 store clause time 6.42
% 12.55/12.99 disable clause time 0.27
% 12.55/12.99 prime paramod time 0.20
% 12.55/12.99 semantics time 0.00
% 12.55/12.99
% 12.55/12.99 EQP interrupted
%------------------------------------------------------------------------------