TSTP Solution File: MGT020-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT020-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:25:50 EDT 2022
% Result : Unsatisfiable 0.36s 0.72s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.28 % Problem : MGT020-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.29 % Command : sos-script %s
% 0.12/0.50 % Computer : n018.cluster.edu
% 0.12/0.50 % Model : x86_64 x86_64
% 0.12/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.50 % Memory : 8042.1875MB
% 0.12/0.50 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.50 % CPULimit : 300
% 0.12/0.50 % WCLimit : 600
% 0.12/0.50 % DateTime : Thu Jun 9 12:14:08 EDT 2022
% 0.12/0.50 % CPUTime :
% 0.12/0.51 ----- Otter 3.2, August 2001 -----
% 0.12/0.51 The process was started by sandbox2 on n018.cluster.edu,
% 0.12/0.51 Thu Jun 9 12:14:08 2022
% 0.12/0.51 The command was "./sos". The process ID is 9082.
% 0.12/0.51
% 0.12/0.51 set(prolog_style_variables).
% 0.12/0.51 set(auto).
% 0.12/0.51 dependent: set(auto1).
% 0.12/0.51 dependent: set(process_input).
% 0.12/0.51 dependent: clear(print_kept).
% 0.12/0.51 dependent: clear(print_new_demod).
% 0.12/0.51 dependent: clear(print_back_demod).
% 0.12/0.51 dependent: clear(print_back_sub).
% 0.12/0.51 dependent: set(control_memory).
% 0.12/0.51 dependent: assign(max_mem, 12000).
% 0.12/0.51 dependent: assign(pick_given_ratio, 4).
% 0.12/0.51 dependent: assign(stats_level, 1).
% 0.12/0.51 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.51 dependent: assign(sos_limit, 5000).
% 0.12/0.51 dependent: assign(max_weight, 60).
% 0.12/0.51 clear(print_given).
% 0.12/0.51
% 0.12/0.51 list(usable).
% 0.12/0.51
% 0.12/0.51 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.12/0.51
% 0.12/0.51 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.51 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.51 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.51 clauses in usable.
% 0.12/0.51
% 0.12/0.51 dependent: set(knuth_bendix).
% 0.12/0.51 dependent: set(para_from).
% 0.12/0.51 dependent: set(para_into).
% 0.12/0.51 dependent: clear(para_from_right).
% 0.12/0.51 dependent: clear(para_into_right).
% 0.12/0.51 dependent: set(para_from_vars).
% 0.12/0.51 dependent: set(eq_units_both_ways).
% 0.12/0.51 dependent: set(dynamic_demod_all).
% 0.12/0.51 dependent: set(dynamic_demod).
% 0.12/0.51 dependent: set(order_eq).
% 0.12/0.51 dependent: set(back_demod).
% 0.12/0.51 dependent: set(lrpo).
% 0.12/0.51 dependent: set(hyper_res).
% 0.12/0.51 dependent: set(unit_deletion).
% 0.12/0.51 dependent: set(factor).
% 0.12/0.51
% 0.12/0.51 ------------> process usable:
% 0.12/0.51
% 0.12/0.51 ------------> process sos:
% 0.12/0.51 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.12/0.51
% 0.12/0.51 ======= end of input processing =======
% 0.36/0.72
% 0.36/0.72 Stopped by limit on insertions
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72 Failed to model usable list: disabling FINDER
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72 -------------- Softie stats --------------
% 0.36/0.72
% 0.36/0.72 UPDATE_STOP: 300
% 0.36/0.72 SFINDER_TIME_LIMIT: 2
% 0.36/0.72 SHORT_CLAUSE_CUTOFF: 4
% 0.36/0.72 number of clauses in intial UL: 13
% 0.36/0.72 number of clauses initially in problem: 16
% 0.36/0.72 percentage of clauses intially in UL: 81
% 0.36/0.72 percentage of distinct symbols occuring in initial UL: 93
% 0.36/0.72 percent of all initial clauses that are short: 93
% 0.36/0.72 absolute distinct symbol count: 15
% 0.36/0.72 distinct predicate count: 7
% 0.36/0.72 distinct function count: 4
% 0.36/0.72 distinct constant count: 4
% 0.36/0.72
% 0.36/0.72 ---------- no more Softie stats ----------
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72 =========== start of search ===========
% 0.36/0.72
% 0.36/0.72 -------- PROOF --------
% 0.36/0.72 % SZS status Unsatisfiable
% 0.36/0.72 % SZS output start Refutation
% 0.36/0.72
% 0.36/0.72 -----> EMPTY CLAUSE at 0.19 sec ----> 254 [hyper,242,1,14,217] {-} $F.
% 0.36/0.72
% 0.36/0.72 Length of proof is 10. Level of proof is 7.
% 0.36/0.72
% 0.36/0.72 ---------------- PROOF ----------------
% 0.36/0.72 % SZS status Unsatisfiable
% 0.36/0.72 % SZS output start Refutation
% 0.36/0.72
% 0.36/0.72 1 [] {+} -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B))).
% 0.36/0.72 2 [] {+} -environment(A)| -in_environment(A,initial_FM_EP(A))|subpopulations(first_movers,efficient_producers,A,initial_FM_EP(A)).
% 0.36/0.72 3 [] {+} -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)|greater_or_equal(B,initial_FM_EP(A)).
% 0.36/0.72 4 [] {+} -environment(A)| -greater_or_equal(B,C)| -greater_or_equal(D,B)| -subpopulations(first_movers,efficient_producers,A,D)| -greater(disbanding_rate(first_movers,C),disbanding_rate(efficient_producers,C))|decreases(difference(disbanding_rate(first_movers,B),disbanding_rate(efficient_producers,B)))|greater(disbanding_rate(first_movers,D),disbanding_rate(efficient_producers,D)).
% 0.36/0.72 5 [] {+} -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)|in_environment(A,B).
% 0.36/0.72 6 [] {+} -environment(A)|greater_or_equal(initial_FM_EP(A),start_time(A)).
% 0.36/0.72 7 [] {+} -environment(A)| -greater_or_equal(B,start_time(A))| -greater(C,B)| -in_environment(A,C)|in_environment(A,B).
% 0.36/0.72 9 [] {+} -greater_or_equal(A,B)|greater(A,B)|A=B.
% 0.36/0.72 10 [] {+} -environment(A)|greater(disbanding_rate(first_movers,initial_FM_EP(A)),disbanding_rate(efficient_producers,initial_FM_EP(A))).
% 0.36/0.72 12 [] {+} -greater(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)).
% 0.36/0.72 14 [] {-} environment(sk1).
% 0.36/0.72 15 [] {-} subpopulations(first_movers,efficient_producers,sk1,sk2).
% 0.36/0.72 17 [hyper,14,10] {-} greater(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1))).
% 0.36/0.72 18 [hyper,14,6] {-} greater_or_equal(initial_FM_EP(sk1),start_time(sk1)).
% 0.36/0.72 20 [hyper,15,5,14] {-} in_environment(sk1,sk2).
% 0.36/0.72 21 [hyper,15,3,14] {-} greater_or_equal(sk2,initial_FM_EP(sk1)).
% 0.36/0.72 28 [hyper,21,9,flip.2] {-} greater(sk2,initial_FM_EP(sk1))|initial_FM_EP(sk1)=sk2.
% 0.36/0.72 47 [hyper,28,7,14,18,20] {-} initial_FM_EP(sk1)=sk2|in_environment(sk1,initial_FM_EP(sk1)).
% 0.36/0.72 70 [hyper,47,2,14] {-} initial_FM_EP(sk1)=sk2|subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)).
% 0.36/0.72 217 [para_from,70.1.1,2.2.2,unit_del,14,20,factor_simp] {-} subpopulations(first_movers,efficient_producers,sk1,initial_FM_EP(sk1)).
% 0.36/0.72 219 [hyper,217,3,14] {-} greater_or_equal(initial_FM_EP(sk1),initial_FM_EP(sk1)).
% 0.36/0.72 242 [hyper,219,4,14,21,15,17,unit_del,12] {-} decreases(difference(disbanding_rate(first_movers,initial_FM_EP(sk1)),disbanding_rate(efficient_producers,initial_FM_EP(sk1)))).
% 0.36/0.72 254 [hyper,242,1,14,217] {-} $F.
% 0.36/0.72
% 0.36/0.72 % SZS output end Refutation
% 0.36/0.72 ------------ end of proof -------------
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72 Search stopped by max_proofs option.
% 0.36/0.72
% 0.36/0.72
% 0.36/0.72 Search stopped by max_proofs option.
% 0.36/0.72
% 0.36/0.72 ============ end of search ============
% 0.36/0.72
% 0.36/0.72 That finishes the proof of the theorem.
% 0.36/0.72
% 0.36/0.72 Process 9082 finished Thu Jun 9 12:14:08 2022
%------------------------------------------------------------------------------