%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n002.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:04:33 AM UTC 2026
% Result : Theorem 0.24s 0.52s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 7 13:05:07 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.24/0.47 start to proof:theBenchmark.p
% 0.24/0.52 % Version : CSI_E---1.1
% 0.24/0.52 % Problem : theBenchmark.p
% 0.24/0.52 % Proof found!
% 0.24/0.52 % SZS status Theorem for theBenchmark.p
% 0.24/0.52 % SZS output start Proof
% 0.24/0.52 fof(prove_t10, conjecture, ?[X1, X2]:(((organisation_at_time(X1,X2)&~(first_mover(X1)))&~(efficient_producer(X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_t10)).
% 0.24/0.52 fof(a16, hypothesis, ?[X1, X2]:((((organisation_at_time(X1,X2)&founding_time(X1,X2))&number_of_routines(X1,X2,high))&~(has_elaborated_routines(X1,X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', a16)).
% 0.24/0.52 fof(a14, hypothesis, ![X1, X2]:((((organisation_at_time(X1,X2)&efficient_producer(X1))&founding_time(X1,X2))=>has_elaborated_routines(X1,X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', a14)).
% 0.24/0.52 fof(a15, hypothesis, ![X1, X2]:((((organisation_at_time(X1,X2)&first_mover(X1))&founding_time(X1,X2))=>number_of_routines(X1,X2,low))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', a15)).
% 0.24/0.52 fof(mp_not_high_and_low, axiom, ![X1, X2]:(~((number_of_routines(X1,X2,low)&number_of_routines(X1,X2,high)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mp_not_high_and_low)).
% 0.24/0.52 fof(c_0_5, negated_conjecture, ~(?[X1, X2]:(((organisation_at_time(X1,X2)&~first_mover(X1))&~efficient_producer(X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_t10])])).
% 0.24/0.52 fof(c_0_6, hypothesis, ?[X1, X2]:((((organisation_at_time(X1,X2)&founding_time(X1,X2))&number_of_routines(X1,X2,high))&~has_elaborated_routines(X1,X2))), inference(fof_simplification,[status(thm)],[a16])).
% 0.24/0.52 fof(c_0_7, negated_conjecture, ![X11, X12]:((~organisation_at_time(X11,X12)|first_mover(X11)|efficient_producer(X11))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
% 0.24/0.52 fof(c_0_8, hypothesis, (((organisation_at_time(esk1_0,esk2_0)&founding_time(esk1_0,esk2_0))&number_of_routines(esk1_0,esk2_0,high))&~has_elaborated_routines(esk1_0,esk2_0)), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])])).
% 0.24/0.52 fof(c_0_9, hypothesis, ![X5, X6]:((~organisation_at_time(X5,X6)|~efficient_producer(X5)|~founding_time(X5,X6)|has_elaborated_routines(X5,X6))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a14])])])).
% 0.24/0.52 fof(c_0_10, hypothesis, ![X7, X8]:((~organisation_at_time(X7,X8)|~first_mover(X7)|~founding_time(X7,X8)|number_of_routines(X7,X8,low))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a15])])])).
% 0.24/0.52 cnf(c_0_11, negated_conjecture, (first_mover(X1)|efficient_producer(X1)|~organisation_at_time(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
% 0.24/0.52 cnf(c_0_12, hypothesis, (organisation_at_time(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.52 cnf(c_0_13, hypothesis, (~has_elaborated_routines(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.52 cnf(c_0_14, hypothesis, (has_elaborated_routines(X1,X2)|~organisation_at_time(X1,X2)|~efficient_producer(X1)|~founding_time(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.24/0.52 cnf(c_0_15, hypothesis, (founding_time(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.52 cnf(c_0_16, hypothesis, (number_of_routines(X1,X2,low)|~organisation_at_time(X1,X2)|~first_mover(X1)|~founding_time(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
% 0.24/0.52 cnf(c_0_17, hypothesis, (first_mover(esk1_0)|efficient_producer(esk1_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.24/0.52 cnf(c_0_18, hypothesis, (~efficient_producer(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), c_0_12])])).
% 0.24/0.52 fof(c_0_19, plain, ![X3, X4]:((~number_of_routines(X3,X4,low)|~number_of_routines(X3,X4,high))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_not_high_and_low])])])).
% 0.24/0.52 cnf(c_0_20, hypothesis, (number_of_routines(esk1_0,esk2_0,low)|~first_mover(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_15]), c_0_12])])).
% 0.24/0.52 cnf(c_0_21, hypothesis, (first_mover(esk1_0)), inference(sr,[status(thm)],[c_0_17, c_0_18])).
% 0.24/0.52 cnf(c_0_22, plain, (~number_of_routines(X1,X2,low)|~number_of_routines(X1,X2,high)), inference(split_conjunct,[status(thm)],[c_0_19])).
% 0.24/0.52 cnf(c_0_23, hypothesis, (number_of_routines(esk1_0,esk2_0,low)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_21])])).
% 0.24/0.52 cnf(c_0_24, hypothesis, (number_of_routines(esk1_0,esk2_0,high)), inference(split_conjunct,[status(thm)],[c_0_8])).
% 0.24/0.52 cnf(c_0_25, hypothesis, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])]), ['proof']).
% 0.24/0.52 % SZS output end Proof
% 0.24/0.52 % User time : 0.002 s
% 0.24/0.52 % System time : 0.004 s
% 0.24/0.52 % Total time : 0.006 s
% 0.24/0.52 % User time : 0.011 s
% 0.24/0.52 % System time : 0.010 s
% 0.24/0.52 % Total time : 0.022 s
% 0.24/0.52
%------------------------------------------------------------------------------