TSTP Solution File: GRP181-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP181-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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:46 EDT 2022
% Result : Unknown 12.51s 12.91s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP181-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 07:33:24 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.76/1.14 ----- EQP 0.9e, May 2009 -----
% 0.76/1.14 The job began on n005.cluster.edu, Tue Jun 14 07:33:24 2022
% 0.76/1.14 The command was "./eqp09e".
% 0.76/1.14
% 0.76/1.14 set(prolog_style_variables).
% 0.76/1.14 set(lrpo).
% 0.76/1.14 set(basic_paramod).
% 0.76/1.14 set(functional_subsume).
% 0.76/1.14 set(ordered_paramod).
% 0.76/1.14 set(prime_paramod).
% 0.76/1.14 set(para_pairs).
% 0.76/1.14 assign(pick_given_ratio,4).
% 0.76/1.14 clear(print_kept).
% 0.76/1.14 clear(print_new_demod).
% 0.76/1.14 clear(print_back_demod).
% 0.76/1.14 clear(print_given).
% 0.76/1.14 assign(max_mem,64000).
% 0.76/1.14 end_of_commands.
% 0.76/1.14
% 0.76/1.14 Usable:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Sos:
% 0.76/1.14 0 (wt=-1) [] multiply(identity,A) = A.
% 0.76/1.14 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.76/1.14 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.76/1.14 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.76/1.14 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.76/1.14 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.76/1.14 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.76/1.14 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.76/1.14 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.76/1.14 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.76/1.14 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.76/1.14 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.76/1.14 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.76/1.14 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.76/1.14 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.76/1.14 0 (wt=-1) [] inverse(identity) = identity.
% 0.76/1.14 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.76/1.14 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.76/1.14 0 (wt=-1) [] greatest_lower_bound(a,c) = greatest_lower_bound(b,c).
% 0.76/1.14 0 (wt=-1) [] least_upper_bound(a,c) = least_upper_bound(b,c).
% 0.76/1.14 0 (wt=-1) [] -(a = b).
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Demodulators:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Passive:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Starting to process input.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.76/1.14 1 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.76/1.14 2 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.76/1.14 3 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.76/1.14 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.76/1.14
% 0.76/1.14 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.76/1.14 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.76/1.14
% 0.76/1.14 ** 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.76/1.14 6 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** 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.76/1.14 7 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.76/1.14 8 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.76/1.14 9 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.76/1.14 10 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.76/1.14 11 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.76/1.14 12 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.76/1.14 13 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.76/1.14 14 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.76/1.14 15 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.76/1.14 16 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.76/1.14 17 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.76/1.14 18 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 19 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 12.51/12.91 19 is a new demodulator.
% 12.51/12.91
% 12.51/12.91 ** KEPT: 20 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 12.51/12.91 20 is a new demodulator.
% 12.51/12.91
% 12.51/12.91 ** KEPT: 21 (wt=3) [flip(1)] -(b = a).
% 12.51/12.91
% 12.51/12.91 After processing input:
% 12.51/12.91
% 12.51/12.91 Usable:
% 12.51/12.91 end_of_list.
% 12.51/12.91
% 12.51/12.91 Sos:
% 12.51/12.91 21 (wt=3) [flip(1)] -(b = a).
% 12.51/12.91 16 (wt=4) [] inverse(identity) = identity.
% 12.51/12.91 1 (wt=5) [] multiply(identity,A) = A.
% 12.51/12.91 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.51/12.91 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.51/12.91 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.51/12.91 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.51/12.91 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 12.51/12.91 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 12.51/12.91 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.51/12.91 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.51/12.91 19 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 12.51/12.91 20 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 12.51/12.91 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.51/12.91 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.51/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.51/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.51/12.91 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.51/12.91 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.51/12.91 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.51/12.91 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.51/12.91 end_of_list.
% 12.51/12.91
% 12.51/12.91 Demodulators:
% 12.51/12.91 1 (wt=5) [] multiply(identity,A) = A.
% 12.51/12.91 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 12.51/12.91 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 12.51/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.51/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.51/12.91 8 (wt=5) [] least_upper_bound(A,A) = A.
% 12.51/12.91 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 12.51/12.91 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 12.51/12.91 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 12.51/12.91 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 12.51/12.91 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 12.51/12.91 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 12.51/12.91 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 12.51/12.91 16 (wt=4) [] inverse(identity) = identity.
% 12.51/12.91 17 (wt=5) [] inverse(inverse(A)) = A.
% 12.51/12.91 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 12.51/12.91 19 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 12.51/12.91 20 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 12.51/12.91 end_of_list.
% 12.51/12.91
% 12.51/12.91 Passive:
% 12.51/12.91 end_of_list.
% 12.51/12.91
% 12.51/12.91 ------------- memory usage ------------
% 12.51/12.91 Memory dynamically allocated (tp_alloc): 63964.
% 12.51/12.91 type (bytes each) gets frees in use avail bytes
% 12.51/12.91 sym_ent ( 96) 59 0 59 0 5.5 K
% 12.51/12.91 term ( 16) 4050585 3170000 880585 0 17090.4 K
% 12.51/12.91 gen_ptr ( 8) 4832346 551026 4281320 0 33447.8 K
% 12.51/12.91 context ( 808) 5841463 5841461 2 7 7.1 K
% 12.51/12.91 trail ( 12) 277151 277151 0 7 0.1 K
% 12.51/12.91 bt_node ( 68) 2908978 2908975 3 24 1.8 K
% 12.51/12.91 ac_position (285432) 0 0 0 0 0.0 K
% 12.51/12.91 ac_match_pos (14044) 0 0 0 0 0.0 K
% 12.51/12.91 ac_match_free_vars_pos (4020)
% 12.51/12.91 0 0 0 0 0.0 K
% 12.51/12.91 discrim ( 12) 701635 26393 675242 0 7913.0 K
% 12.51/12.91 flat ( 40) 10023617 10023617 0 185 7.2 K
% 12.51/12.91 discrim_pos ( 12) 179529 179529 0 1 0.0 K
% 12.51/12.91 fpa_head ( 12) 57906 0 57906 0 678.6 K
% 12.51/12.91 fpa_tree ( 28) 110
% 12.51/12.91
% 12.51/12.91 ********** ABNORMAL END **********
% 12.51/12.91 ********** in tp_alloc, max_mem parameter exceeded.
% 12.51/12.91 893 110893 0 83 2.3 K
% 12.51/12.91 fpa_pos ( 36) 44605 44605 0 1 0.0 K
% 12.51/12.91 literal ( 12) 159503 131720 27783 0 325.6 K
% 12.51/12.91 clause ( 24) 159503 131720 27783 0 651.2 K
% 12.51/12.91 list ( 12) 16882 16826 56 3 0.7 K
% 12.51/12.91 list_pos ( 20) 103204 6518 96686 0 1888.4 K
% 12.51/12.91 pair_index ( 40) 2 0 2 0 0.1 K
% 12.51/12.91
% 12.51/12.91 -------------- statistics -------------
% 12.51/12.91 Clauses input 21
% 12.51/12.91 Usable input 0
% 12.51/12.91 Sos input 21
% 12.51/12.91 Demodulators input 0
% 12.51/12.91 Passive input 0
% 12.51/12.91
% 12.51/12.91 Processed BS (before search) 23
% 12.51/12.91 Forward subsumed BS 2
% 12.51/12.91 Kept BS 21
% 12.51/12.91 New demodulators BS 18
% 12.51/12.91 Back demodulated BS 0
% 12.51/12.91
% 12.51/12.91 Clauses or pairs given 460215
% 12.51/12.91 Clauses generated 107281
% 12.51/12.91 Forward subsumed 79520
% 12.51/12.91 Deleted by weight 0
% 12.51/12.91 Deleted by variable count 0
% 12.51/12.91 Kept 27761
% 12.51/12.91 New demodulators 16805
% 12.51/12.91 Back demodulated 1507
% 12.51/12.91 Ordered paramod prunes 0
% 12.51/12.91 Basic paramod prunes 2816359
% 12.51/12.91 Prime paramod prunes 4620
% 12.51/12.91 Semantic prunes 0
% 12.51/12.91
% 12.51/12.91 Rewrite attmepts 1721958
% 12.51/12.91 Rewrites 155535
% 12.51/12.91
% 12.51/12.91 FPA overloads 0
% 12.51/12.91 FPA underloads 0
% 12.51/12.91
% 12.51/12.91 Usable size 0
% 12.51/12.91 Sos size 26275
% 12.51/12.91 Demodulators size 16354
% 12.51/12.91 Passive size 0
% 12.51/12.91 Disabled size 1507
% 12.51/12.91
% 12.51/12.91 Proofs found 0
% 12.51/12.91
% 12.51/12.91 ----------- times (seconds) ----------- Tue Jun 14 07:33:36 2022
% 12.51/12.91
% 12.51/12.91 user CPU time 9.52 (0 hr, 0 min, 9 sec)
% 12.51/12.91 system CPU time 2.25 (0 hr, 0 min, 2 sec)
% 12.51/12.91 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 12.51/12.91 input time 0.00
% 12.51/12.91 paramodulation time 0.81
% 12.51/12.91 demodulation time 0.46
% 12.51/12.91 orient time 0.21
% 12.51/12.91 weigh time 0.05
% 12.51/12.91 forward subsume time 0.13
% 12.51/12.91 back demod find time 0.60
% 12.51/12.91 conflict time 0.02
% 12.51/12.91 LRPO time 0.08
% 12.51/12.91 store clause time 6.18
% 12.51/12.91 disable clause time 0.25
% 12.51/12.91 prime paramod time 0.17
% 12.51/12.91 semantics time 0.00
% 12.51/12.91
% 12.51/12.91 EQP interrupted
%------------------------------------------------------------------------------