TSTP Solution File: PUZ061+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ061+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 : art04.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:58 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP28643/PUZ061+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28643/PUZ061+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28643/PUZ061+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 28739
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:![X8]:((alive(X8)&eats(X8,X6))=>likes(X8,X7))&![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]:![X8]:((alive(X8)&eats(X8,X6))=>likes(X8,X7))&![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, plain,![X1]:![X2]:![X3]:![X6]:![X5]:![X4]:(epred1_6(X4,X5,X6,X3,X2,X1)=>((((((((![X7]:![X8]:((alive(X8)&eats(X8,X6))=>likes(X8,X7))&![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)))),introduced(definition)).
% fof(4, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(epred1_6(X4,X5,X6,X3,X2,X1)=>likes(X2,X1))),inference(apply_def,[status(esa)],[2,3,theory(equality)])).
% fof(5, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:?[X6]:(epred1_6(X4,X5,X6,X3,X2,X1)&~(likes(X2,X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(6, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:?[X11]:?[X12]:(epred1_6(X10,X11,X12,X9,X8,X7)&~(likes(X8,X7))),inference(variable_rename,[status(thm)],[5])).
% fof(7, negated_conjecture,(epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)&~(likes(esk2_0,esk1_0))),inference(skolemize,[status(esa)],[6])).
% cnf(8,negated_conjecture,(~likes(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% fof(10, plain,![X1]:![X2]:![X3]:![X6]:![X5]:![X4]:(~(epred1_6(X4,X5,X6,X3,X2,X1))|((((((((![X7]:![X8]:((~(alive(X8))|~(eats(X8,X6)))|likes(X8,X7))&![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)))),inference(fof_nnf,[status(thm)],[3])).
% fof(11, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:(~(epred1_6(X14,X13,X12,X11,X10,X9))|((((((((![X15]:![X16]:((~(alive(X16))|~(eats(X16,X12)))|likes(X16,X15))&![X17]:(~(food(X17))|likes(X10,X17)))&food(X13))&food(X12))&![X18]:(![X19]:(~(eats(X19,X18))|~(not_killed_by(X19,X18)))|food(X18)))&eats(X11,X9))&alive(X11))&![X20]:(~(eats(X11,X20))|eats(X14,X20)))&![X21]:(~(alive(X21))|![X22]:not_killed_by(X21,X22)))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:![X21]:![X22]:(((not_killed_by(X21,X22)|~(alive(X21)))&((~(eats(X11,X20))|eats(X14,X20))&(((((~(eats(X19,X18))|~(not_killed_by(X19,X18)))|food(X18))&((((~(food(X17))|likes(X10,X17))&((~(alive(X16))|~(eats(X16,X12)))|likes(X16,X15)))&food(X13))&food(X12)))&eats(X11,X9))&alive(X11))))|~(epred1_6(X14,X13,X12,X11,X10,X9))),inference(shift_quantors,[status(thm)],[11])).
% fof(13, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X19]:![X20]:![X21]:![X22]:(((not_killed_by(X21,X22)|~(alive(X21)))|~(epred1_6(X14,X13,X12,X11,X10,X9)))&(((~(eats(X11,X20))|eats(X14,X20))|~(epred1_6(X14,X13,X12,X11,X10,X9)))&((((((~(eats(X19,X18))|~(not_killed_by(X19,X18)))|food(X18))|~(epred1_6(X14,X13,X12,X11,X10,X9)))&(((((~(food(X17))|likes(X10,X17))|~(epred1_6(X14,X13,X12,X11,X10,X9)))&(((~(alive(X16))|~(eats(X16,X12)))|likes(X16,X15))|~(epred1_6(X14,X13,X12,X11,X10,X9))))&(food(X13)|~(epred1_6(X14,X13,X12,X11,X10,X9))))&(food(X12)|~(epred1_6(X14,X13,X12,X11,X10,X9)))))&(eats(X11,X9)|~(epred1_6(X14,X13,X12,X11,X10,X9))))&(alive(X11)|~(epred1_6(X14,X13,X12,X11,X10,X9)))))),inference(distribute,[status(thm)],[12])).
% cnf(14,plain,(alive(X4)|~epred1_6(X1,X2,X3,X4,X5,X6)),inference(split_conjunct,[status(thm)],[13])).
% cnf(15,plain,(eats(X4,X6)|~epred1_6(X1,X2,X3,X4,X5,X6)),inference(split_conjunct,[status(thm)],[13])).
% cnf(19,plain,(likes(X5,X7)|~epred1_6(X1,X2,X3,X4,X5,X6)|~food(X7)),inference(split_conjunct,[status(thm)],[13])).
% cnf(20,plain,(food(X7)|~epred1_6(X1,X2,X3,X4,X5,X6)|~not_killed_by(X8,X7)|~eats(X8,X7)),inference(split_conjunct,[status(thm)],[13])).
% cnf(22,plain,(not_killed_by(X7,X8)|~epred1_6(X1,X2,X3,X4,X5,X6)|~alive(X7)),inference(split_conjunct,[status(thm)],[13])).
% cnf(23,negated_conjecture,(alive(esk3_0)),inference(spm,[status(thm)],[14,9,theory(equality)])).
% cnf(26,negated_conjecture,(eats(esk3_0,esk1_0)),inference(spm,[status(thm)],[15,9,theory(equality)])).
% cnf(27,negated_conjecture,(likes(esk2_0,X1)|~food(X1)),inference(spm,[status(thm)],[19,9,theory(equality)])).
% cnf(28,negated_conjecture,(not_killed_by(X1,X2)|~alive(X1)),inference(spm,[status(thm)],[22,9,theory(equality)])).
% cnf(30,negated_conjecture,(food(X1)|~not_killed_by(X2,X1)|~eats(X2,X1)),inference(spm,[status(thm)],[20,9,theory(equality)])).
% cnf(32,negated_conjecture,(~food(esk1_0)),inference(spm,[status(thm)],[8,27,theory(equality)])).
% cnf(35,negated_conjecture,(food(X1)|~eats(X2,X1)|~alive(X2)),inference(spm,[status(thm)],[30,28,theory(equality)])).
% cnf(37,negated_conjecture,(food(esk1_0)|~alive(esk3_0)),inference(spm,[status(thm)],[35,26,theory(equality)])).
% cnf(39,negated_conjecture,(food(esk1_0)|$false),inference(rw,[status(thm)],[37,23,theory(equality)])).
% cnf(40,negated_conjecture,(food(esk1_0)),inference(cn,[status(thm)],[39,theory(equality)])).
% cnf(41,negated_conjecture,($false),inference(sr,[status(thm)],[40,32,theory(equality)])).
% cnf(42,negated_conjecture,($false),41,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 34
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 15
% # ...of the previous two non-trivial : 14
% # Contextual simplify-reflections : 0
% # Paramodulations : 15
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 2
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 34
% # Rec. Clause-clause subsumption calls : 34
% # 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: 25 leaves, 1.48+/-1.300 terms/leaf
% # Paramod-from index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 20 leaves, 1.35+/-1.314 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.004 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/SystemOnTPTP28643/PUZ061+1.tptp
%
%------------------------------------------------------------------------------