TSTP Solution File: GRP178-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n013.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:44 EDT 2022
% Result : Unknown 9.89s 10.28s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 07:21:59 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.70/1.09 ----- EQP 0.9e, May 2009 -----
% 0.70/1.09 The job began on n013.cluster.edu, Mon Jun 13 07:21:59 2022
% 0.70/1.09 The command was "./eqp09e".
% 0.70/1.09
% 0.70/1.09 set(prolog_style_variables).
% 0.70/1.09 set(lrpo).
% 0.70/1.09 set(basic_paramod).
% 0.70/1.09 set(functional_subsume).
% 0.70/1.09 set(ordered_paramod).
% 0.70/1.09 set(prime_paramod).
% 0.70/1.09 set(para_pairs).
% 0.70/1.09 assign(pick_given_ratio,4).
% 0.70/1.09 clear(print_kept).
% 0.70/1.09 clear(print_new_demod).
% 0.70/1.09 clear(print_back_demod).
% 0.70/1.09 clear(print_given).
% 0.70/1.09 assign(max_mem,64000).
% 0.70/1.09 end_of_commands.
% 0.70/1.09
% 0.70/1.09 Usable:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Sos:
% 0.70/1.09 0 (wt=-1) [] multiply(identity,A) = A.
% 0.70/1.09 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.70/1.09 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.09 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.09 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.70/1.09 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.09 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.09 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.09 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.09 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.09 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(identity,a) = a.
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(identity,b) = b.
% 0.70/1.09 0 (wt=-1) [] least_upper_bound(identity,c) = c.
% 0.70/1.09 0 (wt=-1) [] greatest_lower_bound(a,b) = identity.
% 0.70/1.09 0 (wt=-1) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Demodulators:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Passive:
% 0.70/1.09 end_of_list.
% 0.70/1.09
% 0.70/1.09 Starting to process input.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.70/1.09 1 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.70/1.09 2 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.09 3 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.09 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.70/1.09
% 0.70/1.09 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.09 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.70/1.09
% 0.70/1.09 ** 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.70/1.09 6 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** 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.70/1.09 7 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.70/1.09 8 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.70/1.09 9 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.09 10 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.09 11 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.09 12 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.09 13 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.09 14 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.09 15 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.70/1.09 16 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.70/1.09 17 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 0.70/1.09 18 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 0.70/1.09 19 is a new demodulator.
% 0.70/1.09
% 0.70/1.09 ** KEPT: 20 (wt=9) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 9.89/10.28
% 9.89/10.28 After processing input:
% 9.89/10.28
% 9.89/10.28 Usable:
% 9.89/10.28 end_of_list.
% 9.89/10.28
% 9.89/10.28 Sos:
% 9.89/10.28 1 (wt=5) [] multiply(identity,A) = A.
% 9.89/10.28 8 (wt=5) [] least_upper_bound(A,A) = A.
% 9.89/10.28 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 9.89/10.28 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 9.89/10.28 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 9.89/10.28 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 9.89/10.28 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 9.89/10.28 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 9.89/10.28 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 9.89/10.28 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 9.89/10.28 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 9.89/10.28 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 9.89/10.28 20 (wt=9) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 9.89/10.28 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 9.89/10.28 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 9.89/10.28 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 9.89/10.28 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 9.89/10.28 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 9.89/10.28 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 9.89/10.28 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 9.89/10.28 end_of_list.
% 9.89/10.28
% 9.89/10.28 Demodulators:
% 9.89/10.28 1 (wt=5) [] multiply(identity,A) = A.
% 9.89/10.28 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 9.89/10.28 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 9.89/10.28 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 9.89/10.28 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 9.89/10.28 8 (wt=5) [] least_upper_bound(A,A) = A.
% 9.89/10.28 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 9.89/10.28 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 9.89/10.28 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 9.89/10.28 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 9.89/10.28 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 9.89/10.28 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 9.89/10.28 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 9.89/10.28 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 9.89/10.28 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 9.89/10.28 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 9.89/10.28 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 9.89/10.28 end_of_list.
% 9.89/10.28
% 9.89/10.28 Passive:
% 9.89/10.28 end_of_list.
% 9.89/10.28
% 9.89/10.28 ------------- memory usage ------------
% 9.89/10.28 Memory dynamically allocated (tp_alloc): 63964.
% 9.89/10.28 type (bytes each) gets frees in use avail bytes
% 9.89/10.28 sym_ent ( 96) 59 0 59 0 5.5 K
% 9.89/10.28 term ( 16) 4903508 4104460 799048 0 15521.2 K
% 9.89/10.28 gen_ptr ( 8) 4898050 516859 4381191 5 34228.1 K
% 9.89/10.28 context ( 808) 6261857 6261855 2 7 7.1 K
% 9.89/10.28 trail ( 12) 915069 915069 0 7 0.1 K
% 9.89/10.28 bt_node ( 68) 3302534 3302531 3 88 6.0 K
% 9.89/10.28 ac_position (285432) 0 0 0 0 0.0 K
% 9.89/10.28 ac_match_pos (14044) 0 0 0 0 0.0 K
% 9.89/10.28 ac_match_free_vars_pos (4020)
% 9.89/10.28 0 0 0 0 0.0 K
% 9.89/10.28 discrim ( 12) 803346 40744 762602 0 8936.7 K
% 9.89/10.28 flat ( 40) 10979778 10979778 0 228 8.9 K
% 9.89/10.28 discrim_pos ( 12) 241830 241830 0 1 0.0 K
% 9.89/10.28 fpa_head ( 12) 45302 0 45302 0 530.9 K
% 9.89/10.28 fpa_tree ( 28) 180537 180537 0 83 2.3 K
% 9.89/10.28 fpa_pos ( 36) 38105 38105 0 1 0.0 K
% 9.89/10.28 literal ( 12) 11
% 9.89/10.28
% 9.89/10.28 ********** ABNORMAL END **********
% 9.89/10.28 ********** in tp_alloc, max_mem parameter exceeded.
% 9.89/10.28 3219 91414 21805 0 255.5 K
% 9.89/10.28 clause ( 24) 113219 91414 21805 0 511.1 K
% 9.89/10.28 list ( 12) 16360 16304 56 3 0.7 K
% 9.89/10.28 list_pos ( 20) 85487 8624 76863 0 1501.2 K
% 9.89/10.28 pair_index ( 40) 2 0 2 0 0.1 K
% 9.89/10.28
% 9.89/10.28 -------------- statistics -------------
% 9.89/10.28 Clauses input 20
% 9.89/10.28 Usable input 0
% 9.89/10.28 Sos input 20
% 9.89/10.28 Demodulators input 0
% 9.89/10.28 Passive input 0
% 9.89/10.28
% 9.89/10.28 Processed BS (before search) 22
% 9.89/10.28 Forward subsumed BS 2
% 9.89/10.28 Kept BS 20
% 9.89/10.28 New demodulators BS 17
% 9.89/10.28 Back demodulated BS 0
% 9.89/10.28
% 9.89/10.28 Clauses or pairs given 571480
% 9.89/10.28 Clauses generated 78041
% 9.89/10.28 Forward subsumed 56257
% 9.89/10.28 Deleted by weight 0
% 9.89/10.28 Deleted by variable count 0
% 9.89/10.28 Kept 21784
% 9.89/10.28 New demodulators 16284
% 9.89/10.28 Back demodulated 1872
% 9.89/10.28 Ordered paramod prunes 0
% 9.89/10.28 Basic paramod prunes 3413763
% 9.89/10.28 Prime paramod prunes 7950
% 9.89/10.28 Semantic prunes 0
% 9.89/10.28
% 9.89/10.28 Rewrite attmepts 1727103
% 9.89/10.28 Rewrites 223317
% 9.89/10.28
% 9.89/10.28 FPA overloads 0
% 9.89/10.28 FPA underloads 0
% 9.89/10.28
% 9.89/10.28 Usable size 0
% 9.89/10.28 Sos size 19932
% 9.89/10.28 Demodulators size 15195
% 9.89/10.28 Passive size 0
% 9.89/10.28 Disabled size 1872
% 9.89/10.28
% 9.89/10.28 Proofs found 0
% 9.89/10.28
% 9.89/10.28 ----------- times (seconds) ----------- Mon Jun 13 07:22:09 2022
% 9.89/10.28
% 9.89/10.28 user CPU time 6.96 (0 hr, 0 min, 6 sec)
% 9.89/10.28 system CPU time 2.23 (0 hr, 0 min, 2 sec)
% 9.89/10.28 wall-clock time 10 (0 hr, 0 min, 10 sec)
% 9.89/10.28 input time 0.00
% 9.89/10.28 paramodulation time 0.70
% 9.89/10.28 demodulation time 0.56
% 9.89/10.28 orient time 0.14
% 9.89/10.28 weigh time 0.05
% 9.89/10.28 forward subsume time 0.08
% 9.89/10.28 back demod find time 0.69
% 9.89/10.28 conflict time 0.01
% 9.89/10.28 LRPO time 0.05
% 9.89/10.28 store clause time 3.71
% 9.89/10.28 disable clause time 0.29
% 9.89/10.28 prime paramod time 0.09
% 9.89/10.28 semantics time 0.00
% 9.89/10.28
% 9.89/10.28 EQP interrupted
%------------------------------------------------------------------------------