TSTP Solution File: MGT045+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT045+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:09:00 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/SystemOnTPTP3847/MGT045+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3847/MGT045+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3847/MGT045+1.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 3943
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>greater(external_ties(X1,X5),external_ties(X1,X4))),file('/tmp/SRASS.s.p', assumption_8)).
% fof(4, axiom,![X1]:![X4]:![X5]:(organization(X1)=>((greater(external_ties(X1,X5),external_ties(X1,X4))=>greater(position(X1,X5),position(X1,X4)))&(external_ties(X1,X5)=external_ties(X1,X4)=>position(X1,X5)=position(X1,X4)))),file('/tmp/SRASS.s.p', assumption_6)).
% fof(9, conjecture,![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>greater(position(X1,X5),position(X1,X4))),file('/tmp/SRASS.s.p', lemma_4)).
% fof(10, negated_conjecture,~(![X1]:![X4]:![X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))=>greater(position(X1,X5),position(X1,X4)))),inference(assume_negation,[status(cth)],[9])).
% fof(17, plain,![X1]:![X4]:![X5]:((~(organization(X1))|~(greater(age(X1,X5),age(X1,X4))))|greater(external_ties(X1,X5),external_ties(X1,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X6]:![X7]:![X8]:((~(organization(X6))|~(greater(age(X6,X8),age(X6,X7))))|greater(external_ties(X6,X8),external_ties(X6,X7))),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,(greater(external_ties(X1,X2),external_ties(X1,X3))|~greater(age(X1,X2),age(X1,X3))|~organization(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X4]:![X5]:(~(organization(X1))|((~(greater(external_ties(X1,X5),external_ties(X1,X4)))|greater(position(X1,X5),position(X1,X4)))&(~(external_ties(X1,X5)=external_ties(X1,X4))|position(X1,X5)=position(X1,X4)))),inference(fof_nnf,[status(thm)],[4])).
% fof(21, plain,![X6]:![X7]:![X8]:(~(organization(X6))|((~(greater(external_ties(X6,X8),external_ties(X6,X7)))|greater(position(X6,X8),position(X6,X7)))&(~(external_ties(X6,X8)=external_ties(X6,X7))|position(X6,X8)=position(X6,X7)))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X6]:![X7]:![X8]:(((~(greater(external_ties(X6,X8),external_ties(X6,X7)))|greater(position(X6,X8),position(X6,X7)))|~(organization(X6)))&((~(external_ties(X6,X8)=external_ties(X6,X7))|position(X6,X8)=position(X6,X7))|~(organization(X6)))),inference(distribute,[status(thm)],[21])).
% cnf(24,plain,(greater(position(X1,X2),position(X1,X3))|~organization(X1)|~greater(external_ties(X1,X2),external_ties(X1,X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(43, negated_conjecture,?[X1]:?[X4]:?[X5]:((organization(X1)&greater(age(X1,X5),age(X1,X4)))&~(greater(position(X1,X5),position(X1,X4)))),inference(fof_nnf,[status(thm)],[10])).
% fof(44, negated_conjecture,?[X6]:?[X7]:?[X8]:((organization(X6)&greater(age(X6,X8),age(X6,X7)))&~(greater(position(X6,X8),position(X6,X7)))),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,((organization(esk1_0)&greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0)))&~(greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0)))),inference(skolemize,[status(esa)],[44])).
% cnf(46,negated_conjecture,(~greater(position(esk1_0,esk3_0),position(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,negated_conjecture,(greater(age(esk1_0,esk3_0),age(esk1_0,esk2_0))),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,negated_conjecture,(organization(esk1_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(57,negated_conjecture,(greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|~organization(esk1_0)),inference(spm,[status(thm)],[19,47,theory(equality)])).
% cnf(58,negated_conjecture,(greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[57,48,theory(equality)])).
% cnf(59,negated_conjecture,(greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))),inference(cn,[status(thm)],[58,theory(equality)])).
% cnf(63,negated_conjecture,(~organization(esk1_0)|~greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))),inference(spm,[status(thm)],[46,24,theory(equality)])).
% cnf(64,negated_conjecture,($false|~greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))),inference(rw,[status(thm)],[63,48,theory(equality)])).
% cnf(65,negated_conjecture,(~greater(external_ties(esk1_0,esk3_0),external_ties(esk1_0,esk2_0))),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(68,negated_conjecture,($false),inference(sr,[status(thm)],[59,65,theory(equality)])).
% cnf(69,negated_conjecture,($false),68,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 40
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 14
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections : 1
% # Paramodulations : 12
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 20
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 11
% # Clause-clause subsumption calls (NU) : 20
% # Rec. Clause-clause subsumption calls : 20
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 26 leaves, 1.38+/-0.684 terms/leaf
% # Paramod-from index: 6 leaves, 1.33+/-0.471 terms/leaf
% # Paramod-into index: 23 leaves, 1.26+/-0.439 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.006 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP3847/MGT045+1.tptp
%
%------------------------------------------------------------------------------