TSTP Solution File: GRP167-5 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP167-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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 4.08s 4.42s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP167-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 14:09:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.06 ----- EQP 0.9e, May 2009 -----
% 0.43/1.06 The job began on n027.cluster.edu, Tue Jun 14 14:09:04 2022
% 0.43/1.06 The command was "./eqp09e".
% 0.43/1.06
% 0.43/1.06 set(prolog_style_variables).
% 0.43/1.06 set(lrpo).
% 0.43/1.06 set(basic_paramod).
% 0.43/1.06 set(functional_subsume).
% 0.43/1.06 set(ordered_paramod).
% 0.43/1.06 set(prime_paramod).
% 0.43/1.06 set(para_pairs).
% 0.43/1.06 assign(pick_given_ratio,4).
% 0.43/1.06 clear(print_kept).
% 0.43/1.06 clear(print_new_demod).
% 0.43/1.06 clear(print_back_demod).
% 0.43/1.06 clear(print_given).
% 0.43/1.06 assign(max_mem,64000).
% 0.43/1.06 end_of_commands.
% 0.43/1.06
% 0.43/1.06 Usable:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Sos:
% 0.43/1.06 0 (wt=-1) [] multiply(identity,A) = A.
% 0.43/1.06 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.43/1.06 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.06 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 0 (wt=-1) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 0.43/1.06 0 (wt=-1) [] positive_part(A) = least_upper_bound(A,identity).
% 0.43/1.06 0 (wt=-1) [] negative_part(A) = greatest_lower_bound(A,identity).
% 0.43/1.06 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 0.43/1.06 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(B,C)) = least_upper_bound(greatest_lower_bound(A,B),greatest_lower_bound(A,C)).
% 0.43/1.06 0 (wt=-1) [] -(a = multiply(positive_part(a),negative_part(a))).
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Demodulators:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Passive:
% 0.43/1.06 end_of_list.
% 0.43/1.06
% 0.43/1.06 Starting to process input.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.43/1.06 1 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.43/1.06 2 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.43/1.06 3 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.43/1.06 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.43/1.06
% 0.43/1.06 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.43/1.06 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.43/1.06
% 0.43/1.06 ** 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.43/1.06 6 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** 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.43/1.06 7 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.43/1.06 8 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.43/1.06 9 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.43/1.06 10 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.43/1.06 11 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 12 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.43/1.06 13 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 14 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.43/1.06 15 is a new demodulator.
% 0.43/1.06
% 0.43/1.06 ** KEPT: 16 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 4.01/4.42 16 is a new demodulator.
% 4.01/4.42
% 4.01/4.42 ** KEPT: 17 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 4.01/4.42 17 is a new demodulator.
% 4.01/4.42
% 4.01/4.42 ** KEPT: 18 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 4.01/4.42 18 is a new demodulator.
% 4.01/4.42
% 4.01/4.42 ** KEPT: 19 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 4.01/4.42 19 is a new demodulator.
% 4.01/4.42 -> 19 back demodulating 10.
% 4.01/4.42 clause forward subsumed: 0 (wt=3) [back_demod(10),demod([19,8,11])] A = A.
% 4.01/4.42
% 4.01/4.42 ** KEPT: 20 (wt=17) [demod([19]),flip(1)] greatest_lower_bound(least_upper_bound(greatest_lower_bound(A,B),A),least_upper_bound(greatest_lower_bound(A,B),C)) = greatest_lower_bound(A,least_upper_bound(B,C)).
% 4.01/4.42 20 is a new demodulator.
% 4.01/4.42
% 4.01/4.42 ** KEPT: 21 (wt=13) [demod([17,18,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).
% 4.01/4.42
% 4.01/4.42 After processing input:
% 4.01/4.42
% 4.01/4.42 Usable:
% 4.01/4.42 end_of_list.
% 4.01/4.42
% 4.01/4.42 Sos:
% 4.01/4.42 1 (wt=5) [] multiply(identity,A) = A.
% 4.01/4.42 8 (wt=5) [] least_upper_bound(A,A) = A.
% 4.01/4.42 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 4.01/4.42 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 4.01/4.42 17 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 4.01/4.42 18 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 4.01/4.42 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 4.01/4.42 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 4.01/4.42 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 4.01/4.42 16 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 4.01/4.42 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.01/4.42 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 4.01/4.42 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 4.01/4.42 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 4.01/4.42 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 4.01/4.42 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 4.01/4.42 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 4.01/4.42 19 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 4.01/4.42 21 (wt=13) [demod([17,18,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).
% 4.01/4.42 20 (wt=17) [demod([19]),flip(1)] greatest_lower_bound(least_upper_bound(greatest_lower_bound(A,B),A),least_upper_bound(greatest_lower_bound(A,B),C)) = greatest_lower_bound(A,least_upper_bound(B,C)).
% 4.01/4.42 end_of_list.
% 4.01/4.42
% 4.01/4.42 Demodulators:
% 4.01/4.42 1 (wt=5) [] multiply(identity,A) = A.
% 4.01/4.42 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 4.01/4.42 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.01/4.42 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 4.01/4.42 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 4.01/4.42 8 (wt=5) [] least_upper_bound(A,A) = A.
% 4.01/4.42 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 4.01/4.42 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 4.01/4.42 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 4.01/4.42 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 4.01/4.42 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 4.01/4.42 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 4.01/4.42 16 (wt=10) [] inverse(least_upper_bound(A,B)) = greatest_lower_bound(inverse(A),inverse(B)).
% 4.01/4.42 17 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 4.01/4.42 18 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 4.01/4.42 19 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 4.01/4.42 20 (wt=17) [demod([19]),flip(1)] greatest_lower_bound(least_upper_bound(greatest_lower_bound(A,B),A),least_upper_bound(greatest_lower_bound(A,B),C)) = greatest_lower_bound(A,least_upper_bound(B,C)).
% 4.01/4.42 end_of_list.
% 4.01/4.42
% 4.01/4.42 Passive:
% 4.01/4.42 end_of_list.
% 4.01/4.42
% 4.01/4.42 ------------- memory usage ------------
% 4.01/4.42 Memory dynamically allocated (tp_alloc): 31250.
% 4.01/4.42 type (bytes each) gets frees in use avail bytes
% 4.01/4.42 sym_ent ( 96) 61 0 61 0 5.7 K
% 4.01/4.42 term ( 16) 20016490 19624949 391541 32762 8246.9 K
% 4.01/4.42 gen_ptr ( 8) 2526911 399278 2127633 0 16622.1 K
% 4.01/4.42 context ( 808) 2275124 2274873 251 0 198.1 K
% 4.01/4.42 trail ( 12) 301069 301069 0 6 0.1 K
% 4.01/4.42 bt_node ( 68) 992114 992111 3 38 2.7 K
% 4.01/4.42 ac_position (285432) 0 0 0 0 0.0 K
% 4.01/4.42
% 4.01/4.42 ********** ABNORMAL END **********
% 4.01/4.42 ********** next_available_multiplier, none.
% 4.01/4.42
% 4.01/4.42 ac_match_pos (14044) 0 0 0 0 0.0 K
% 4.01/4.42 ac_match_free_vars_pos (4020)
% 4.01/4.42 0 0 0 0 0.0 K
% 4.01/4.42 discrim ( 12) 387166 65145 322021 0 3773.7 K
% 4.01/4.42 flat ( 40) 6811961 6811961 0 2774 108.4 K
% 4.01/4.42 discrim_pos ( 12) 172235 172235 0 1 0.0 K
% 4.01/4.42 fpa_head ( 12) 16860 0 16860 0 197.6 K
% 4.01/4.42 fpa_tree ( 28) 72001 72001 0 103 2.8 K
% 4.01/4.42 fpa_pos ( 36) 17632 17632 0 1 0.0 K
% 4.01/4.42 literal ( 12) 68466 58159 10307 0 120.8 K
% 4.01/4.42 clause ( 24) 68466 58159 10307 0 241.6 K
% 4.01/4.42 list ( 12) 7385 7329 56 3 0.7 K
% 4.01/4.42 list_pos ( 20) 42299 9111 33188 0 648.2 K
% 4.01/4.42 pair_index ( 40) 2 0 2 0 0.1 K
% 4.01/4.42
% 4.01/4.42 -------------- statistics -------------
% 4.01/4.42 Clauses input 21
% 4.01/4.42 Usable input 0
% 4.01/4.42 Sos input 21
% 4.01/4.42 Demodulators input 0
% 4.01/4.42 Passive input 0
% 4.01/4.42
% 4.01/4.42 Processed BS (before search) 24
% 4.01/4.42 Forward subsumed BS 3
% 4.01/4.42 Kept BS 21
% 4.01/4.42 New demodulators BS 18
% 4.01/4.42 Back demodulated BS 1
% 4.01/4.42
% 4.01/4.42 Clauses or pairs given 152260
% 4.01/4.42 Clauses generated 47362
% 4.01/4.42 Forward subsumed 37076
% 4.01/4.42 Deleted by weight 0
% 4.01/4.42 Deleted by variable count 0
% 4.01/4.42 Kept 10285
% 4.01/4.42 New demodulators 7308
% 4.01/4.42 Back demodulated 2013
% 4.01/4.42 Ordered paramod prunes 0
% 4.01/4.42 Basic paramod prunes 745444
% 4.01/4.42 Prime paramod prunes 5927
% 4.01/4.42 Semantic prunes 0
% 4.01/4.42
% 4.01/4.42 Rewrite attmepts 895484
% 4.01/4.42 Rewrites 158217
% 4.01/4.42
% 4.01/4.42 FPA overloads 0
% 4.01/4.42 FPA underloads 0
% 4.01/4.42
% 4.01/4.42 Usable size 0
% 4.01/4.42 Sos size 8292
% 4.01/4.42 Demodulators size 6298
% 4.01/4.42 Passive size 0
% 4.01/4.42 Disabled size 2014
% 4.01/4.42
% 4.01/4.42 Proofs found 0
% 4.01/4.42
% 4.01/4.42 ----------- times (seconds) ----------- Tue Jun 14 14:09:07 2022
% 4.01/4.42
% 4.01/4.42 user CPU time 2.52 (0 hr, 0 min, 2 sec)
% 4.01/4.42 system CPU time 0.84 (0 hr, 0 min, 0 sec)
% 4.01/4.42 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 4.01/4.42 input time 0.00
% 4.01/4.42 paramodulation time 0.30
% 4.01/4.42 demodulation time 0.94
% 4.01/4.42 orient time 0.09
% 4.01/4.42 weigh time 0.02
% 4.01/4.42 forward subsume time 0.04
% 4.01/4.42 back demod find time 0.19
% 4.01/4.42 conflict time 0.01
% 4.01/4.42 LRPO time 0.04
% 4.01/4.42 store clause time 0.58
% 4.01/4.42 disable clause time 0.08
% 4.01/4.42 prime paramod time 0.07
% 4.01/4.42 semantics time 0.00
% 4.01/4.42
% 4.01/4.42 EQP interrupted
%------------------------------------------------------------------------------