TSTP Solution File: PUZ001+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ001+2 : TPTP v5.0.0. Released v4.0.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:25:36 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/SystemOnTPTP28125/PUZ001+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28125/PUZ001+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28125/PUZ001+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 28221
% 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(1, axiom,?[X1]:?[X2]:?[X3]:((((((((((((($true&predicate1(X2,live,X1))&modifier_pp(X2,in,'DreadburyMansion'))&predicate2(X3,kill,X1,'AuntAgatha'))&![X4]:![X5]:((($true&predicate1(X5,live,X4))&modifier_pp(X5,in,'DreadburyMansion'))=>((X4='AuntAgatha'|X4='Butler')|X4='Charles')))&![X6]:($true=>![X7]:![X8]:(($true&predicate2(X8,kill,X6,X7))=>?[X9]:predicate2(X9,hate,X6,X7))))&![X10]:($true=>~(?[X11]:?[X12]:?[X13]:((($true&predicate2(X12,kill,X10,X11))&property2(X13,rich,comp_than,X11))&X10=X13))))&![X14]:![X15]:(($true&predicate2(X15,hate,'AuntAgatha',X14))=>~(?[X16]:predicate2(X16,hate,'Charles',X14))))&~(?[X17]:predicate2(X17,hate,'AuntAgatha','Butler')))&![X18]:(($true&~(X18='Butler'))=>?[X19]:predicate2(X19,hate,'AuntAgatha',X18)))&![X20]:(($true&~(?[X21]:(property2(X21,rich,comp_than,'AuntAgatha')&X20=X21)))=>?[X22]:predicate2(X22,hate,'Butler',X20)))&![X23]:![X24]:(($true&predicate2(X24,hate,'AuntAgatha',X23))=>?[X25]:predicate2(X25,hate,'Butler',X23)))&![X26]:($true=>~(![X27]:($true=>?[X28]:predicate2(X28,hate,X26,X27)))))&~('AuntAgatha'='Butler')),file('/tmp/SRASS.s.p', background)).
% fof(2, conjecture,?[X1]:predicate2(X1,kill,'AuntAgatha','AuntAgatha'),file('/tmp/SRASS.s.p', prove)).
% fof(3, negated_conjecture,~(?[X1]:predicate2(X1,kill,'AuntAgatha','AuntAgatha')),inference(assume_negation,[status(cth)],[2])).
% fof(4, plain,?[X1]:?[X2]:?[X3]:((((((((((((predicate1(X2,live,X1)&modifier_pp(X2,in,'DreadburyMansion'))&predicate2(X3,kill,X1,'AuntAgatha'))&![X4]:![X5]:((predicate1(X5,live,X4)&modifier_pp(X5,in,'DreadburyMansion'))=>((X4='AuntAgatha'|X4='Butler')|X4='Charles')))&![X6]:![X7]:![X8]:(predicate2(X8,kill,X6,X7)=>?[X9]:predicate2(X9,hate,X6,X7)))&![X10]:~(?[X11]:?[X12]:?[X13]:((predicate2(X12,kill,X10,X11)&property2(X13,rich,comp_than,X11))&X10=X13)))&![X14]:![X15]:(predicate2(X15,hate,'AuntAgatha',X14)=>~(?[X16]:predicate2(X16,hate,'Charles',X14))))&~(?[X17]:predicate2(X17,hate,'AuntAgatha','Butler')))&![X18]:(~(X18='Butler')=>?[X19]:predicate2(X19,hate,'AuntAgatha',X18)))&![X20]:(~(?[X21]:(property2(X21,rich,comp_than,'AuntAgatha')&X20=X21))=>?[X22]:predicate2(X22,hate,'Butler',X20)))&![X23]:![X24]:(predicate2(X24,hate,'AuntAgatha',X23)=>?[X25]:predicate2(X25,hate,'Butler',X23)))&![X26]:~(![X27]:?[X28]:predicate2(X28,hate,X26,X27)))&~('AuntAgatha'='Butler')),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(5, plain,?[X1]:?[X2]:?[X3]:((((((((((((predicate1(X2,live,X1)&modifier_pp(X2,in,'DreadburyMansion'))&predicate2(X3,kill,X1,'AuntAgatha'))&![X4]:![X5]:((~(predicate1(X5,live,X4))|~(modifier_pp(X5,in,'DreadburyMansion')))|((X4='AuntAgatha'|X4='Butler')|X4='Charles')))&![X6]:![X7]:![X8]:(~(predicate2(X8,kill,X6,X7))|?[X9]:predicate2(X9,hate,X6,X7)))&![X10]:![X11]:![X12]:![X13]:((~(predicate2(X12,kill,X10,X11))|~(property2(X13,rich,comp_than,X11)))|~(X10=X13)))&![X14]:![X15]:(~(predicate2(X15,hate,'AuntAgatha',X14))|![X16]:~(predicate2(X16,hate,'Charles',X14))))&![X17]:~(predicate2(X17,hate,'AuntAgatha','Butler')))&![X18]:(X18='Butler'|?[X19]:predicate2(X19,hate,'AuntAgatha',X18)))&![X20]:(?[X21]:(property2(X21,rich,comp_than,'AuntAgatha')&X20=X21)|?[X22]:predicate2(X22,hate,'Butler',X20)))&![X23]:![X24]:(~(predicate2(X24,hate,'AuntAgatha',X23))|?[X25]:predicate2(X25,hate,'Butler',X23)))&![X26]:?[X27]:![X28]:~(predicate2(X28,hate,X26,X27)))&~('AuntAgatha'='Butler')),inference(fof_nnf,[status(thm)],[4])).
% fof(6, plain,?[X29]:?[X30]:?[X31]:((((((((((((predicate1(X30,live,X29)&modifier_pp(X30,in,'DreadburyMansion'))&predicate2(X31,kill,X29,'AuntAgatha'))&![X32]:![X33]:((~(predicate1(X33,live,X32))|~(modifier_pp(X33,in,'DreadburyMansion')))|((X32='AuntAgatha'|X32='Butler')|X32='Charles')))&![X34]:![X35]:![X36]:(~(predicate2(X36,kill,X34,X35))|?[X37]:predicate2(X37,hate,X34,X35)))&![X38]:![X39]:![X40]:![X41]:((~(predicate2(X40,kill,X38,X39))|~(property2(X41,rich,comp_than,X39)))|~(X38=X41)))&![X42]:![X43]:(~(predicate2(X43,hate,'AuntAgatha',X42))|![X44]:~(predicate2(X44,hate,'Charles',X42))))&![X45]:~(predicate2(X45,hate,'AuntAgatha','Butler')))&![X46]:(X46='Butler'|?[X47]:predicate2(X47,hate,'AuntAgatha',X46)))&![X48]:(?[X49]:(property2(X49,rich,comp_than,'AuntAgatha')&X48=X49)|?[X50]:predicate2(X50,hate,'Butler',X48)))&![X51]:![X52]:(~(predicate2(X52,hate,'AuntAgatha',X51))|?[X53]:predicate2(X53,hate,'Butler',X51)))&![X54]:?[X55]:![X56]:~(predicate2(X56,hate,X54,X55)))&~('AuntAgatha'='Butler')),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,((((((((((((predicate1(esk2_0,live,esk1_0)&modifier_pp(esk2_0,in,'DreadburyMansion'))&predicate2(esk3_0,kill,esk1_0,'AuntAgatha'))&![X32]:![X33]:((~(predicate1(X33,live,X32))|~(modifier_pp(X33,in,'DreadburyMansion')))|((X32='AuntAgatha'|X32='Butler')|X32='Charles')))&![X34]:![X35]:![X36]:(~(predicate2(X36,kill,X34,X35))|predicate2(esk4_3(X34,X35,X36),hate,X34,X35)))&![X38]:![X39]:![X40]:![X41]:((~(predicate2(X40,kill,X38,X39))|~(property2(X41,rich,comp_than,X39)))|~(X38=X41)))&![X42]:![X43]:(~(predicate2(X43,hate,'AuntAgatha',X42))|![X44]:~(predicate2(X44,hate,'Charles',X42))))&![X45]:~(predicate2(X45,hate,'AuntAgatha','Butler')))&![X46]:(X46='Butler'|predicate2(esk5_1(X46),hate,'AuntAgatha',X46)))&![X48]:((property2(esk6_1(X48),rich,comp_than,'AuntAgatha')&X48=esk6_1(X48))|predicate2(esk7_1(X48),hate,'Butler',X48)))&![X51]:![X52]:(~(predicate2(X52,hate,'AuntAgatha',X51))|predicate2(esk8_2(X51,X52),hate,'Butler',X51)))&![X54]:![X56]:~(predicate2(X56,hate,X54,esk9_1(X54))))&~('AuntAgatha'='Butler')),inference(skolemize,[status(esa)],[6])).
% fof(8, plain,![X32]:![X33]:![X34]:![X35]:![X36]:![X38]:![X39]:![X40]:![X41]:![X42]:![X43]:![X44]:![X45]:![X46]:![X48]:![X51]:![X52]:![X54]:![X56]:((~(predicate2(X56,hate,X54,esk9_1(X54)))&((~(predicate2(X52,hate,'AuntAgatha',X51))|predicate2(esk8_2(X51,X52),hate,'Butler',X51))&(((property2(esk6_1(X48),rich,comp_than,'AuntAgatha')&X48=esk6_1(X48))|predicate2(esk7_1(X48),hate,'Butler',X48))&((X46='Butler'|predicate2(esk5_1(X46),hate,'AuntAgatha',X46))&(~(predicate2(X45,hate,'AuntAgatha','Butler'))&((~(predicate2(X44,hate,'Charles',X42))|~(predicate2(X43,hate,'AuntAgatha',X42)))&(((~(predicate2(X40,kill,X38,X39))|~(property2(X41,rich,comp_than,X39)))|~(X38=X41))&((~(predicate2(X36,kill,X34,X35))|predicate2(esk4_3(X34,X35,X36),hate,X34,X35))&(((~(predicate1(X33,live,X32))|~(modifier_pp(X33,in,'DreadburyMansion')))|((X32='AuntAgatha'|X32='Butler')|X32='Charles'))&((predicate1(esk2_0,live,esk1_0)&modifier_pp(esk2_0,in,'DreadburyMansion'))&predicate2(esk3_0,kill,esk1_0,'AuntAgatha')))))))))))&~('AuntAgatha'='Butler')),inference(shift_quantors,[status(thm)],[7])).
% fof(9, plain,![X32]:![X33]:![X34]:![X35]:![X36]:![X38]:![X39]:![X40]:![X41]:![X42]:![X43]:![X44]:![X45]:![X46]:![X48]:![X51]:![X52]:![X54]:![X56]:((~(predicate2(X56,hate,X54,esk9_1(X54)))&((~(predicate2(X52,hate,'AuntAgatha',X51))|predicate2(esk8_2(X51,X52),hate,'Butler',X51))&(((property2(esk6_1(X48),rich,comp_than,'AuntAgatha')|predicate2(esk7_1(X48),hate,'Butler',X48))&(X48=esk6_1(X48)|predicate2(esk7_1(X48),hate,'Butler',X48)))&((X46='Butler'|predicate2(esk5_1(X46),hate,'AuntAgatha',X46))&(~(predicate2(X45,hate,'AuntAgatha','Butler'))&((~(predicate2(X44,hate,'Charles',X42))|~(predicate2(X43,hate,'AuntAgatha',X42)))&(((~(predicate2(X40,kill,X38,X39))|~(property2(X41,rich,comp_than,X39)))|~(X38=X41))&((~(predicate2(X36,kill,X34,X35))|predicate2(esk4_3(X34,X35,X36),hate,X34,X35))&(((~(predicate1(X33,live,X32))|~(modifier_pp(X33,in,'DreadburyMansion')))|((X32='AuntAgatha'|X32='Butler')|X32='Charles'))&((predicate1(esk2_0,live,esk1_0)&modifier_pp(esk2_0,in,'DreadburyMansion'))&predicate2(esk3_0,kill,esk1_0,'AuntAgatha')))))))))))&~('AuntAgatha'='Butler')),inference(distribute,[status(thm)],[8])).
% cnf(10,plain,('AuntAgatha'!='Butler'),inference(split_conjunct,[status(thm)],[9])).
% cnf(11,plain,(predicate2(esk3_0,kill,esk1_0,'AuntAgatha')),inference(split_conjunct,[status(thm)],[9])).
% cnf(12,plain,(modifier_pp(esk2_0,in,'DreadburyMansion')),inference(split_conjunct,[status(thm)],[9])).
% cnf(13,plain,(predicate1(esk2_0,live,esk1_0)),inference(split_conjunct,[status(thm)],[9])).
% cnf(14,plain,(X1='Charles'|X1='Butler'|X1='AuntAgatha'|~modifier_pp(X2,in,'DreadburyMansion')|~predicate1(X2,live,X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(15,plain,(predicate2(esk4_3(X1,X2,X3),hate,X1,X2)|~predicate2(X3,kill,X1,X2)),inference(split_conjunct,[status(thm)],[9])).
% cnf(16,plain,(X1!=X2|~property2(X2,rich,comp_than,X3)|~predicate2(X4,kill,X1,X3)),inference(split_conjunct,[status(thm)],[9])).
% cnf(17,plain,(~predicate2(X1,hate,'AuntAgatha',X2)|~predicate2(X3,hate,'Charles',X2)),inference(split_conjunct,[status(thm)],[9])).
% cnf(19,plain,(predicate2(esk5_1(X1),hate,'AuntAgatha',X1)|X1='Butler'),inference(split_conjunct,[status(thm)],[9])).
% cnf(20,plain,(predicate2(esk7_1(X1),hate,'Butler',X1)|X1=esk6_1(X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(21,plain,(predicate2(esk7_1(X1),hate,'Butler',X1)|property2(esk6_1(X1),rich,comp_than,'AuntAgatha')),inference(split_conjunct,[status(thm)],[9])).
% cnf(22,plain,(predicate2(esk8_2(X1,X2),hate,'Butler',X1)|~predicate2(X2,hate,'AuntAgatha',X1)),inference(split_conjunct,[status(thm)],[9])).
% cnf(23,plain,(~predicate2(X1,hate,X2,esk9_1(X2))),inference(split_conjunct,[status(thm)],[9])).
% fof(24, negated_conjecture,![X1]:~(predicate2(X1,kill,'AuntAgatha','AuntAgatha')),inference(fof_nnf,[status(thm)],[3])).
% fof(25, negated_conjecture,![X2]:~(predicate2(X2,kill,'AuntAgatha','AuntAgatha')),inference(variable_rename,[status(thm)],[24])).
% cnf(26,negated_conjecture,(~predicate2(X1,kill,'AuntAgatha','AuntAgatha')),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(~property2(X1,rich,comp_than,X2)|~predicate2(X3,kill,X1,X2)),inference(er,[status(thm)],[16,theory(equality)])).
% cnf(29,plain,(esk6_1(esk9_1('Butler'))=esk9_1('Butler')),inference(spm,[status(thm)],[23,20,theory(equality)])).
% cnf(30,plain,('AuntAgatha'=X1|'Butler'=X1|'Charles'=X1|~predicate1(esk2_0,live,X1)),inference(spm,[status(thm)],[14,12,theory(equality)])).
% cnf(33,plain,(~predicate2(X3,hate,'AuntAgatha',X1)|~predicate2(X2,kill,'Charles',X1)),inference(spm,[status(thm)],[17,15,theory(equality)])).
% cnf(34,plain,(~predicate2(X1,hate,'AuntAgatha',esk9_1('Butler'))),inference(spm,[status(thm)],[23,22,theory(equality)])).
% cnf(35,plain,(property2(esk6_1(esk9_1('Butler')),rich,comp_than,'AuntAgatha')),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(38,plain,('Charles'=esk1_0|'Butler'=esk1_0|'AuntAgatha'=esk1_0),inference(spm,[status(thm)],[30,13,theory(equality)])).
% cnf(40,plain,('Butler'=esk9_1('Butler')),inference(spm,[status(thm)],[34,19,theory(equality)])).
% cnf(45,plain,(esk6_1('Butler')=esk9_1('Butler')),inference(rw,[status(thm)],[29,40,theory(equality)])).
% cnf(46,plain,(esk6_1('Butler')='Butler'),inference(rw,[status(thm)],[45,40,theory(equality)])).
% cnf(48,plain,(predicate2(esk3_0,kill,esk1_0,esk1_0)|esk1_0='Butler'|'Charles'=esk1_0),inference(spm,[status(thm)],[11,38,theory(equality)])).
% cnf(50,negated_conjecture,(esk1_0='Butler'|'Charles'=esk1_0|~predicate2(X1,kill,esk1_0,esk1_0)),inference(spm,[status(thm)],[26,38,theory(equality)])).
% cnf(57,plain,('Butler'=X1|~predicate2(X2,kill,'Charles',X1)),inference(spm,[status(thm)],[33,19,theory(equality)])).
% cnf(63,negated_conjecture,('Charles'=esk1_0|esk1_0='Butler'),inference(spm,[status(thm)],[50,48,theory(equality)])).
% cnf(65,negated_conjecture,('Butler'=X1|esk1_0='Butler'|~predicate2(X2,kill,esk1_0,X1)),inference(spm,[status(thm)],[57,63,theory(equality)])).
% cnf(66,negated_conjecture,(esk1_0='Butler'|'Butler'='AuntAgatha'),inference(spm,[status(thm)],[65,11,theory(equality)])).
% cnf(67,negated_conjecture,(esk1_0='Butler'),inference(sr,[status(thm)],[66,10,theory(equality)])).
% cnf(72,plain,(predicate2(esk3_0,kill,'Butler','AuntAgatha')),inference(rw,[status(thm)],[11,67,theory(equality)])).
% cnf(74,plain,(property2('Butler',rich,comp_than,'AuntAgatha')),inference(rw,[status(thm)],[inference(rw,[status(thm)],[35,40,theory(equality)]),46,theory(equality)])).
% cnf(75,plain,(~predicate2(X1,kill,'Butler','AuntAgatha')),inference(spm,[status(thm)],[27,74,theory(equality)])).
% cnf(79,plain,($false),inference(sr,[status(thm)],[72,75,theory(equality)])).
% cnf(80,plain,($false),79,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 61
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 55
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 6
% # Generated clauses : 39
% # ...of the previous two non-trivial : 40
% # Contextual simplify-reflections : 0
% # Paramodulations : 37
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 35 leaves, 1.49+/-1.918 terms/leaf
% # Paramod-from index: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 33 leaves, 1.36+/-1.367 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.002 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP28125/PUZ001+2.tptp
%
%------------------------------------------------------------------------------