TSTP Solution File: GRP183-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP183-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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:48 EDT 2022
% Result : Unknown 13.10s 13.47s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP183-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n008.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 : Mon Jun 13 10:37:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.06 ----- EQP 0.9e, May 2009 -----
% 0.42/1.06 The job began on n008.cluster.edu, Mon Jun 13 10:37:23 2022
% 0.42/1.06 The command was "./eqp09e".
% 0.42/1.06
% 0.42/1.06 set(prolog_style_variables).
% 0.42/1.06 set(lrpo).
% 0.42/1.06 set(basic_paramod).
% 0.42/1.06 set(functional_subsume).
% 0.42/1.06 set(ordered_paramod).
% 0.42/1.06 set(prime_paramod).
% 0.42/1.06 set(para_pairs).
% 0.42/1.06 assign(pick_given_ratio,4).
% 0.42/1.06 clear(print_kept).
% 0.42/1.06 clear(print_new_demod).
% 0.42/1.06 clear(print_back_demod).
% 0.42/1.06 clear(print_given).
% 0.42/1.06 assign(max_mem,64000).
% 0.42/1.06 end_of_commands.
% 0.42/1.06
% 0.42/1.06 Usable:
% 0.42/1.06 end_of_list.
% 0.42/1.06
% 0.42/1.06 Sos:
% 0.42/1.06 0 (wt=-1) [] multiply(identity,A) = A.
% 0.42/1.06 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.42/1.06 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.42/1.06 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.42/1.06 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.42/1.06 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.42/1.06 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.42/1.06 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.42/1.06 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.42/1.06 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.42/1.06 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.42/1.06 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.06 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.06 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.06 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.06 0 (wt=-1) [] inverse(identity) = identity.
% 0.42/1.06 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.42/1.06 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.42/1.06 0 (wt=-1) [] -(greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = identity).
% 0.42/1.06 end_of_list.
% 0.42/1.06
% 0.42/1.06 Demodulators:
% 0.42/1.06 end_of_list.
% 0.42/1.06
% 0.42/1.06 Passive:
% 0.42/1.06 end_of_list.
% 0.42/1.06
% 0.42/1.06 Starting to process input.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.42/1.06 1 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.42/1.06 2 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.42/1.06 3 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.42/1.06 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.42/1.06
% 0.42/1.06 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.42/1.06 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.42/1.06
% 0.42/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.42/1.06 6 is a new demodulator.
% 0.42/1.06
% 0.42/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.42/1.06 7 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.42/1.06 8 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.42/1.06 9 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.42/1.06 10 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.42/1.06 11 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.06 12 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.06 13 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.06 14 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.06 15 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.42/1.06 16 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.42/1.06 17 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.42/1.06 18 is a new demodulator.
% 0.42/1.06
% 0.42/1.06 ** KEPT: 19 (wt=10) [] -(greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = identity).
% 13.10/13.46
% 13.10/13.46 After processing input:
% 13.10/13.46
% 13.10/13.46 Usable:
% 13.10/13.46 end_of_list.
% 13.10/13.46
% 13.10/13.46 Sos:
% 13.10/13.46 16 (wt=4) [] inverse(identity) = identity.
% 13.10/13.46 1 (wt=5) [] multiply(identity,A) = A.
% 13.10/13.46 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.10/13.46 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.10/13.46 17 (wt=5) [] inverse(inverse(A)) = A.
% 13.10/13.46 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.10/13.46 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 13.10/13.46 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 13.10/13.46 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.10/13.46 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.10/13.46 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 13.10/13.46 19 (wt=10) [] -(greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = identity).
% 13.10/13.46 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.10/13.46 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 13.10/13.46 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 13.10/13.46 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.10/13.46 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.10/13.46 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.10/13.46 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.10/13.46 end_of_list.
% 13.10/13.46
% 13.10/13.46 Demodulators:
% 13.10/13.46 1 (wt=5) [] multiply(identity,A) = A.
% 13.10/13.46 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.10/13.46 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.10/13.46 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 13.10/13.46 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 13.10/13.46 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.10/13.46 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.10/13.46 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.10/13.46 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.10/13.46 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.10/13.46 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.10/13.46 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.10/13.46 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.10/13.46 16 (wt=4) [] inverse(identity) = identity.
% 13.10/13.46 17 (wt=5) [] inverse(inverse(A)) = A.
% 13.10/13.46 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 13.10/13.46 end_of_list.
% 13.10/13.46
% 13.10/13.46 Passive:
% 13.10/13.46 end_of_list.
% 13.10/13.46
% 13.10/13.46 ------------- memory usage ------------
% 13.10/13.46 Memory dynamically allocated (tp_alloc): 63964.
% 13.10/13.46 type (bytes each) gets frees in use avail bytes
% 13.10/13.46 sym_ent ( 96) 57 0 57 0 5.3 K
% 13.10/13.46 term ( 16) 4680485 3793097 887388 1 17221.5 K
% 13.10/13.46 gen_ptr ( 8) 4872062 601554 4270508 0 33363.3 K
% 13.10/13.46 context ( 808) 4658375 4658373 2 7 7.1 K
% 13.10/13.46 trail ( 12) 525057 525057 0 7 0.1 K
% 13.10/13.46 bt_node ( 68) 2091763 2091760 3 24 1.8 K
% 13.10/13.46 ac_position (285432) 0 0 0 0 0.0 K
% 13.10/13.46 ac_match_pos (14044) 0 0 0 0 0.0 K
% 13.10/13.46 ac_match_free_vars_pos (4020)
% 13.10/13.46 0 0 0 0 0.0 K
% 13.10/13.46 discrim ( 12) 702559 24934 677625 0 7940.9 K
% 13.10/13.46 flat ( 40) 11256755 11256755 0 185 7.2 K
% 13.10/13.46 discrim_pos ( 12) 209607 209607 0 1 0.0 K
% 13.10/13.46 fpa_head ( 12) 49305 0 49305 0 577.8 K
% 13.10/13.46 fpa_tree ( 28) 114570 114570 0 83 2.3 K
% 13.10/13.46 fpa_pos ( 36) 48362 48362 0 1 0.0 K
% 13.10/13.46 literal ( 12) 163205 134975 28230 1 330
% 13.10/13.47
% 13.10/13.47 ********** ABNORMAL END **********
% 13.10/13.47 ********** in tp_alloc, max_mem parameter exceeded.
% 13.10/13.47 .8 K
% 13.10/13.47 clause ( 24) 163205 134975 28230 1 661.7 K
% 13.10/13.47 list ( 12) 20191 20135 56 3 0.7 K
% 13.10/13.47 list_pos ( 20) 108223 7282 100941 0 1971.5 K
% 13.10/13.47 pair_index ( 40) 2 0 2 0 0.1 K
% 13.10/13.47
% 13.10/13.47 -------------- statistics -------------
% 13.10/13.47 Clauses input 19
% 13.10/13.47 Usable input 0
% 13.10/13.47 Sos input 19
% 13.10/13.47 Demodulators input 0
% 13.10/13.47 Passive input 0
% 13.10/13.47
% 13.10/13.47 Processed BS (before search) 21
% 13.10/13.47 Forward subsumed BS 2
% 13.10/13.47 Kept BS 19
% 13.10/13.47 New demodulators BS 16
% 13.10/13.47 Back demodulated BS 0
% 13.10/13.47
% 13.10/13.47 Clauses or pairs given 400330
% 13.10/13.47 Clauses generated 112171
% 13.10/13.47 Forward subsumed 83960
% 13.10/13.47 Deleted by weight 0
% 13.10/13.47 Deleted by variable count 0
% 13.10/13.47 Kept 28211
% 13.10/13.47 New demodulators 20116
% 13.10/13.47 Back demodulated 1691
% 13.10/13.47 Ordered paramod prunes 0
% 13.10/13.47 Basic paramod prunes 2431554
% 13.10/13.47 Prime paramod prunes 9564
% 13.10/13.47 Semantic prunes 0
% 13.10/13.47
% 13.10/13.47 Rewrite attmepts 1631616
% 13.10/13.47 Rewrites 182849
% 13.10/13.47
% 13.10/13.47 FPA overloads 0
% 13.10/13.47 FPA underloads 0
% 13.10/13.47
% 13.10/13.47 Usable size 0
% 13.10/13.47 Sos size 26539
% 13.10/13.47 Demodulators size 19633
% 13.10/13.47 Passive size 0
% 13.10/13.47 Disabled size 1691
% 13.10/13.47
% 13.10/13.47 Proofs found 0
% 13.10/13.47
% 13.10/13.47 ----------- times (seconds) ----------- Mon Jun 13 10:37:35 2022
% 13.10/13.47
% 13.10/13.47 user CPU time 10.37 (0 hr, 0 min, 10 sec)
% 13.10/13.47 system CPU time 2.04 (0 hr, 0 min, 2 sec)
% 13.10/13.47 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 13.10/13.47 input time 0.00
% 13.10/13.47 paramodulation time 0.89
% 13.10/13.47 demodulation time 0.47
% 13.10/13.47 orient time 0.23
% 13.10/13.47 weigh time 0.06
% 13.10/13.47 forward subsume time 0.17
% 13.10/13.47 back demod find time 1.02
% 13.10/13.47 conflict time 0.02
% 13.10/13.47 LRPO time 0.10
% 13.10/13.47 store clause time 6.32
% 13.10/13.47 disable clause time 0.30
% 13.10/13.47 prime paramod time 0.20
% 13.10/13.47 semantics time 0.00
% 13.10/13.47
% 13.10/13.47 EQP interrupted
%------------------------------------------------------------------------------