TSTP Solution File: GRP179-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP179-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:45 EDT 2022
% Result : Unknown 10.99s 11.43s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP179-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n019.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 : Tue Jun 14 05:29:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 10.99/11.42 ----- EQP 0.9e, May 2009 -----
% 10.99/11.42 The job began on n019.cluster.edu, Tue Jun 14 05:29:10 2022
% 10.99/11.42 The command was "./eqp09e".
% 10.99/11.42
% 10.99/11.42 set(prolog_style_variables).
% 10.99/11.42 set(lrpo).
% 10.99/11.42 set(basic_paramod).
% 10.99/11.42 set(functional_subsume).
% 10.99/11.42 set(ordered_paramod).
% 10.99/11.42 set(prime_paramod).
% 10.99/11.42 set(para_pairs).
% 10.99/11.42 assign(pick_given_ratio,4).
% 10.99/11.42 clear(print_kept).
% 10.99/11.42 clear(print_new_demod).
% 10.99/11.42 clear(print_back_demod).
% 10.99/11.42 clear(print_given).
% 10.99/11.42 assign(max_mem,64000).
% 10.99/11.42 end_of_commands.
% 10.99/11.42
% 10.99/11.42 Usable:
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Sos:
% 10.99/11.42 0 (wt=-1) [] multiply(identity,A) = A.
% 10.99/11.42 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 10.99/11.42 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.42 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.99/11.42 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.99/11.42 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 10.99/11.42 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 10.99/11.42 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 10.99/11.42 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 10.99/11.42 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.42 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.42 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 0 (wt=-1) [] -(least_upper_bound(inverse(a),identity) = inverse(greatest_lower_bound(a,identity))).
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Demodulators:
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Passive:
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Starting to process input.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 10.99/11.42 1 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.99/11.42 2 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.42 3 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.99/11.42 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 10.99/11.42
% 10.99/11.42 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.99/11.42 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 10.99/11.42
% 10.99/11.42 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 10.99/11.42 6 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 10.99/11.42 7 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.99/11.42 8 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.99/11.42 9 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.42 10 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.42 11 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 12 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 13 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 14 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 15 is a new demodulator.
% 10.99/11.42
% 10.99/11.42 ** KEPT: 16 (wt=9) [flip(1)] -(inverse(greatest_lower_bound(a,identity)) = least_upper_bound(inverse(a),identity)).
% 10.99/11.42
% 10.99/11.42 After processing input:
% 10.99/11.42
% 10.99/11.42 Usable:
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Sos:
% 10.99/11.42 1 (wt=5) [] multiply(identity,A) = A.
% 10.99/11.42 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.99/11.42 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.99/11.42 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.99/11.42 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.99/11.42 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.99/11.42 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.42 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.42 16 (wt=9) [flip(1)] -(inverse(greatest_lower_bound(a,identity)) = least_upper_bound(inverse(a),identity)).
% 10.99/11.42 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.42 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 10.99/11.42 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 10.99/11.42 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Demodulators:
% 10.99/11.42 1 (wt=5) [] multiply(identity,A) = A.
% 10.99/11.42 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.99/11.42 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.42 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 10.99/11.42 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 10.99/11.42 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.99/11.42 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.99/11.42 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.42 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.42 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.42 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 Passive:
% 10.99/11.42 end_of_list.
% 10.99/11.42
% 10.99/11.42 ------------- memory usage ------------
% 10.99/11.42 Memory dynamically allocated (tp_alloc): 63964.
% 10.99/11.42 type (bytes each) gets frees in use avail bytes
% 10.99/11.42 sym_ent ( 96) 57 0 57 0 5.3 K
% 10.99/11.42 term ( 16) 5453607 4631116 822491 34 15970.9 K
% 10.99/11.42 gen_ptr ( 8) 4926734 602708 4324026 9 33781.5 K
% 10.99/11.42 context ( 808) 4316789 4316787 2 7 7.1 K
% 10.99/11.42 trail ( 12) 946327 946327 0 7 0.1 K
% 10.99/11.42 bt_node ( 68) 1820369 1820364 5 27 2.1 K
% 10.99/11.42 ac_position (285432) 0 0 0 0 0.0 K
% 10.99/11.42 ac_match_pos (14044) 0 0 0 0 0.0 K
% 10.99/11.42 ac_match_free_vars_pos (4020)
% 10.99/11.42 0 0 0 0 0.0 K
% 10.99/11.42 discrim ( 12) 766570 17154 749416 0 8782.2 K
% 10.99/11.42 flat ( 40) 11822695 11822695 0 228 8.9 K
% 10.99/11.42 discrim_pos ( 12) 245105 245105 0 1 0.0 K
% 10.99/11.42 fpa_head ( 12) 44452 0 44452 0 520.9 K
% 10.99/11.42 fpa_tree ( 28) 164042 164042 0 83 2.3 K
% 10.99/11.42 fpa_pos ( 36) 43807 43807 0 1 0.0 K
% 10.99/11.42 literal ( 12) 146973 122896 24077 1 282.2 K
% 10.99/11.42 clause ( 24) 146973 122896 24077 1 564.3 K
% 10.99/11.42 list ( 12) 19789 19733 56 3 0.7 K
% 10.99/11.42 list_pos ( 20) 94047 4519 89528 0 1748.6 K
% 10.99/11.42 pair_index ( 40) 2 0 2 0 0.1 K
% 10.99/11.42
% 10.99/11.42 ----------
% 10.99/11.42
% 10.99/11.42 ********** ABNORMAL END **********
% 10.99/11.42 ********** in tp_alloc, max_mem parameter exceeded.
% 10.99/11.42 ---- statistics -------------
% 10.99/11.42 Clauses input 16
% 10.99/11.42 Usable input 0
% 10.99/11.42 Sos input 16
% 10.99/11.42 Demodulators input 0
% 10.99/11.42 Passive input 0
% 10.99/11.42
% 10.99/11.42 Processed BS (before search) 18
% 10.99/11.42 Forward subsumed BS 2
% 10.99/11.42 Kept BS 16
% 10.99/11.42 New demodulators BS 13
% 10.99/11.43 Back demodulated BS 0
% 10.99/11.43
% 10.99/11.43 Clauses or pairs given 329480
% 10.99/11.43 Clauses generated 104123
% 10.99/11.43 Forward subsumed 80062
% 10.99/11.43 Deleted by weight 0
% 10.99/11.43 Deleted by variable count 0
% 10.99/11.43 Kept 24061
% 10.99/11.43 New demodulators 19717
% 10.99/11.43 Back demodulated 1035
% 10.99/11.43 Ordered paramod prunes 0
% 10.99/11.43 Basic paramod prunes 1939172
% 10.99/11.43 Prime paramod prunes 8841
% 10.99/11.43 Semantic prunes 0
% 10.99/11.43
% 10.99/11.43 Rewrite attmepts 1704728
% 10.99/11.43 Rewrites 222669
% 10.99/11.43
% 10.99/11.43 FPA overloads 0
% 10.99/11.43 FPA underloads 0
% 10.99/11.43
% 10.99/11.43 Usable size 0
% 10.99/11.43 Sos size 23041
% 10.99/11.43 Demodulators size 19369
% 10.99/11.43 Passive size 0
% 10.99/11.43 Disabled size 1035
% 10.99/11.43
% 10.99/11.43 Proofs found 0
% 10.99/11.43
% 10.99/11.43 ----------- times (seconds) ----------- Tue Jun 14 05:29:20 2022
% 10.99/11.43
% 10.99/11.43 user CPU time 8.37 (0 hr, 0 min, 8 sec)
% 10.99/11.43 system CPU time 1.97 (0 hr, 0 min, 1 sec)
% 10.99/11.43 wall-clock time 10 (0 hr, 0 min, 10 sec)
% 10.99/11.43 input time 0.00
% 10.99/11.43 paramodulation time 0.83
% 10.99/11.43 demodulation time 0.60
% 10.99/11.43 orient time 0.23
% 10.99/11.43 weigh time 0.05
% 10.99/11.43 forward subsume time 0.12
% 10.99/11.43 back demod find time 0.94
% 10.99/11.43 conflict time 0.03
% 10.99/11.43 LRPO time 0.11
% 10.99/11.43 store clause time 4.65
% 10.99/11.43 disable clause time 0.17
% 10.99/11.43 prime paramod time 0.18
% 10.99/11.43 semantics time 0.00
% 10.99/11.43
% 10.99/11.43 EQP interrupted
%------------------------------------------------------------------------------