TSTP Solution File: GRP167-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP167-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:38 EDT 2022
% Result : Unknown 13.05s 13.50s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP167-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 18:52:53 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.72/1.10 ----- EQP 0.9e, May 2009 -----
% 0.72/1.10 The job began on n017.cluster.edu, Mon Jun 13 18:52:54 2022
% 0.72/1.10 The command was "./eqp09e".
% 0.72/1.10
% 0.72/1.10 set(prolog_style_variables).
% 0.72/1.10 set(lrpo).
% 0.72/1.10 set(basic_paramod).
% 0.72/1.10 set(functional_subsume).
% 0.72/1.10 set(ordered_paramod).
% 0.72/1.10 set(prime_paramod).
% 0.72/1.10 set(para_pairs).
% 0.72/1.10 assign(pick_given_ratio,4).
% 0.72/1.10 clear(print_kept).
% 0.72/1.10 clear(print_new_demod).
% 0.72/1.10 clear(print_back_demod).
% 0.72/1.10 clear(print_given).
% 0.72/1.10 assign(max_mem,64000).
% 0.72/1.10 end_of_commands.
% 0.72/1.10
% 0.72/1.10 Usable:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Sos:
% 0.72/1.10 0 (wt=-1) [] multiply(identity,A) = A.
% 0.72/1.10 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.72/1.10 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.10 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.10 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.10 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.72/1.10 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.72/1.10 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.72/1.10 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.72/1.10 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.10 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.10 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.10 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.10 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.10 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.10 0 (wt=-1) [] inverse(identity) = identity.
% 0.72/1.10 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.72/1.10 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.72/1.10 0 (wt=-1) [] -(a = multiply(least_upper_bound(a,identity),greatest_lower_bound(a,identity))).
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Demodulators:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Passive:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Starting to process input.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.10 1 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.10 2 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.10 3 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.10 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.72/1.10
% 0.72/1.10 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.10 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.72/1.10
% 0.72/1.10 ** 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.72/1.10 6 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** 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.72/1.10 7 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.10 8 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.10 9 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.10 10 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.10 11 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.10 12 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.10 13 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.10 14 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.10 15 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.72/1.10 16 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.72/1.10 17 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.72/1.10 18 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 19 (wt=13) [demod([13,14,1,14,1]),flip(1)] -(greatest_lower_bound(least_upper_bound(multiply(a,a),a),least_upper_bound(multiply(a,identity),identity)) = a).
% 13.05/13.49
% 13.05/13.49 After processing input:
% 13.05/13.49
% 13.05/13.49 Usable:
% 13.05/13.49 end_of_list.
% 13.05/13.49
% 13.05/13.49 Sos:
% 13.05/13.49 16 (wt=4) [] inverse(identity) = identity.
% 13.05/13.49 1 (wt=5) [] multiply(identity,A) = A.
% 13.05/13.49 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.05/13.49 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.05/13.49 17 (wt=5) [] inverse(inverse(A)) = A.
% 13.05/13.49 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.05/13.49 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 13.05/13.49 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 13.05/13.49 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.05/13.49 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.05/13.49 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 13.05/13.49 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.05/13.49 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 13.05/13.49 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 13.05/13.49 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.05/13.49 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.05/13.49 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.05/13.49 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.05/13.49 19 (wt=13) [demod([13,14,1,14,1]),flip(1)] -(greatest_lower_bound(least_upper_bound(multiply(a,a),a),least_upper_bound(multiply(a,identity),identity)) = a).
% 13.05/13.49 end_of_list.
% 13.05/13.49
% 13.05/13.49 Demodulators:
% 13.05/13.49 1 (wt=5) [] multiply(identity,A) = A.
% 13.05/13.49 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.05/13.49 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.05/13.49 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 13.05/13.49 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 13.05/13.49 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.05/13.49 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.05/13.49 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.05/13.49 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.05/13.49 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.05/13.49 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.05/13.49 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.05/13.49 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.05/13.49 16 (wt=4) [] inverse(identity) = identity.
% 13.05/13.49 17 (wt=5) [] inverse(inverse(A)) = A.
% 13.05/13.49 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 13.05/13.49 end_of_list.
% 13.05/13.49
% 13.05/13.49 Passive:
% 13.05/13.49 end_of_list.
% 13.05/13.49
% 13.05/13.49 ------------- memory usage ------------
% 13.05/13.49 Memory dynamically allocated (tp_alloc): 63964.
% 13.05/13.49 type (bytes each) gets frees in use avail bytes
% 13.05/13.49 sym_ent ( 96) 57 0 57 0 5.3 K
% 13.05/13.49 term ( 16) 4582769 3696795 885974 1 17195.4 K
% 13.05/13.49 gen_ptr ( 8) 4877015 589136 4287879 0 33499.1 K
% 13.05/13.49 context ( 808) 4575824 4575822 2 7 7.1 K
% 13.05/13.49 trail ( 12) 473270 473270 0 7 0.1 K
% 13.05/13.49 bt_node ( 68) 2048139 2048136 3 24 1.8 K
% 13.05/13.49 ac_position (285432) 0 0 0 0 0.0 K
% 13.05/13.49 ac_match_pos (14044) 0 0 0 0 0.0 K
% 13.05/13.49 ac_match_free_vars_pos (4020)
% 13.05/13.49 0 0 0 0 0.0 K
% 13.05/13.49 discrim ( 12) 702693 30895 671798 0 7872.6 K
% 13.05/13.49 flat ( 40) 11107159 11107159 0 185 7.2 K
% 13.05/13.49 discrim_pos ( 12) 203966 203966 0 1 0.0 K
% 13.05/13.49 fpa_head ( 12) 50385 0 50385 0 590.4 K
% 13.05/13.49 fpa_tree ( 28) 111483 111483 0 83 2.3 K
% 13.05/13.49 fpa_pos ( 36) 47116 47116 0 1 0.0 K
% 13.05/13.49 literal ( 12) 159819 1
% 13.05/13.50
% 13.05/13.50 ********** ABNORMAL END **********
% 13.05/13.50 ********** in tp_alloc, max_mem parameter exceeded.
% 13.05/13.50 31972 27847 1 326.3 K
% 13.05/13.50 clause ( 24) 159819 131972 27847 1 652.7 K
% 13.05/13.50 list ( 12) 19328 19272 56 3 0.7 K
% 13.05/13.50 list_pos ( 20) 106119 7101 99018 0 1933.9 K
% 13.05/13.50 pair_index ( 40) 2 0 2 0 0.1 K
% 13.05/13.50
% 13.05/13.50 -------------- statistics -------------
% 13.05/13.50 Clauses input 19
% 13.05/13.50 Usable input 0
% 13.05/13.50 Sos input 19
% 13.05/13.50 Demodulators input 0
% 13.05/13.50 Passive input 0
% 13.05/13.50
% 13.05/13.50 Processed BS (before search) 21
% 13.05/13.50 Forward subsumed BS 2
% 13.05/13.50 Kept BS 19
% 13.05/13.50 New demodulators BS 16
% 13.05/13.50 Back demodulated BS 0
% 13.05/13.50
% 13.05/13.50 Clauses or pairs given 393580
% 13.05/13.50 Clauses generated 109612
% 13.05/13.50 Forward subsumed 81784
% 13.05/13.50 Deleted by weight 0
% 13.05/13.50 Deleted by variable count 0
% 13.05/13.50 Kept 27828
% 13.05/13.50 New demodulators 19253
% 13.05/13.50 Back demodulated 1643
% 13.05/13.50 Ordered paramod prunes 0
% 13.05/13.50 Basic paramod prunes 2403237
% 13.05/13.50 Prime paramod prunes 9591
% 13.05/13.50 Semantic prunes 0
% 13.05/13.50
% 13.05/13.50 Rewrite attmepts 1605945
% 13.05/13.50 Rewrites 177174
% 13.05/13.50
% 13.05/13.50 FPA overloads 0
% 13.05/13.50 FPA underloads 0
% 13.05/13.50
% 13.05/13.50 Usable size 0
% 13.05/13.50 Sos size 26204
% 13.05/13.50 Demodulators size 18763
% 13.05/13.50 Passive size 0
% 13.05/13.50 Disabled size 1643
% 13.05/13.50
% 13.05/13.50 Proofs found 0
% 13.05/13.50
% 13.05/13.50 ----------- times (seconds) ----------- Mon Jun 13 18:53:06 2022
% 13.05/13.50
% 13.05/13.50 user CPU time 10.34 (0 hr, 0 min, 10 sec)
% 13.05/13.50 system CPU time 2.06 (0 hr, 0 min, 2 sec)
% 13.05/13.50 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 13.05/13.50 input time 0.00
% 13.05/13.50 paramodulation time 0.86
% 13.05/13.50 demodulation time 0.51
% 13.05/13.50 orient time 0.21
% 13.05/13.50 weigh time 0.06
% 13.05/13.50 forward subsume time 0.14
% 13.05/13.50 back demod find time 1.12
% 13.05/13.50 conflict time 0.03
% 13.05/13.50 LRPO time 0.10
% 13.05/13.50 store clause time 6.22
% 13.05/13.50 disable clause time 0.35
% 13.05/13.50 prime paramod time 0.18
% 13.05/13.50 semantics time 0.00
% 13.05/13.50
% 13.05/13.50 EQP interrupted
%------------------------------------------------------------------------------