TSTP Solution File: MSC017+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MSC017+1 : TPTP v5.0.0. Released v4.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:12:50 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP10674/MSC017+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10674/MSC017+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10674/MSC017+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 10770
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(dive(X1)=>![X2]:((outcome(X1,X2)&bad(X2))=>X2=dci)),file('/tmp/SRASS.s.p', dci_is_the_only_bad_outcome)).
% fof(3, axiom,![X1]:(dive(X1)=>(~(greater(depth(X1),depth_limit))&~(greater(time(X1),time_limit)))),file('/tmp/SRASS.s.p', no_deep_long)).
% fof(4, axiom,![X1]:(dive(X1)=>(greater(nitrogen(X1),nitrogen_limit)<=>outcome(X1,dci))),file('/tmp/SRASS.s.p', too_much_nitrogen)).
% fof(5, axiom,![X1]:(dive(X1)=>((greater(depth(X1),depth_limit)|greater(time(X1),time_limit))<=>greater(nitrogen(X1),nitrogen_limit))),file('/tmp/SRASS.s.p', depth_and_time_and_nitrogen)).
% fof(7, conjecture,![X1]:(dive(X1)=>![X2]:(outcome(X1,X2)=>~(bad(X2)))),file('/tmp/SRASS.s.p', no_bad)).
% fof(8, negated_conjecture,~(![X1]:(dive(X1)=>![X2]:(outcome(X1,X2)=>~(bad(X2))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:(dive(X1)=>(~(greater(depth(X1),depth_limit))&~(greater(time(X1),time_limit)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(10, negated_conjecture,~(![X1]:(dive(X1)=>![X2]:(outcome(X1,X2)=>~(bad(X2))))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(12, plain,![X1]:(~(dive(X1))|![X2]:((~(outcome(X1,X2))|~(bad(X2)))|X2=dci)),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X3]:(~(dive(X3))|![X4]:((~(outcome(X3,X4))|~(bad(X4)))|X4=dci)),inference(variable_rename,[status(thm)],[12])).
% fof(14, plain,![X3]:![X4]:(((~(outcome(X3,X4))|~(bad(X4)))|X4=dci)|~(dive(X3))),inference(shift_quantors,[status(thm)],[13])).
% cnf(15,plain,(X2=dci|~dive(X1)|~bad(X2)|~outcome(X1,X2)),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X1]:(~(dive(X1))|(~(greater(depth(X1),depth_limit))&~(greater(time(X1),time_limit)))),inference(fof_nnf,[status(thm)],[9])).
% fof(17, plain,![X2]:(~(dive(X2))|(~(greater(depth(X2),depth_limit))&~(greater(time(X2),time_limit)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X2]:((~(greater(depth(X2),depth_limit))|~(dive(X2)))&(~(greater(time(X2),time_limit))|~(dive(X2)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(~dive(X1)|~greater(time(X1),time_limit)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(~dive(X1)|~greater(depth(X1),depth_limit)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X1]:(~(dive(X1))|((~(greater(nitrogen(X1),nitrogen_limit))|outcome(X1,dci))&(~(outcome(X1,dci))|greater(nitrogen(X1),nitrogen_limit)))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X2]:(~(dive(X2))|((~(greater(nitrogen(X2),nitrogen_limit))|outcome(X2,dci))&(~(outcome(X2,dci))|greater(nitrogen(X2),nitrogen_limit)))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X2]:(((~(greater(nitrogen(X2),nitrogen_limit))|outcome(X2,dci))|~(dive(X2)))&((~(outcome(X2,dci))|greater(nitrogen(X2),nitrogen_limit))|~(dive(X2)))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(greater(nitrogen(X1),nitrogen_limit)|~dive(X1)|~outcome(X1,dci)),inference(split_conjunct,[status(thm)],[23])).
% fof(26, plain,![X1]:(~(dive(X1))|(((~(greater(depth(X1),depth_limit))&~(greater(time(X1),time_limit)))|greater(nitrogen(X1),nitrogen_limit))&(~(greater(nitrogen(X1),nitrogen_limit))|(greater(depth(X1),depth_limit)|greater(time(X1),time_limit))))),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X2]:(~(dive(X2))|(((~(greater(depth(X2),depth_limit))&~(greater(time(X2),time_limit)))|greater(nitrogen(X2),nitrogen_limit))&(~(greater(nitrogen(X2),nitrogen_limit))|(greater(depth(X2),depth_limit)|greater(time(X2),time_limit))))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X2]:((((~(greater(depth(X2),depth_limit))|greater(nitrogen(X2),nitrogen_limit))|~(dive(X2)))&((~(greater(time(X2),time_limit))|greater(nitrogen(X2),nitrogen_limit))|~(dive(X2))))&((~(greater(nitrogen(X2),nitrogen_limit))|(greater(depth(X2),depth_limit)|greater(time(X2),time_limit)))|~(dive(X2)))),inference(distribute,[status(thm)],[27])).
% cnf(29,plain,(greater(time(X1),time_limit)|greater(depth(X1),depth_limit)|~dive(X1)|~greater(nitrogen(X1),nitrogen_limit)),inference(split_conjunct,[status(thm)],[28])).
% fof(35, negated_conjecture,?[X1]:(dive(X1)&?[X2]:(outcome(X1,X2)&bad(X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(36, negated_conjecture,?[X3]:(dive(X3)&?[X4]:(outcome(X3,X4)&bad(X4))),inference(variable_rename,[status(thm)],[35])).
% fof(37, negated_conjecture,(dive(esk1_0)&(outcome(esk1_0,esk2_0)&bad(esk2_0))),inference(skolemize,[status(esa)],[36])).
% cnf(38,negated_conjecture,(bad(esk2_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(outcome(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,negated_conjecture,(dive(esk1_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(43,plain,(greater(depth(X1),depth_limit)|~greater(nitrogen(X1),nitrogen_limit)|~dive(X1)),inference(csr,[status(thm)],[29,19])).
% cnf(44,plain,(~greater(nitrogen(X1),nitrogen_limit)|~dive(X1)),inference(csr,[status(thm)],[43,20])).
% cnf(45,negated_conjecture,(dci=esk2_0|~dive(esk1_0)|~bad(esk2_0)),inference(spm,[status(thm)],[15,39,theory(equality)])).
% cnf(46,negated_conjecture,(dci=esk2_0|$false|~bad(esk2_0)),inference(rw,[status(thm)],[45,40,theory(equality)])).
% cnf(47,negated_conjecture,(dci=esk2_0|$false|$false),inference(rw,[status(thm)],[46,38,theory(equality)])).
% cnf(48,negated_conjecture,(dci=esk2_0),inference(cn,[status(thm)],[47,theory(equality)])).
% cnf(49,plain,(~outcome(X1,dci)|~dive(X1)),inference(csr,[status(thm)],[24,44])).
% cnf(50,negated_conjecture,(outcome(esk1_0,dci)),inference(rw,[status(thm)],[39,48,theory(equality)])).
% cnf(52,negated_conjecture,(~dive(esk1_0)),inference(spm,[status(thm)],[49,50,theory(equality)])).
% cnf(53,negated_conjecture,($false),inference(rw,[status(thm)],[52,40,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(cn,[status(thm)],[53,theory(equality)])).
% cnf(55,negated_conjecture,($false),54,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 2
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 5
% # Paramodulations : 2
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 10
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 21 leaves, 1.05+/-0.213 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 18 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 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/SystemOnTPTP10674/MSC017+1.tptp
%
%------------------------------------------------------------------------------