TSTP Solution File: PUZ128+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : PUZ128+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 : 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:36:14 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP18919/PUZ128+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18919/PUZ128+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18919/PUZ128+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 19051
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,parent_of(iokaste,oedipus),file('/tmp/SRASS.s.p', iokaste_oedipus)).
% fof(2, axiom,parent_of(iokaste,polyneikes),file('/tmp/SRASS.s.p', iokaste_polyneikes)).
% fof(3, axiom,patricide(oedipus),file('/tmp/SRASS.s.p', oedipus_patricidal)).
% fof(4, axiom,~(patricide(thersandros)),file('/tmp/SRASS.s.p', thersandros_not_patricidal)).
% fof(5, axiom,parent_of(oedipus,polyneikes),file('/tmp/SRASS.s.p', oedipus_polyneikes)).
% fof(6, axiom,parent_of(polyneikes,thersandros),file('/tmp/SRASS.s.p', polyneikes_thersandros)).
% fof(7, conjecture,?[X1]:?[X2]:(((parent_of(iokaste,X1)&patricide(X1))&parent_of(X1,X2))&~(patricide(X2))),file('/tmp/SRASS.s.p', iokaste_parent_particide_parent_not_patricide)).
% fof(8, negated_conjecture,~(?[X1]:?[X2]:(((parent_of(iokaste,X1)&patricide(X1))&parent_of(X1,X2))&~(patricide(X2)))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,~(patricide(thersandros)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(10, negated_conjecture,~(?[X1]:?[X2]:(((parent_of(iokaste,X1)&patricide(X1))&parent_of(X1,X2))&~(patricide(X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% cnf(11,plain,(parent_of(iokaste,oedipus)),inference(split_conjunct,[status(thm)],[1])).
% cnf(12,plain,(parent_of(iokaste,polyneikes)),inference(split_conjunct,[status(thm)],[2])).
% cnf(13,plain,(patricide(oedipus)),inference(split_conjunct,[status(thm)],[3])).
% cnf(14,plain,(~patricide(thersandros)),inference(split_conjunct,[status(thm)],[9])).
% cnf(15,plain,(parent_of(oedipus,polyneikes)),inference(split_conjunct,[status(thm)],[5])).
% cnf(16,plain,(parent_of(polyneikes,thersandros)),inference(split_conjunct,[status(thm)],[6])).
% fof(17, negated_conjecture,![X1]:![X2]:(((~(parent_of(iokaste,X1))|~(patricide(X1)))|~(parent_of(X1,X2)))|patricide(X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(18, negated_conjecture,![X3]:![X4]:(((~(parent_of(iokaste,X3))|~(patricide(X3)))|~(parent_of(X3,X4)))|patricide(X4)),inference(variable_rename,[status(thm)],[17])).
% cnf(19,negated_conjecture,(patricide(X1)|~parent_of(X2,X1)|~patricide(X2)|~parent_of(iokaste,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,negated_conjecture,(patricide(thersandros)|~patricide(polyneikes)|~parent_of(iokaste,polyneikes)),inference(spm,[status(thm)],[19,16,theory(equality)])).
% cnf(21,negated_conjecture,(patricide(polyneikes)|~patricide(oedipus)|~parent_of(iokaste,oedipus)),inference(spm,[status(thm)],[19,15,theory(equality)])).
% cnf(24,negated_conjecture,(patricide(thersandros)|~patricide(polyneikes)|$false),inference(rw,[status(thm)],[20,12,theory(equality)])).
% cnf(25,negated_conjecture,(patricide(thersandros)|~patricide(polyneikes)),inference(cn,[status(thm)],[24,theory(equality)])).
% cnf(26,negated_conjecture,(~patricide(polyneikes)),inference(sr,[status(thm)],[25,14,theory(equality)])).
% cnf(27,negated_conjecture,(patricide(polyneikes)|$false|~parent_of(iokaste,oedipus)),inference(rw,[status(thm)],[21,13,theory(equality)])).
% cnf(28,negated_conjecture,(patricide(polyneikes)|$false|$false),inference(rw,[status(thm)],[27,11,theory(equality)])).
% cnf(29,negated_conjecture,(patricide(polyneikes)),inference(cn,[status(thm)],[28,theory(equality)])).
% cnf(32,negated_conjecture,($false),inference(rw,[status(thm)],[26,29,theory(equality)])).
% cnf(33,negated_conjecture,($false),inference(cn,[status(thm)],[32,theory(equality)])).
% cnf(34,negated_conjecture,($false),33,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # 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: 8
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # 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: 15 leaves, 1.07+/-0.249 terms/leaf
% # Paramod-from index: 6 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 12 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.003 s
% # Total time : 0.010 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP18919/PUZ128+1.tptp
%
%------------------------------------------------------------------------------