TSTP Solution File: MGT041+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT041+2 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 16:08:27 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP8768/MGT041+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8768/MGT041+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8768/MGT041+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 8864
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(((organisation_at_time(X1,X2)&efficient_producer(X1))&founding_time(X1,X2))=>has_elaborated_routines(X1,X2)),file('/tmp/SRASS.s.p', a14)).
% fof(2, axiom,![X1]:![X2]:(((organisation_at_time(X1,X2)&first_mover(X1))&founding_time(X1,X2))=>number_of_routines(X1,X2,low)),file('/tmp/SRASS.s.p', a15)).
% fof(3, axiom,?[X1]:?[X2]:(((organisation_at_time(X1,X2)&founding_time(X1,X2))&number_of_routines(X1,X2,high))&~(has_elaborated_routines(X1,X2))),file('/tmp/SRASS.s.p', a16)).
% fof(4, axiom,![X1]:![X2]:~((number_of_routines(X1,X2,low)&number_of_routines(X1,X2,high))),file('/tmp/SRASS.s.p', mp_not_high_and_low)).
% fof(5, conjecture,?[X1]:?[X2]:((organisation_at_time(X1,X2)&~(first_mover(X1)))&~(efficient_producer(X1))),file('/tmp/SRASS.s.p', prove_t10)).
% fof(6, negated_conjecture,~(?[X1]:?[X2]:((organisation_at_time(X1,X2)&~(first_mover(X1)))&~(efficient_producer(X1)))),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,?[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)],[3,theory(equality)])).
% fof(8, negated_conjecture,~(?[X1]:?[X2]:((organisation_at_time(X1,X2)&~(first_mover(X1)))&~(efficient_producer(X1)))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(9, plain,![X1]:![X2]:(((~(organisation_at_time(X1,X2))|~(efficient_producer(X1)))|~(founding_time(X1,X2)))|has_elaborated_routines(X1,X2)),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,![X3]:![X4]:(((~(organisation_at_time(X3,X4))|~(efficient_producer(X3)))|~(founding_time(X3,X4)))|has_elaborated_routines(X3,X4)),inference(variable_rename,[status(thm)],[9])).
% cnf(11,plain,(has_elaborated_routines(X1,X2)|~founding_time(X1,X2)|~efficient_producer(X1)|~organisation_at_time(X1,X2)),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X1]:![X2]:(((~(organisation_at_time(X1,X2))|~(first_mover(X1)))|~(founding_time(X1,X2)))|number_of_routines(X1,X2,low)),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X3]:![X4]:(((~(organisation_at_time(X3,X4))|~(first_mover(X3)))|~(founding_time(X3,X4)))|number_of_routines(X3,X4,low)),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(number_of_routines(X1,X2,low)|~founding_time(X1,X2)|~first_mover(X1)|~organisation_at_time(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,?[X3]:?[X4]:(((organisation_at_time(X3,X4)&founding_time(X3,X4))&number_of_routines(X3,X4,high))&~(has_elaborated_routines(X3,X4))),inference(variable_rename,[status(thm)],[7])).
% fof(16, plain,(((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(skolemize,[status(esa)],[15])).
% cnf(17,plain,(~has_elaborated_routines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(number_of_routines(esk1_0,esk2_0,high)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(founding_time(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[16])).
% cnf(20,plain,(organisation_at_time(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[16])).
% fof(21, plain,![X1]:![X2]:(~(number_of_routines(X1,X2,low))|~(number_of_routines(X1,X2,high))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X3]:![X4]:(~(number_of_routines(X3,X4,low))|~(number_of_routines(X3,X4,high))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(~number_of_routines(X1,X2,high)|~number_of_routines(X1,X2,low)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, negated_conjecture,![X1]:![X2]:((~(organisation_at_time(X1,X2))|first_mover(X1))|efficient_producer(X1)),inference(fof_nnf,[status(thm)],[8])).
% fof(25, negated_conjecture,![X3]:![X4]:((~(organisation_at_time(X3,X4))|first_mover(X3))|efficient_producer(X3)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,negated_conjecture,(efficient_producer(X1)|first_mover(X1)|~organisation_at_time(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,negated_conjecture,(first_mover(esk1_0)|efficient_producer(esk1_0)),inference(pm,[status(thm)],[26,20,theory(equality)])).
% cnf(28,plain,(~founding_time(esk1_0,esk2_0)|~efficient_producer(esk1_0)|~organisation_at_time(esk1_0,esk2_0)),inference(pm,[status(thm)],[17,11,theory(equality)])).
% cnf(29,plain,($false|~efficient_producer(esk1_0)|~organisation_at_time(esk1_0,esk2_0)),inference(rw,[status(thm)],[28,19,theory(equality)])).
% cnf(30,plain,($false|~efficient_producer(esk1_0)|$false),inference(rw,[status(thm)],[29,20,theory(equality)])).
% cnf(31,plain,(~efficient_producer(esk1_0)),inference(cn,[status(thm)],[30,theory(equality)])).
% cnf(32,plain,(number_of_routines(esk1_0,esk2_0,low)|~first_mover(esk1_0)|~organisation_at_time(esk1_0,esk2_0)),inference(pm,[status(thm)],[14,19,theory(equality)])).
% cnf(33,plain,(number_of_routines(esk1_0,esk2_0,low)|~first_mover(esk1_0)|$false),inference(rw,[status(thm)],[32,20,theory(equality)])).
% cnf(34,plain,(number_of_routines(esk1_0,esk2_0,low)|~first_mover(esk1_0)),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(35,negated_conjecture,(first_mover(esk1_0)),inference(sr,[status(thm)],[27,31,theory(equality)])).
% cnf(36,plain,(number_of_routines(esk1_0,esk2_0,low)|$false),inference(rw,[status(thm)],[34,35,theory(equality)])).
% cnf(37,plain,(number_of_routines(esk1_0,esk2_0,low)),inference(cn,[status(thm)],[36,theory(equality)])).
% cnf(38,plain,(~number_of_routines(esk1_0,esk2_0,high)),inference(pm,[status(thm)],[23,37,theory(equality)])).
% cnf(39,plain,($false),inference(rw,[status(thm)],[38,18,theory(equality)])).
% cnf(40,plain,($false),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(41,plain,($false),40,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 11
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 4
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 4
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 11
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 17 leaves, 1.12+/-0.322 terms/leaf
% # Paramod-from index: 5 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 14 leaves, 1.07+/-0.258 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.002 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP8768/MGT041+2.tptp
%
%------------------------------------------------------------------------------