TSTP Solution File: MGT032+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n024.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:32 EDT 2022
% Result : Theorem 0.13s 0.33s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT032+2 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.32 % Computer : n024.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Thu Jun 9 12:05:19 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.33 % SZS status Theorem
% 0.13/0.33 % SZS output begin IncompleteProof
% 0.13/0.33 cnf(c0, axiom,
% 0.13/0.33 sP0(X0,sK3) | ~in_environment(sK3,X0)).
% 0.13/0.33 cnf(c1, plain,
% 0.13/0.33 sP0(X0,sK3) | ~in_environment(sK3,X0),
% 0.13/0.33 inference(start, [], [c0])).
% 0.13/0.33
% 0.13/0.33 cnf(c2, axiom,
% 0.13/0.33 greater_or_equal(sK2(X1,X2),X1) | ~sP0(X1,X2)).
% 0.13/0.33 cnf(a0, assumption,
% 0.13/0.33 X0 = X1).
% 0.13/0.33 cnf(a1, assumption,
% 0.13/0.33 sK3 = X2).
% 0.13/0.33 cnf(c3, plain,
% 0.13/0.33 ~in_environment(sK3,X0),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.33 cnf(c4, plain,
% 0.13/0.33 greater_or_equal(sK2(X1,X2),X1),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.13/0.33
% 0.13/0.33 cnf(c5, axiom,
% 0.13/0.33 greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) | ~greater_or_equal(X3,sK1(X4)) | ~subpopulations(first_movers,efficient_producers,X4,X3) | ~stable(X4) | ~environment(X4)).
% 0.13/0.33 cnf(a2, assumption,
% 0.13/0.33 sK2(X1,X2) = X3).
% 0.13/0.33 cnf(a3, assumption,
% 0.13/0.33 X1 = sK1(X4)).
% 0.13/0.33 cnf(c6, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.33 cnf(c7, plain,
% 0.13/0.33 greater(growth_rate(efficient_producers,X3),growth_rate(first_movers,X3)) | ~subpopulations(first_movers,efficient_producers,X4,X3) | ~stable(X4) | ~environment(X4),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.13/0.33
% 0.13/0.33 cnf(c8, axiom,
% 0.13/0.33 selection_favors(X5,X6,X7) | ~greater(growth_rate(X5,X7),growth_rate(X6,X7)) | ~subpopulations(X6,X5,X8,X7) | ~environment(X8)).
% 0.13/0.33 cnf(a4, assumption,
% 0.13/0.33 growth_rate(efficient_producers,X3) = growth_rate(X5,X7)).
% 0.13/0.33 cnf(a5, assumption,
% 0.13/0.33 growth_rate(first_movers,X3) = growth_rate(X6,X7)).
% 0.13/0.33 cnf(c9, plain,
% 0.13/0.33 ~subpopulations(first_movers,efficient_producers,X4,X3) | ~stable(X4) | ~environment(X4),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.33 cnf(c10, plain,
% 0.13/0.33 selection_favors(X5,X6,X7) | ~subpopulations(X6,X5,X8,X7) | ~environment(X8),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.13/0.33
% 0.13/0.33 cnf(c11, axiom,
% 0.13/0.33 ~selection_favors(efficient_producers,first_movers,sK2(X9,X10)) | ~sP0(X9,X10)).
% 0.13/0.33 cnf(a6, assumption,
% 0.13/0.33 X5 = efficient_producers).
% 0.13/0.33 cnf(a7, assumption,
% 0.13/0.33 X6 = first_movers).
% 0.13/0.33 cnf(a8, assumption,
% 0.13/0.33 X7 = sK2(X9,X10)).
% 0.13/0.33 cnf(c12, plain,
% 0.13/0.33 ~subpopulations(X6,X5,X8,X7) | ~environment(X8),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c10, c11])).
% 0.13/0.33 cnf(c13, plain,
% 0.13/0.33 ~sP0(X9,X10),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c10, c11])).
% 0.13/0.33
% 0.13/0.33 cnf(c14, plain,
% 0.13/0.33 sP0(X0,sK3)).
% 0.13/0.33 cnf(a9, assumption,
% 0.13/0.33 X9 = X0).
% 0.13/0.33 cnf(a10, assumption,
% 0.13/0.33 X10 = sK3).
% 0.13/0.33 cnf(c15, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(predicate_reduction, [assumptions([a9, a10])], [c13, c14])).
% 0.13/0.33
% 0.13/0.33 cnf(c16, axiom,
% 0.13/0.33 subpopulations(first_movers,efficient_producers,X11,sK2(X12,X11)) | ~sP0(X12,X11)).
% 0.13/0.33 cnf(a11, assumption,
% 0.13/0.33 X6 = first_movers).
% 0.13/0.33 cnf(a12, assumption,
% 0.13/0.33 X5 = efficient_producers).
% 0.13/0.33 cnf(a13, assumption,
% 0.13/0.33 X8 = X11).
% 0.13/0.33 cnf(a14, assumption,
% 0.13/0.33 X7 = sK2(X12,X11)).
% 0.13/0.33 cnf(c17, plain,
% 0.13/0.33 ~environment(X8),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c12, c16])).
% 0.13/0.33 cnf(c18, plain,
% 0.13/0.33 ~sP0(X12,X11),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c12, c16])).
% 0.13/0.33
% 0.13/0.33 cnf(c19, plain,
% 0.13/0.33 sP0(X0,sK3)).
% 0.13/0.33 cnf(a15, assumption,
% 0.13/0.33 X12 = X0).
% 0.13/0.33 cnf(a16, assumption,
% 0.13/0.33 X11 = sK3).
% 0.13/0.33 cnf(c20, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(predicate_reduction, [assumptions([a15, a16])], [c18, c19])).
% 0.13/0.33
% 0.13/0.33 cnf(c21, axiom,
% 0.13/0.33 environment(sK3)).
% 0.13/0.33 cnf(a17, assumption,
% 0.13/0.33 X8 = sK3).
% 0.13/0.33 cnf(c22, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a17])], [c17, c21])).
% 0.13/0.33 cnf(c23, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a17])], [c17, c21])).
% 0.13/0.33
% 0.13/0.33 cnf(c24, plain,
% 0.13/0.33 subpopulations(X6,X5,X8,X7)).
% 0.13/0.33 cnf(a18, assumption,
% 0.13/0.33 first_movers = X6).
% 0.13/0.33 cnf(a19, assumption,
% 0.13/0.33 efficient_producers = X5).
% 0.13/0.33 cnf(a20, assumption,
% 0.13/0.33 X4 = X8).
% 0.13/0.33 cnf(a21, assumption,
% 0.13/0.33 X3 = X7).
% 0.13/0.33 cnf(c25, plain,
% 0.13/0.33 ~stable(X4) | ~environment(X4),
% 0.13/0.33 inference(predicate_reduction, [assumptions([a18, a19, a20, a21])], [c9, c24])).
% 0.13/0.33
% 0.13/0.33 cnf(c26, axiom,
% 0.13/0.33 stable(sK3)).
% 0.13/0.33 cnf(a22, assumption,
% 0.13/0.33 X4 = sK3).
% 0.13/0.33 cnf(c27, plain,
% 0.13/0.33 ~environment(X4),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a22])], [c25, c26])).
% 0.13/0.33 cnf(c28, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a22])], [c25, c26])).
% 0.13/0.33
% 0.13/0.33 cnf(c29, plain,
% 0.13/0.33 environment(X8)).
% 0.13/0.33 cnf(a23, assumption,
% 0.13/0.33 X4 = X8).
% 0.13/0.33 cnf(c30, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(predicate_reduction, [assumptions([a23])], [c27, c29])).
% 0.13/0.33
% 0.13/0.33 cnf(c31, axiom,
% 0.13/0.33 in_environment(X13,sK1(X13)) | ~stable(X13) | ~environment(X13)).
% 0.13/0.33 cnf(a24, assumption,
% 0.13/0.33 sK3 = X13).
% 0.13/0.33 cnf(a25, assumption,
% 0.13/0.33 X0 = sK1(X13)).
% 0.13/0.33 cnf(c32, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a24, a25])], [c3, c31])).
% 0.13/0.33 cnf(c33, plain,
% 0.13/0.33 ~stable(X13) | ~environment(X13),
% 0.13/0.33 inference(strict_predicate_extension, [assumptions([a24, a25])], [c3, c31])).
% 0.13/0.33
% 0.13/0.33 cnf(c34, plain,
% 0.13/0.33 stable(X4)).
% 0.13/0.33 cnf(a26, assumption,
% 0.13/0.33 X13 = X4).
% 0.13/0.33 cnf(c35, plain,
% 0.13/0.33 ~environment(X13),
% 0.13/0.33 inference(predicate_reduction, [assumptions([a26])], [c33, c34])).
% 0.13/0.33
% 0.13/0.33 cnf(c36, plain,
% 0.13/0.33 environment(X8)).
% 0.13/0.33 cnf(a27, assumption,
% 0.13/0.33 X13 = X8).
% 0.13/0.33 cnf(c37, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(predicate_reduction, [assumptions([a27])], [c35, c36])).
% 0.13/0.33
% 0.13/0.33 cnf(c38, plain,
% 0.13/0.33 $false,
% 0.13/0.33 inference(constraint_solving, [
% 0.13/0.33 bind(X0, sK1(X4)),
% 0.13/0.33 bind(X1, sK1(X4)),
% 0.13/0.33 bind(X2, sK3),
% 0.13/0.33 bind(X3, sK2(X1,X2)),
% 0.13/0.33 bind(X4, sK3),
% 0.13/0.33 bind(X5, efficient_producers),
% 0.13/0.33 bind(X6, first_movers),
% 0.13/0.33 bind(X7, sK2(X1,X2)),
% 0.13/0.33 bind(X8, sK3),
% 0.13/0.33 bind(X9, sK1(X4)),
% 0.13/0.33 bind(X10, sK3),
% 0.13/0.33 bind(X11, sK3),
% 0.13/0.33 bind(X12, sK1(X4)),
% 0.13/0.33 bind(X13, sK3)
% 0.13/0.33 ],
% 0.13/0.33 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27])).
% 0.13/0.33
% 0.13/0.33 % SZS output end IncompleteProof
%------------------------------------------------------------------------------