TSTP Solution File: MGT005-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT005-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n004.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 : 300s
% DateTime : Wed Jul 27 13:05:56 EDT 2022
% Result : Timeout 299.94s 300.07s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT005-1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 04:00:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.84/2.02 ----- Otter 3.3f, August 2004 -----
% 1.84/2.02 The process was started by sandbox on n004.cluster.edu,
% 1.84/2.02 Wed Jul 27 04:00:21 2022
% 1.84/2.02 The command was "./otter". The process ID is 7223.
% 1.84/2.02
% 1.84/2.02 set(prolog_style_variables).
% 1.84/2.02 set(auto).
% 1.84/2.02 dependent: set(auto1).
% 1.84/2.02 dependent: set(process_input).
% 1.84/2.02 dependent: clear(print_kept).
% 1.84/2.02 dependent: clear(print_new_demod).
% 1.84/2.02 dependent: clear(print_back_demod).
% 1.84/2.02 dependent: clear(print_back_sub).
% 1.84/2.02 dependent: set(control_memory).
% 1.84/2.02 dependent: assign(max_mem, 12000).
% 1.84/2.02 dependent: assign(pick_given_ratio, 4).
% 1.84/2.02 dependent: assign(stats_level, 1).
% 1.84/2.02 dependent: assign(max_seconds, 10800).
% 1.84/2.02 clear(print_given).
% 1.84/2.02
% 1.84/2.02 list(usable).
% 1.84/2.02 0 [] A=A.
% 1.84/2.02 0 [] -greater(A,B)|A!=B.
% 1.84/2.02 0 [] -greater(A,B)| -greater(B,A).
% 1.84/2.02 0 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.84/2.02 0 [] -organization(A,B)|survival_chance(A,sk1(B,A),B).
% 1.84/2.02 0 [] -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 1.84/2.02 0 [] -reorganization(A,B,C)|greater(C,B).
% 1.84/2.02 0 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 1.84/2.02 0 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 1.84/2.02 0 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 1.84/2.02 0 [] -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 1.84/2.02 0 [] organization(sk2,sk11).
% 1.84/2.02 0 [] organization(sk3,sk11).
% 1.84/2.02 0 [] organization(sk2,sk13).
% 1.84/2.02 0 [] organization(sk3,sk13).
% 1.84/2.02 0 [] class(sk2,sk5,sk11).
% 1.84/2.02 0 [] class(sk3,sk5,sk11).
% 1.84/2.02 0 [] survival_chance(sk2,sk6,sk11).
% 1.84/2.02 0 [] survival_chance(sk3,sk6,sk11).
% 1.84/2.02 0 [] reorganization(sk2,sk11,sk12).
% 1.84/2.02 0 [] reorganization(sk3,sk11,sk13).
% 1.84/2.02 0 [] reorganization_type(sk2,sk4,sk11).
% 1.84/2.02 0 [] reorganization_type(sk3,sk4,sk11).
% 1.84/2.02 0 [] reorganization_free(sk2,sk12,sk13).
% 1.84/2.02 0 [] survival_chance(sk2,sk7,sk13).
% 1.84/2.02 0 [] survival_chance(sk3,sk8,sk13).
% 1.84/2.02 0 [] complexity(sk2,sk9,sk11).
% 1.84/2.02 0 [] complexity(sk3,sk10,sk11).
% 1.84/2.02 0 [] greater(sk10,sk9).
% 1.84/2.02 0 [] -greater(sk7,sk8).
% 1.84/2.02 end_of_list.
% 1.84/2.02
% 1.84/2.02 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 1.84/2.02
% 1.84/2.02 This ia a non-Horn set with equality. The strategy will be
% 1.84/2.02 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.84/2.02 deletion, with positive clauses in sos and nonpositive
% 1.84/2.02 clauses in usable.
% 1.84/2.02
% 1.84/2.02 dependent: set(knuth_bendix).
% 1.84/2.02 dependent: set(anl_eq).
% 1.84/2.02 dependent: set(para_from).
% 1.84/2.02 dependent: set(para_into).
% 1.84/2.02 dependent: clear(para_from_right).
% 1.84/2.02 dependent: clear(para_into_right).
% 1.84/2.02 dependent: set(para_from_vars).
% 1.84/2.02 dependent: set(eq_units_both_ways).
% 1.84/2.02 dependent: set(dynamic_demod_all).
% 1.84/2.02 dependent: set(dynamic_demod).
% 1.84/2.02 dependent: set(order_eq).
% 1.84/2.02 dependent: set(back_demod).
% 1.84/2.02 dependent: set(lrpo).
% 1.84/2.02 dependent: set(hyper_res).
% 1.84/2.02 dependent: set(unit_deletion).
% 1.84/2.02 dependent: set(factor).
% 1.84/2.02
% 1.84/2.02 ------------> process usable:
% 1.84/2.02 ** KEPT (pick-wt=6): 1 [] -greater(A,B)|A!=B.
% 1.84/2.02 ** KEPT (pick-wt=6): 2 [] -greater(A,B)| -greater(B,A).
% 1.84/2.02 ** KEPT (pick-wt=9): 3 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.84/2.02 ** KEPT (pick-wt=9): 4 [] -organization(A,B)|survival_chance(A,sk1(B,A),B).
% 1.84/2.02 ** KEPT (pick-wt=15): 5 [] -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 1.84/2.02 ** KEPT (pick-wt=7): 6 [] -reorganization(A,B,C)|greater(C,B).
% 1.84/2.02 ** KEPT (pick-wt=24): 7 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 1.84/2.02 ** KEPT (pick-wt=30): 8 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survAlarm clock
% 299.94/300.07 Otter interrupted
% 299.94/300.07 PROOF NOT FOUND
%------------------------------------------------------------------------------