TSTP Solution File: MGT041-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : MGT041-2 : 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 : n027.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:36 EDT 2022
% Result : Unsatisfiable 0.13s 0.35s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MGT041-2 : TPTP v8.1.0. Released v2.4.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.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 07:39:57 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Unsatisfiable
% 0.13/0.35 % SZS output begin IncompleteProof
% 0.13/0.35 cnf(c0, axiom,
% 0.13/0.35 efficient_producer(X0) | first_mover(X0) | ~organisation_at_time(X0,X1)).
% 0.13/0.35 cnf(c1, plain,
% 0.13/0.35 efficient_producer(X0) | first_mover(X0) | ~organisation_at_time(X0,X1),
% 0.13/0.35 inference(start, [], [c0])).
% 0.13/0.35
% 0.13/0.35 cnf(c2, axiom,
% 0.13/0.35 has_elaborated_routines(X2,X3) | ~founding_time(X2,X3) | ~efficient_producer(X2) | ~organisation_at_time(X2,X3)).
% 0.13/0.35 cnf(a0, assumption,
% 0.13/0.35 X0 = X2).
% 0.13/0.35 cnf(c3, plain,
% 0.13/0.35 first_mover(X0) | ~organisation_at_time(X0,X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35 cnf(c4, plain,
% 0.13/0.35 has_elaborated_routines(X2,X3) | ~founding_time(X2,X3) | ~organisation_at_time(X2,X3),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.35
% 0.13/0.35 cnf(c5, axiom,
% 0.13/0.35 ~has_elaborated_routines(sk1,sk2)).
% 0.13/0.35 cnf(a1, assumption,
% 0.13/0.35 X2 = sk1).
% 0.13/0.35 cnf(a2, assumption,
% 0.13/0.35 X3 = sk2).
% 0.13/0.35 cnf(c6, plain,
% 0.13/0.35 ~founding_time(X2,X3) | ~organisation_at_time(X2,X3),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.35 cnf(c7, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])).
% 0.13/0.35
% 0.13/0.35 cnf(c8, axiom,
% 0.13/0.35 founding_time(sk1,sk2)).
% 0.13/0.35 cnf(a3, assumption,
% 0.13/0.35 X2 = sk1).
% 0.13/0.35 cnf(a4, assumption,
% 0.13/0.35 X3 = sk2).
% 0.13/0.35 cnf(c9, plain,
% 0.13/0.35 ~organisation_at_time(X2,X3),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.13/0.35 cnf(c10, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])).
% 0.13/0.35
% 0.13/0.35 cnf(c11, axiom,
% 0.13/0.35 organisation_at_time(sk1,sk2)).
% 0.13/0.35 cnf(a5, assumption,
% 0.13/0.35 X2 = sk1).
% 0.13/0.35 cnf(a6, assumption,
% 0.13/0.35 X3 = sk2).
% 0.13/0.35 cnf(c12, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.13/0.35 cnf(c13, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a5, a6])], [c9, c11])).
% 0.13/0.35
% 0.13/0.35 cnf(c14, axiom,
% 0.13/0.35 number_of_routines(X4,X5,low) | ~founding_time(X4,X5) | ~first_mover(X4) | ~organisation_at_time(X4,X5)).
% 0.13/0.35 cnf(a7, assumption,
% 0.13/0.35 X0 = X4).
% 0.13/0.35 cnf(c15, plain,
% 0.13/0.35 ~organisation_at_time(X0,X1),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c3, c14])).
% 0.13/0.35 cnf(c16, plain,
% 0.13/0.35 number_of_routines(X4,X5,low) | ~founding_time(X4,X5) | ~organisation_at_time(X4,X5),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c3, c14])).
% 0.13/0.35
% 0.13/0.35 cnf(c17, axiom,
% 0.13/0.35 ~number_of_routines(X6,X7,high) | ~number_of_routines(X6,X7,low)).
% 0.13/0.35 cnf(a8, assumption,
% 0.13/0.35 X4 = X6).
% 0.13/0.35 cnf(a9, assumption,
% 0.13/0.35 X5 = X7).
% 0.13/0.35 cnf(a10, assumption,
% 0.13/0.35 low = low).
% 0.13/0.35 cnf(c18, plain,
% 0.13/0.35 ~founding_time(X4,X5) | ~organisation_at_time(X4,X5),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])).
% 0.13/0.35 cnf(c19, plain,
% 0.13/0.35 ~number_of_routines(X6,X7,high),
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c16, c17])).
% 0.13/0.35
% 0.13/0.35 cnf(c20, axiom,
% 0.13/0.35 number_of_routines(sk1,sk2,high)).
% 0.13/0.35 cnf(a11, assumption,
% 0.13/0.35 X6 = sk1).
% 0.13/0.35 cnf(a12, assumption,
% 0.13/0.35 X7 = sk2).
% 0.13/0.35 cnf(a13, assumption,
% 0.13/0.35 high = high).
% 0.13/0.35 cnf(c21, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c19, c20])).
% 0.13/0.35 cnf(c22, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c19, c20])).
% 0.13/0.35
% 0.13/0.35 cnf(c23, plain,
% 0.13/0.35 founding_time(X2,X3)).
% 0.13/0.35 cnf(a14, assumption,
% 0.13/0.35 X4 = X2).
% 0.13/0.35 cnf(a15, assumption,
% 0.13/0.35 X5 = X3).
% 0.13/0.35 cnf(c24, plain,
% 0.13/0.35 ~organisation_at_time(X4,X5),
% 0.13/0.35 inference(predicate_reduction, [assumptions([a14, a15])], [c18, c23])).
% 0.13/0.35
% 0.13/0.35 cnf(c25, plain,
% 0.13/0.35 organisation_at_time(X2,X3)).
% 0.13/0.35 cnf(a16, assumption,
% 0.13/0.35 X4 = X2).
% 0.13/0.35 cnf(a17, assumption,
% 0.13/0.35 X5 = X3).
% 0.13/0.35 cnf(c26, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 0.13/0.35
% 0.13/0.35 cnf(c27, plain,
% 0.13/0.35 organisation_at_time(X2,X3)).
% 0.13/0.35 cnf(a18, assumption,
% 0.13/0.35 X0 = X2).
% 0.13/0.35 cnf(a19, assumption,
% 0.13/0.35 X1 = X3).
% 0.13/0.35 cnf(c28, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(predicate_reduction, [assumptions([a18, a19])], [c15, c27])).
% 0.13/0.35
% 0.13/0.35 cnf(c29, plain,
% 0.13/0.35 $false,
% 0.13/0.35 inference(constraint_solving, [
% 0.13/0.35 bind(X0, sk1),
% 0.13/0.35 bind(X1, sk2),
% 0.13/0.35 bind(X2, sk1),
% 0.13/0.35 bind(X3, sk2),
% 0.13/0.35 bind(X4, sk1),
% 0.13/0.35 bind(X5, sk2),
% 0.13/0.35 bind(X6, sk1),
% 0.13/0.35 bind(X7, sk2)
% 0.13/0.35 ],
% 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 0.13/0.35
% 0.13/0.35 % SZS output end IncompleteProof
%------------------------------------------------------------------------------