%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : MGT041+2 : TPTP v9.3.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 : n003.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8046.5625MB % OS : Linux 6.8.0-71-generic % CPULimit : 300s % WCLimit : 300s % DateTime : Tue Sep 8 06:13:19 AM UTC 2026 % Result : Theorem 0.09s 0.38s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0. % 0.00/0.04 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.09/0.36 % Computer : n003.cluster.edu % 0.09/0.36 % Model : x86_64 x86_64 % 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.36 % Memory : 8046.5625MB % 0.09/0.36 % OS : Linux 6.8.0-71-generic % 0.09/0.36 % CPULimit : 300 % 0.09/0.36 % WCLimit : 300 % 0.09/0.36 % DateTime : Mon Sep 7 13:03:24 UTC 2026 % 0.09/0.36 % CPUTime : % 0.09/0.38 % SZS status Theorem % 0.09/0.38 % SZS output begin IncompleteProof % 0.09/0.38 cnf(c0, axiom, % 0.09/0.38 efficient_producer(X0) | first_mover(X0) | ~organisation_at_time(X0,X1)). % 0.09/0.38 cnf(c1, plain, % 0.09/0.38 efficient_producer(X0) | first_mover(X0) | ~organisation_at_time(X0,X1), % 0.09/0.38 inference(start, [], [c0])). % 0.09/0.38 % 0.09/0.38 cnf(c2, axiom, % 0.09/0.38 has_elaborated_routines(X2,X3) | ~founding_time(X2,X3) | ~efficient_producer(X2) | ~organisation_at_time(X2,X3)). % 0.09/0.38 cnf(a0, assumption, % 0.09/0.38 X0 = X2). % 0.09/0.38 cnf(c3, plain, % 0.09/0.38 first_mover(X0) | ~organisation_at_time(X0,X1), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.38 cnf(c4, plain, % 0.09/0.38 has_elaborated_routines(X2,X3) | ~founding_time(X2,X3) | ~organisation_at_time(X2,X3), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.09/0.38 % 0.09/0.38 cnf(c5, axiom, % 0.09/0.38 ~has_elaborated_routines(sK0,sK1)). % 0.09/0.38 cnf(a1, assumption, % 0.09/0.38 X2 = sK0). % 0.09/0.38 cnf(a2, assumption, % 0.09/0.38 X3 = sK1). % 0.09/0.38 cnf(c6, plain, % 0.09/0.38 ~founding_time(X2,X3) | ~organisation_at_time(X2,X3), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.09/0.38 cnf(c7, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.09/0.38 % 0.09/0.38 cnf(c8, axiom, % 0.09/0.38 founding_time(sK0,sK1)). % 0.09/0.38 cnf(a3, assumption, % 0.09/0.38 X2 = sK0). % 0.09/0.38 cnf(a4, assumption, % 0.09/0.38 X3 = sK1). % 0.09/0.38 cnf(c9, plain, % 0.09/0.38 ~organisation_at_time(X2,X3), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.09/0.38 cnf(c10, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.09/0.38 % 0.09/0.38 cnf(c11, axiom, % 0.09/0.38 organisation_at_time(sK0,sK1)). % 0.09/0.38 cnf(a5, assumption, % 0.09/0.38 X2 = sK0). % 0.09/0.38 cnf(a6, assumption, % 0.09/0.38 X3 = sK1). % 0.09/0.38 cnf(c12, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])). % 0.09/0.38 cnf(c13, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])). % 0.09/0.38 % 0.09/0.38 cnf(c14, axiom, % 0.09/0.38 number_of_routines(X4,X5,low) | ~founding_time(X4,X5) | ~first_mover(X4) | ~organisation_at_time(X4,X5)). % 0.09/0.38 cnf(a7, assumption, % 0.09/0.38 X0 = X4). % 0.09/0.38 cnf(c15, plain, % 0.09/0.38 ~organisation_at_time(X0,X1), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a7])], [c3, c14])). % 0.09/0.38 cnf(c16, plain, % 0.09/0.38 number_of_routines(X4,X5,low) | ~founding_time(X4,X5) | ~organisation_at_time(X4,X5), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a7])], [c3, c14])). % 0.09/0.38 % 0.09/0.38 cnf(c17, axiom, % 0.09/0.38 ~number_of_routines(X6,X7,high) | ~number_of_routines(X6,X7,low)). % 0.09/0.38 cnf(a8, assumption, % 0.09/0.38 X4 = X6). % 0.09/0.38 cnf(a9, assumption, % 0.09/0.38 X5 = X7). % 0.09/0.38 cnf(a10, assumption, % 0.09/0.38 low = low). % 0.09/0.38 cnf(c18, plain, % 0.09/0.38 ~founding_time(X4,X5) | ~organisation_at_time(X4,X5), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])). % 0.09/0.38 cnf(c19, plain, % 0.09/0.38 ~number_of_routines(X6,X7,high), % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])). % 0.09/0.38 % 0.09/0.38 cnf(c20, axiom, % 0.09/0.38 number_of_routines(sK0,sK1,high)). % 0.09/0.38 cnf(a11, assumption, % 0.09/0.38 X6 = sK0). % 0.09/0.38 cnf(a12, assumption, % 0.09/0.38 X7 = sK1). % 0.09/0.38 cnf(a13, assumption, % 0.09/0.38 high = high). % 0.09/0.38 cnf(c21, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c19, c20])). % 0.09/0.38 cnf(c22, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c19, c20])). % 0.09/0.38 % 0.09/0.38 cnf(c23, plain, % 0.09/0.38 founding_time(X2,X3)). % 0.09/0.38 cnf(a14, assumption, % 0.09/0.38 X4 = X2). % 0.09/0.38 cnf(a15, assumption, % 0.09/0.38 X5 = X3). % 0.09/0.38 cnf(c24, plain, % 0.09/0.38 ~organisation_at_time(X4,X5), % 0.09/0.38 inference(predicate_reduction, [assumptions([a14, a15])], [c18, c23])). % 0.09/0.38 % 0.09/0.38 cnf(c25, plain, % 0.09/0.38 organisation_at_time(X2,X3)). % 0.09/0.38 cnf(a16, assumption, % 0.09/0.38 X4 = X2). % 0.09/0.38 cnf(a17, assumption, % 0.09/0.38 X5 = X3). % 0.09/0.38 cnf(c26, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])). % 0.09/0.38 % 0.09/0.38 cnf(c27, plain, % 0.09/0.38 organisation_at_time(X2,X3)). % 0.09/0.38 cnf(a18, assumption, % 0.09/0.38 X0 = X2). % 0.09/0.38 cnf(a19, assumption, % 0.09/0.38 X1 = X3). % 0.09/0.38 cnf(c28, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(predicate_reduction, [assumptions([a18, a19])], [c15, c27])). % 0.09/0.38 % 0.09/0.38 cnf(c29, plain, % 0.09/0.38 $false, % 0.09/0.38 inference(constraint_solving, [ % 0.09/0.38 bind(X0, sK0), % 0.09/0.38 bind(X1, sK1), % 0.09/0.38 bind(X2, sK0), % 0.09/0.38 bind(X3, sK1), % 0.09/0.38 bind(X4, sK0), % 0.09/0.38 bind(X5, sK1), % 0.09/0.38 bind(X6, sK0), % 0.09/0.38 bind(X7, sK1) % 0.09/0.38 ], % 0.09/0.38 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])). % 0.09/0.38 % 0.09/0.38 % SZS output end IncompleteProof %------------------------------------------------------------------------------