TSTP Solution File: GRP167-3 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP167-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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:38 EDT 2022
% Result : Unknown 11.95s 12.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP167-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 13:00:09 EDT 2022
% 0.14/0.36 % CPUTime :
% 11.91/12.30 ----- EQP 0.9e, May 2009 -----
% 11.91/12.30 The job began on n005.cluster.edu, Mon Jun 13 13:00:09 2022
% 11.91/12.30 The command was "./eqp09e".
% 11.91/12.30
% 11.91/12.30 set(prolog_style_variables).
% 11.91/12.30 set(lrpo).
% 11.91/12.30 set(basic_paramod).
% 11.91/12.30 set(functional_subsume).
% 11.91/12.30 set(ordered_paramod).
% 11.91/12.30 set(prime_paramod).
% 11.91/12.30 set(para_pairs).
% 11.91/12.30 assign(pick_given_ratio,4).
% 11.91/12.30 clear(print_kept).
% 11.91/12.30 clear(print_new_demod).
% 11.91/12.30 clear(print_back_demod).
% 11.91/12.30 clear(print_given).
% 11.91/12.30 assign(max_mem,64000).
% 11.91/12.30 end_of_commands.
% 11.91/12.30
% 11.91/12.30 Usable:
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Sos:
% 11.91/12.30 0 (wt=-1) [] multiply(identity,A) = A.
% 11.91/12.30 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 11.91/12.30 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.91/12.30 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.91/12.30 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.91/12.30 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 11.91/12.30 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 11.91/12.30 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 11.91/12.30 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 11.91/12.30 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.91/12.30 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.91/12.30 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 0 (wt=-1) [] -(a = multiply(least_upper_bound(a,identity),greatest_lower_bound(a,identity))).
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Demodulators:
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Passive:
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Starting to process input.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 11.91/12.30 1 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.91/12.30 2 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.91/12.30 3 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.91/12.30 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 11.91/12.30
% 11.91/12.30 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.91/12.30 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 11.91/12.30
% 11.91/12.30 ** 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.91/12.30 6 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** 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.91/12.30 7 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.91/12.30 8 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.91/12.30 9 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.91/12.30 10 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.91/12.30 11 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 12 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 13 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 14 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 15 is a new demodulator.
% 11.91/12.30
% 11.91/12.30 ** KEPT: 16 (wt=13) [demod([13,14,1,14,1]),flip(1)] -(greatest_lower_bound(least_upper_bound(multiply(a,a),a),least_upper_bound(multiply(a,identity),identity)) = a).
% 11.91/12.30
% 11.91/12.30 After processing input:
% 11.91/12.30
% 11.91/12.30 Usable:
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Sos:
% 11.91/12.30 1 (wt=5) [] multiply(identity,A) = A.
% 11.91/12.30 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.91/12.30 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.91/12.30 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.91/12.30 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 11.91/12.30 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 11.91/12.30 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.91/12.30 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.91/12.30 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.91/12.30 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.91/12.30 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.91/12.30 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 16 (wt=13) [demod([13,14,1,14,1]),flip(1)] -(greatest_lower_bound(least_upper_bound(multiply(a,a),a),least_upper_bound(multiply(a,identity),identity)) = a).
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Demodulators:
% 11.91/12.30 1 (wt=5) [] multiply(identity,A) = A.
% 11.91/12.30 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 11.91/12.30 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 11.91/12.30 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 11.91/12.30 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 11.91/12.30 8 (wt=5) [] least_upper_bound(A,A) = A.
% 11.91/12.30 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 11.91/12.30 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 11.91/12.30 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 11.91/12.30 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 11.91/12.30 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 Passive:
% 11.91/12.30 end_of_list.
% 11.91/12.30
% 11.91/12.30 ------------- memory usage ------------
% 11.91/12.30 Memory dynamically allocated (tp_alloc): 63964.
% 11.91/12.30 type (bytes each) gets frees in use avail bytes
% 11.91/12.30 sym_ent ( 96) 57 0 57 0 5.3 K
% 11.91/12.30 term ( 16) 5457878 4634280 823598 3 15991.2 K
% 11.91/12.30 gen_ptr ( 8) 4924624 607522 4317102 0 33727.4 K
% 11.91/12.30 context ( 808) 4364955 4364952 3 6 7.1 K
% 11.91/12.30 trail ( 12) 890872 890872 0 7 0.1 K
% 11.91/12.30 bt_node ( 68) 1859236 1859233 3 29 2.1 K
% 11.91/12.30 ac_position (285432) 0 0 0 0 0.0 K
% 11.91/12.30 ac_match_pos (14044) 0 0 0 0 0.0 K
% 11.91/12.30 ac_match_free_vars_pos (4020)
% 11.91/12.30 0 0 0 0 0.0 K
% 11.91/12.30 discrim ( 12) 765752 16682 749070 0 8778.2 K
% 11.91/12.30 flat ( 40) 11811350 11811345 5 223 8.9 K
% 11.91/12.30 discrim_pos ( 12) 245542 245541 1 0 0.0 K
% 11.91/12.30 fpa_head ( 12) 44869 0 44869 0 525.8 K
% 11.91/12.30 fpa_tree ( 28) 164748 164748 0 83 2.3 K
% 11.91/12.30 fpa_pos ( 36) 44119 44119 0 1 0.0 K
% 11.91/12.30 literal ( 12) 148557 124304 24253 0 284.2 K
% 11.91/12.30 clause ( 24) 148557 124304 24253 0 568.4 K
% 11.91/12.30 list ( 12) 19926 19870 56 3 0.7 K
% 11.91/12.30 list_pos ( 20) 94739 4566 90173 0 1761.2 K
% 11.91/12.30 pair_index ( 40) 2
% 11.91/12.30
% 11.91/12.30 ********** ABNORMAL END **********
% 11.91/12.30 ********** in tp_alloc, max_mem parameter exceeded.
% 11.91/12.30 0 2 0 0.1 K
% 11.91/12.30
% 11.91/12.30 -------------- statistics -------------
% 11.91/12.30 Clauses input 16
% 11.91/12.30 Usable input 0
% 11.91/12.30 Sos input 16
% 11.91/12.30 Demodulators input 0
% 11.91/12.30 Passive input 0
% 11.91/12.30
% 11.91/12.30 Processed BS (before search) 18
% 11.91/12.31 Forward subsumed BS 2
% 11.91/12.31 Kept BS 16
% 11.91/12.31 New demodulators BS 13
% 11.91/12.31 Back demodulated BS 0
% 11.91/12.31
% 11.91/12.31 Clauses or pairs given 335955
% 11.91/12.31 Clauses generated 105337
% 11.91/12.31 Forward subsumed 81100
% 11.91/12.31 Deleted by weight 0
% 11.91/12.31 Deleted by variable count 0
% 11.91/12.31 Kept 24236
% 11.91/12.31 New demodulators 19854
% 11.91/12.31 Back demodulated 1049
% 11.91/12.31 Ordered paramod prunes 0
% 11.91/12.31 Basic paramod prunes 1992959
% 11.91/12.31 Prime paramod prunes 8925
% 11.91/12.31 Semantic prunes 0
% 11.91/12.31
% 11.91/12.31 Rewrite attmepts 1707165
% 11.91/12.31 Rewrites 222830
% 11.91/12.31
% 11.91/12.31 FPA overloads 0
% 11.91/12.31 FPA underloads 0
% 11.91/12.31
% 11.91/12.31 Usable size 0
% 11.91/12.31 Sos size 23203
% 11.91/12.31 Demodulators size 19515
% 11.91/12.31 Passive size 0
% 11.91/12.31 Disabled size 1049
% 11.91/12.31
% 11.91/12.31 Proofs found 0
% 11.91/12.31
% 11.91/12.31 ----------- times (seconds) ----------- Mon Jun 13 13:00:21 2022
% 11.91/12.31
% 11.91/12.31 user CPU time 9.31 (0 hr, 0 min, 9 sec)
% 11.91/12.31 system CPU time 1.86 (0 hr, 0 min, 1 sec)
% 11.91/12.31 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 11.91/12.31 input time 0.00
% 11.91/12.31 paramodulation time 0.71
% 11.91/12.31 demodulation time 0.57
% 11.91/12.31 orient time 0.20
% 11.91/12.31 weigh time 0.03
% 11.91/12.31 forward subsume time 0.13
% 11.91/12.31 back demod find time 1.50
% 11.91/12.31 conflict time 0.02
% 11.91/12.31 LRPO time 0.08
% 11.91/12.31 store clause time 5.23
% 11.91/12.31 disable clause time 0.23
% 11.91/12.31 prime paramod time 0.17
% 11.91/12.31 semantics time 0.00
% 11.91/12.31
% 11.91/12.31 EQP interrupted
%------------------------------------------------------------------------------