TSTP Solution File: GRP181-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP181-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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 11.32s 11.67s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP181-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 17:44:03 EDT 2022
% 0.15/0.35 % CPUTime :
% 11.29/11.67 ----- EQP 0.9e, May 2009 -----
% 11.29/11.67 The job began on n024.cluster.edu, Mon Jun 13 17:44:04 2022
% 11.29/11.67 The command was "./eqp09e".
% 11.29/11.67
% 11.29/11.67 set(prolog_style_variables).
% 11.29/11.67 set(lrpo).
% 11.29/11.67 set(basic_paramod).
% 11.29/11.67 set(functional_subsume).
% 11.29/11.67 set(ordered_paramod).
% 11.29/11.67 set(prime_paramod).
% 11.29/11.67 set(para_pairs).
% 11.29/11.67 assign(pick_given_ratio,4).
% 11.29/11.67 clear(print_kept).
% 11.29/11.67 clear(print_new_demod).
% 11.29/11.67 clear(print_back_demod).
% 11.29/11.67 clear(print_given).
% 11.29/11.67 assign(max_mem,64000).
% 11.29/11.67 end_of_commands.
% 11.29/11.67
% 11.29/11.67 Usable:
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Sos:
% 11.29/11.67 0 (wt=-1) [] multiply(identity,A) = A.
% 11.29/11.67 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 11.29/11.67 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.29/11.67 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.29/11.67 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.29/11.67 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 11.29/11.67 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 11.29/11.67 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 11.29/11.67 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 11.29/11.67 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.29/11.67 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.29/11.67 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 0 (wt=-1) [] greatest_lower_bound(a,c) = greatest_lower_bound(b,c).
% 11.29/11.67 0 (wt=-1) [] least_upper_bound(a,c) = least_upper_bound(b,c).
% 11.29/11.67 0 (wt=-1) [] -(a = b).
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Demodulators:
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Passive:
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Starting to process input.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 11.29/11.67 1 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.29/11.67 2 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.29/11.67 3 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.29/11.67 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 11.29/11.67
% 11.29/11.67 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.29/11.67 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 11.29/11.67
% 11.29/11.67 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.29/11.67 6 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.29/11.67 7 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.29/11.67 8 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.29/11.67 9 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.29/11.67 10 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.29/11.67 11 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 12 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 13 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 14 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 15 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 16 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 11.29/11.67 16 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 17 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 11.29/11.67 17 is a new demodulator.
% 11.29/11.67
% 11.29/11.67 ** KEPT: 18 (wt=3) [flip(1)] -(b = a).
% 11.29/11.67
% 11.29/11.67 After processing input:
% 11.29/11.67
% 11.29/11.67 Usable:
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Sos:
% 11.29/11.67 18 (wt=3) [flip(1)] -(b = a).
% 11.29/11.67 1 (wt=5) [] multiply(identity,A) = A.
% 11.29/11.67 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.29/11.67 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.29/11.67 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.29/11.67 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.29/11.67 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.29/11.67 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.29/11.67 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.29/11.67 16 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 11.29/11.67 17 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 11.29/11.67 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.29/11.67 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.29/11.67 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.29/11.67 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Demodulators:
% 11.29/11.67 1 (wt=5) [] multiply(identity,A) = A.
% 11.29/11.67 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.29/11.67 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.29/11.67 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.29/11.67 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.29/11.67 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.29/11.67 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.29/11.67 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.29/11.67 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.29/11.67 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.29/11.67 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.29/11.67 16 (wt=7) [flip(1)] greatest_lower_bound(b,c) = greatest_lower_bound(a,c).
% 11.29/11.67 17 (wt=7) [flip(1)] least_upper_bound(b,c) = least_upper_bound(a,c).
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 Passive:
% 11.29/11.67 end_of_list.
% 11.29/11.67
% 11.29/11.67 ------------- memory usage ------------
% 11.29/11.67 Memory dynamically allocated (tp_alloc): 63964.
% 11.29/11.67 type (bytes each) gets frees in use avail bytes
% 11.29/11.67 sym_ent ( 96) 59 0 59 0 5.5 K
% 11.29/11.67 term ( 16) 5481335 4674976 806359 0 15654.0 K
% 11.29/11.67 gen_ptr ( 8) 4954280 649314 4304966 0 33632.5 K
% 11.29/11.67 context ( 808) 6180194 6180191 3 6 7.1 K
% 11.29/11.67 trail ( 12) 899409 899409 0 7 0.1 K
% 11.29/11.67 bt_node ( 68) 2976865 2976862 3 88 6.0 K
% 11.29/11.67 ac_position (285432) 0 0 0 0 0.0 K
% 11.29/11.67 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.29/11.67 ac_match_free_vars_pos (4020)
% 11.29/11.67 0 0 0 0 0.0 K
% 11.29/11.67 discrim ( 12) 784958 24898 760060 0 8907.0 K
% 11.29/11.67 flat ( 40) 12191311 12191306 5 223 8.9 K
% 11.29/11.67 discrim_pos ( 12) 255170 255169 1 0 0.0 K
% 11.29/11.67 fpa_head ( 12) 49577 0 49577 0 581.0 K
% 11.29/11.67 fpa_tree ( 28) 189340 189340 0 83 2.3 K
% 11.29/11.67 fpa_pos ( 36) 43661 43661 0 1 0.0 K
% 11.29/11.67 literal ( 12) 153815 129447 24368 0 285.6 K
% 11.29/11.67 clause ( 24) 153815 129447 24368 0 571.1 K
% 11.29/11.67 list ( 12) 1935
% 11.29/11.67
% 11.29/11.67 ********** ABNORMAL END **********
% 11.29/11.67 ********** in tp_alloc, max_mem parameter exceeded.
% 11.29/11.67 3 19297 56 3 0.7 K
% 11.29/11.67 list_pos ( 20) 95883 7467 88416 0 1726.9 K
% 11.29/11.67 pair_index ( 40) 2 0 2 0 0.1 K
% 11.32/11.67
% 11.32/11.67 -------------- statistics -------------
% 11.32/11.67 Clauses input 18
% 11.32/11.67 Usable input 0
% 11.32/11.67 Sos input 18
% 11.32/11.67 Demodulators input 0
% 11.32/11.67 Passive input 0
% 11.32/11.67
% 11.32/11.67 Processed BS (before search) 20
% 11.32/11.67 Forward subsumed BS 2
% 11.32/11.67 Kept BS 18
% 11.32/11.67 New demodulators BS 15
% 11.32/11.67 Back demodulated BS 0
% 11.32/11.67
% 11.32/11.67 Clauses or pairs given 444375
% 11.32/11.67 Clauses generated 108075
% 11.32/11.67 Forward subsumed 83725
% 11.32/11.67 Deleted by weight 0
% 11.32/11.67 Deleted by variable count 0
% 11.32/11.67 Kept 24349
% 11.32/11.67 New demodulators 19279
% 11.32/11.67 Back demodulated 1735
% 11.32/11.67 Ordered paramod prunes 0
% 11.32/11.67 Basic paramod prunes 2831706
% 11.32/11.67 Prime paramod prunes 4880
% 11.32/11.67 Semantic prunes 0
% 11.32/11.67
% 11.32/11.67 Rewrite attmepts 2023497
% 11.32/11.67 Rewrites 233758
% 11.32/11.67
% 11.32/11.67 FPA overloads 0
% 11.32/11.67 FPA underloads 0
% 11.32/11.67
% 11.32/11.67 Usable size 0
% 11.32/11.67 Sos size 22632
% 11.32/11.67 Demodulators size 18785
% 11.32/11.67 Passive size 0
% 11.32/11.67 Disabled size 1735
% 11.32/11.67
% 11.32/11.67 Proofs found 0
% 11.32/11.67
% 11.32/11.67 ----------- times (seconds) ----------- Mon Jun 13 17:44:15 2022
% 11.32/11.67
% 11.32/11.67 user CPU time 8.40 (0 hr, 0 min, 8 sec)
% 11.32/11.67 system CPU time 2.19 (0 hr, 0 min, 2 sec)
% 11.32/11.67 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 11.32/11.67 input time 0.00
% 11.32/11.67 paramodulation time 0.77
% 11.32/11.67 demodulation time 0.55
% 11.32/11.67 orient time 0.20
% 11.32/11.67 weigh time 0.04
% 11.32/11.67 forward subsume time 0.11
% 11.32/11.67 back demod find time 0.82
% 11.32/11.67 conflict time 0.02
% 11.32/11.67 LRPO time 0.09
% 11.32/11.67 store clause time 4.89
% 11.32/11.67 disable clause time 0.29
% 11.32/11.67 prime paramod time 0.16
% 11.32/11.67 semantics time 0.00
% 11.32/11.67
% 11.32/11.67 EQP interrupted
%------------------------------------------------------------------------------