TSTP Solution File: ALG175+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG175+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 : art07.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 21:00:50 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP12488/ALG175+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12488/ALG175+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12488/ALG175+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 12584
% 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(op(e0,e0),op(e0,e0))=e0&op(op(e1,e0),op(e0,e1))=e0)&op(op(e2,e0),op(e0,e2))=e0)&op(op(e3,e0),op(e0,e3))=e0)&op(op(e4,e0),op(e0,e4))=e0)&op(op(e0,e1),op(e1,e0))=e1)&op(op(e1,e1),op(e1,e1))=e1)&op(op(e2,e1),op(e1,e2))=e1)&op(op(e3,e1),op(e1,e3))=e1)&op(op(e4,e1),op(e1,e4))=e1)&op(op(e0,e2),op(e2,e0))=e2)&op(op(e1,e2),op(e2,e1))=e2)&op(op(e2,e2),op(e2,e2))=e2)&op(op(e3,e2),op(e2,e3))=e2)&op(op(e4,e2),op(e2,e4))=e2)&op(op(e0,e3),op(e3,e0))=e3)&op(op(e1,e3),op(e3,e1))=e3)&op(op(e2,e3),op(e3,e2))=e3)&op(op(e3,e3),op(e3,e3))=e3)&op(op(e4,e3),op(e3,e4))=e3)&op(op(e0,e4),op(e4,e0))=e4)&op(op(e1,e4),op(e4,e1))=e4)&op(op(e2,e4),op(e4,e2))=e4)&op(op(e3,e4),op(e4,e3))=e4)&op(op(e4,e4),op(e4,e4))=e4),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((~(op(e0,e0)=op(e1,e0))&~(op(e0,e0)=op(e2,e0)))&~(op(e0,e0)=op(e3,e0)))&~(op(e0,e0)=op(e4,e0)))&~(op(e1,e0)=op(e2,e0)))&~(op(e1,e0)=op(e3,e0)))&~(op(e1,e0)=op(e4,e0)))&~(op(e2,e0)=op(e3,e0)))&~(op(e2,e0)=op(e4,e0)))&~(op(e3,e0)=op(e4,e0)))&~(op(e0,e1)=op(e1,e1)))&~(op(e0,e1)=op(e2,e1)))&~(op(e0,e1)=op(e3,e1)))&~(op(e0,e1)=op(e4,e1)))&~(op(e1,e1)=op(e2,e1)))&~(op(e1,e1)=op(e3,e1)))&~(op(e1,e1)=op(e4,e1)))&~(op(e2,e1)=op(e3,e1)))&~(op(e2,e1)=op(e4,e1)))&~(op(e3,e1)=op(e4,e1)))&~(op(e0,e2)=op(e1,e2)))&~(op(e0,e2)=op(e2,e2)))&~(op(e0,e2)=op(e3,e2)))&~(op(e0,e2)=op(e4,e2)))&~(op(e1,e2)=op(e2,e2)))&~(op(e1,e2)=op(e3,e2)))&~(op(e1,e2)=op(e4,e2)))&~(op(e2,e2)=op(e3,e2)))&~(op(e2,e2)=op(e4,e2)))&~(op(e3,e2)=op(e4,e2)))&~(op(e0,e3)=op(e1,e3)))&~(op(e0,e3)=op(e2,e3)))&~(op(e0,e3)=op(e3,e3)))&~(op(e0,e3)=op(e4,e3)))&~(op(e1,e3)=op(e2,e3)))&~(op(e1,e3)=op(e3,e3)))&~(op(e1,e3)=op(e4,e3)))&~(op(e2,e3)=op(e3,e3)))&~(op(e2,e3)=op(e4,e3)))&~(op(e3,e3)=op(e4,e3)))&~(op(e0,e4)=op(e1,e4)))&~(op(e0,e4)=op(e2,e4)))&~(op(e0,e4)=op(e3,e4)))&~(op(e0,e4)=op(e4,e4)))&~(op(e1,e4)=op(e2,e4)))&~(op(e1,e4)=op(e3,e4)))&~(op(e1,e4)=op(e4,e4)))&~(op(e2,e4)=op(e3,e4)))&~(op(e2,e4)=op(e4,e4)))&~(op(e3,e4)=op(e4,e4)))&~(op(e0,e0)=op(e0,e1)))&~(op(e0,e0)=op(e0,e2)))&~(op(e0,e0)=op(e0,e3)))&~(op(e0,e0)=op(e0,e4)))&~(op(e0,e1)=op(e0,e2)))&~(op(e0,e1)=op(e0,e3)))&~(op(e0,e1)=op(e0,e4)))&~(op(e0,e2)=op(e0,e3)))&~(op(e0,e2)=op(e0,e4)))&~(op(e0,e3)=op(e0,e4)))&~(op(e1,e0)=op(e1,e1)))&~(op(e1,e0)=op(e1,e2)))&~(op(e1,e0)=op(e1,e3)))&~(op(e1,e0)=op(e1,e4)))&~(op(e1,e1)=op(e1,e2)))&~(op(e1,e1)=op(e1,e3)))&~(op(e1,e1)=op(e1,e4)))&~(op(e1,e2)=op(e1,e3)))&~(op(e1,e2)=op(e1,e4)))&~(op(e1,e3)=op(e1,e4)))&~(op(e2,e0)=op(e2,e1)))&~(op(e2,e0)=op(e2,e2)))&~(op(e2,e0)=op(e2,e3)))&~(op(e2,e0)=op(e2,e4)))&~(op(e2,e1)=op(e2,e2)))&~(op(e2,e1)=op(e2,e3)))&~(op(e2,e1)=op(e2,e4)))&~(op(e2,e2)=op(e2,e3)))&~(op(e2,e2)=op(e2,e4)))&~(op(e2,e3)=op(e2,e4)))&~(op(e3,e0)=op(e3,e1)))&~(op(e3,e0)=op(e3,e2)))&~(op(e3,e0)=op(e3,e3)))&~(op(e3,e0)=op(e3,e4)))&~(op(e3,e1)=op(e3,e2)))&~(op(e3,e1)=op(e3,e3)))&~(op(e3,e1)=op(e3,e4)))&~(op(e3,e2)=op(e3,e3)))&~(op(e3,e2)=op(e3,e4)))&~(op(e3,e3)=op(e3,e4)))&~(op(e4,e0)=op(e4,e1)))&~(op(e4,e0)=op(e4,e2)))&~(op(e4,e0)=op(e4,e3)))&~(op(e4,e0)=op(e4,e4)))&~(op(e4,e1)=op(e4,e2)))&~(op(e4,e1)=op(e4,e3)))&~(op(e4,e1)=op(e4,e4)))&~(op(e4,e2)=op(e4,e3)))&~(op(e4,e2)=op(e4,e4)))&~(op(e4,e3)=op(e4,e4))),file('/tmp/SRASS.s.p', ax4)).
% fof(5, axiom,((e0=op(op(e3,e1),e3)&e2=op(e3,op(op(e3,e1),e3)))&e4=op(e3,e1)),file('/tmp/SRASS.s.p', ax6)).
% fof(7, conjecture,~((((((((((((((((((((((((((((((((((((((((((((((((((op(e0,op(e0,e0))=e0&op(e0,op(e0,e1))=e1)&op(e0,op(e0,e2))=e2)&op(e0,op(e0,e3))=e3)&op(e0,op(e0,e4))=e4)&op(e1,op(e1,e0))=e0)&op(e1,op(e1,e1))=e1)&op(e1,op(e1,e2))=e2)&op(e1,op(e1,e3))=e3)&op(e1,op(e1,e4))=e4)&op(e2,op(e2,e0))=e0)&op(e2,op(e2,e1))=e1)&op(e2,op(e2,e2))=e2)&op(e2,op(e2,e3))=e3)&op(e2,op(e2,e4))=e4)&op(e3,op(e3,e0))=e0)&op(e3,op(e3,e1))=e1)&op(e3,op(e3,e2))=e2)&op(e3,op(e3,e3))=e3)&op(e3,op(e3,e4))=e4)&op(e4,op(e4,e0))=e0)&op(e4,op(e4,e1))=e1)&op(e4,op(e4,e2))=e2)&op(e4,op(e4,e3))=e3)&op(e4,op(e4,e4))=e4)&op(op(e0,e0),e0)=e0)&op(op(e0,e1),e1)=e0)&op(op(e0,e2),e2)=e0)&op(op(e0,e3),e3)=e0)&op(op(e0,e4),e4)=e0)&op(op(e1,e0),e0)=e1)&op(op(e1,e1),e1)=e1)&op(op(e1,e2),e2)=e1)&op(op(e1,e3),e3)=e1)&op(op(e1,e4),e4)=e1)&op(op(e2,e0),e0)=e2)&op(op(e2,e1),e1)=e2)&op(op(e2,e2),e2)=e2)&op(op(e2,e3),e3)=e2)&op(op(e2,e4),e4)=e2)&op(op(e3,e0),e0)=e3)&op(op(e3,e1),e1)=e3)&op(op(e3,e2),e2)=e3)&op(op(e3,e3),e3)=e3)&op(op(e3,e4),e4)=e3)&op(op(e4,e0),e0)=e4)&op(op(e4,e1),e1)=e4)&op(op(e4,e2),e2)=e4)&op(op(e4,e3),e3)=e4)&op(op(e4,e4),e4)=e4)),file('/tmp/SRASS.s.p', co1)).
% fof(8, negated_conjecture,~(~((((((((((((((((((((((((((((((((((((((((((((((((((op(e0,op(e0,e0))=e0&op(e0,op(e0,e1))=e1)&op(e0,op(e0,e2))=e2)&op(e0,op(e0,e3))=e3)&op(e0,op(e0,e4))=e4)&op(e1,op(e1,e0))=e0)&op(e1,op(e1,e1))=e1)&op(e1,op(e1,e2))=e2)&op(e1,op(e1,e3))=e3)&op(e1,op(e1,e4))=e4)&op(e2,op(e2,e0))=e0)&op(e2,op(e2,e1))=e1)&op(e2,op(e2,e2))=e2)&op(e2,op(e2,e3))=e3)&op(e2,op(e2,e4))=e4)&op(e3,op(e3,e0))=e0)&op(e3,op(e3,e1))=e1)&op(e3,op(e3,e2))=e2)&op(e3,op(e3,e3))=e3)&op(e3,op(e3,e4))=e4)&op(e4,op(e4,e0))=e0)&op(e4,op(e4,e1))=e1)&op(e4,op(e4,e2))=e2)&op(e4,op(e4,e3))=e3)&op(e4,op(e4,e4))=e4)&op(op(e0,e0),e0)=e0)&op(op(e0,e1),e1)=e0)&op(op(e0,e2),e2)=e0)&op(op(e0,e3),e3)=e0)&op(op(e0,e4),e4)=e0)&op(op(e1,e0),e0)=e1)&op(op(e1,e1),e1)=e1)&op(op(e1,e2),e2)=e1)&op(op(e1,e3),e3)=e1)&op(op(e1,e4),e4)=e1)&op(op(e2,e0),e0)=e2)&op(op(e2,e1),e1)=e2)&op(op(e2,e2),e2)=e2)&op(op(e2,e3),e3)=e2)&op(op(e2,e4),e4)=e2)&op(op(e3,e0),e0)=e3)&op(op(e3,e1),e1)=e3)&op(op(e3,e2),e2)=e3)&op(op(e3,e3),e3)=e3)&op(op(e3,e4),e4)=e3)&op(op(e4,e0),e0)=e4)&op(op(e4,e1),e1)=e4)&op(op(e4,e2),e2)=e4)&op(op(e4,e3),e3)=e4)&op(op(e4,e4),e4)=e4))),inference(assume_negation,[status(cth)],[7])).
% cnf(87,plain,(op(op(e1,e4),op(e4,e1))=e4),inference(split_conjunct,[status(thm)],[3])).
% cnf(123,plain,(op(e3,e1)!=op(e3,e3)),inference(split_conjunct,[status(thm)],[4])).
% cnf(209,plain,(e4=op(e3,e1)),inference(split_conjunct,[status(thm)],[5])).
% fof(222, negated_conjecture,(((((((((((((((((((((((((((((((((((((((((((((((((op(e0,op(e0,e0))=e0&op(e0,op(e0,e1))=e1)&op(e0,op(e0,e2))=e2)&op(e0,op(e0,e3))=e3)&op(e0,op(e0,e4))=e4)&op(e1,op(e1,e0))=e0)&op(e1,op(e1,e1))=e1)&op(e1,op(e1,e2))=e2)&op(e1,op(e1,e3))=e3)&op(e1,op(e1,e4))=e4)&op(e2,op(e2,e0))=e0)&op(e2,op(e2,e1))=e1)&op(e2,op(e2,e2))=e2)&op(e2,op(e2,e3))=e3)&op(e2,op(e2,e4))=e4)&op(e3,op(e3,e0))=e0)&op(e3,op(e3,e1))=e1)&op(e3,op(e3,e2))=e2)&op(e3,op(e3,e3))=e3)&op(e3,op(e3,e4))=e4)&op(e4,op(e4,e0))=e0)&op(e4,op(e4,e1))=e1)&op(e4,op(e4,e2))=e2)&op(e4,op(e4,e3))=e3)&op(e4,op(e4,e4))=e4)&op(op(e0,e0),e0)=e0)&op(op(e0,e1),e1)=e0)&op(op(e0,e2),e2)=e0)&op(op(e0,e3),e3)=e0)&op(op(e0,e4),e4)=e0)&op(op(e1,e0),e0)=e1)&op(op(e1,e1),e1)=e1)&op(op(e1,e2),e2)=e1)&op(op(e1,e3),e3)=e1)&op(op(e1,e4),e4)=e1)&op(op(e2,e0),e0)=e2)&op(op(e2,e1),e1)=e2)&op(op(e2,e2),e2)=e2)&op(op(e2,e3),e3)=e2)&op(op(e2,e4),e4)=e2)&op(op(e3,e0),e0)=e3)&op(op(e3,e1),e1)=e3)&op(op(e3,e2),e2)=e3)&op(op(e3,e3),e3)=e3)&op(op(e3,e4),e4)=e3)&op(op(e4,e0),e0)=e4)&op(op(e4,e1),e1)=e4)&op(op(e4,e2),e2)=e4)&op(op(e4,e3),e3)=e4)&op(op(e4,e4),e4)=e4),inference(fof_nnf,[status(thm)],[8])).
% cnf(228,negated_conjecture,(op(op(e3,e4),e4)=e3),inference(split_conjunct,[status(thm)],[222])).
% cnf(231,negated_conjecture,(op(op(e3,e1),e1)=e3),inference(split_conjunct,[status(thm)],[222])).
% cnf(256,negated_conjecture,(op(e3,op(e3,e1))=e1),inference(split_conjunct,[status(thm)],[222])).
% cnf(273,negated_conjecture,(op(e3,e4)=e1),inference(rw,[status(thm)],[256,209,theory(equality)])).
% cnf(275,negated_conjecture,(op(e4,e1)=e3),inference(rw,[status(thm)],[231,209,theory(equality)])).
% cnf(284,negated_conjecture,(op(e1,e4)=e3),inference(rw,[status(thm)],[228,273,theory(equality)])).
% cnf(304,plain,(e4!=op(e3,e3)),inference(rw,[status(thm)],[123,209,theory(equality)])).
% cnf(318,plain,(op(e3,e3)=e4),inference(rw,[status(thm)],[inference(rw,[status(thm)],[87,284,theory(equality)]),275,theory(equality)])).
% cnf(319,plain,($false),inference(sr,[status(thm)],[318,304,theory(equality)])).
% cnf(320,plain,($false),319,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 148
% # ...of these trivial : 2
% # ...subsumed : 2
% # ...remaining for further processing: 144
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 19
% # Generated clauses : 0
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 124
% # Positive orientable unit clauses: 53
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 71
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 132
% # ...number of literals in the above : 432
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 50
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 77 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 53 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 77 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.005 s
% # Total time : 0.022 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/SystemOnTPTP12488/ALG175+1.tptp
%
%------------------------------------------------------------------------------