TSTP Solution File: SYN728+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN728+1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 : Thu Dec 30 09:59:39 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/SystemOnTPTP672/SYN728+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP672/SYN728+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP672/SYN728+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 768
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(((![X1]:(?[X2]:p(X1,X2)=>![X3]:p(X3,X3))&![X4]:?[X5]:(p(X4,X5)|(m(X4)&q(f(X4,X5)))))&![X6]:(q(X6)=>~(m(g(X6)))))=>![X7]:?[X8]:(p(g(X7),X8)&p(X7,X7))),file('/tmp/SRASS.s.p', thm69)).
% fof(2, negated_conjecture,~((((![X1]:(?[X2]:p(X1,X2)=>![X3]:p(X3,X3))&![X4]:?[X5]:(p(X4,X5)|(m(X4)&q(f(X4,X5)))))&![X6]:(q(X6)=>~(m(g(X6)))))=>![X7]:?[X8]:(p(g(X7),X8)&p(X7,X7)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((((![X1]:(?[X2]:p(X1,X2)=>![X3]:p(X3,X3))&![X4]:?[X5]:(p(X4,X5)|(m(X4)&q(f(X4,X5)))))&![X6]:(q(X6)=>~(m(g(X6)))))=>![X7]:?[X8]:(p(g(X7),X8)&p(X7,X7)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,(((![X1]:(![X2]:~(p(X1,X2))|![X3]:p(X3,X3))&![X4]:?[X5]:(p(X4,X5)|(m(X4)&q(f(X4,X5)))))&![X6]:(~(q(X6))|~(m(g(X6)))))&?[X7]:![X8]:(~(p(g(X7),X8))|~(p(X7,X7)))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,(((![X9]:(![X10]:~(p(X9,X10))|![X11]:p(X11,X11))&![X12]:?[X13]:(p(X12,X13)|(m(X12)&q(f(X12,X13)))))&![X14]:(~(q(X14))|~(m(g(X14)))))&?[X15]:![X16]:(~(p(g(X15),X16))|~(p(X15,X15)))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,(((![X9]:(![X10]:~(p(X9,X10))|![X11]:p(X11,X11))&![X12]:(p(X12,esk1_1(X12))|(m(X12)&q(f(X12,esk1_1(X12))))))&![X14]:(~(q(X14))|~(m(g(X14)))))&![X16]:(~(p(g(esk2_0),X16))|~(p(esk2_0,esk2_0)))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X9]:![X10]:![X11]:![X12]:![X14]:![X16]:((~(p(g(esk2_0),X16))|~(p(esk2_0,esk2_0)))&((~(q(X14))|~(m(g(X14))))&((p(X12,esk1_1(X12))|(m(X12)&q(f(X12,esk1_1(X12)))))&(p(X11,X11)|~(p(X9,X10)))))),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X9]:![X10]:![X11]:![X12]:![X14]:![X16]:((~(p(g(esk2_0),X16))|~(p(esk2_0,esk2_0)))&((~(q(X14))|~(m(g(X14))))&(((m(X12)|p(X12,esk1_1(X12)))&(q(f(X12,esk1_1(X12)))|p(X12,esk1_1(X12))))&(p(X11,X11)|~(p(X9,X10)))))),inference(distribute,[status(thm)],[7])).
% cnf(9,negated_conjecture,(p(X3,X3)|~p(X1,X2)),inference(split_conjunct,[status(thm)],[8])).
% cnf(10,negated_conjecture,(p(X1,esk1_1(X1))|q(f(X1,esk1_1(X1)))),inference(split_conjunct,[status(thm)],[8])).
% cnf(11,negated_conjecture,(p(X1,esk1_1(X1))|m(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(12,negated_conjecture,(~m(g(X1))|~q(X1)),inference(split_conjunct,[status(thm)],[8])).
% cnf(13,negated_conjecture,(~p(esk2_0,esk2_0)|~p(g(esk2_0),X1)),inference(split_conjunct,[status(thm)],[8])).
% fof(14, plain,(~(epred1_0)<=>![X3]:p(X3,X3)),introduced(definition),['split']).
% cnf(15,plain,(epred1_0|p(X3,X3)),inference(split_equiv,[status(thm)],[14])).
% fof(16, plain,(~(epred2_0)<=>![X2]:![X1]:~(p(X1,X2))),introduced(definition),['split']).
% cnf(17,plain,(epred2_0|~p(X1,X2)),inference(split_equiv,[status(thm)],[16])).
% cnf(18,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,14,theory(equality)]),16,theory(equality)]),['split']).
% cnf(20,negated_conjecture,(epred1_0|~p(esk2_0,esk2_0)),inference(spm,[status(thm)],[13,15,theory(equality)])).
% cnf(21,negated_conjecture,(epred2_0|m(X1)),inference(spm,[status(thm)],[17,11,theory(equality)])).
% cnf(25,negated_conjecture,(epred1_0),inference(csr,[status(thm)],[20,15])).
% cnf(26,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[18,25,theory(equality)])).
% cnf(27,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[26,theory(equality)])).
% cnf(29,negated_conjecture,(m(X1)),inference(sr,[status(thm)],[21,27,theory(equality)])).
% cnf(31,negated_conjecture,(~q(X1)|$false),inference(rw,[status(thm)],[12,29,theory(equality)])).
% cnf(32,negated_conjecture,(~q(X1)),inference(cn,[status(thm)],[31,theory(equality)])).
% cnf(34,negated_conjecture,(p(X1,esk1_1(X1))),inference(sr,[status(thm)],[10,32,theory(equality)])).
% cnf(36,negated_conjecture,(epred2_0),inference(spm,[status(thm)],[17,34,theory(equality)])).
% cnf(37,negated_conjecture,($false),inference(sr,[status(thm)],[36,27,theory(equality)])).
% cnf(38,negated_conjecture,($false),37,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 12
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 1
% # Paramodulations : 8
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 1
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 14
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 11 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 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/SystemOnTPTP672/SYN728+1.tptp
%
%------------------------------------------------------------------------------