TSTP Solution File: GRP167-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP167-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:37 EDT 2022
% Result : Unknown 7.36s 7.76s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP167-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 09:54:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.14 ----- EQP 0.9e, May 2009 -----
% 0.75/1.14 The job began on n009.cluster.edu, Mon Jun 13 09:54:08 2022
% 0.75/1.14 The command was "./eqp09e".
% 0.75/1.14
% 0.75/1.14 set(prolog_style_variables).
% 0.75/1.14 set(lrpo).
% 0.75/1.14 set(basic_paramod).
% 0.75/1.14 set(functional_subsume).
% 0.75/1.14 set(ordered_paramod).
% 0.75/1.14 set(prime_paramod).
% 0.75/1.14 set(para_pairs).
% 0.75/1.14 assign(pick_given_ratio,4).
% 0.75/1.14 clear(print_kept).
% 0.75/1.14 clear(print_new_demod).
% 0.75/1.14 clear(print_back_demod).
% 0.75/1.14 clear(print_given).
% 0.75/1.14 assign(max_mem,64000).
% 0.75/1.14 end_of_commands.
% 0.75/1.14
% 0.75/1.14 Usable:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Sos:
% 0.75/1.14 0 (wt=-1) [] multiply(identity,A) = A.
% 0.75/1.14 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.75/1.14 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.75/1.14 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.75/1.14 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.75/1.14 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.75/1.14 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.75/1.14 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.75/1.14 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.75/1.14 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.75/1.14 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.75/1.14 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.14 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.14 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.14 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.14 0 (wt=-1) [] positive_part(A) = least_upper_bound(A,identity).
% 0.75/1.14 0 (wt=-1) [] negative_part(A) = greatest_lower_bound(A,identity).
% 0.75/1.14 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.75/1.14 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.75/1.14 0 (wt=-1) [] -(a = multiply(positive_part(a),negative_part(a))).
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Demodulators:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Passive:
% 0.75/1.14 end_of_list.
% 0.75/1.14
% 0.75/1.14 Starting to process input.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.75/1.14 1 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.75/1.14 2 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.75/1.14 3 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.75/1.14 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.75/1.14
% 0.75/1.14 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.75/1.14 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.75/1.14
% 0.75/1.14 ** 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.75/1.14 6 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** 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.75/1.14 7 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.75/1.14 8 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.75/1.14 9 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.75/1.14 10 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.75/1.14 11 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.14 12 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.75/1.14 13 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.14 14 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.75/1.14 15 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 16 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 0.75/1.14 16 is a new demodulator.
% 0.75/1.14
% 0.75/1.14 ** KEPT: 17 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 0.75/1.14 17 is a new demodulator.
% 7.36/7.75
% 7.36/7.75 ** KEPT: 18 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 7.36/7.75 18 is a new demodulator.
% 7.36/7.75 -> 18 back demodulating 10.
% 7.36/7.75 clause forward subsumed: 0 (wt=3) [back_demod(10),demod([18,8,11])] A = A.
% 7.36/7.75
% 7.36/7.75 ** KEPT: 19 (wt=17) [demod([18]),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)).
% 7.36/7.75 19 is a new demodulator.
% 7.36/7.75
% 7.36/7.75 ** KEPT: 20 (wt=13) [demod([16,17,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).
% 7.36/7.75
% 7.36/7.75 After processing input:
% 7.36/7.75
% 7.36/7.75 Usable:
% 7.36/7.75 end_of_list.
% 7.36/7.75
% 7.36/7.75 Sos:
% 7.36/7.75 1 (wt=5) [] multiply(identity,A) = A.
% 7.36/7.75 8 (wt=5) [] least_upper_bound(A,A) = A.
% 7.36/7.75 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 7.36/7.75 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 7.36/7.75 16 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 7.36/7.75 17 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 7.36/7.75 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 7.36/7.75 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 7.36/7.75 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 7.36/7.75 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 7.36/7.75 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 7.36/7.75 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 7.36/7.75 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 7.36/7.75 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 7.36/7.75 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 7.36/7.75 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 7.36/7.75 18 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 7.36/7.75 20 (wt=13) [demod([16,17,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).
% 7.36/7.75 19 (wt=17) [demod([18]),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)).
% 7.36/7.75 end_of_list.
% 7.36/7.75
% 7.36/7.75 Demodulators:
% 7.36/7.75 1 (wt=5) [] multiply(identity,A) = A.
% 7.36/7.75 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 7.36/7.75 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 7.36/7.75 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 7.36/7.75 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 7.36/7.75 8 (wt=5) [] least_upper_bound(A,A) = A.
% 7.36/7.75 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 7.36/7.75 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 7.36/7.75 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 7.36/7.75 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 7.36/7.75 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 7.36/7.75 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 7.36/7.75 16 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 7.36/7.75 17 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 7.36/7.75 18 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 7.36/7.75 19 (wt=17) [demod([18]),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)).
% 7.36/7.75 end_of_list.
% 7.36/7.75
% 7.36/7.75 Passive:
% 7.36/7.75 end_of_list.
% 7.36/7.75
% 7.36/7.75 ------------- memory usage ------------
% 7.36/7.75 Memory dynamically allocated (tp_alloc): 63964.
% 7.36/7.75 type (bytes each) gets frees in use avail bytes
% 7.36/7.75 sym_ent ( 96) 59 0 59 0 5.5 K
% 7.36/7.76 term ( 16) 6214518 5444991 769527 32 14960.8 K
% 7.36/7.76 gen_ptr ( 8) 5147915 559205 4588710 0 35849.3 K
% 7.36/7.76 context ( 808) 3889465 3889463 2 9 8.7 K
% 7.36/7.76 trail ( 12) 1731962 1731962 0 7 0.1 K
% 7.36/7.76 bt_node ( 68) 1327432 1327427 5 86 6.0 K
% 7.36/7.76 ac_position (285432) 0 0 0 0 0.0 K
% 7.36/7.76 ac_match_pos (14044) 0 0 0 0 0.0 K
% 7.36/7.76 ac_match_free_vars_pos (4020)
% 7.36/7.76 0 0 0 0 0.0 K
% 7.36/7.76 dis
% 7.36/7.76
% 7.36/7.76 ********** ABNORMAL END **********
% 7.36/7.76 ********** in tp_alloc, max_mem parameter exceeded.
% 7.36/7.76 crim ( 12) 782121 31580 750541 0 8795.4 K
% 7.36/7.76 flat ( 40) 13463126 13463126 0 367 14.3 K
% 7.36/7.76 discrim_pos ( 12) 298749 298749 0 1 0.0 K
% 7.36/7.76 fpa_head ( 12) 25599 0 25599 0 300.0 K
% 7.36/7.76 fpa_tree ( 28) 182515 182515 0 149 4.1 K
% 7.36/7.76 fpa_pos ( 36) 31397 31397 0 1 0.0 K
% 7.36/7.76 literal ( 12) 106573 88746 17827 1 208.9 K
% 7.36/7.76 clause ( 24) 106573 88746 17827 1 417.8 K
% 7.36/7.76 list ( 12) 13629 13573 56 3 0.7 K
% 7.36/7.76 list_pos ( 20) 70565 7765 62800 0 1226.6 K
% 7.36/7.76 pair_index ( 40) 2 0 2 0 0.1 K
% 7.36/7.76
% 7.36/7.76 -------------- statistics -------------
% 7.36/7.76 Clauses input 20
% 7.36/7.76 Usable input 0
% 7.36/7.76 Sos input 20
% 7.36/7.76 Demodulators input 0
% 7.36/7.76 Passive input 0
% 7.36/7.76
% 7.36/7.76 Processed BS (before search) 23
% 7.36/7.76 Forward subsumed BS 3
% 7.36/7.76 Kept BS 20
% 7.36/7.76 New demodulators BS 17
% 7.36/7.76 Back demodulated BS 1
% 7.36/7.76
% 7.36/7.76 Clauses or pairs given 201050
% 7.36/7.76 Clauses generated 73990
% 7.36/7.76 Forward subsumed 56183
% 7.36/7.76 Deleted by weight 0
% 7.36/7.76 Deleted by variable count 0
% 7.36/7.76 Kept 17807
% 7.36/7.76 New demodulators 13553
% 7.36/7.76 Back demodulated 1744
% 7.36/7.76 Ordered paramod prunes 0
% 7.36/7.76 Basic paramod prunes 1145037
% 7.36/7.76 Prime paramod prunes 7039
% 7.36/7.76 Semantic prunes 0
% 7.36/7.76
% 7.36/7.76 Rewrite attmepts 1917587
% 7.36/7.76 Rewrites 280651
% 7.36/7.76
% 7.36/7.76 FPA overloads 0
% 7.36/7.76 FPA underloads 0
% 7.36/7.76
% 7.36/7.76 Usable size 0
% 7.36/7.76 Sos size 16082
% 7.36/7.76 Demodulators size 12809
% 7.36/7.76 Passive size 0
% 7.36/7.76 Disabled size 1745
% 7.36/7.76
% 7.36/7.76 Proofs found 0
% 7.36/7.76
% 7.36/7.76 ----------- times (seconds) ----------- Mon Jun 13 09:54:15 2022
% 7.36/7.76
% 7.36/7.76 user CPU time 5.33 (0 hr, 0 min, 5 sec)
% 7.36/7.76 system CPU time 1.29 (0 hr, 0 min, 1 sec)
% 7.36/7.76 wall-clock time 7 (0 hr, 0 min, 7 sec)
% 7.36/7.76 input time 0.00
% 7.36/7.76 paramodulation time 0.49
% 7.36/7.76 demodulation time 0.63
% 7.36/7.76 orient time 0.12
% 7.36/7.76 weigh time 0.04
% 7.36/7.76 forward subsume time 0.10
% 7.36/7.76 back demod find time 0.81
% 7.36/7.76 conflict time 0.01
% 7.36/7.76 LRPO time 0.05
% 7.36/7.76 store clause time 2.52
% 7.36/7.76 disable clause time 0.14
% 7.36/7.76 prime paramod time 0.13
% 7.36/7.76 semantics time 0.00
% 7.36/7.76
% 7.36/7.76 EQP interrupted
%------------------------------------------------------------------------------