TSTP Solution File: PUZ060+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ060+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 21:26:49 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP19306/PUZ060+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19306/PUZ060+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19306/PUZ060+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 19402
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((((((((![X7]:(food(X7)=>likes(X2,X7))&food(X5))&food(X6))&![X7]:(?[X8]:(eats(X8,X7)¬_killed_by(X8,X7))=>food(X7)))&eats(X3,X1))&alive(X3))&![X7]:(eats(X3,X7)=>eats(X4,X7)))&![X8]:(alive(X8)=>![X7]:not_killed_by(X8,X7)))=>likes(X2,X1)),file('/tmp/SRASS.s.p', prove_this)).
% fof(2, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((((((((![X7]:(food(X7)=>likes(X2,X7))&food(X5))&food(X6))&![X7]:(?[X8]:(eats(X8,X7)¬_killed_by(X8,X7))=>food(X7)))&eats(X3,X1))&alive(X3))&![X7]:(eats(X3,X7)=>eats(X4,X7)))&![X8]:(alive(X8)=>![X7]:not_killed_by(X8,X7)))=>likes(X2,X1))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:?[X6]:((((((((![X7]:(~(food(X7))|likes(X2,X7))&food(X5))&food(X6))&![X7]:(![X8]:(~(eats(X8,X7))|~(not_killed_by(X8,X7)))|food(X7)))&eats(X3,X1))&alive(X3))&![X7]:(~(eats(X3,X7))|eats(X4,X7)))&![X8]:(~(alive(X8))|![X7]:not_killed_by(X8,X7)))&~(likes(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:?[X14]:((((((((![X15]:(~(food(X15))|likes(X10,X15))&food(X13))&food(X14))&![X16]:(![X17]:(~(eats(X17,X16))|~(not_killed_by(X17,X16)))|food(X16)))&eats(X11,X9))&alive(X11))&![X18]:(~(eats(X11,X18))|eats(X12,X18)))&![X19]:(~(alive(X19))|![X20]:not_killed_by(X19,X20)))&~(likes(X10,X9))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((((((((![X15]:(~(food(X15))|likes(esk2_0,X15))&food(esk5_0))&food(esk6_0))&![X16]:(![X17]:(~(eats(X17,X16))|~(not_killed_by(X17,X16)))|food(X16)))&eats(esk3_0,esk1_0))&alive(esk3_0))&![X18]:(~(eats(esk3_0,X18))|eats(esk4_0,X18)))&![X19]:(~(alive(X19))|![X20]:not_killed_by(X19,X20)))&~(likes(esk2_0,esk1_0))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:(((not_killed_by(X19,X20)|~(alive(X19)))&((~(eats(esk3_0,X18))|eats(esk4_0,X18))&(((((~(eats(X17,X16))|~(not_killed_by(X17,X16)))|food(X16))&(((~(food(X15))|likes(esk2_0,X15))&food(esk5_0))&food(esk6_0)))&eats(esk3_0,esk1_0))&alive(esk3_0))))&~(likes(esk2_0,esk1_0))),inference(shift_quantors,[status(thm)],[5])).
% cnf(7,negated_conjecture,(~likes(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(alive(esk3_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(eats(esk3_0,esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(12,negated_conjecture,(likes(esk2_0,X1)|~food(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(13,negated_conjecture,(food(X1)|~not_killed_by(X2,X1)|~eats(X2,X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(15,negated_conjecture,(not_killed_by(X1,X2)|~alive(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(16,negated_conjecture,(~food(esk1_0)),inference(spm,[status(thm)],[7,12,theory(equality)])).
% cnf(17,negated_conjecture,(food(X1)|~eats(X2,X1)|~alive(X2)),inference(spm,[status(thm)],[13,15,theory(equality)])).
% cnf(19,negated_conjecture,(food(esk1_0)|~alive(esk3_0)),inference(spm,[status(thm)],[17,9,theory(equality)])).
% cnf(20,negated_conjecture,(food(esk1_0)|$false),inference(rw,[status(thm)],[19,8,theory(equality)])).
% cnf(21,negated_conjecture,(food(esk1_0)),inference(cn,[status(thm)],[20,theory(equality)])).
% cnf(22,negated_conjecture,($false),inference(sr,[status(thm)],[21,16,theory(equality)])).
% cnf(23,negated_conjecture,($false),22,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 20
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 20
% # 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: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 3
% # 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 : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 20 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 16 leaves, 1.06+/-0.242 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP19306/PUZ060+1.tptp
%
%------------------------------------------------------------------------------