TSTP Solution File: ALG014+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG014+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:39:07 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP30769/ALG014+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30769/ALG014+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30769/ALG014+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 30865
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,(((((((((((((((((((((((((((((((((((((((((((((((~(op(e0,e0)=op(e1,e0))&~(op(e0,e0)=op(e2,e0)))&~(op(e0,e0)=op(e3,e0)))&~(op(e1,e0)=op(e2,e0)))&~(op(e1,e0)=op(e3,e0)))&~(op(e2,e0)=op(e3,e0)))&~(op(e0,e1)=op(e1,e1)))&~(op(e0,e1)=op(e2,e1)))&~(op(e0,e1)=op(e3,e1)))&~(op(e1,e1)=op(e2,e1)))&~(op(e1,e1)=op(e3,e1)))&~(op(e2,e1)=op(e3,e1)))&~(op(e0,e2)=op(e1,e2)))&~(op(e0,e2)=op(e2,e2)))&~(op(e0,e2)=op(e3,e2)))&~(op(e1,e2)=op(e2,e2)))&~(op(e1,e2)=op(e3,e2)))&~(op(e2,e2)=op(e3,e2)))&~(op(e0,e3)=op(e1,e3)))&~(op(e0,e3)=op(e2,e3)))&~(op(e0,e3)=op(e3,e3)))&~(op(e1,e3)=op(e2,e3)))&~(op(e1,e3)=op(e3,e3)))&~(op(e2,e3)=op(e3,e3)))&~(op(e0,e0)=op(e0,e1)))&~(op(e0,e0)=op(e0,e2)))&~(op(e0,e0)=op(e0,e3)))&~(op(e0,e1)=op(e0,e2)))&~(op(e0,e1)=op(e0,e3)))&~(op(e0,e2)=op(e0,e3)))&~(op(e1,e0)=op(e1,e1)))&~(op(e1,e0)=op(e1,e2)))&~(op(e1,e0)=op(e1,e3)))&~(op(e1,e1)=op(e1,e2)))&~(op(e1,e1)=op(e1,e3)))&~(op(e1,e2)=op(e1,e3)))&~(op(e2,e0)=op(e2,e1)))&~(op(e2,e0)=op(e2,e2)))&~(op(e2,e0)=op(e2,e3)))&~(op(e2,e1)=op(e2,e2)))&~(op(e2,e1)=op(e2,e3)))&~(op(e2,e2)=op(e2,e3)))&~(op(e3,e0)=op(e3,e1)))&~(op(e3,e0)=op(e3,e2)))&~(op(e3,e0)=op(e3,e3)))&~(op(e3,e1)=op(e3,e2)))&~(op(e3,e1)=op(e3,e3)))&~(op(e3,e2)=op(e3,e3))),file('/tmp/SRASS.s.p', ax10)).
% fof(5, axiom,((((((((op(unit,e0)=e0&op(e0,unit)=e0)&op(unit,e1)=e1)&op(e1,unit)=e1)&op(unit,e2)=e2)&op(e2,unit)=e2)&op(unit,e3)=e3)&op(e3,unit)=e3)&(((unit=e0|unit=e1)|unit=e2)|unit=e3)),file('/tmp/SRASS.s.p', ax3)).
% fof(10, axiom,unit=e0,file('/tmp/SRASS.s.p', ax5)).
% fof(12, 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(13, 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)],[12])).
% fof(15, 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(16, 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)],[13,15,theory(equality)]),15,theory(equality)])).
% cnf(124,plain,(op(e0,e3)!=op(e3,e3)),inference(split_conjunct,[status(thm)],[3])).
% cnf(153,plain,(op(unit,e3)=e3),inference(split_conjunct,[status(thm)],[5])).
% cnf(195,plain,(unit=e0),inference(split_conjunct,[status(thm)],[10])).
% fof(197, 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)],[16])).
% fof(198, negated_conjecture,((~(epred1_0)&(((~(op(e0,e0)=e3)|~(op(e1,e1)=e3))|~(op(e2,e2)=e3))|~(op(e3,e3)=e3)))&((((op(e0,e0)=e3|epred1_0)&(op(e1,e1)=e3|epred1_0))&(op(e2,e2)=e3|epred1_0))&(op(e3,e3)=e3|epred1_0))),inference(distribute,[status(thm)],[197])).
% cnf(199,negated_conjecture,(epred1_0|op(e3,e3)=e3),inference(split_conjunct,[status(thm)],[198])).
% cnf(204,negated_conjecture,(~epred1_0),inference(split_conjunct,[status(thm)],[198])).
% cnf(283,negated_conjecture,(op(e3,e3)=e3),inference(sr,[status(thm)],[199,204,theory(equality)])).
% cnf(399,plain,(e3!=op(e0,e3)),inference(rw,[status(thm)],[124,283,theory(equality)])).
% cnf(400,plain,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[399,195,theory(equality)]),153,theory(equality)])).
% cnf(401,plain,($false),inference(cn,[status(thm)],[400,theory(equality)])).
% cnf(402,plain,($false),401,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 116
% # ...of these trivial : 18
% # ...subsumed : 19
% # ...remaining for further processing: 79
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 2
% # ...of the previous two non-trivial : 5
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 73
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 38
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 141
% # ...number of literals in the above : 412
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 51 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 33 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 47 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.002 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.19 WC
% FINAL PrfWatch: 0.10 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP30769/ALG014+1.tptp
%
%------------------------------------------------------------------------------