TSTP Solution File: GRP180-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP180-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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 12.00s 12.38s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP180-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n028.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 : Tue Jun 14 04:46:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 12.00/12.37 ----- EQP 0.9e, May 2009 -----
% 12.00/12.37 The job began on n028.cluster.edu, Tue Jun 14 04:46:24 2022
% 12.00/12.37 The command was "./eqp09e".
% 12.00/12.37
% 12.00/12.37 set(prolog_style_variables).
% 12.00/12.37 set(lrpo).
% 12.00/12.37 set(basic_paramod).
% 12.00/12.37 set(functional_subsume).
% 12.00/12.37 set(ordered_paramod).
% 12.00/12.37 set(prime_paramod).
% 12.00/12.37 set(para_pairs).
% 12.00/12.37 assign(pick_given_ratio,4).
% 12.00/12.37 clear(print_kept).
% 12.00/12.37 clear(print_new_demod).
% 12.00/12.37 clear(print_back_demod).
% 12.00/12.37 clear(print_given).
% 12.00/12.37 assign(max_mem,64000).
% 12.00/12.37 end_of_commands.
% 12.00/12.37
% 12.00/12.37 Usable:
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Sos:
% 12.00/12.37 0 (wt=-1) [] multiply(identity,A) = A.
% 12.00/12.37 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 12.00/12.37 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.00/12.37 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.00/12.37 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.00/12.37 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 12.00/12.37 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 12.00/12.37 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 12.00/12.37 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 12.00/12.37 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.00/12.37 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.00/12.37 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 0 (wt=-1) [] inverse(identity) = identity.
% 12.00/12.37 0 (wt=-1) [] inverse(inverse(A)) = A.
% 12.00/12.37 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.00/12.37 0 (wt=-1) [] -(multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) = least_upper_bound(a,b)).
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Demodulators:
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Passive:
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Starting to process input.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 12.00/12.37 1 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.00/12.37 2 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.00/12.37 3 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.00/12.37 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 12.00/12.37
% 12.00/12.37 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.00/12.37 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 12.00/12.37
% 12.00/12.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)).
% 12.00/12.37 6 is a new demodulator.
% 12.00/12.37
% 12.00/12.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)).
% 12.00/12.37 7 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.00/12.37 8 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.00/12.37 9 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.00/12.37 10 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.00/12.37 11 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 12 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 13 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 14 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 15 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 12.00/12.37 16 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.00/12.37 17 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.00/12.37 18 is a new demodulator.
% 12.00/12.37
% 12.00/12.37 ** KEPT: 19 (wt=12) [] -(multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) = least_upper_bound(a,b)).
% 12.00/12.37
% 12.00/12.37 After processing input:
% 12.00/12.37
% 12.00/12.37 Usable:
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Sos:
% 12.00/12.37 16 (wt=4) [] inverse(identity) = identity.
% 12.00/12.37 1 (wt=5) [] multiply(identity,A) = A.
% 12.00/12.37 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.00/12.37 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.00/12.37 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.00/12.37 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.00/12.37 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.00/12.37 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.00/12.37 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.00/12.37 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.00/12.37 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.00/12.37 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.00/12.37 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.00/12.37 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.00/12.37 19 (wt=12) [] -(multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) = least_upper_bound(a,b)).
% 12.00/12.37 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Demodulators:
% 12.00/12.37 1 (wt=5) [] multiply(identity,A) = A.
% 12.00/12.37 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.00/12.37 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.00/12.37 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 12.00/12.37 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 12.00/12.37 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.00/12.37 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.00/12.37 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.00/12.37 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.00/12.37 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.00/12.37 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.00/12.37 16 (wt=4) [] inverse(identity) = identity.
% 12.00/12.37 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.00/12.37 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 Passive:
% 12.00/12.37 end_of_list.
% 12.00/12.37
% 12.00/12.37 ------------- memory usage ------------
% 12.00/12.37 Memory dynamically allocated (tp_alloc): 63964.
% 12.00/12.37 type (bytes each) gets frees in use avail bytes
% 12.00/12.37 sym_ent ( 96) 58 0 58 0 5.4 K
% 12.00/12.37 term ( 16) 4654566 3768053 886513 1 17205.1 K
% 12.00/12.37 gen_ptr ( 8) 4875390 598032 4277358 0 33416.9 K
% 12.00/12.37 context ( 808) 4569927 4569925 2 7 7.1 K
% 12.00/12.37 trail ( 12) 515210 515210 0 7 0.1 K
% 12.00/12.37 bt_node ( 68) 2022457 2022453 4 23 1.8 K
% 12.00/12.37 ac_position (285432) 0 0 0 0 0.0 K
% 12.00/12.37 ac_match_pos (14044) 0 0 0 0 0.0 K
% 12.00/12.37 ac_match_free_vars_pos (4020)
% 12.00/12.37 0 0 0 0 0.0 K
% 12.00/12.37 discrim ( 12) 703054 25510 677544 0 7940.0 K
% 12.00/12.37 flat ( 40) 11219689 11219689 0 185 7.2 K
% 12.00/12.37 discrim_pos ( 12) 208358 208358 0 1 0.0 K
% 12.00/12.37 fpa_head ( 12) 49329 0 49329 0 578.1 K
% 12.00/12.37 fpa_tree ( 28) 112431 112431 0 83 2.3 K
% 12.00/12.37 fpa_pos ( 36) 47952 47952 0 1 0.0 K
% 12.00/12.37 literal ( 12) 162235 134167 28068 1 328.9 K
% 12.00/12.37 clause ( 24)
% 12.00/12.37
% 12.00/12.37 ********** ABNORMAL END **********
% 12.00/12.38 ********** in tp_alloc, max_mem parameter exceeded.
% 12.00/12.38 162235 134167 28068 1 657.9 K
% 12.00/12.38 list ( 12) 19943 19887 56 3 0.7 K
% 12.00/12.38 list_pos ( 20) 107367 7037 100330 0 1959.6 K
% 12.00/12.38 pair_index ( 40) 2 0 2 0 0.1 K
% 12.00/12.38
% 12.00/12.38 -------------- statistics -------------
% 12.00/12.38 Clauses input 19
% 12.00/12.38 Usable input 0
% 12.00/12.38 Sos input 19
% 12.00/12.38 Demodulators input 0
% 12.00/12.38 Passive input 0
% 12.00/12.38
% 12.00/12.38 Processed BS (before search) 21
% 12.00/12.38 Forward subsumed BS 2
% 12.00/12.38 Kept BS 19
% 12.00/12.38 New demodulators BS 16
% 12.00/12.38 Back demodulated BS 0
% 12.00/12.38
% 12.00/12.38 Clauses or pairs given 387595
% 12.00/12.38 Clauses generated 111654
% 12.00/12.38 Forward subsumed 83605
% 12.00/12.38 Deleted by weight 0
% 12.00/12.38 Deleted by variable count 0
% 12.00/12.38 Kept 28049
% 12.00/12.38 New demodulators 19868
% 12.00/12.38 Back demodulated 1630
% 12.00/12.38 Ordered paramod prunes 0
% 12.00/12.38 Basic paramod prunes 2364141
% 12.00/12.38 Prime paramod prunes 9587
% 12.00/12.38 Semantic prunes 0
% 12.00/12.38
% 12.00/12.38 Rewrite attmepts 1623107
% 12.00/12.38 Rewrites 181686
% 12.00/12.38
% 12.00/12.38 FPA overloads 0
% 12.00/12.38 FPA underloads 0
% 12.00/12.38
% 12.00/12.38 Usable size 0
% 12.00/12.38 Sos size 26438
% 12.00/12.38 Demodulators size 19386
% 12.00/12.38 Passive size 0
% 12.00/12.38 Disabled size 1630
% 12.00/12.38
% 12.00/12.38 Proofs found 0
% 12.00/12.38
% 12.00/12.38 ----------- times (seconds) ----------- Tue Jun 14 04:46:35 2022
% 12.00/12.38
% 12.00/12.38 user CPU time 9.36 (0 hr, 0 min, 9 sec)
% 12.00/12.38 system CPU time 1.96 (0 hr, 0 min, 1 sec)
% 12.00/12.38 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 12.00/12.38 input time 0.00
% 12.00/12.38 paramodulation time 0.83
% 12.00/12.38 demodulation time 0.47
% 12.00/12.38 orient time 0.23
% 12.00/12.38 weigh time 0.04
% 12.00/12.38 forward subsume time 0.14
% 12.00/12.38 back demod find time 0.66
% 12.00/12.38 conflict time 0.02
% 12.00/12.38 LRPO time 0.12
% 12.00/12.38 store clause time 5.91
% 12.00/12.38 disable clause time 0.27
% 12.00/12.38 prime paramod time 0.18
% 12.00/12.38 semantics time 0.00
% 12.00/12.38
% 12.00/12.38 EQP interrupted
%------------------------------------------------------------------------------