TSTP Solution File: GRP183-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP183-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:47 EDT 2022
% Result : Unknown 11.80s 12.20s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP183-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 12:56:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 11.80/12.19 ----- EQP 0.9e, May 2009 -----
% 11.80/12.19 The job began on n014.cluster.edu, Tue Jun 14 12:56:52 2022
% 11.80/12.19 The command was "./eqp09e".
% 11.80/12.19
% 11.80/12.19 set(prolog_style_variables).
% 11.80/12.19 set(lrpo).
% 11.80/12.19 set(basic_paramod).
% 11.80/12.19 set(functional_subsume).
% 11.80/12.19 set(ordered_paramod).
% 11.80/12.19 set(prime_paramod).
% 11.80/12.19 set(para_pairs).
% 11.80/12.19 assign(pick_given_ratio,4).
% 11.80/12.19 clear(print_kept).
% 11.80/12.19 clear(print_new_demod).
% 11.80/12.19 clear(print_back_demod).
% 11.80/12.19 clear(print_given).
% 11.80/12.19 assign(max_mem,64000).
% 11.80/12.19 end_of_commands.
% 11.80/12.19
% 11.80/12.19 Usable:
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Sos:
% 11.80/12.19 0 (wt=-1) [] multiply(identity,A) = A.
% 11.80/12.19 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 11.80/12.19 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.80/12.19 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.80/12.19 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.80/12.19 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 11.80/12.19 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 11.80/12.19 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 11.80/12.19 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 11.80/12.19 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.80/12.19 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.80/12.19 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 0 (wt=-1) [] -(greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = identity).
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Demodulators:
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Passive:
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Starting to process input.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 11.80/12.19 1 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.80/12.19 2 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.80/12.19 3 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.80/12.19 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 11.80/12.19
% 11.80/12.19 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.80/12.19 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 11.80/12.19
% 11.80/12.19 ** 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.80/12.19 6 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** 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.80/12.19 7 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.80/12.19 8 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.80/12.19 9 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.80/12.19 10 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.80/12.19 11 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 12 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 13 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 14 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 15 is a new demodulator.
% 11.80/12.19
% 11.80/12.19 ** KEPT: 16 (wt=10) [] -(greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = identity).
% 11.80/12.19
% 11.80/12.19 After processing input:
% 11.80/12.19
% 11.80/12.19 Usable:
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Sos:
% 11.80/12.19 1 (wt=5) [] multiply(identity,A) = A.
% 11.80/12.19 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.80/12.19 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.80/12.19 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.80/12.19 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.80/12.19 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.80/12.19 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.80/12.19 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.80/12.19 16 (wt=10) [] -(greatest_lower_bound(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = identity).
% 11.80/12.19 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.80/12.19 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.80/12.19 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.80/12.19 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Demodulators:
% 11.80/12.19 1 (wt=5) [] multiply(identity,A) = A.
% 11.80/12.19 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.80/12.19 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.80/12.19 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.80/12.19 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.80/12.19 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.80/12.19 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.80/12.19 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.80/12.19 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.80/12.19 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.80/12.19 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 Passive:
% 11.80/12.19 end_of_list.
% 11.80/12.19
% 11.80/12.19 ------------- memory usage ------------
% 11.80/12.19 Memory dynamically allocated (tp_alloc): 63964.
% 11.80/12.19 type (bytes each) gets frees in use avail bytes
% 11.80/12.19 sym_ent ( 96) 57 0 57 0 5.3 K
% 11.80/12.19 term ( 16) 5524735 4682651 842084 24 16345.3 K
% 11.80/12.19 gen_ptr ( 8) 4909210 643414 4265796 0 33326.5 K
% 11.80/12.19 context ( 808) 4574948 4574946 2 7 7.1 K
% 11.80/12.19 trail ( 12) 821541 821541 0 7 0.1 K
% 11.80/12.19 bt_node ( 68) 1977753 1977750 3 29 2.1 K
% 11.80/12.19 ac_position (285432) 0 0 0 0 0.0 K
% 11.80/12.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.80/12.19 ac_match_free_vars_pos (4020)
% 11.80/12.19 0 0 0 0 0.0 K
% 11.80/12.19 discrim ( 12) 754449 18782 735667 0 8621.1 K
% 11.80/12.19 flat ( 40) 12004908 12004908 0 228 8.9 K
% 11.80/12.19 discrim_pos ( 12) 248528 248528 0 1 0.0 K
% 11.80/12.19 fpa_head ( 12) 47486 0 47486 0 556.5 K
% 11.80/12.19 fpa_tree ( 28) 159451 159451 0 83 2.3 K
% 11.80/12.19 fpa_pos ( 36) 47659 47659 0 1 0.0 K
% 11.80/12.19 literal ( 12) 159626 133497 26129 1 306.2 K
% 11.80/12.19 clause ( 24) 159626 133497 26129 1 612.4 K
% 11.80/12.19 list ( 12) 21589 21533 56 3 0.7 K
% 11.80/12.19 list_pos ( 20) 102363 5272 97091 0 1896.3 K
% 11.80/12.19 pair_index ( 40) 2 0 2 0 0
% 11.80/12.19
% 11.80/12.19 ********** ABNORMAL END **********
% 11.80/12.19 ********** in tp_alloc, max_mem parameter exceeded.
% 11.80/12.19 .1 K
% 11.80/12.19
% 11.80/12.19 -------------- statistics -------------
% 11.80/12.19 Clauses input 16
% 11.80/12.19 Usable input 0
% 11.80/12.19 Sos input 16
% 11.80/12.19 Demodulators input 0
% 11.80/12.19 Passive input 0
% 11.80/12.19
% 11.80/12.19 Processed BS (before search) 18
% 11.80/12.19 Forward subsumed BS 2
% 11.80/12.19 Kept BS 16
% 11.80/12.20 New demodulators BS 13
% 11.80/12.20 Back demodulated BS 0
% 11.80/12.20
% 11.80/12.20 Clauses or pairs given 366105
% 11.80/12.20 Clauses generated 113070
% 11.80/12.20 Forward subsumed 86957
% 11.80/12.20 Deleted by weight 0
% 11.80/12.20 Deleted by variable count 0
% 11.80/12.20 Kept 26113
% 11.80/12.20 New demodulators 21517
% 11.80/12.20 Back demodulated 1214
% 11.80/12.20 Ordered paramod prunes 0
% 11.80/12.20 Basic paramod prunes 2185229
% 11.80/12.20 Prime paramod prunes 9163
% 11.80/12.20 Semantic prunes 0
% 11.80/12.20
% 11.80/12.20 Rewrite attmepts 1750519
% 11.80/12.20 Rewrites 224709
% 11.80/12.20
% 11.80/12.20 FPA overloads 0
% 11.80/12.20 FPA underloads 0
% 11.80/12.20
% 11.80/12.20 Usable size 0
% 11.80/12.20 Sos size 24915
% 11.80/12.20 Demodulators size 21132
% 11.80/12.20 Passive size 0
% 11.80/12.20 Disabled size 1214
% 11.80/12.20
% 11.80/12.20 Proofs found 0
% 11.80/12.20
% 11.80/12.20 ----------- times (seconds) ----------- Tue Jun 14 12:57:03 2022
% 11.80/12.20
% 11.80/12.20 user CPU time 9.05 (0 hr, 0 min, 9 sec)
% 11.80/12.20 system CPU time 2.09 (0 hr, 0 min, 2 sec)
% 11.80/12.20 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 11.80/12.20 input time 0.00
% 11.80/12.20 paramodulation time 0.83
% 11.80/12.20 demodulation time 0.55
% 11.80/12.20 orient time 0.24
% 11.80/12.20 weigh time 0.04
% 11.80/12.20 forward subsume time 0.11
% 11.80/12.20 back demod find time 1.11
% 11.80/12.20 conflict time 0.02
% 11.80/12.20 LRPO time 0.12
% 11.80/12.20 store clause time 5.17
% 11.80/12.20 disable clause time 0.23
% 11.80/12.20 prime paramod time 0.20
% 11.80/12.20 semantics time 0.00
% 11.80/12.20
% 11.80/12.20 EQP interrupted
%------------------------------------------------------------------------------