TSTP Solution File: GRP164-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP164-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:36 EDT 2022
% Result : Unknown 12.53s 12.92s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP164-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.10 % Command : tptp2X_and_run_eqp %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon Jun 13 16:47:42 EDT 2022
% 0.10/0.29 % CPUTime :
% 12.53/12.91 ----- EQP 0.9e, May 2009 -----
% 12.53/12.91 The job began on n032.cluster.edu, Mon Jun 13 16:47:42 2022
% 12.53/12.91 The command was "./eqp09e".
% 12.53/12.91
% 12.53/12.91 set(prolog_style_variables).
% 12.53/12.91 set(lrpo).
% 12.53/12.91 set(basic_paramod).
% 12.53/12.91 set(functional_subsume).
% 12.53/12.91 set(ordered_paramod).
% 12.53/12.91 set(prime_paramod).
% 12.53/12.91 set(para_pairs).
% 12.53/12.91 assign(pick_given_ratio,4).
% 12.53/12.91 clear(print_kept).
% 12.53/12.91 clear(print_new_demod).
% 12.53/12.91 clear(print_back_demod).
% 12.53/12.91 clear(print_given).
% 12.53/12.91 assign(max_mem,64000).
% 12.53/12.91 end_of_commands.
% 12.53/12.91
% 12.53/12.91 Usable:
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Sos:
% 12.53/12.91 0 (wt=-1) [] multiply(identity,A) = A.
% 12.53/12.91 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 12.53/12.91 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.53/12.91 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.53/12.91 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.53/12.91 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 12.53/12.91 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 12.53/12.91 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 12.53/12.91 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 12.53/12.91 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.53/12.91 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.53/12.91 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 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))).
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Demodulators:
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Passive:
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Starting to process input.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 12.53/12.91 1 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.53/12.91 2 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.53/12.91 3 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.53/12.91 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 12.53/12.91
% 12.53/12.91 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.53/12.91 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 12.53/12.91
% 12.53/12.91 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.53/12.91 6 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.53/12.91 7 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.53/12.91 8 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.53/12.91 9 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.53/12.91 10 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.53/12.91 11 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 12 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 13 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 14 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 15 is a new demodulator.
% 12.53/12.91
% 12.53/12.91 ** KEPT: 16 (wt=13) [] -(least_upper_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,c))).
% 12.53/12.91
% 12.53/12.91 After processing input:
% 12.53/12.91
% 12.53/12.91 Usable:
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Sos:
% 12.53/12.91 1 (wt=5) [] multiply(identity,A) = A.
% 12.53/12.91 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.53/12.91 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.53/12.91 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.53/12.91 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.53/12.91 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.53/12.91 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.53/12.91 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.53/12.91 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.53/12.91 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.53/12.91 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.53/12.91 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 16 (wt=13) [] -(least_upper_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,c))).
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Demodulators:
% 12.53/12.91 1 (wt=5) [] multiply(identity,A) = A.
% 12.53/12.91 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.53/12.91 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.53/12.91 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.53/12.91 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.53/12.91 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.53/12.91 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.53/12.91 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.53/12.91 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.53/12.91 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.53/12.91 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 Passive:
% 12.53/12.91 end_of_list.
% 12.53/12.91
% 12.53/12.91 ------------- memory usage ------------
% 12.53/12.91 Memory dynamically allocated (tp_alloc): 63964.
% 12.53/12.91 type (bytes each) gets frees in use avail bytes
% 12.53/12.91 sym_ent ( 96) 59 0 59 0 5.5 K
% 12.53/12.91 term ( 16) 5527175 4674024 853151 0 16556.6 K
% 12.53/12.91 gen_ptr ( 8) 4897410 655229 4242181 0 33142.0 K
% 12.53/12.91 context ( 808) 4677169 4677166 3 6 7.1 K
% 12.53/12.91 trail ( 12) 690735 690735 0 7 0.1 K
% 12.53/12.91 bt_node ( 68) 2030242 2030239 3 29 2.1 K
% 12.53/12.91 ac_position (285432) 0 0 0 0 0.0 K
% 12.53/12.91 ac_match_pos (14044) 0 0 0 0 0.0 K
% 12.53/12.91 ac_match_free_vars_pos (4020)
% 12.53/12.91 0 0 0 0 0.0 K
% 12.53/12.91 discrim ( 12) 747363 19839 727524 0 8525.7 K
% 12.53/12.91 flat ( 40) 12044125 12044109 16 212 8.9 K
% 12.53/12.91 discrim_pos ( 12) 247318 247317 1 0 0.0 K
% 12.53/12.91 fpa_head ( 12) 48128 0 48128 0 564.0 K
% 12.53/12.91 fpa_tree ( 28) 152924 152924 0 83 2.3 K
% 12.53/12.91 fpa_pos ( 36) 49580 49580 0 1 0.0 K
% 12.53/12.91 literal ( 12) 165923 138666 27257 0 319.4 K
% 12.53/12.91 clause ( 24) 165923 138666 27257 0 638.8 K
% 12.53/12.91 list ( 12) 22383 22327 56 3 0.7 K
% 12.53/12.91 list_pos ( 20) 106618 5433 101185 0 1976.3 K
% 12.53/12.91 pair_index ( 40) 2 0 2
% 12.53/12.91
% 12.53/12.91 ********** ABNORMAL END **********
% 12.53/12.91 ********** in tp_alloc, max_mem parameter exceeded.
% 12.53/12.91 0 0.1 K
% 12.53/12.91
% 12.53/12.91 -------------- statistics -------------
% 12.53/12.91 Clauses input 16
% 12.53/12.91 Usable input 0
% 12.53/12.91 Sos input 16
% 12.53/12.91 Demodulators input 0
% 12.53/12.91 Passive input 0
% 12.53/12.91
% 12.53/12.91 Processed BS (before search) 18
% 12.53/12.91 Forward subsumed BS 2
% 12.53/12.92 Kept BS 16
% 12.53/12.92 New demodulators BS 13
% 12.53/12.92 Back demodulated BS 0
% 12.53/12.92
% 12.53/12.92 Clauses or pairs given 381475
% 12.53/12.92 Clauses generated 116735
% 12.53/12.92 Forward subsumed 89494
% 12.53/12.92 Deleted by weight 0
% 12.53/12.92 Deleted by variable count 0
% 12.53/12.92 Kept 27240
% 12.53/12.92 New demodulators 22311
% 12.53/12.92 Back demodulated 1253
% 12.53/12.92 Ordered paramod prunes 0
% 12.53/12.92 Basic paramod prunes 2302212
% 12.53/12.92 Prime paramod prunes 9833
% 12.53/12.92 Semantic prunes 0
% 12.53/12.92
% 12.53/12.92 Rewrite attmepts 1765696
% 12.53/12.92 Rewrites 221804
% 12.53/12.92
% 12.53/12.92 FPA overloads 0
% 12.53/12.92 FPA underloads 0
% 12.53/12.92
% 12.53/12.92 Usable size 0
% 12.53/12.92 Sos size 26003
% 12.53/12.92 Demodulators size 21923
% 12.53/12.92 Passive size 0
% 12.53/12.92 Disabled size 1253
% 12.53/12.92
% 12.53/12.92 Proofs found 0
% 12.53/12.92
% 12.53/12.92 ----------- times (seconds) ----------- Mon Jun 13 16:47:54 2022
% 12.53/12.92
% 12.53/12.92 user CPU time 9.77 (0 hr, 0 min, 9 sec)
% 12.53/12.92 system CPU time 2.27 (0 hr, 0 min, 2 sec)
% 12.53/12.92 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.53/12.92 input time 0.00
% 12.53/12.92 paramodulation time 0.81
% 12.53/12.92 demodulation time 0.49
% 12.53/12.92 orient time 0.23
% 12.53/12.92 weigh time 0.05
% 12.53/12.92 forward subsume time 0.14
% 12.53/12.92 back demod find time 1.20
% 12.53/12.92 conflict time 0.02
% 12.53/12.92 LRPO time 0.10
% 12.53/12.92 store clause time 5.83
% 12.53/12.92 disable clause time 0.26
% 12.53/12.92 prime paramod time 0.19
% 12.53/12.92 semantics time 0.00
% 12.53/12.92
% 12.53/12.92 EQP interrupted
%------------------------------------------------------------------------------