%------------------------------------------------------------------------------
% File : PyRes---1.5
% Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% Computer : n011.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:18:45 AM UTC 2026
% Result : Theorem 0.32s 0.61s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT041+2 : TPTP v9.3.0. Released v2.0.0.
% 0.00/0.04 % Command : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 7 13:02:15 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:155: SyntaxWarning: invalid escape sequence '\.'
% 0.09/0.43 (re.compile("\."), Token.FullStop),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:156: SyntaxWarning: invalid escape sequence '\('
% 0.09/0.43 (re.compile("\("), Token.OpenPar),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:157: SyntaxWarning: invalid escape sequence '\)'
% 0.09/0.43 (re.compile("\)"), Token.ClosePar),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:158: SyntaxWarning: invalid escape sequence '\['
% 0.09/0.43 (re.compile("\["), Token.OpenSquare),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:159: SyntaxWarning: invalid escape sequence '\]'
% 0.09/0.43 (re.compile("\]"), Token.CloseSquare),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:162: SyntaxWarning: invalid escape sequence '\|'
% 0.09/0.43 (re.compile("~\|"), Token.Nor),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:164: SyntaxWarning: invalid escape sequence '\|'
% 0.09/0.43 (re.compile("\|"), Token.Or),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:175: SyntaxWarning: invalid escape sequence '\?'
% 0.09/0.43 (re.compile("\?"), Token.Existential),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:176: SyntaxWarning: invalid escape sequence '\s'
% 0.09/0.43 (re.compile("\s+"), Token.WhiteSpace),
% 0.09/0.43 /export/starexec/sandbox/solver/bin/lexer.py:180: SyntaxWarning: invalid escape sequence '\$'
% 0.09/0.43 (re.compile("\$[_a-z0-9_A-Z]*"), Token.DefFunctor),
% 0.21/0.50 /export/starexec/sandbox/solver/bin/signature.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.21/0.50 """
% 0.21/0.50 /export/starexec/sandbox/solver/bin/literals.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.21/0.50 """
% 0.32/0.59 /export/starexec/sandbox/solver/bin/unification.py:6: SyntaxWarning: invalid escape sequence '\c'
% 0.32/0.59 """
% 0.32/0.61 % Version: 1.5
% 0.32/0.61 % SZS status Theorem
% 0.32/0.61 % SZS output start CNFRefutation
% 0.32/0.61 fof(a16,plain,(?[X]:(?[T]:(((organisation_at_time(X,T)&founding_time(X,T))&number_of_routines(X,T,high))&(~has_elaborated_routines(X,T))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p', a16)).
% 0.32/0.61 fof(c7,plain,(?[X]:(?[T]:(((organisation_at_time(X,T)&founding_time(X,T))&number_of_routines(X,T,high))&~has_elaborated_routines(X,T)))),inference(fof_simplification,[status(thm)],[a16])).
% 0.32/0.61 fof(c8,plain,(?[X4]:(?[X5]:(((organisation_at_time(X4,X5)&founding_time(X4,X5))&number_of_routines(X4,X5,high))&~has_elaborated_routines(X4,X5)))),inference(variable_rename,[status(thm)],[c7])).
% 0.32/0.61 fof(c9,plain,(((organisation_at_time(skolem0001,skolem0002)&founding_time(skolem0001,skolem0002))&number_of_routines(skolem0001,skolem0002,high))&~has_elaborated_routines(skolem0001,skolem0002)),inference(skolemize,[status(esa)],[c8])).
% 0.32/0.61 cnf(c12,plain,number_of_routines(skolem0001,skolem0002,high),inference(split_conjunct,[status(thm)],[c9])).
% 0.32/0.61 fof(mp_not_high_and_low,axiom,(![X]:(![T]:(~(number_of_routines(X,T,low)&number_of_routines(X,T,high))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p', mp_not_high_and_low)).
% 0.32/0.61 fof(c20,plain,(![X]:(![T]:(~number_of_routines(X,T,low)|~number_of_routines(X,T,high)))),inference(fof_nnf,[status(thm)],[mp_not_high_and_low])).
% 0.32/0.61 fof(c21,plain,(![X10]:(![X11]:(~number_of_routines(X10,X11,low)|~number_of_routines(X10,X11,high)))),inference(variable_rename,[status(thm)],[c20])).
% 0.32/0.61 cnf(c22,plain,~number_of_routines(X16,X17,low)|~number_of_routines(X16,X17,high),inference(split_conjunct,[status(thm)],[c21])).
% 0.32/0.61 cnf(c25,plain,~number_of_routines(skolem0001,skolem0002,low),inference(resolution,[status(thm)],[c22, c12])).
% 0.32/0.61 cnf(c13,plain,~has_elaborated_routines(skolem0001,skolem0002),inference(split_conjunct,[status(thm)],[c9])).
% 0.32/0.61 cnf(c10,plain,organisation_at_time(skolem0001,skolem0002),inference(split_conjunct,[status(thm)],[c9])).
% 0.32/0.61 fof(prove_t10,conjecture,(?[X]:(?[T]:((organisation_at_time(X,T)&(~first_mover(X)))&(~efficient_producer(X))))),file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_t10)).
% 0.32/0.61 fof(c0,negated_conjecture,(~(?[X]:(?[T]:((organisation_at_time(X,T)&(~first_mover(X)))&(~efficient_producer(X)))))),inference(assume_negation,[status(cth)],[prove_t10])).
% 0.32/0.61 fof(c1,negated_conjecture,(~(?[X]:(?[T]:((organisation_at_time(X,T)&~first_mover(X))&~efficient_producer(X))))),inference(fof_simplification,[status(thm)],[c0])).
% 0.32/0.61 fof(c2,negated_conjecture,(![X]:(![T]:((~organisation_at_time(X,T)|first_mover(X))|efficient_producer(X)))),inference(fof_nnf,[status(thm)],[c1])).
% 0.32/0.61 fof(c3,negated_conjecture,(![X]:(((![T]:~organisation_at_time(X,T))|first_mover(X))|efficient_producer(X))),inference(shift_quantors,[status(thm)],[c2])).
% 0.32/0.61 fof(c5,negated_conjecture,(![X2]:(![X3]:((~organisation_at_time(X2,X3)|first_mover(X2))|efficient_producer(X2)))),inference(shift_quantors,[status(thm)],[fof(c4,negated_conjecture,(![X2]:(((![X3]:~organisation_at_time(X2,X3))|first_mover(X2))|efficient_producer(X2))),inference(variable_rename,[status(thm)],[c3])).])).
% 0.32/0.61 cnf(c6,negated_conjecture,~organisation_at_time(X13,X12)|first_mover(X13)|efficient_producer(X13),inference(split_conjunct,[status(thm)],[c5])).
% 0.32/0.61 cnf(c23,plain,first_mover(skolem0001)|efficient_producer(skolem0001),inference(resolution,[status(thm)],[c6, c10])).
% 0.32/0.61 cnf(c11,plain,founding_time(skolem0001,skolem0002),inference(split_conjunct,[status(thm)],[c9])).
% 0.32/0.61 fof(a14,plain,(![X]:(![T]:(((organisation_at_time(X,T)&efficient_producer(X))&founding_time(X,T))=>has_elaborated_routines(X,T)))),file('/export/starexec/sandbox/benchmark/theBenchmark.p', a14)).
% 0.32/0.61 fof(c17,plain,(![X]:(![T]:(((~organisation_at_time(X,T)|~efficient_producer(X))|~founding_time(X,T))|has_elaborated_routines(X,T)))),inference(fof_nnf,[status(thm)],[a14])).
% 0.32/0.61 fof(c18,plain,(![X8]:(![X9]:(((~organisation_at_time(X8,X9)|~efficient_producer(X8))|~founding_time(X8,X9))|has_elaborated_routines(X8,X9)))),inference(variable_rename,[status(thm)],[c17])).
% 0.32/0.61 cnf(c19,plain,~organisation_at_time(X19,X18)|~efficient_producer(X19)|~founding_time(X19,X18)|has_elaborated_routines(X19,X18),inference(split_conjunct,[status(thm)],[c18])).
% 0.32/0.61 cnf(c26,plain,~organisation_at_time(skolem0001,skolem0002)|~efficient_producer(skolem0001)|has_elaborated_routines(skolem0001,skolem0002),inference(resolution,[status(thm)],[c19, c11])).
% 0.32/0.61 cnf(c27,plain,~efficient_producer(skolem0001)|has_elaborated_routines(skolem0001,skolem0002),inference(resolution,[status(thm)],[c26, c10])).
% 0.32/0.61 cnf(c29,plain,has_elaborated_routines(skolem0001,skolem0002)|first_mover(skolem0001),inference(resolution,[status(thm)],[c27, c23])).
% 0.32/0.61 cnf(c30,plain,first_mover(skolem0001),inference(resolution,[status(thm)],[c29, c13])).
% 0.32/0.61 fof(a15,plain,(![X]:(![T]:(((organisation_at_time(X,T)&first_mover(X))&founding_time(X,T))=>number_of_routines(X,T,low)))),file('/export/starexec/sandbox/benchmark/theBenchmark.p', a15)).
% 0.32/0.61 fof(c14,plain,(![X]:(![T]:(((~organisation_at_time(X,T)|~first_mover(X))|~founding_time(X,T))|number_of_routines(X,T,low)))),inference(fof_nnf,[status(thm)],[a15])).
% 0.32/0.61 fof(c15,plain,(![X6]:(![X7]:(((~organisation_at_time(X6,X7)|~first_mover(X6))|~founding_time(X6,X7))|number_of_routines(X6,X7,low)))),inference(variable_rename,[status(thm)],[c14])).
% 0.32/0.61 cnf(c16,plain,~organisation_at_time(X14,X15)|~first_mover(X14)|~founding_time(X14,X15)|number_of_routines(X14,X15,low),inference(split_conjunct,[status(thm)],[c15])).
% 0.32/0.61 cnf(c24,plain,~organisation_at_time(skolem0001,skolem0002)|~first_mover(skolem0001)|number_of_routines(skolem0001,skolem0002,low),inference(resolution,[status(thm)],[c16, c11])).
% 0.32/0.61 cnf(c28,plain,~first_mover(skolem0001)|number_of_routines(skolem0001,skolem0002,low),inference(resolution,[status(thm)],[c24, c10])).
% 0.32/0.61 cnf(c31,plain,number_of_routines(skolem0001,skolem0002,low),inference(resolution,[status(thm)],[c28, c30])).
% 0.32/0.61 cnf(c32,plain,$false,inference(resolution,[status(thm)],[c31, c25])).
% 0.32/0.61 % SZS output end CNFRefutation
% 0.32/0.61
% 0.32/0.61 % Initial clauses : 8
% 0.32/0.61 % Processed clauses : 17
% 0.32/0.61 % Factors computed : 0
% 0.32/0.61 % Resolvents computed: 10
% 0.32/0.61 % Tautologies deleted: 0
% 0.32/0.61 % Forward subsumed : 0
% 0.32/0.61 % Backward subsumed : 5
% 0.32/0.61 % -------- CPU Time ---------
% 0.32/0.61 % User time : 0.220 s
% 0.32/0.61 % System time : 0.019 s
% 0.32/0.61 % Total time : 0.239 s
%------------------------------------------------------------------------------