TSTP Solution File: GRP180-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP180-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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 13.62s 14.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : GRP180-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.08 % Command : tptp2X_and_run_eqp %s
% 0.07/0.27 % Computer : n019.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Tue Jun 14 14:03:54 EDT 2022
% 0.07/0.27 % CPUTime :
% 13.62/14.07 ----- EQP 0.9e, May 2009 -----
% 13.62/14.07 The job began on n019.cluster.edu, Tue Jun 14 14:03:55 2022
% 13.62/14.07 The command was "./eqp09e".
% 13.62/14.07
% 13.62/14.07 set(prolog_style_variables).
% 13.62/14.07 set(lrpo).
% 13.62/14.07 set(basic_paramod).
% 13.62/14.07 set(functional_subsume).
% 13.62/14.07 set(ordered_paramod).
% 13.62/14.07 set(prime_paramod).
% 13.62/14.07 set(para_pairs).
% 13.62/14.07 assign(pick_given_ratio,4).
% 13.62/14.07 clear(print_kept).
% 13.62/14.07 clear(print_new_demod).
% 13.62/14.07 clear(print_back_demod).
% 13.62/14.07 clear(print_given).
% 13.62/14.07 assign(max_mem,64000).
% 13.62/14.07 end_of_commands.
% 13.62/14.07
% 13.62/14.07 Usable:
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Sos:
% 13.62/14.07 0 (wt=-1) [] multiply(identity,A) = A.
% 13.62/14.07 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 13.62/14.07 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.62/14.07 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 13.62/14.07 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 13.62/14.07 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 13.62/14.07 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 13.62/14.07 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 13.62/14.07 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 13.62/14.07 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.62/14.07 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.62/14.07 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 0 (wt=-1) [] -(multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) = least_upper_bound(a,b)).
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Demodulators:
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Passive:
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Starting to process input.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 13.62/14.07 1 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.62/14.07 2 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.62/14.07 3 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 13.62/14.07 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 13.62/14.07
% 13.62/14.07 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 13.62/14.07 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 13.62/14.07
% 13.62/14.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)).
% 13.62/14.07 6 is a new demodulator.
% 13.62/14.07
% 13.62/14.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)).
% 13.62/14.07 7 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.62/14.07 8 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.62/14.07 9 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.62/14.07 10 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.62/14.07 11 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 12 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 13 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 14 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 15 is a new demodulator.
% 13.62/14.07
% 13.62/14.07 ** KEPT: 16 (wt=12) [] -(multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) = least_upper_bound(a,b)).
% 13.62/14.07
% 13.62/14.07 After processing input:
% 13.62/14.07
% 13.62/14.07 Usable:
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Sos:
% 13.62/14.07 1 (wt=5) [] multiply(identity,A) = A.
% 13.62/14.07 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.62/14.07 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.62/14.07 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.62/14.07 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 13.62/14.07 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 13.62/14.07 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.62/14.07 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.62/14.07 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.62/14.07 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 13.62/14.07 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 13.62/14.07 16 (wt=12) [] -(multiply(a,multiply(inverse(greatest_lower_bound(a,b)),b)) = least_upper_bound(a,b)).
% 13.62/14.07 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Demodulators:
% 13.62/14.07 1 (wt=5) [] multiply(identity,A) = A.
% 13.62/14.07 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 13.62/14.07 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 13.62/14.07 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 13.62/14.07 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 13.62/14.07 8 (wt=5) [] least_upper_bound(A,A) = A.
% 13.62/14.07 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 13.62/14.07 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 13.62/14.07 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 13.62/14.07 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 13.62/14.07 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 Passive:
% 13.62/14.07 end_of_list.
% 13.62/14.07
% 13.62/14.07 ------------- memory usage ------------
% 13.62/14.07 Memory dynamically allocated (tp_alloc): 63964.
% 13.62/14.07 type (bytes each) gets frees in use avail bytes
% 13.62/14.07 sym_ent ( 96) 58 0 58 0 5.4 K
% 13.62/14.07 term ( 16) 5556684 4704587 852097 52 16537.4 K
% 13.62/14.07 gen_ptr ( 8) 4904657 656319 4248338 0 33190.1 K
% 13.62/14.07 context ( 808) 4687292 4687290 2 7 7.1 K
% 13.62/14.07 trail ( 12) 744915 744915 0 7 0.1 K
% 13.62/14.07 bt_node ( 68) 2030426 2030423 3 29 2.1 K
% 13.62/14.07 ac_position (285432) 0 0 0 0 0.0 K
% 13.62/14.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 13.62/14.07 ac_match_free_vars_pos (4020)
% 13.62/14.07 0 0 0 0 0.0 K
% 13.62/14.07 discrim ( 12) 746096 20125 725971 0 8507.5 K
% 13.62/14.07 flat ( 40) 12101557 12101557 0 228 8.9 K
% 13.62/14.07 discrim_pos ( 12) 248885 248885 0 1 0.0 K
% 13.62/14.07 fpa_head ( 12) 47919 0 47919 0 561.6 K
% 13.62/14.07 fpa_tree ( 28) 153397 153397 0 83 2.3 K
% 13.62/14.07 fpa_pos ( 36) 49405 49405 0 1 0.0 K
% 13.62/14.07 literal ( 12) 165650 138481 27169 1 318.4 K
% 13.62/14.07 clause ( 24) 165650 138481 27169 1 636.8 K
% 13.62/14.07 list ( 12) 22295 22239 56 3 0.7 K
% 13.62/14.07 list_pos ( 20) 106284 5466 100818 0 1969.1 K
% 13.62/14.07 pair_index ( 40) 2 0 2 0 0.1 K
% 13.62/14.07
% 13.62/14.07 --------------
% 13.62/14.07
% 13.62/14.07 ********** ABNORMAL END **********
% 13.62/14.07 ********** in tp_alloc, max_mem parameter exceeded.
% 13.62/14.07 statistics -------------
% 13.62/14.07 Clauses input 16
% 13.62/14.07 Usable input 0
% 13.62/14.07 Sos input 16
% 13.62/14.07 Demodulators input 0
% 13.62/14.07 Passive input 0
% 13.62/14.07
% 13.62/14.07 Processed BS (before search) 18
% 13.62/14.07 Forward subsumed BS 2
% 13.62/14.07 Kept BS 16
% 13.62/14.07 New demodulators BS 13
% 13.62/14.07 Back demodulated BS 0
% 13.62/14.08
% 13.62/14.08 Clauses or pairs given 380030
% 13.62/14.08 Clauses generated 116551
% 13.62/14.08 Forward subsumed 89398
% 13.62/14.08 Deleted by weight 0
% 13.62/14.08 Deleted by variable count 0
% 13.62/14.08 Kept 27153
% 13.62/14.08 New demodulators 22224
% 13.62/14.08 Back demodulated 1260
% 13.62/14.08 Ordered paramod prunes 0
% 13.62/14.08 Basic paramod prunes 2289276
% 13.62/14.08 Prime paramod prunes 9807
% 13.62/14.08 Semantic prunes 0
% 13.62/14.08
% 13.62/14.08 Rewrite attmepts 1769817
% 13.62/14.08 Rewrites 223404
% 13.62/14.08
% 13.62/14.08 FPA overloads 0
% 13.62/14.08 FPA underloads 0
% 13.62/14.08
% 13.62/14.08 Usable size 0
% 13.62/14.08 Sos size 25909
% 13.62/14.08 Demodulators size 21831
% 13.62/14.08 Passive size 0
% 13.62/14.08 Disabled size 1260
% 13.62/14.08
% 13.62/14.08 Proofs found 0
% 13.62/14.08
% 13.62/14.08 ----------- times (seconds) ----------- Tue Jun 14 14:04:08 2022
% 13.62/14.08
% 13.62/14.08 user CPU time 10.64 (0 hr, 0 min, 10 sec)
% 13.62/14.08 system CPU time 2.36 (0 hr, 0 min, 2 sec)
% 13.62/14.08 wall-clock time 13 (0 hr, 0 min, 13 sec)
% 13.62/14.08 input time 0.00
% 13.62/14.08 paramodulation time 0.74
% 13.62/14.08 demodulation time 0.56
% 13.62/14.08 orient time 0.23
% 13.62/14.08 weigh time 0.05
% 13.62/14.08 forward subsume time 0.13
% 13.62/14.08 back demod find time 1.71
% 13.62/14.08 conflict time 0.02
% 13.62/14.08 LRPO time 0.11
% 13.62/14.08 store clause time 6.15
% 13.62/14.08 disable clause time 0.35
% 13.62/14.08 prime paramod time 0.16
% 13.62/14.08 semantics time 0.00
% 13.62/14.08
% 13.62/14.08 EQP interrupted
%------------------------------------------------------------------------------