TSTP Solution File: GRP187-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP187-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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:51 EDT 2022
% Result : Unknown 11.02s 11.38s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP187-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 06:55:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 10.99/11.37 ----- EQP 0.9e, May 2009 -----
% 10.99/11.37 The job began on n024.cluster.edu, Tue Jun 14 06:55:04 2022
% 10.99/11.37 The command was "./eqp09e".
% 10.99/11.37
% 10.99/11.37 set(prolog_style_variables).
% 10.99/11.37 set(lrpo).
% 10.99/11.37 set(basic_paramod).
% 10.99/11.37 set(functional_subsume).
% 10.99/11.37 set(ordered_paramod).
% 10.99/11.37 set(prime_paramod).
% 10.99/11.37 set(para_pairs).
% 10.99/11.37 assign(pick_given_ratio,4).
% 10.99/11.37 clear(print_kept).
% 10.99/11.37 clear(print_new_demod).
% 10.99/11.37 clear(print_back_demod).
% 10.99/11.37 clear(print_given).
% 10.99/11.37 assign(max_mem,64000).
% 10.99/11.37 end_of_commands.
% 10.99/11.37
% 10.99/11.37 Usable:
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Sos:
% 10.99/11.37 0 (wt=-1) [] multiply(identity,A) = A.
% 10.99/11.37 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 10.99/11.37 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.37 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.99/11.37 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.99/11.37 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 10.99/11.37 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 10.99/11.37 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 10.99/11.37 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 10.99/11.37 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.37 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.37 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 0 (wt=-1) [] greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity.
% 10.99/11.37 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Demodulators:
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Passive:
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Starting to process input.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 10.99/11.37 1 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.99/11.37 2 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.37 3 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.99/11.37 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 10.99/11.37
% 10.99/11.37 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.99/11.37 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 10.99/11.37
% 10.99/11.37 ** 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.37 6 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** 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.37 7 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.99/11.37 8 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.99/11.37 9 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.37 10 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.37 11 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 12 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 13 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 14 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 15 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 16 (wt=11) [] greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity.
% 10.99/11.37 16 is a new demodulator.
% 10.99/11.37
% 10.99/11.37 ** KEPT: 17 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 10.99/11.37
% 10.99/11.37 After processing input:
% 10.99/11.37
% 10.99/11.37 Usable:
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Sos:
% 10.99/11.37 1 (wt=5) [] multiply(identity,A) = A.
% 10.99/11.37 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.99/11.37 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.99/11.37 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.99/11.37 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.99/11.37 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.99/11.37 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.37 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.37 17 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 10.99/11.37 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.37 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.37 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.37 16 (wt=11) [] greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity.
% 10.99/11.37 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Demodulators:
% 10.99/11.37 1 (wt=5) [] multiply(identity,A) = A.
% 10.99/11.37 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.99/11.37 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.99/11.37 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.37 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.37 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.99/11.37 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.99/11.37 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.99/11.37 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.99/11.37 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.99/11.37 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.99/11.37 16 (wt=11) [] greatest_lower_bound(least_upper_bound(a,inverse(a)),least_upper_bound(b,inverse(b))) = identity.
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 Passive:
% 10.99/11.37 end_of_list.
% 10.99/11.37
% 10.99/11.37 ------------- memory usage ------------
% 10.99/11.37 Memory dynamically allocated (tp_alloc): 63964.
% 10.99/11.37 type (bytes each) gets frees in use avail bytes
% 10.99/11.37 sym_ent ( 96) 58 0 58 0 5.4 K
% 10.99/11.37 term ( 16) 5098532 4293286 805246 0 15633.7 K
% 10.99/11.37 gen_ptr ( 8) 4882783 574684 4308099 2 33657.0 K
% 10.99/11.37 context ( 808) 7044306 7044303 3 5 6.3 K
% 10.99/11.37 trail ( 12) 671084 671084 0 7 0.1 K
% 10.99/11.37 bt_node ( 68) 3730269 3730266 3 32 2.3 K
% 10.99/11.37 ac_position (285432) 0 0 0 0 0.0 K
% 10.99/11.37 ac_match_pos (14044) 0 0 0 0 0.0 K
% 10.99/11.37 ac_match_free_vars_pos (4020)
% 10.99/11.37 0 0 0 0 0.0 K
% 10.99/11.37 discrim ( 12) 790758 25400 765358 0 8969.0 K
% 10.99/11.37 flat ( 40) 11441652 11441622 30 198 8.9 K
% 10.99/11.37 discrim_pos ( 12) 230314 230313 1 0 0.0 K
% 10.99/11.37 fpa_head ( 12) 48477 0 48477 0 568.1 K
% 10.99/11.37 fpa_tree ( 28) 188176 188176 0 83 2.3 K
% 10.99/11.37 fpa_pos ( 36) 43123 43123 0 1 0.0 K
% 10.99/11.37 literal ( 12) 141298 117298 24000 0 281.2 K
% 10.99/11.37 clause ( 24) 141298 117298 24000 0 562.5 K
% 10.99/11.37 list ( 12) 19183 19127 56 3
% 10.99/11.37
% 10.99/11.37 ********** ABNORMAL END **********
% 10.99/11.37 ********** in tp_alloc, max_mem parameter exceeded.
% 10.99/11.37 0.7 K
% 10.99/11.37 list_pos ( 20) 94300 6966 87334 0 1705.7 K
% 10.99/11.37 pair_index ( 40) 2 0 2 0 0.1 K
% 10.99/11.37
% 10.99/11.37 -------------- statistics -------------
% 10.99/11.37 Clauses input 17
% 10.99/11.37 Usable input 0
% 10.99/11.37 Sos input 17
% 10.99/11.37 Demodulators input 0
% 10.99/11.37 Passive input 0
% 10.99/11.37
% 10.99/11.37 Processed BS (before search) 19
% 10.99/11.37 Forward subsumed BS 2
% 10.99/11.37 Kept BS 17
% 10.99/11.37 New demodulators BS 14
% 10.99/11.37 Back demodulated BS 0
% 10.99/11.37
% 10.99/11.37 Clauses or pairs given 531395
% 10.99/11.37 Clauses generated 98487
% 10.99/11.37 Forward subsumed 74504
% 10.99/11.37 Deleted by weight 0
% 10.99/11.37 Deleted by variable count 0
% 10.99/11.37 Kept 23982
% 10.99/11.37 New demodulators 19110
% 10.99/11.37 Back demodulated 1579
% 10.99/11.37 Ordered paramod prunes 0
% 10.99/11.37 Basic paramod prunes 3881862
% 10.99/11.37 Prime paramod prunes 6019
% 10.99/11.37 Semantic prunes 0
% 10.99/11.37
% 10.99/11.37 Rewrite attmepts 1886041
% 10.99/11.37 Rewrites 211166
% 10.99/11.37
% 10.99/11.37 FPA overloads 0
% 10.99/11.37 FPA underloads 0
% 10.99/11.37
% 10.99/11.37 Usable size 0
% 10.99/11.37 Sos size 22420
% 10.99/11.37 Demodulators size 18495
% 10.99/11.37 Passive size 0
% 10.99/11.37 Disabled size 1579
% 10.99/11.37
% 10.99/11.37 Proofs found 0
% 10.99/11.37
% 10.99/11.37 ----------- times (seconds) ----------- Tue Jun 14 06:55:14 2022
% 10.99/11.37
% 10.99/11.37 user CPU time 8.06 (0 hr, 0 min, 8 sec)
% 10.99/11.37 system CPU time 2.24 (0 hr, 0 min, 2 sec)
% 10.99/11.37 wall-clock time 10 (0 hr, 0 min, 10 sec)
% 10.99/11.37 input time 0.00
% 10.99/11.37 paramodulation time 0.87
% 10.99/11.37 demodulation time 0.60
% 10.99/11.37 orient time 0.21
% 10.99/11.37 weigh time 0.04
% 10.99/11.37 forward subsume time 0.11
% 10.99/11.37 back demod find time 0.68
% 10.99/11.37 conflict time 0.02
% 10.99/11.37 LRPO time 0.09
% 10.99/11.37 store clause time 4.43
% 10.99/11.37 disable clause time 0.29
% 10.99/11.37 prime paramod time 0.12
% 10.99/11.37 semantics time 0.00
% 10.99/11.37
% 10.99/11.37 EQP interrupted
%------------------------------------------------------------------------------