TSTP Solution File: PUZ130+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ130+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 21:37:09 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP19967/PUZ130+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19967/PUZ130+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19967/PUZ130+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 20099
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,human(jon),file('/tmp/SRASS.s.p', jon_type)).
% fof(6, axiom,owner(jon,odie),file('/tmp/SRASS.s.p', jon_o_owner_axiom)).
% fof(7, axiom,owner(jon,garfield),file('/tmp/SRASS.s.p', jon_g_owner_axiom)).
% fof(9, axiom,cat(garfield),file('/tmp/SRASS.s.p', garfield_type)).
% fof(10, axiom,dog(odie),file('/tmp/SRASS.s.p', odie_type)).
% fof(11, axiom,![X2]:![X3]:((cat(X2)&dog(X3))=>(chased(X3,X2)=>hates(owner_of(X2),owner_of(X3)))),file('/tmp/SRASS.s.p', cat_chase_axiom)).
% fof(14, axiom,![X2]:![X3]:((human(X2)&pet(X3))=>(owner(X2,X3)<=>X2=owner_of(X3))),file('/tmp/SRASS.s.p', owner_def)).
% fof(15, axiom,![X1]:(dog(X1)=>pet(X1)),file('/tmp/SRASS.s.p', dog_pet_type)).
% fof(16, axiom,![X1]:(cat(X1)=>pet(X1)),file('/tmp/SRASS.s.p', cat_pet_type)).
% fof(18, axiom,chased(odie,garfield),file('/tmp/SRASS.s.p', odie_chase_axiom)).
% fof(19, conjecture,hates(jon,jon),file('/tmp/SRASS.s.p', jon_conjecture)).
% fof(20, negated_conjecture,~(hates(jon,jon)),inference(assume_negation,[status(cth)],[19])).
% fof(21, negated_conjecture,~(hates(jon,jon)),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% cnf(25,plain,(human(jon)),inference(split_conjunct,[status(thm)],[2])).
% cnf(35,plain,(owner(jon,odie)),inference(split_conjunct,[status(thm)],[6])).
% cnf(36,plain,(owner(jon,garfield)),inference(split_conjunct,[status(thm)],[7])).
% cnf(43,plain,(cat(garfield)),inference(split_conjunct,[status(thm)],[9])).
% cnf(44,plain,(dog(odie)),inference(split_conjunct,[status(thm)],[10])).
% fof(45, plain,![X2]:![X3]:((~(cat(X2))|~(dog(X3)))|(~(chased(X3,X2))|hates(owner_of(X2),owner_of(X3)))),inference(fof_nnf,[status(thm)],[11])).
% fof(46, plain,![X4]:![X5]:((~(cat(X4))|~(dog(X5)))|(~(chased(X5,X4))|hates(owner_of(X4),owner_of(X5)))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(hates(owner_of(X1),owner_of(X2))|~chased(X2,X1)|~dog(X2)|~cat(X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(60, plain,![X2]:![X3]:((~(human(X2))|~(pet(X3)))|((~(owner(X2,X3))|X2=owner_of(X3))&(~(X2=owner_of(X3))|owner(X2,X3)))),inference(fof_nnf,[status(thm)],[14])).
% fof(61, plain,![X4]:![X5]:((~(human(X4))|~(pet(X5)))|((~(owner(X4,X5))|X4=owner_of(X5))&(~(X4=owner_of(X5))|owner(X4,X5)))),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,![X4]:![X5]:(((~(owner(X4,X5))|X4=owner_of(X5))|(~(human(X4))|~(pet(X5))))&((~(X4=owner_of(X5))|owner(X4,X5))|(~(human(X4))|~(pet(X5))))),inference(distribute,[status(thm)],[61])).
% cnf(64,plain,(X2=owner_of(X1)|~pet(X1)|~human(X2)|~owner(X2,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(65, plain,![X1]:(~(dog(X1))|pet(X1)),inference(fof_nnf,[status(thm)],[15])).
% fof(66, plain,![X2]:(~(dog(X2))|pet(X2)),inference(variable_rename,[status(thm)],[65])).
% cnf(67,plain,(pet(X1)|~dog(X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:(~(cat(X1))|pet(X1)),inference(fof_nnf,[status(thm)],[16])).
% fof(69, plain,![X2]:(~(cat(X2))|pet(X2)),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(pet(X1)|~cat(X1)),inference(split_conjunct,[status(thm)],[69])).
% cnf(74,plain,(chased(odie,garfield)),inference(split_conjunct,[status(thm)],[18])).
% cnf(75,negated_conjecture,(~hates(jon,jon)),inference(split_conjunct,[status(thm)],[21])).
% cnf(77,plain,(pet(garfield)),inference(spm,[status(thm)],[70,43,theory(equality)])).
% cnf(80,plain,(pet(odie)),inference(spm,[status(thm)],[67,44,theory(equality)])).
% cnf(83,plain,(owner_of(garfield)=jon|~pet(garfield)|~human(jon)),inference(spm,[status(thm)],[64,36,theory(equality)])).
% cnf(84,plain,(owner_of(odie)=jon|~pet(odie)|~human(jon)),inference(spm,[status(thm)],[64,35,theory(equality)])).
% cnf(86,plain,(owner_of(garfield)=jon|~pet(garfield)|$false),inference(rw,[status(thm)],[83,25,theory(equality)])).
% cnf(87,plain,(owner_of(garfield)=jon|~pet(garfield)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(88,plain,(owner_of(odie)=jon|~pet(odie)|$false),inference(rw,[status(thm)],[84,25,theory(equality)])).
% cnf(89,plain,(owner_of(odie)=jon|~pet(odie)),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(90,plain,(owner_of(garfield)=jon|$false),inference(rw,[status(thm)],[87,77,theory(equality)])).
% cnf(91,plain,(owner_of(garfield)=jon),inference(cn,[status(thm)],[90,theory(equality)])).
% cnf(93,plain,(hates(jon,owner_of(X1))|~chased(X1,garfield)|~dog(X1)|~cat(garfield)),inference(spm,[status(thm)],[47,91,theory(equality)])).
% cnf(99,plain,(hates(jon,owner_of(X1))|~chased(X1,garfield)|~dog(X1)|$false),inference(rw,[status(thm)],[93,43,theory(equality)])).
% cnf(100,plain,(hates(jon,owner_of(X1))|~chased(X1,garfield)|~dog(X1)),inference(cn,[status(thm)],[99,theory(equality)])).
% cnf(113,plain,(owner_of(odie)=jon|$false),inference(rw,[status(thm)],[89,80,theory(equality)])).
% cnf(114,plain,(owner_of(odie)=jon),inference(cn,[status(thm)],[113,theory(equality)])).
% cnf(146,plain,(hates(jon,jon)|~chased(odie,garfield)|~dog(odie)),inference(spm,[status(thm)],[100,114,theory(equality)])).
% cnf(148,plain,(hates(jon,jon)|$false|~dog(odie)),inference(rw,[status(thm)],[146,74,theory(equality)])).
% cnf(149,plain,(hates(jon,jon)|$false|$false),inference(rw,[status(thm)],[148,44,theory(equality)])).
% cnf(150,plain,(hates(jon,jon)),inference(cn,[status(thm)],[149,theory(equality)])).
% cnf(151,plain,($false),inference(sr,[status(thm)],[150,75,theory(equality)])).
% cnf(152,plain,($false),151,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 60
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 60
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 32
% # ...of the previous two non-trivial : 23
% # Contextual simplify-reflections : 1
% # Paramodulations : 31
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 37
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 9
% # ...number of literals in the above : 29
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # 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: 52 leaves, 1.10+/-0.295 terms/leaf
% # Paramod-from index: 28 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 46 leaves, 1.02+/-0.146 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP19967/PUZ130+1.tptp
%
%------------------------------------------------------------------------------