TSTP Solution File: GRP178-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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.30s 9.73s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n016.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 : Mon Jun 13 08:31:29 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.07 ----- EQP 0.9e, May 2009 -----
% 0.44/1.07 The job began on n016.cluster.edu, Mon Jun 13 08:31:30 2022
% 0.44/1.07 The command was "./eqp09e".
% 0.44/1.07
% 0.44/1.07 set(prolog_style_variables).
% 0.44/1.07 set(lrpo).
% 0.44/1.07 set(basic_paramod).
% 0.44/1.07 set(functional_subsume).
% 0.44/1.07 set(ordered_paramod).
% 0.44/1.07 set(prime_paramod).
% 0.44/1.07 set(para_pairs).
% 0.44/1.07 assign(pick_given_ratio,4).
% 0.44/1.07 clear(print_kept).
% 0.44/1.07 clear(print_new_demod).
% 0.44/1.07 clear(print_back_demod).
% 0.44/1.07 clear(print_given).
% 0.44/1.07 assign(max_mem,64000).
% 0.44/1.07 end_of_commands.
% 0.44/1.07
% 0.44/1.07 Usable:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Sos:
% 0.44/1.07 0 (wt=-1) [] multiply(identity,A) = A.
% 0.44/1.07 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.44/1.07 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.44/1.07 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.44/1.07 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.44/1.07 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.44/1.07 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.44/1.07 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.44/1.07 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.44/1.07 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.44/1.07 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(identity,a) = identity.
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(identity,b) = identity.
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(identity,c) = identity.
% 0.44/1.07 0 (wt=-1) [] greatest_lower_bound(a,b) = identity.
% 0.44/1.07 0 (wt=-1) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Demodulators:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Passive:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Starting to process input.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.44/1.07 1 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.44/1.07 2 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.44/1.07 3 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.44/1.07 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.44/1.07
% 0.44/1.07 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.44/1.07 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.44/1.07
% 0.44/1.07 ** 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.44/1.07 6 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** 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.44/1.07 7 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.44/1.07 8 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.44/1.07 9 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.44/1.07 10 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.44/1.07 11 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.44/1.07 12 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.44/1.07 13 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.44/1.07 14 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.44/1.07 15 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.44/1.07 16 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.44/1.07 17 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 18 (wt=5) [] greatest_lower_bound(identity,c) = identity.
% 0.44/1.07 18 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 9.30/9.72 19 is a new demodulator.
% 9.30/9.72
% 9.30/9.72 ** KEPT: 20 (wt=9) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 9.30/9.72
% 9.30/9.72 After processing input:
% 9.30/9.72
% 9.30/9.72 Usable:
% 9.30/9.72 end_of_list.
% 9.30/9.72
% 9.30/9.72 Sos:
% 9.30/9.72 1 (wt=5) [] multiply(identity,A) = A.
% 9.30/9.72 8 (wt=5) [] least_upper_bound(A,A) = A.
% 9.30/9.72 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 9.30/9.72 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 9.30/9.72 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 9.30/9.72 18 (wt=5) [] greatest_lower_bound(identity,c) = identity.
% 9.30/9.72 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 9.30/9.72 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 9.30/9.72 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 9.30/9.72 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 9.30/9.72 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 9.30/9.72 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 9.30/9.72 20 (wt=9) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 9.30/9.72 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 9.30/9.72 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 9.30/9.72 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 9.30/9.72 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 9.30/9.72 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 9.30/9.72 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 9.30/9.72 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 9.30/9.72 end_of_list.
% 9.30/9.72
% 9.30/9.72 Demodulators:
% 9.30/9.72 1 (wt=5) [] multiply(identity,A) = A.
% 9.30/9.72 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 9.30/9.72 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 9.30/9.72 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 9.30/9.72 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 9.30/9.72 8 (wt=5) [] least_upper_bound(A,A) = A.
% 9.30/9.72 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 9.30/9.72 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 9.30/9.72 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 9.30/9.72 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 9.30/9.72 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 9.30/9.72 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 9.30/9.72 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 9.30/9.72 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 9.30/9.72 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 9.30/9.72 18 (wt=5) [] greatest_lower_bound(identity,c) = identity.
% 9.30/9.72 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 9.30/9.72 end_of_list.
% 9.30/9.72
% 9.30/9.72 Passive:
% 9.30/9.72 end_of_list.
% 9.30/9.72
% 9.30/9.72 ------------- memory usage ------------
% 9.30/9.72 Memory dynamically allocated (tp_alloc): 63964.
% 9.30/9.72 type (bytes each) gets frees in use avail bytes
% 9.30/9.72 sym_ent ( 96) 59 0 59 0 5.5 K
% 9.30/9.72 term ( 16) 4878401 4073674 804727 445 15640.9 K
% 9.30/9.72 gen_ptr ( 8) 4928807 538009 4390798 0 34303.1 K
% 9.30/9.72 context ( 808) 5706536 5706534 2 7 7.1 K
% 9.30/9.72 trail ( 12) 900674 900674 0 7 0.1 K
% 9.30/9.72 bt_node ( 68) 2990173 2990170 3 88 6.0 K
% 9.30/9.72 ac_position (285432) 0 0 0 0 0.0 K
% 9.30/9.72 ac_match_pos (14044) 0 0 0 0 0.0 K
% 9.30/9.72 ac_match_free_vars_pos (4020)
% 9.30/9.72 0 0 0 0 0.0 K
% 9.30/9.72 discrim ( 12) 804041 50120 753921 0 8835.0 K
% 9.30/9.72 flat ( 40) 10922234 10922234 0 228 8.9 K
% 9.30/9.72 discrim_pos ( 12) 241675 241675 0 1 0.0 K
% 9.30/9.72 fpa_head ( 12) 42901 0 42901 0 502.7 K
% 9.30/9.73 fpa_tree ( 28) 180009 180009 0 83 2.3 K
% 9.30/9.73 fpa_pos ( 36) 38062 38062
% 9.30/9.73
% 9.30/9.73 ********** ABNORMAL END **********
% 9.30/9.73 ********** in tp_alloc, max_mem parameter exceeded.
% 9.30/9.73 0 1 0.0 K
% 9.30/9.73 literal ( 12) 115380 93601 21779 1 255.2 K
% 9.30/9.73 clause ( 24) 115380 93601 21779 1 510.5 K
% 9.30/9.73 list ( 12) 16342 16286 56 4 0.7 K
% 9.30/9.73 list_pos ( 20) 85595 8971 76624 0 1496.6 K
% 9.30/9.73 pair_index ( 40) 2 0 2 0 0.1 K
% 9.30/9.73
% 9.30/9.73 -------------- statistics -------------
% 9.30/9.73 Clauses input 20
% 9.30/9.73 Usable input 0
% 9.30/9.73 Sos input 20
% 9.30/9.73 Demodulators input 0
% 9.30/9.73 Passive input 0
% 9.30/9.73
% 9.30/9.73 Processed BS (before search) 22
% 9.30/9.73 Forward subsumed BS 2
% 9.30/9.73 Kept BS 20
% 9.30/9.73 New demodulators BS 17
% 9.30/9.73 Back demodulated BS 0
% 9.30/9.73
% 9.30/9.73 Clauses or pairs given 537100
% 9.30/9.73 Clauses generated 79397
% 9.30/9.73 Forward subsumed 57638
% 9.30/9.73 Deleted by weight 0
% 9.30/9.73 Deleted by variable count 0
% 9.30/9.73 Kept 21759
% 9.30/9.73 New demodulators 16266
% 9.30/9.73 Back demodulated 1952
% 9.30/9.73 Ordered paramod prunes 0
% 9.30/9.73 Basic paramod prunes 3300577
% 9.30/9.73 Prime paramod prunes 6945
% 9.30/9.73 Semantic prunes 0
% 9.30/9.73
% 9.30/9.73 Rewrite attmepts 1719696
% 9.30/9.73 Rewrites 223821
% 9.30/9.73
% 9.30/9.73 FPA overloads 0
% 9.30/9.73 FPA underloads 0
% 9.30/9.73
% 9.30/9.73 Usable size 0
% 9.30/9.73 Sos size 19827
% 9.30/9.73 Demodulators size 15191
% 9.30/9.73 Passive size 0
% 9.30/9.73 Disabled size 1952
% 9.30/9.73
% 9.30/9.73 Proofs found 0
% 9.30/9.73
% 9.30/9.73 ----------- times (seconds) ----------- Mon Jun 13 08:31:38 2022
% 9.30/9.73
% 9.30/9.73 user CPU time 6.56 (0 hr, 0 min, 6 sec)
% 9.30/9.73 system CPU time 2.09 (0 hr, 0 min, 2 sec)
% 9.30/9.73 wall-clock time 8 (0 hr, 0 min, 8 sec)
% 9.30/9.73 input time 0.00
% 9.30/9.73 paramodulation time 0.78
% 9.30/9.73 demodulation time 0.52
% 9.30/9.73 orient time 0.13
% 9.30/9.73 weigh time 0.03
% 9.30/9.73 forward subsume time 0.09
% 9.30/9.73 back demod find time 0.57
% 9.30/9.73 conflict time 0.01
% 9.30/9.73 LRPO time 0.06
% 9.30/9.73 store clause time 3.44
% 9.30/9.73 disable clause time 0.26
% 9.30/9.73 prime paramod time 0.12
% 9.30/9.73 semantics time 0.00
% 9.30/9.73
% 9.30/9.73 EQP interrupted
%------------------------------------------------------------------------------