TSTP Solution File: GRP177-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP177-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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 10.08s 10.49s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : GRP177-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 19:04:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.70/1.10 ----- EQP 0.9e, May 2009 -----
% 0.70/1.10 The job began on n010.cluster.edu, Mon Jun 13 19:04:40 2022
% 0.70/1.10 The command was "./eqp09e".
% 0.70/1.10
% 0.70/1.10 set(prolog_style_variables).
% 0.70/1.10 set(lrpo).
% 0.70/1.10 set(basic_paramod).
% 0.70/1.10 set(functional_subsume).
% 0.70/1.10 set(ordered_paramod).
% 0.70/1.10 set(prime_paramod).
% 0.70/1.10 set(para_pairs).
% 0.70/1.10 assign(pick_given_ratio,4).
% 0.70/1.10 clear(print_kept).
% 0.70/1.10 clear(print_new_demod).
% 0.70/1.10 clear(print_back_demod).
% 0.70/1.10 clear(print_given).
% 0.70/1.10 assign(max_mem,64000).
% 0.70/1.10 end_of_commands.
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 0 (wt=-1) [] multiply(identity,A) = A.
% 0.70/1.10 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.70/1.10 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.10 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(identity,a) = a.
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(identity,b) = b.
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(identity,c) = c.
% 0.70/1.10 0 (wt=-1) [] -(least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Starting to process input.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.70/1.10 1 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.70/1.10 2 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.10 3 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.70/1.10
% 0.70/1.10 ** 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.10 6 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** 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.10 7 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.70/1.10 8 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.70/1.10 9 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.10 10 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.10 11 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 12 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 13 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 14 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 15 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.70/1.10 16 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.70/1.10 17 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 0.70/1.10 18 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 19 (wt=37) [demod([13,15,15,6,13,15,15,6])] -(least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c))))) = greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c))))).
% 10.08/10.48
% 10.08/10.48 After processing input:
% 10.08/10.48
% 10.08/10.48 Usable:
% 10.08/10.48 end_of_list.
% 10.08/10.48
% 10.08/10.48 Sos:
% 10.08/10.48 1 (wt=5) [] multiply(identity,A) = A.
% 10.08/10.48 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.08/10.48 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.08/10.48 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 10.08/10.48 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 10.08/10.48 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 10.08/10.48 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.08/10.48 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 10.08/10.48 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 10.08/10.48 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.08/10.48 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.08/10.48 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.08/10.48 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 10.08/10.48 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 10.08/10.48 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.08/10.48 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.08/10.48 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.08/10.48 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.08/10.48 19 (wt=37) [demod([13,15,15,6,13,15,15,6])] -(least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c))))) = greatest_lower_bound(multiply(a,a),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(b,c))))).
% 10.08/10.48 end_of_list.
% 10.08/10.48
% 10.08/10.48 Demodulators:
% 10.08/10.48 1 (wt=5) [] multiply(identity,A) = A.
% 10.08/10.48 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 10.08/10.48 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 10.08/10.48 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 10.08/10.48 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 10.08/10.48 8 (wt=5) [] least_upper_bound(A,A) = A.
% 10.08/10.48 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 10.08/10.48 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 10.08/10.48 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 10.08/10.48 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 10.08/10.48 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 10.08/10.48 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 10.08/10.48 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 10.08/10.48 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 10.08/10.48 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 10.08/10.48 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 10.08/10.48 end_of_list.
% 10.08/10.48
% 10.08/10.48 Passive:
% 10.08/10.48 end_of_list.
% 10.08/10.48
% 10.08/10.48 ------------- memory usage ------------
% 10.08/10.48 Memory dynamically allocated (tp_alloc): 63964.
% 10.08/10.48 type (bytes each) gets frees in use avail bytes
% 10.08/10.48 sym_ent ( 96) 59 0 59 0 5.5 K
% 10.08/10.48 term ( 16) 4815890 4024126 791764 16 15386.9 K
% 10.08/10.48 gen_ptr ( 8) 4921056 495292 4425764 0 34576.3 K
% 10.08/10.48 context ( 808) 5721164 5721162 2 7 7.1 K
% 10.08/10.48 trail ( 12) 915955 915955 0 7 0.1 K
% 10.08/10.48 bt_node ( 68) 2964842 2964839 3 88 6.0 K
% 10.08/10.48 ac_position (285432) 0 0 0 0 0.0 K
% 10.08/10.48 ac_match_pos (14044) 0 0 0 0 0.0 K
% 10.08/10.48 ac_match_free_vars_pos (4020)
% 10.08/10.48 0 0 0 0 0.0 K
% 10.08/10.48 discrim ( 12) 819232 54191 765041 0 8965.3 K
% 10.08/10.48 flat ( 40) 10815437 10815437 0 228 8.9 K
% 10.08/10.48 discrim_pos ( 12) 228002 228002 0 1 0.0 K
% 10.08/10.48 fpa_head ( 12) 44752 0 44752 0 524.4 K
% 10.08/10.48 fpa_tree ( 2
% 10.08/10.48
% 10.08/10.48 ********** ABNORMAL END **********
% 10.08/10.48 ********** in tp_alloc, max_mem parameter exceeded.
% 10.08/10.48 8) 177196 177196 0 89 2.4 K
% 10.08/10.48 fpa_pos ( 36) 34843 34843 0 1 0.0 K
% 10.08/10.48 literal ( 12) 101830 81967 19863 1 232.8 K
% 10.08/10.48 clause ( 24) 101830 81967 19863 1 465.6 K
% 10.08/10.48 list ( 12) 15039 14983 56 3 0.7 K
% 10.08/10.48 list_pos ( 20) 78332 8718 69614 0 1359.6 K
% 10.08/10.48 pair_index ( 40) 2 0 2 0 0.1 K
% 10.08/10.48
% 10.08/10.48 -------------- statistics -------------
% 10.08/10.48 Clauses input 19
% 10.08/10.48 Usable input 0
% 10.08/10.48 Sos input 19
% 10.08/10.48 Demodulators input 0
% 10.08/10.48 Passive input 0
% 10.08/10.48
% 10.08/10.48 Processed BS (before search) 21
% 10.08/10.48 Forward subsumed BS 2
% 10.08/10.48 Kept BS 19
% 10.08/10.48 New demodulators BS 16
% 10.08/10.48 Back demodulated BS 0
% 10.08/10.48
% 10.08/10.48 Clauses or pairs given 524995
% 10.08/10.48 Clauses generated 70598
% 10.08/10.48 Forward subsumed 50754
% 10.08/10.48 Deleted by weight 0
% 10.08/10.48 Deleted by variable count 0
% 10.08/10.48 Kept 19844
% 10.08/10.48 New demodulators 14964
% 10.08/10.48 Back demodulated 1869
% 10.08/10.48 Ordered paramod prunes 0
% 10.08/10.48 Basic paramod prunes 3293243
% 10.08/10.48 Prime paramod prunes 6665
% 10.08/10.48 Semantic prunes 0
% 10.08/10.48
% 10.08/10.48 Rewrite attmepts 1630569
% 10.08/10.48 Rewrites 211798
% 10.08/10.48
% 10.08/10.48 FPA overloads 0
% 10.08/10.48 FPA underloads 0
% 10.08/10.48
% 10.08/10.48 Usable size 0
% 10.08/10.48 Sos size 17994
% 10.08/10.48 Demodulators size 13763
% 10.08/10.48 Passive size 0
% 10.08/10.48 Disabled size 1869
% 10.08/10.48
% 10.08/10.48 Proofs found 0
% 10.08/10.48
% 10.08/10.48 ----------- times (seconds) ----------- Mon Jun 13 19:04:50 2022
% 10.08/10.48
% 10.08/10.48 user CPU time 7.20 (0 hr, 0 min, 7 sec)
% 10.08/10.48 system CPU time 2.18 (0 hr, 0 min, 2 sec)
% 10.08/10.48 wall-clock time 10 (0 hr, 0 min, 10 sec)
% 10.08/10.48 input time 0.00
% 10.08/10.48 paramodulation time 0.75
% 10.08/10.48 demodulation time 0.54
% 10.08/10.48 orient time 0.13
% 10.08/10.48 weigh time 0.04
% 10.08/10.48 forward subsume time 0.11
% 10.08/10.48 back demod find time 1.03
% 10.08/10.48 conflict time 0.02
% 10.08/10.48 LRPO time 0.05
% 10.08/10.48 store clause time 3.50
% 10.08/10.48 disable clause time 0.35
% 10.08/10.48 prime paramod time 0.09
% 10.08/10.48 semantics time 0.00
% 10.08/10.48
% 10.08/10.48 EQP interrupted
%------------------------------------------------------------------------------