TSTP Solution File: ALG039+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : ALG039+1 : TPTP v5.0.0. Released v2.7.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 : Tue Dec 28 20:43:37 EST 2010

% Result   : Theorem 0.92s
% Output   : Solution 0.92s
% 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/SystemOnTPTP1612/ALG039+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP1612/ALG039+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1612/ALG039+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 1708
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,(e0=op(e1,e1)&e2=op(e3,e1)),file('/tmp/SRASS.s.p', ax6)).
% fof(6, axiom,(((((~(e0=e1)&~(e0=e2))&~(e0=e3))&~(e1=e2))&~(e1=e3))&~(e2=e3)),file('/tmp/SRASS.s.p', ax5)).
% fof(7, conjecture,~((((((((op(e0,e0)=e0&op(e1,e1)=e0)&op(e2,e2)=e0)&op(e3,e3)=e0)|(((op(e0,e0)=e1&op(e1,e1)=e1)&op(e2,e2)=e1)&op(e3,e3)=e1))|(((op(e0,e0)=e2&op(e1,e1)=e2)&op(e2,e2)=e2)&op(e3,e3)=e2))|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3))&~(((((((op(e0,e0)=e0&op(e1,e1)=e0)&op(e2,e2)=e0)&op(e3,e3)=e0)|(((op(e0,e0)=e1&op(e1,e1)=e1)&op(e2,e2)=e1)&op(e3,e3)=e1))|(((op(e0,e0)=e2&op(e1,e1)=e2)&op(e2,e2)=e2)&op(e3,e3)=e2))|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3))))),file('/tmp/SRASS.s.p', co1)).
% fof(8, negated_conjecture,~(~((((((((op(e0,e0)=e0&op(e1,e1)=e0)&op(e2,e2)=e0)&op(e3,e3)=e0)|(((op(e0,e0)=e1&op(e1,e1)=e1)&op(e2,e2)=e1)&op(e3,e3)=e1))|(((op(e0,e0)=e2&op(e1,e1)=e2)&op(e2,e2)=e2)&op(e3,e3)=e2))|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3))&~(((((((op(e0,e0)=e0&op(e1,e1)=e0)&op(e2,e2)=e0)&op(e3,e3)=e0)|(((op(e0,e0)=e1&op(e1,e1)=e1)&op(e2,e2)=e1)&op(e3,e3)=e1))|(((op(e0,e0)=e2&op(e1,e1)=e2)&op(e2,e2)=e2)&op(e3,e3)=e2))|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3)))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,(epred1_0<=>(((((op(e0,e0)=e0&op(e1,e1)=e0)&op(e2,e2)=e0)&op(e3,e3)=e0)|(((op(e0,e0)=e1&op(e1,e1)=e1)&op(e2,e2)=e1)&op(e3,e3)=e1))|(((op(e0,e0)=e2&op(e1,e1)=e2)&op(e2,e2)=e2)&op(e3,e3)=e2))),introduced(definition)).
% fof(10, negated_conjecture,~(~(((epred1_0|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3))&~((epred1_0|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3)))))),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[8,9,theory(equality)]),9,theory(equality)])).
% cnf(108,plain,(e0=op(e1,e1)),inference(split_conjunct,[status(thm)],[4])).
% cnf(121,plain,(e0!=e3),inference(split_conjunct,[status(thm)],[6])).
% fof(124, negated_conjecture,((epred1_0|(((op(e0,e0)=e3&op(e1,e1)=e3)&op(e2,e2)=e3)&op(e3,e3)=e3))&(~(epred1_0)&(((~(op(e0,e0)=e3)|~(op(e1,e1)=e3))|~(op(e2,e2)=e3))|~(op(e3,e3)=e3)))),inference(fof_nnf,[status(thm)],[10])).
% fof(125, negated_conjecture,(((((op(e0,e0)=e3|epred1_0)&(op(e1,e1)=e3|epred1_0))&(op(e2,e2)=e3|epred1_0))&(op(e3,e3)=e3|epred1_0))&(~(epred1_0)&(((~(op(e0,e0)=e3)|~(op(e1,e1)=e3))|~(op(e2,e2)=e3))|~(op(e3,e3)=e3)))),inference(distribute,[status(thm)],[124])).
% cnf(127,negated_conjecture,(~epred1_0),inference(split_conjunct,[status(thm)],[125])).
% cnf(130,negated_conjecture,(epred1_0|op(e1,e1)=e3),inference(split_conjunct,[status(thm)],[125])).
% cnf(202,negated_conjecture,(e0=e3|epred1_0),inference(rw,[status(thm)],[130,108,theory(equality)])).
% cnf(203,negated_conjecture,(epred1_0),inference(sr,[status(thm)],[202,121,theory(equality)])).
% cnf(204,negated_conjecture,($false),inference(sr,[status(thm)],[203,127,theory(equality)])).
% cnf(205,negated_conjecture,($false),204,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 14
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 14
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 1
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 0
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 12
% #    Positive orientable unit clauses: 5
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 7
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 173
% # ...number of literals in the above : 529
% # 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:    12 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            5 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:           11 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time              : 0.013 s
% # System time            : 0.003 s
% # Total time             : 0.016 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/SystemOnTPTP1612/ALG039+1.tptp
% 
%------------------------------------------------------------------------------