TSTP Solution File: MGT036-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:07 EDT 2022
% Result : Unsatisfiable 1.63s 1.85s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 10 RR)
% Number of literals : 18 ( 0 equ; 9 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ environment(A)
| ~ subpopulations(B,C,A,D)
| subpopulations(C,B,A,D) ),
file('MGT036-3.p',unknown),
[] ).
cnf(2,axiom,
( ~ environment(A)
| ~ subpopulations(B,C,A,D)
| ~ greater_or_e_qual(growth_rate(C,D),zero)
| ~ greater(zero,growth_rate(B,D))
| outcompetes(C,B,D) ),
file('MGT036-3.p',unknown),
[] ).
cnf(5,axiom,
( ~ environment(A)
| ~ subpopulations(first_movers,efficient_producers,A,B)
| ~ outcompetes(first_movers,efficient_producers,B) ),
file('MGT036-3.p',unknown),
[] ).
cnf(6,axiom,
environment(sk1),
file('MGT036-3.p',unknown),
[] ).
cnf(7,axiom,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file('MGT036-3.p',unknown),
[] ).
cnf(8,axiom,
greater_or_e_qual(growth_rate(first_movers,sk2),zero),
file('MGT036-3.p',unknown),
[] ).
cnf(9,axiom,
greater(zero,growth_rate(efficient_producers,sk2)),
file('MGT036-3.p',unknown),
[] ).
cnf(10,plain,
subpopulations(efficient_producers,first_movers,sk1,sk2),
inference(hyper,[status(thm)],[7,1,6]),
[iquote('hyper,7,1,6')] ).
cnf(11,plain,
outcompetes(first_movers,efficient_producers,sk2),
inference(hyper,[status(thm)],[10,2,6,8,9]),
[iquote('hyper,10,2,6,8,9')] ).
cnf(12,plain,
$false,
inference(hyper,[status(thm)],[11,5,6,7]),
[iquote('hyper,11,5,6,7')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:00:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.63/1.85 ----- Otter 3.3f, August 2004 -----
% 1.63/1.85 The process was started by sandbox2 on n012.cluster.edu,
% 1.63/1.85 Wed Jul 27 04:00:35 2022
% 1.63/1.85 The command was "./otter". The process ID is 24883.
% 1.63/1.85
% 1.63/1.85 set(prolog_style_variables).
% 1.63/1.85 set(auto).
% 1.63/1.85 dependent: set(auto1).
% 1.63/1.85 dependent: set(process_input).
% 1.63/1.85 dependent: clear(print_kept).
% 1.63/1.85 dependent: clear(print_new_demod).
% 1.63/1.85 dependent: clear(print_back_demod).
% 1.63/1.85 dependent: clear(print_back_sub).
% 1.63/1.85 dependent: set(control_memory).
% 1.63/1.85 dependent: assign(max_mem, 12000).
% 1.63/1.85 dependent: assign(pick_given_ratio, 4).
% 1.63/1.85 dependent: assign(stats_level, 1).
% 1.63/1.85 dependent: assign(max_seconds, 10800).
% 1.63/1.85 clear(print_given).
% 1.63/1.85
% 1.63/1.85 list(usable).
% 1.63/1.85 0 [] -environment(A)| -subpopulations(B,C,A,D)|subpopulations(C,B,A,D).
% 1.63/1.85 0 [] -environment(A)| -subpopulations(B,C,A,D)| -greater_or_e_qual(growth_rate(C,D),zero)| -greater(zero,growth_rate(B,D))|outcompetes(C,B,D).
% 1.63/1.85 0 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater_or_e_qual(growth_rate(C,D),zero).
% 1.63/1.85 0 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater(zero,growth_rate(B,D)).
% 1.63/1.85 0 [] environment(sk1).
% 1.63/1.85 0 [] subpopulations(first_movers,efficient_producers,sk1,sk2).
% 1.63/1.85 0 [] greater_or_e_qual(growth_rate(first_movers,sk2),zero).
% 1.63/1.85 0 [] greater(zero,growth_rate(efficient_producers,sk2)).
% 1.63/1.85 0 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -outcompetes(first_movers,efficient_producers,B).
% 1.63/1.85 end_of_list.
% 1.63/1.85
% 1.63/1.85 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 1.63/1.85
% 1.63/1.85 This is a Horn set without equality. The strategy will
% 1.63/1.85 be hyperresolution, with satellites in sos and nuclei
% 1.63/1.85 in usable.
% 1.63/1.85
% 1.63/1.85 dependent: set(hyper_res).
% 1.63/1.85 dependent: clear(order_hyper).
% 1.63/1.85
% 1.63/1.85 ------------> process usable:
% 1.63/1.85 ** KEPT (pick-wt=12): 1 [] -environment(A)| -subpopulations(B,C,A,D)|subpopulations(C,B,A,D).
% 1.63/1.85 ** KEPT (pick-wt=21): 2 [] -environment(A)| -subpopulations(B,C,A,D)| -greater_or_e_qual(growth_rate(C,D),zero)| -greater(zero,growth_rate(B,D))|outcompetes(C,B,D).
% 1.63/1.85 ** KEPT (pick-wt=16): 3 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater_or_e_qual(growth_rate(C,D),zero).
% 1.63/1.85 ** KEPT (pick-wt=16): 4 [] -environment(A)| -subpopulations(B,C,A,D)| -outcompetes(C,B,D)|greater(zero,growth_rate(B,D)).
% 1.63/1.85 ** KEPT (pick-wt=11): 5 [] -environment(A)| -subpopulations(first_movers,efficient_producers,A,B)| -outcompetes(first_movers,efficient_producers,B).
% 1.63/1.85
% 1.63/1.85 ------------> process sos:
% 1.63/1.85 ** KEPT (pick-wt=2): 6 [] environment(sk1).
% 1.63/1.85 ** KEPT (pick-wt=5): 7 [] subpopulations(first_movers,efficient_producers,sk1,sk2).
% 1.63/1.85 ** KEPT (pick-wt=5): 8 [] greater_or_e_qual(growth_rate(first_movers,sk2),zero).
% 1.63/1.85 ** KEPT (pick-wt=5): 9 [] greater(zero,growth_rate(efficient_producers,sk2)).
% 1.63/1.85
% 1.63/1.85 ======= end of input processing =======
% 1.63/1.85
% 1.63/1.85 =========== start of search ===========
% 1.63/1.85
% 1.63/1.85 -------- PROOF --------
% 1.63/1.85
% 1.63/1.85 -----> EMPTY CLAUSE at 0.00 sec ----> 12 [hyper,11,5,6,7] $F.
% 1.63/1.85
% 1.63/1.85 Length of proof is 2. Level of proof is 2.
% 1.63/1.85
% 1.63/1.85 ---------------- PROOF ----------------
% 1.63/1.85 % SZS status Unsatisfiable
% 1.63/1.85 % SZS output start Refutation
% See solution above
% 1.63/1.85 ------------ end of proof -------------
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85 ============ end of search ============
% 1.63/1.85
% 1.63/1.85 -------------- statistics -------------
% 1.63/1.85 clauses given 6
% 1.63/1.85 clauses generated 4
% 1.63/1.85 clauses kept 11
% 1.63/1.85 clauses forward subsumed 1
% 1.63/1.85 clauses back subsumed 0
% 1.63/1.85 Kbytes malloced 976
% 1.63/1.85
% 1.63/1.85 ----------- times (seconds) -----------
% 1.63/1.85 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.85 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.63/1.85
% 1.63/1.85 That finishes the proof of the theorem.
% 1.63/1.85
% 1.63/1.85 Process 24883 finished Wed Jul 27 04:00:37 2022
% 1.63/1.85 Otter interrupted
% 1.63/1.85 PROOF FOUND
%------------------------------------------------------------------------------