TSTP Solution File: MGT023-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT023-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-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 : 300s
% DateTime : Wed Jul 27 13:06:02 EDT 2022
% Result : Unsatisfiable 1.77s 1.96s
% Output : Refutation 1.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 10 unt; 8 nHn; 21 RR)
% Number of literals : 48 ( 9 equ; 17 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ environment(A)
| greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
| ~ in_environment(A,B)
| subpopulations(first_movers,efficient_producers,A,sk1(B,A))
| B = critical_point(A) ),
file('MGT023-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ environment(A)
| greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
| ~ in_environment(A,B)
| greater(sk1(B,A),B)
| B = critical_point(A) ),
file('MGT023-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ environment(A)
| greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))
| ~ in_environment(A,B)
| ~ greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A)))
| B = critical_point(A) ),
file('MGT023-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ environment(A)
| ~ stable(A)
| in_environment(A,sk2(A)) ),
file('MGT023-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))) ),
file('MGT023-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ environment(A)
| ~ stable(A)
| ~ subpopulations(first_movers,efficient_producers,A,B)
| ~ greater(B,sk2(A))
| greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) ),
file('MGT023-1.p',unknown),
[] ).
cnf(7,axiom,
~ in_environment(sk3,critical_point(sk3)),
file('MGT023-1.p',unknown),
[] ).
cnf(9,axiom,
environment(sk3),
file('MGT023-1.p',unknown),
[] ).
cnf(10,axiom,
stable(sk3),
file('MGT023-1.p',unknown),
[] ).
cnf(14,plain,
in_environment(sk3,sk2(sk3)),
inference(hyper,[status(thm)],[10,4,9]),
[iquote('hyper,10,4,9')] ).
cnf(18,plain,
( greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))
| greater(sk1(sk2(sk3),sk3),sk2(sk3))
| sk2(sk3) = critical_point(sk3) ),
inference(hyper,[status(thm)],[14,2,9]),
[iquote('hyper,14,2,9')] ).
cnf(19,plain,
( greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))
| subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3))
| sk2(sk3) = critical_point(sk3) ),
inference(hyper,[status(thm)],[14,1,9]),
[iquote('hyper,14,1,9')] ).
cnf(185,plain,
( greater(sk1(sk2(sk3),sk3),sk2(sk3))
| sk2(sk3) = critical_point(sk3) ),
inference(hyper,[status(thm)],[18,5,9,10]),
[iquote('hyper,18,5,9,10')] ).
cnf(210,plain,
greater(sk1(sk2(sk3),sk3),sk2(sk3)),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[185,14]),7]),
[iquote('para_from,185.2.1,14.1.2,unit_del,7')] ).
cnf(331,plain,
( subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3))
| sk2(sk3) = critical_point(sk3) ),
inference(hyper,[status(thm)],[19,5,9,10]),
[iquote('hyper,19,5,9,10')] ).
cnf(361,plain,
subpopulations(first_movers,efficient_producers,sk3,sk1(sk2(sk3),sk3)),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[331,14]),7]),
[iquote('para_from,331.2.1,14.1.2,unit_del,7')] ).
cnf(362,plain,
greater(growth_rate(efficient_producers,sk1(sk2(sk3),sk3)),growth_rate(first_movers,sk1(sk2(sk3),sk3))),
inference(hyper,[status(thm)],[361,6,9,10,210]),
[iquote('hyper,361,6,9,10,210')] ).
cnf(453,plain,
( greater(growth_rate(efficient_producers,sk2(sk3)),growth_rate(first_movers,sk2(sk3)))
| sk2(sk3) = critical_point(sk3) ),
inference(hyper,[status(thm)],[362,3,9,14]),
[iquote('hyper,362,3,9,14')] ).
cnf(485,plain,
sk2(sk3) = critical_point(sk3),
inference(hyper,[status(thm)],[453,5,9,10]),
[iquote('hyper,453,5,9,10')] ).
cnf(555,plain,
in_environment(sk3,critical_point(sk3)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[14]),485]),
[iquote('back_demod,14,demod,485')] ).
cnf(556,plain,
$false,
inference(binary,[status(thm)],[555,7]),
[iquote('binary,555.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT023-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:05:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.77/1.96 ----- Otter 3.3f, August 2004 -----
% 1.77/1.96 The process was started by sandbox on n018.cluster.edu,
% 1.77/1.96 Wed Jul 27 04:05:16 2022
% 1.77/1.96 The command was "./otter". The process ID is 18541.
% 1.77/1.96
% 1.77/1.96 set(prolog_style_variables).
% 1.77/1.96 set(auto).
% 1.77/1.96 dependent: set(auto1).
% 1.77/1.96 dependent: set(process_input).
% 1.77/1.96 dependent: clear(print_kept).
% 1.77/1.96 dependent: clear(print_new_demod).
% 1.77/1.96 dependent: clear(print_back_demod).
% 1.77/1.96 dependent: clear(print_back_sub).
% 1.77/1.96 dependent: set(control_memory).
% 1.77/1.96 dependent: assign(max_mem, 12000).
% 1.77/1.96 dependent: assign(pick_given_ratio, 4).
% 1.77/1.96 dependent: assign(stats_level, 1).
% 1.77/1.96 dependent: assign(max_seconds, 10800).
% 1.77/1.96 clear(print_given).
% 1.77/1.96
% 1.77/1.96 list(usable).
% 1.77/1.96 0 [] A=A.
% 1.77/1.96 0 [] -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|subpopulations(first_movers,efficient_producers,A,sk1(B,A))|B=critical_point(A).
% 1.77/1.96 0 [] -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|greater(sk1(B,A),B)|B=critical_point(A).
% 1.77/1.96 0 [] -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)| -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A)))|B=critical_point(A).
% 1.77/1.96 0 [] -environment(A)| -stable(A)|in_environment(A,sk2(A)).
% 1.77/1.96 0 [] -environment(A)| -stable(A)| -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))).
% 1.77/1.96 0 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater(B,sk2(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 1.77/1.96 0 [] environment(sk3).
% 1.77/1.96 0 [] stable(sk3).
% 1.77/1.96 0 [] -in_environment(sk3,critical_point(sk3)).
% 1.77/1.96 end_of_list.
% 1.77/1.96
% 1.77/1.96 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.77/1.96
% 1.77/1.96 This ia a non-Horn set with equality. The strategy will be
% 1.77/1.96 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.96 deletion, with positive clauses in sos and nonpositive
% 1.77/1.96 clauses in usable.
% 1.77/1.96
% 1.77/1.96 dependent: set(knuth_bendix).
% 1.77/1.96 dependent: set(anl_eq).
% 1.77/1.96 dependent: set(para_from).
% 1.77/1.96 dependent: set(para_into).
% 1.77/1.96 dependent: clear(para_from_right).
% 1.77/1.96 dependent: clear(para_into_right).
% 1.77/1.96 dependent: set(para_from_vars).
% 1.77/1.96 dependent: set(eq_units_both_ways).
% 1.77/1.96 dependent: set(dynamic_demod_all).
% 1.77/1.96 dependent: set(dynamic_demod).
% 1.77/1.96 dependent: set(order_eq).
% 1.77/1.96 dependent: set(back_demod).
% 1.77/1.96 dependent: set(lrpo).
% 1.77/1.96 dependent: set(hyper_res).
% 1.77/1.96 dependent: set(unit_deletion).
% 1.77/1.96 dependent: set(factor).
% 1.77/1.96
% 1.77/1.96 ------------> process usable:
% 1.77/1.96 ** KEPT (pick-wt=23): 1 [] -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|subpopulations(first_movers,efficient_producers,A,sk1(B,A))|B=critical_point(A).
% 1.77/1.96 ** KEPT (pick-wt=21): 2 [] -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)|greater(sk1(B,A),B)|B=critical_point(A).
% 1.77/1.96 ** KEPT (pick-wt=27): 3 [] -environment(A)|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B))| -in_environment(A,B)| -greater(growth_rate(efficient_producers,sk1(B,A)),growth_rate(first_movers,sk1(B,A)))|B=critical_point(A).
% 1.77/1.96 ** KEPT (pick-wt=8): 4 [] -environment(A)| -stable(A)|in_environment(A,sk2(A)).
% 1.77/1.96 ** KEPT (pick-wt=13): 5 [] -environment(A)| -stable(A)| -greater(growth_rate(efficient_producers,sk2(A)),growth_rate(first_movers,sk2(A))).
% 1.77/1.96 ** KEPT (pick-wt=20): 6 [] -environment(A)| -stable(A)| -subpopulations(first_movers,efficient_producers,A,B)| -greater(B,sk2(A))|greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)).
% 1.77/1.96 ** KEPT (pick-wt=4): 7 [] -in_environment(sk3,critical_point(sk3)).
% 1.77/1.96
% 1.77/1.96 ------------> process sos:
% 1.77/1.96 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.77/1.96 ** KEPT (pick-wt=2): 9 [] environment(sk3).
% 1.77/1.96 ** KEPT (pick-wt=2): 10 [] stable(sk3).
% 1.77/1.96 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.77/1.96
% 1.77/1.96 ======= end of input processing =======
% 1.77/1.96
% 1.77/1.96 =========== start of search ===========
% 1.77/1.96
% 1.77/1.96 -------- PROOF --------
% 1.77/1.96
% 1.77/1.96 ----> UNIT CONFLICT at 0.08 sec ----> 556 [binary,555.1,7.1] $F.
% 1.77/1.96
% 1.77/1.96 Length of proof is 11. Level of proof is 8.
% 1.77/1.96
% 1.77/1.96 ---------------- PROOF ----------------
% 1.77/1.96 % SZS status Unsatisfiable
% 1.77/1.96 % SZS output start Refutation
% See solution above
% 1.77/1.96 ------------ end of proof -------------
% 1.77/1.96
% 1.77/1.96
% 1.77/1.96 Search stopped by max_proofs option.
% 1.77/1.96
% 1.77/1.96
% 1.77/1.96 Search stopped by max_proofs option.
% 1.77/1.96
% 1.77/1.96 ============ end of search ============
% 1.77/1.96
% 1.77/1.96 -------------- statistics -------------
% 1.77/1.96 clauses given 18
% 1.77/1.96 clauses generated 641
% 1.77/1.96 clauses kept 554
% 1.77/1.96 clauses forward subsumed 169
% 1.77/1.96 clauses back subsumed 60
% 1.77/1.96 Kbytes malloced 1953
% 1.77/1.96
% 1.77/1.96 ----------- times (seconds) -----------
% 1.77/1.96 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 1.77/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.77/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.77/1.96
% 1.77/1.96 That finishes the proof of the theorem.
% 1.77/1.96
% 1.77/1.96 Process 18541 finished Wed Jul 27 04:05:17 2022
% 1.77/1.96 Otter interrupted
% 1.77/1.96 PROOF FOUND
%------------------------------------------------------------------------------