TSTP Solution File: GRP167-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP167-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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 9.85s 10.20s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP167-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 04:04:12 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.78/1.15 ----- EQP 0.9e, May 2009 -----
% 0.78/1.15 The job began on n018.cluster.edu, Mon Jun 13 04:04:13 2022
% 0.78/1.15 The command was "./eqp09e".
% 0.78/1.15
% 0.78/1.15 set(prolog_style_variables).
% 0.78/1.15 set(lrpo).
% 0.78/1.15 set(basic_paramod).
% 0.78/1.15 set(functional_subsume).
% 0.78/1.15 set(ordered_paramod).
% 0.78/1.15 set(prime_paramod).
% 0.78/1.15 set(para_pairs).
% 0.78/1.15 assign(pick_given_ratio,4).
% 0.78/1.15 clear(print_kept).
% 0.78/1.15 clear(print_new_demod).
% 0.78/1.15 clear(print_back_demod).
% 0.78/1.15 clear(print_given).
% 0.78/1.15 assign(max_mem,64000).
% 0.78/1.15 end_of_commands.
% 0.78/1.15
% 0.78/1.15 Usable:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Sos:
% 0.78/1.15 0 (wt=-1) [] multiply(identity,A) = A.
% 0.78/1.15 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.78/1.15 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.78/1.15 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.78/1.15 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.78/1.15 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.78/1.15 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.78/1.15 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.78/1.15 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.78/1.15 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.78/1.15 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.78/1.15 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.78/1.15 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.78/1.15 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.78/1.15 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.78/1.15 0 (wt=-1) [] inverse(identity) = identity.
% 0.78/1.15 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.78/1.15 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.78/1.15 0 (wt=-1) [] positive_part(A) = least_upper_bound(A,identity).
% 0.78/1.15 0 (wt=-1) [] negative_part(A) = greatest_lower_bound(A,identity).
% 0.78/1.15 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.78/1.15 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.78/1.15 0 (wt=-1) [] -(a = multiply(positive_part(a),negative_part(a))).
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Demodulators:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Passive:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Starting to process input.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.78/1.15 1 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.78/1.15 2 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.78/1.15 3 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.78/1.15 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.78/1.15
% 0.78/1.15 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.78/1.15 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.78/1.15
% 0.78/1.15 ** 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.78/1.15 6 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** 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.78/1.15 7 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.78/1.15 8 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.78/1.15 9 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.78/1.15 10 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.78/1.15 11 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.78/1.15 12 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.78/1.15 13 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.78/1.15 14 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.78/1.15 15 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 9.77/10.19 16 is a new demodulator.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 9.77/10.19 17 is a new demodulator.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 9.77/10.19 18 is a new demodulator.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 19 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 9.77/10.19 19 is a new demodulator.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 20 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 9.77/10.19 20 is a new demodulator.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 21 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 9.77/10.19 21 is a new demodulator.
% 9.77/10.19 -> 21 back demodulating 10.
% 9.77/10.19 clause forward subsumed: 0 (wt=3) [back_demod(10),demod([21,8,11])] A = A.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 22 (wt=17) [demod([21]),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)).
% 9.77/10.19 22 is a new demodulator.
% 9.77/10.19
% 9.77/10.19 ** KEPT: 23 (wt=13) [demod([19,20,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).
% 9.77/10.19
% 9.77/10.19 After processing input:
% 9.77/10.19
% 9.77/10.19 Usable:
% 9.77/10.19 end_of_list.
% 9.77/10.19
% 9.77/10.19 Sos:
% 9.77/10.19 16 (wt=4) [] inverse(identity) = identity.
% 9.77/10.19 1 (wt=5) [] multiply(identity,A) = A.
% 9.77/10.19 8 (wt=5) [] least_upper_bound(A,A) = A.
% 9.77/10.19 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 9.77/10.19 17 (wt=5) [] inverse(inverse(A)) = A.
% 9.77/10.19 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 9.77/10.19 19 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 9.77/10.19 20 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 9.77/10.19 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 9.77/10.19 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 9.77/10.19 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 9.77/10.19 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 9.77/10.19 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 9.77/10.19 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 9.77/10.19 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 9.77/10.19 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 9.77/10.19 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 9.77/10.19 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 9.77/10.19 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 9.77/10.19 21 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 9.77/10.19 23 (wt=13) [demod([19,20,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).
% 9.77/10.19 22 (wt=17) [demod([21]),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)).
% 9.77/10.19 end_of_list.
% 9.77/10.19
% 9.77/10.19 Demodulators:
% 9.77/10.19 1 (wt=5) [] multiply(identity,A) = A.
% 9.77/10.19 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 9.77/10.19 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 9.77/10.19 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 9.77/10.19 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 9.77/10.19 8 (wt=5) [] least_upper_bound(A,A) = A.
% 9.77/10.19 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 9.77/10.19 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 9.77/10.19 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 9.77/10.19 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 9.77/10.19 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 9.77/10.19 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 9.77/10.19 16 (wt=4) [] inverse(identity) = identity.
% 9.77/10.19 17 (wt=5) [] inverse(inverse(A)) = A.
% 9.77/10.19 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 9.77/10.19 19 (wt=6) [] positive_part(A) = least_upper_bound(A,identity).
% 9.77/10.19 20 (wt=6) [] negative_part(A) = greatest_lower_bound(A,identity).
% 9.77/10.19 21 (wt=13) [] least_upper_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,C)).
% 9.77/10.19 22 (wt=17) [demod([21]),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)).
% 9.77/10.19 end_of_list.
% 9.77/10.19
% 9.77/10.19 Passive:
% 9.77/10.19 end_of_list.
% 9.77/10.19
% 9.77/10.19 ------------- memory usage ------------
% 9.77/10.19 Memory dynamically allocated (tp_alloc): 63964.
% 9.77/10.19 type (bytes each) gets frees in use avail bytes
% 9.77/10.19 sym_ent ( 96) 59 0 59 0 5.5 K
% 9.77/10.19 term ( 16) 3892121 3051173 840948 0 16342.3 K
% 9.77/10.19 gen_ptr ( 8) 4902671 401870 4500801 0 35162.5 K
% 9.77/10.19 context ( 808) 3251960 3251958 2 7 7.1 K
% 9.77/10.19 trail ( 12) 239898 239898 0 7 0.1 K
% 9.77/10.19 bt_node ( 68) 1214229
% 9.77/10.19
% 9.77/10.19 ********** ABNORMAL END **********
% 9.77/10.19 ********** in tp_alloc, max_mem parameter exceeded.
% 9.77/10.19 1214226 3 48 3.4 K
% 9.77/10.19 ac_position (285432) 0 0 0 0 0.0 K
% 9.77/10.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 9.77/10.19 ac_match_free_vars_pos (4020)
% 9.77/10.19 0 0 0 0 0.0 K
% 9.77/10.19 discrim ( 12) 729627 28045 701582 0 8221.7 K
% 9.77/10.19 flat ( 40) 10038441 10038441 0 215 8.4 K
% 9.77/10.19 discrim_pos ( 12) 180156 180156 0 1 0.0 K
% 9.77/10.19 fpa_head ( 12) 39568 0 39568 0 463.7 K
% 9.77/10.19 fpa_tree ( 28) 99814 99814 0 79 2.2 K
% 9.77/10.19 fpa_pos ( 36) 31833 31833 0 1 0.0 K
% 9.77/10.19 literal ( 12) 114764 93666 21098 0 247.2 K
% 9.77/10.19 clause ( 24) 114764 93666 21098 0 494.5 K
% 9.77/10.19 list ( 12) 10795 10738 57 2 0.7 K
% 9.77/10.19 list_pos ( 20) 77623 7776 69847 13 1364.5 K
% 9.77/10.19 pair_index ( 40) 2 0 2 0 0.1 K
% 9.77/10.19
% 9.77/10.19 -------------- statistics -------------
% 9.77/10.19 Clauses input 23
% 9.77/10.19 Usable input 0
% 9.77/10.19 Sos input 23
% 9.77/10.19 Demodulators input 0
% 9.77/10.19 Passive input 0
% 9.77/10.19
% 9.77/10.19 Processed BS (before search) 26
% 9.77/10.19 Forward subsumed BS 3
% 9.77/10.19 Kept BS 23
% 9.77/10.19 New demodulators BS 20
% 9.77/10.19 Back demodulated BS 1
% 9.77/10.19
% 9.77/10.19 Clauses or pairs given 212512
% 9.77/10.19 Clauses generated 71239
% 9.77/10.19 Forward subsumed 50165
% 9.77/10.19 Deleted by weight 0
% 9.77/10.19 Deleted by variable count 0
% 9.77/10.19 Kept 21074
% 9.77/10.19 New demodulators 10716
% 9.77/10.19 Back demodulated 1760
% 9.77/10.19 Ordered paramod prunes 0
% 9.77/10.19 Basic paramod prunes 1153745
% 9.77/10.19 Prime paramod prunes 5953
% 9.77/10.19 Semantic prunes 0
% 9.77/10.19
% 9.77/10.19 Rewrite attmepts 1413530
% 9.77/10.19 Rewrites 158871
% 9.77/10.19
% 9.77/10.19 FPA overloads 0
% 9.77/10.19 FPA underloads 0
% 9.77/10.19
% 9.77/10.19 Usable size 0
% 9.77/10.19 Sos size 19337
% 9.77/10.19 Demodulators size 10033
% 9.77/10.19 Passive size 0
% 9.77/10.19 Disabled size 1760
% 9.77/10.19
% 9.77/10.19 Proofs found 0
% 9.77/10.19
% 9.77/10.19 ----------- times (seconds) ----------- Mon Jun 13 04:04:22 2022
% 9.77/10.19
% 9.77/10.19 user CPU time 7.78 (0 hr, 0 min, 7 sec)
% 9.77/10.19 system CPU time 1.26 (0 hr, 0 min, 1 sec)
% 9.77/10.19 wall-clock time 9 (0 hr, 0 min, 9 sec)
% 9.77/10.19 input time 0.00
% 9.77/10.19 paramodulation time 0.45
% 9.77/10.19 demodulation time 0.54
% 9.77/10.19 orient time 0.15
% 9.77/10.19 weigh time 0.04
% 9.77/10.19 forward subsume time 0.20
% 9.77/10.19 back demod find time 1.07
% 9.77/10.19 conflict time 0.02
% 9.77/10.19 LRPO time 0.08
% 9.77/10.19 store clause time 4.50
% 9.77/10.19 disable clause time 0.30
% 9.77/10.19 prime paramod time 0.09
% 9.77/10.19 semantics time 0.00
% 9.77/10.19
% 9.77/10.19 EQP interrupted
%------------------------------------------------------------------------------