TSTP Solution File: MGT038-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : MGT038-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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 : Sun Jul 17 22:07:26 EDT 2022
% Result : Unknown 0.69s 1.11s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT038-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 08:24:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.11 ----- EQP 0.9e, May 2009 -----
% 0.69/1.11 The job began on n025.cluster.edu, Thu Jun 9 08:24:06 2022
% 0.69/1.11 The command was "./eqp09e".
% 0.69/1.11
% 0.69/1.11 set(prolog_style_variables).
% 0.69/1.11 set(lrpo).
% 0.69/1.11 set(basic_paramod).
% 0.69/1.11 set(functional_subsume).
% 0.69/1.11 set(ordered_paramod).
% 0.69/1.11 set(prime_paramod).
% 0.69/1.11 set(para_pairs).
% 0.69/1.11 assign(pick_given_ratio,4).
% 0.69/1.11 clear(print_kept).
% 0.69/1.11 clear(print_new_demod).
% 0.69/1.11 clear(print_back_demod).
% 0.69/1.11 clear(print_given).
% 0.69/1.11 assign(max_mem,64000).
% 0.69/1.11 end_of_commands.
% 0.69/1.11
% 0.69/1.11 Usable:
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Sos:
% 0.69/1.11 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.69/1.11 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.69/1.11 0 (wt=-1) [] finite_set(first_movers) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq(environment(A),true,ifeq(stable(A),true,in_environment(A,appear(first_movers,A)),true),true) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq(finite_set(A),true,ifeq(contracts_from(B,A),true,greater(sk1(B,A),B),true),true) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq2(finite_set(A),true,ifeq2(contracts_from(B,A),true,cardinality_at_time(s,t2),zero),zero) = zero.
% 0.69/1.11 0 (wt=-1) [] ifeq(greater(A,B),true,ifeq(in_environment(C,B),true,ifeq(environment(C),true,ifeq(stable(C),true,in_environment(C,A),true),true),true),true) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq(greater(A,B),true,ifeq(greater(C,A),true,greater(C,B),true),true) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq(environment(A),true,ifeq(stable(A),true,greater(sk2(A),appear(efficient_producers,A)),true),true) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq(environment(A),true,ifeq(stable(A),true,contracts_from(sk2(A),first_movers),true),true) = true.
% 0.69/1.11 0 (wt=-1) [] ifeq(environment(A),true,greater(appear(efficient_producers,e),appear(first_movers,A)),true) = true.
% 0.69/1.11 0 (wt=-1) [] environment(sk3) = true.
% 0.69/1.11 0 (wt=-1) [] stable(sk3) = true.
% 0.69/1.11 0 (wt=-1) [] -(tuple(cardinality_at_time(first_movers,to),in_environment(sk3,A),greater(A,appear(first_movers,sk3))) = tuple(zero,true,true)).
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Demodulators:
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Passive:
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Starting to process input.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.69/1.11 1 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.11 2 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 3 (wt=4) [] finite_set(first_movers) = true.
% 0.69/1.11 3 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 4 (wt=17) [] ifeq(environment(A),true,ifeq(stable(A),true,in_environment(A,appear(first_movers,A)),true),true) = true.
% 0.69/1.11 4 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 5 (wt=18) [] ifeq(finite_set(A),true,ifeq(contracts_from(B,A),true,greater(sk1(B,A),B),true),true) = true.
% 0.69/1.11 5 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 6 (wt=16) [] ifeq2(finite_set(A),true,ifeq2(contracts_from(B,A),true,cardinality_at_time(s,t2),zero),zero) = zero.
% 0.69/1.11 6 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 7 (wt=27) [] ifeq(greater(A,B),true,ifeq(in_environment(C,B),true,ifeq(environment(C),true,ifeq(stable(C),true,in_environment(C,A),true),true),true),true) = true.
% 0.69/1.11 7 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 8 (wt=17) [] ifeq(greater(A,B),true,ifeq(greater(C,A),true,greater(C,B),true),true) = true.
% 0.69/1.11 8 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 9 (wt=18) [] ifeq(environment(A),true,ifeq(stable(A),true,greater(sk2(A),appear(efficient_producers,A)),true),true) = true.
% 0.69/1.11 9 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 10 (wt=16) [] ifeq(environment(A),true,ifeq(stable(A),true,contracts_from(sk2(A),first_movers),true),true) = true.
% 0.69/1.11 10 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 11 (wt=14) [] ifeq(environment(A),true,greater(appear(efficient_producers,e),appear(first_movers,A)),true) = true.
% 0.69/1.11 11 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 12 (wt=4) [] environment(sk3) = true.
% 0.69/1.11 12 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 13 (wt=4) [] stable(sk3) = true.
% 0.69/1.11 13 is a new demodulator.
% 0.69/1.11
% 0.69/1.11 ** KEPT: 14 (wt=17) [] -(tuple(cardinality_at_time(first_movers,to),in_environment(sk3,A),greater(A,appear(first_movers,sk3))) = tuple(zero,true,true)).
% 0.69/1.11
% 0.69/1.11 no more inferences to make.
% 0.69/1.11
% 0.69/1.11 After processing input:
% 0.69/1.11
% 0.69/1.11 Usable:
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Sos:
% 0.69/1.11 3 (wt=4) [] finite_set(first_movers) = true.
% 0.69/1.11 12 (wt=4) [] environment(sk3) = true.
% 0.69/1.11 13 (wt=4) [] stable(sk3) = true.
% 0.69/1.11 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.69/1.11 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.11 11 (wt=14) [] ifeq(environment(A),true,greater(appear(efficient_producers,e),appear(first_movers,A)),true) = true.
% 0.69/1.11 6 (wt=16) [] ifeq2(finite_set(A),true,ifeq2(contracts_from(B,A),true,cardinality_at_time(s,t2),zero),zero) = zero.
% 0.69/1.11 10 (wt=16) [] ifeq(environment(A),true,ifeq(stable(A),true,contracts_from(sk2(A),first_movers),true),true) = true.
% 0.69/1.11 4 (wt=17) [] ifeq(environment(A),true,ifeq(stable(A),true,in_environment(A,appear(first_movers,A)),true),true) = true.
% 0.69/1.11 8 (wt=17) [] ifeq(greater(A,B),true,ifeq(greater(C,A),true,greater(C,B),true),true) = true.
% 0.69/1.11 14 (wt=17) [] -(tuple(cardinality_at_time(first_movers,to),in_environment(sk3,A),greater(A,appear(first_movers,sk3))) = tuple(zero,true,true)).
% 0.69/1.11 5 (wt=18) [] ifeq(finite_set(A),true,ifeq(contracts_from(B,A),true,greater(sk1(B,A),B),true),true) = true.
% 0.69/1.11 9 (wt=18) [] ifeq(environment(A),true,ifeq(stable(A),true,greater(sk2(A),appear(efficient_producers,A)),true),true) = true.
% 0.69/1.11 7 (wt=27) [] ifeq(greater(A,B),true,ifeq(in_environment(C,B),true,ifeq(environment(C),true,ifeq(stable(C),true,in_environment(C,A),true),true),true),true) = true.
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Demodulators:
% 0.69/1.11 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.69/1.11 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.11 3 (wt=4) [] finite_set(first_movers) = true.
% 0.69/1.11 4 (wt=17) [] ifeq(environment(A),true,ifeq(stable(A),true,in_environment(A,appear(first_movers,A)),true),true) = true.
% 0.69/1.11 5 (wt=18) [] ifeq(finite_set(A),true,ifeq(contracts_from(B,A),true,greater(sk1(B,A),B),true),true) = true.
% 0.69/1.11 6 (wt=16) [] ifeq2(finite_set(A),true,ifeq2(contracts_from(B,A),true,cardinality_at_time(s,t2),zero),zero) = zero.
% 0.69/1.11 7 (wt=27) [] ifeq(greater(A,B),true,ifeq(in_environment(C,B),true,ifeq(environment(C),true,ifeq(stable(C),true,in_environment(C,A),true),true),true),true) = true.
% 0.69/1.11 8 (wt=17) [] ifeq(greater(A,B),true,ifeq(greater(C,A),true,greater(C,B),true),true) = true.
% 0.69/1.11 9 (wt=18) [] ifeq(environment(A),true,ifeq(stable(A),true,greater(sk2(A),appear(efficient_producers,A)),true),true) = true.
% 0.69/1.11 10 (wt=16) [] ifeq(environment(A),true,ifeq(stable(A),true,contracts_from(sk2(A),first_movers),true),true) = true.
% 0.69/1.11 11 (wt=14) [] ifeq(environment(A),true,greater(appear(efficient_producers,e),appear(first_movers,A)),true) = true.
% 0.69/1.11 12 (wt=4) [] environment(sk3) = true.
% 0.69/1.11 13 (wt=4) [] stable(sk3) = true.
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 Passive:
% 0.69/1.11 end_of_list.
% 0.69/1.11
% 0.69/1.11 no more inferences to make.
% 0.69/1.11
% 0.69/1.11 ------------- memory usage ------------
% 0.69/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.11 type (bytes each) gets frees in use avail bytes
% 0.69/1.11 sym_ent ( 96) 73 0 73 0 6.8 K
% 0.69/1.11 term ( 16) 5130 4268 862 35 17.3 K
% 0.69/1.11 gen_ptr ( 8) 4374 992 3382 11 26.5 K
% 0.69/1.11 context ( 808) 56254 56254 0 4 3.2 K
% 0.69/1.11 trail ( 12) 48 48 0 3 0.0 K
% 0.69/1.11 bt_node ( 68) 36856 36856 0 25 1.7 K
% 0.69/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.11 ac_match_free_vars_pos (4020)
% 0.69/1.11 0 0 0 0 0.0 K
% 0.69/1.11 discrim ( 12) 1059 52 1007 0 11.8 K
% 0.69/1.11 flat ( 40) 5386 5386 0 23 0.9 K
% 0.69/1.11 discrim_pos ( 12) 249 249 0 1 0.0 K
% 0.69/1.11 fpa_head ( 12) 563 0 563 0 6.6 K
% 0.69/1.11 fpa_tree ( 28) 629 629 0 25 0.7 K
% 0.69/1.11 fpa_pos ( 36) 118 118 0 1 0.0 K
% 0.69/1.11 literal ( 12) 248 187 61 1 0.7 K
% 0.69/1.11 clause ( 24) 248 187 61 1 1.5 K
% 0.69/1.11 list ( 12) 116 60 56 3 0.7 K
% 0.69/1.11 list_pos ( 20) 260 28 232 0 4.5 K
% 0.69/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.11
% 0.69/1.11 -------------- statistics -------------
% 0.69/1.11 Clauses input 14
% 0.69/1.11 Usable input 0
% 0.69/1.11 Sos input 14
% 0.69/1.11 Demodulators input 0
% 0.69/1.11 Passive input 0
% 0.69/1.11
% 0.69/1.11 Processed BS (before search) 14
% 0.69/1.11 Forward subsumed BS 0
% 0.69/1.11 Kept BS 14
% 0.69/1.11 New demodulators BS 13
% 0.69/1.11 Back demodulated BS 0
% 0.69/1.11
% 0.69/1.11 Clauses or pairs given 1733
% 0.69/1.11 Clauses generated 177
% 0.69/1.11 Forward subsumed 130
% 0.69/1.11 Deleted by weight 0
% 0.69/1.11 Deleted by variable count 0
% 0.69/1.11 Kept 47
% 0.69/1.11 New demodulators 44
% 0.69/1.11 Back demodulated 3
% 0.69/1.11 Ordered paramod prunes 0
% 0.69/1.11 Basic paramod prunes 4793
% 0.69/1.11 Prime paramod prunes 0
% 0.69/1.11 Semantic prunes 0
% 0.69/1.11
% 0.69/1.11 Rewrite attmepts 2365
% 0.69/1.11 Rewrites 248
% 0.69/1.11
% 0.69/1.11 FPA overloads 0
% 0.69/1.11 FPA underloads 0
% 0.69/1.11
% 0.69/1.11 Usable size 0
% 0.69/1.11 Sos size 58
% 0.69/1.11 Demodulators size 55
% 0.69/1.11 Passive size 0
% 0.69/1.11 Disabled size 3
% 0.69/1.11
% 0.69/1.11 Proofs found 0
% 0.69/1.11
% 0.69/1.11 ----------- times (seconds) ----------- Thu Jun 9 08:24:06 2022
% 0.69/1.11
% 0.69/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.69/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.11 input time 0.00
% 0.69/1.11 paramodulation time 0.00
% 0.69/1.11 demodulation time 0.00
% 0.69/1.11 orient time 0.00
% 0.69/1.11 weigh time 0.00
% 0.69/1.11 forward subsume time 0.00
% 0.69/1.11 back demod find time 0.00
% 0.69/1.11 conflict time 0.00
% 0.69/1.11 LRPO time 0.00
% 0.69/1.11 store clause time 0.00
% 0.69/1.11 disable clause time 0.00
% 0.69/1.11 prime paramod time 0.00
% 0.69/1.11 semantics time 0.00
% 0.69/1.11
% 0.69/1.11 EQP interrupted
%------------------------------------------------------------------------------