TSTP Solution File: MGT036-3 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n029.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:16:34 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MGT036-3 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n029.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 9 10:20:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 ~outcompetes(first_movers,efficient_producers,X0) | ~subpopulations(first_movers,efficient_producers,X1,X0) | ~environment(X1)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 ~outcompetes(first_movers,efficient_producers,X0) | ~subpopulations(first_movers,efficient_producers,X1,X0) | ~environment(X1),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 outcompetes(X2,X3,X4) | ~greater(zero,growth_rate(X3,X4)) | ~greater_or_equal(growth_rate(X2,X4),zero) | ~subpopulations(X3,X2,X5,X4) | ~environment(X5)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 first_movers = X2).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 efficient_producers = X3).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 X0 = X4).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 ~subpopulations(first_movers,efficient_producers,X1,X0) | ~environment(X1),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 ~greater(zero,growth_rate(X3,X4)) | ~greater_or_equal(growth_rate(X2,X4),zero) | ~subpopulations(X3,X2,X5,X4) | ~environment(X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 greater(zero,growth_rate(efficient_producers,sk2))).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 zero = zero).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 growth_rate(X3,X4) = growth_rate(efficient_producers,sk2)).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 ~greater_or_equal(growth_rate(X2,X4),zero) | ~subpopulations(X3,X2,X5,X4) | ~environment(X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c8, axiom,
% 0.12/0.34 greater_or_equal(growth_rate(first_movers,sk2),zero)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 growth_rate(X2,X4) = growth_rate(first_movers,sk2)).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 zero = zero).
% 0.12/0.34 cnf(c9, plain,
% 0.12/0.34 ~subpopulations(X3,X2,X5,X4) | ~environment(X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c6, c8])).
% 0.12/0.34
% 0.12/0.34 cnf(c11, axiom,
% 0.12/0.34 subpopulations(X6,X7,X8,X9) | ~subpopulations(X7,X6,X8,X9) | ~environment(X8)).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 X3 = X6).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 X2 = X7).
% 0.12/0.34 cnf(a9, assumption,
% 0.12/0.34 X5 = X8).
% 0.12/0.34 cnf(a10, assumption,
% 0.12/0.34 X4 = X9).
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 ~environment(X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a7, a8, a9, a10])], [c9, c11])).
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 ~subpopulations(X7,X6,X8,X9) | ~environment(X8),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a7, a8, a9, a10])], [c9, c11])).
% 0.12/0.34
% 0.12/0.34 cnf(c14, axiom,
% 0.12/0.34 subpopulations(first_movers,efficient_producers,sk1,sk2)).
% 0.12/0.34 cnf(a11, assumption,
% 0.12/0.34 X7 = first_movers).
% 0.12/0.34 cnf(a12, assumption,
% 0.12/0.34 X6 = efficient_producers).
% 0.12/0.34 cnf(a13, assumption,
% 0.12/0.34 X8 = sk1).
% 0.12/0.34 cnf(a14, assumption,
% 0.12/0.34 X9 = sk2).
% 0.12/0.34 cnf(c15, plain,
% 0.12/0.34 ~environment(X8),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c13, c14])).
% 0.12/0.34 cnf(c16, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c13, c14])).
% 0.12/0.34
% 0.12/0.34 cnf(c17, axiom,
% 0.12/0.34 environment(sk1)).
% 0.12/0.34 cnf(a15, assumption,
% 0.12/0.34 X8 = sk1).
% 0.12/0.34 cnf(c18, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15])], [c15, c17])).
% 0.12/0.34 cnf(c19, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a15])], [c15, c17])).
% 0.12/0.34
% 0.12/0.34 cnf(c20, plain,
% 0.12/0.34 environment(X8)).
% 0.12/0.34 cnf(a16, assumption,
% 0.12/0.34 X5 = X8).
% 0.12/0.34 cnf(c21, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a16])], [c12, c20])).
% 0.12/0.34
% 0.12/0.34 cnf(c22, plain,
% 0.12/0.34 subpopulations(X7,X6,X8,X9)).
% 0.12/0.34 cnf(a17, assumption,
% 0.12/0.34 first_movers = X7).
% 0.12/0.34 cnf(a18, assumption,
% 0.12/0.34 efficient_producers = X6).
% 0.12/0.34 cnf(a19, assumption,
% 0.12/0.34 X1 = X8).
% 0.12/0.34 cnf(a20, assumption,
% 0.12/0.34 X0 = X9).
% 0.12/0.34 cnf(c23, plain,
% 0.12/0.34 ~environment(X1),
% 0.12/0.34 inference(predicate_reduction, [assumptions([a17, a18, a19, a20])], [c3, c22])).
% 0.12/0.34
% 0.12/0.34 cnf(c24, plain,
% 0.12/0.34 environment(X8)).
% 0.12/0.34 cnf(a21, assumption,
% 0.12/0.34 X1 = X8).
% 0.12/0.34 cnf(c25, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a21])], [c23, c24])).
% 0.12/0.34
% 0.12/0.34 cnf(c26, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, sk2),
% 0.12/0.34 bind(X1, sk1),
% 0.12/0.34 bind(X2, first_movers),
% 0.12/0.34 bind(X3, efficient_producers),
% 0.12/0.34 bind(X4, sk2),
% 0.12/0.34 bind(X5, sk1),
% 0.12/0.34 bind(X6, efficient_producers),
% 0.12/0.34 bind(X7, first_movers),
% 0.12/0.34 bind(X8, sk1),
% 0.12/0.34 bind(X9, sk2)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------