TSTP Solution File: ALG171+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG171+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 : 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 : Tue Dec 28 21:05:03 EST 2010
% Result : Theorem 1.21s
% Output : Solution 1.21s
% 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/SystemOnTPTP20588/ALG171+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20588/ALG171+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20588/ALG171+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 20720
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,(((e0=op(e4,op(e4,e4))&e1=op(e4,e4))&e2=op(op(e4,op(e4,e4)),op(e4,e4)))&e3=op(op(e4,op(e4,e4)),op(e4,op(e4,e4)))),file('/tmp/SRASS.s.p', ax6)).
% fof(6, axiom,(((((((((~(e0=e1)&~(e0=e2))&~(e0=e3))&~(e0=e4))&~(e1=e2))&~(e1=e3))&~(e1=e4))&~(e2=e3))&~(e2=e4))&~(e3=e4)),file('/tmp/SRASS.s.p', ax5)).
% fof(7, conjecture,~((((((((((((((((((((((((((((((((((~(op(e0,e0)=e0)&~(op(e1,e0)=e1))&~(op(e2,e0)=e2))&~(op(e3,e0)=e3))&~(op(e4,e0)=e4))|((((~(op(e0,e1)=e0)&~(op(e1,e1)=e1))&~(op(e2,e1)=e2))&~(op(e3,e1)=e3))&~(op(e4,e1)=e4)))|((((~(op(e0,e2)=e0)&~(op(e1,e2)=e1))&~(op(e2,e2)=e2))&~(op(e3,e2)=e3))&~(op(e4,e2)=e4)))|((((~(op(e0,e3)=e0)&~(op(e1,e3)=e1))&~(op(e2,e3)=e2))&~(op(e3,e3)=e3))&~(op(e4,e3)=e4)))|((((~(op(e0,e4)=e0)&~(op(e1,e4)=e1))&~(op(e2,e4)=e2))&~(op(e3,e4)=e3))&~(op(e4,e4)=e4)))&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)),file('/tmp/SRASS.s.p', co1)).
% fof(8, negated_conjecture,~(~((((((((((((((((((((((((((((((((((~(op(e0,e0)=e0)&~(op(e1,e0)=e1))&~(op(e2,e0)=e2))&~(op(e3,e0)=e3))&~(op(e4,e0)=e4))|((((~(op(e0,e1)=e0)&~(op(e1,e1)=e1))&~(op(e2,e1)=e2))&~(op(e3,e1)=e3))&~(op(e4,e1)=e4)))|((((~(op(e0,e2)=e0)&~(op(e1,e2)=e1))&~(op(e2,e2)=e2))&~(op(e3,e2)=e3))&~(op(e4,e2)=e4)))|((((~(op(e0,e3)=e0)&~(op(e1,e3)=e1))&~(op(e2,e3)=e2))&~(op(e3,e3)=e3))&~(op(e4,e3)=e4)))|((((~(op(e0,e4)=e0)&~(op(e1,e4)=e1))&~(op(e2,e4)=e2))&~(op(e3,e4)=e3))&~(op(e4,e4)=e4)))&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))),inference(assume_negation,[status(cth)],[7])).
% fof(10, plain,(epred2_0=>(((((((~(op(e0,e0)=e0)&~(op(e1,e0)=e1))&~(op(e2,e0)=e2))&~(op(e3,e0)=e3))&~(op(e4,e0)=e4))|((((~(op(e0,e1)=e0)&~(op(e1,e1)=e1))&~(op(e2,e1)=e2))&~(op(e3,e1)=e3))&~(op(e4,e1)=e4)))|((((~(op(e0,e2)=e0)&~(op(e1,e2)=e1))&~(op(e2,e2)=e2))&~(op(e3,e2)=e3))&~(op(e4,e2)=e4)))|((((~(op(e0,e3)=e0)&~(op(e1,e3)=e1))&~(op(e2,e3)=e2))&~(op(e3,e3)=e3))&~(op(e4,e3)=e4)))),introduced(definition)).
% fof(11, negated_conjecture,~(~(((((((((((((((((((((((((((epred2_0|((((~(op(e0,e4)=e0)&~(op(e1,e4)=e1))&~(op(e2,e4)=e2))&~(op(e3,e4)=e3))&~(op(e4,e4)=e4)))&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))),inference(apply_def,[status(esa)],[8,10,theory(equality)])).
% cnf(215,plain,(e1=op(e4,e4)),inference(split_conjunct,[status(thm)],[5])).
% cnf(216,plain,(e0=op(e4,op(e4,e4))),inference(split_conjunct,[status(thm)],[5])).
% cnf(223,plain,(e0!=e4),inference(split_conjunct,[status(thm)],[6])).
% fof(227, negated_conjecture,((((((((((((((((((((((((((epred2_0|((((~(op(e0,e4)=e0)&~(op(e1,e4)=e1))&~(op(e2,e4)=e2))&~(op(e3,e4)=e3))&~(op(e4,e4)=e4)))&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),inference(fof_nnf,[status(thm)],[11])).
% fof(228, negated_conjecture,((((((((((((((((((((((((((((((~(op(e0,e4)=e0)|epred2_0)&(~(op(e1,e4)=e1)|epred2_0))&(~(op(e2,e4)=e2)|epred2_0))&(~(op(e3,e4)=e3)|epred2_0))&(~(op(e4,e4)=e4)|epred2_0))&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),inference(distribute,[status(thm)],[227])).
% cnf(229,negated_conjecture,(op(e4,op(e4,e4))=e4),inference(split_conjunct,[status(thm)],[228])).
% cnf(314,plain,(op(e4,e1)=e0),inference(rw,[status(thm)],[216,215,theory(equality)])).
% cnf(316,negated_conjecture,(e0=e4),inference(rw,[status(thm)],[inference(rw,[status(thm)],[229,215,theory(equality)]),314,theory(equality)])).
% cnf(317,negated_conjecture,($false),inference(sr,[status(thm)],[316,223,theory(equality)])).
% cnf(318,negated_conjecture,($false),317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 42
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 253
% # ...number of literals in the above : 678
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 55 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 25 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 53 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.006 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.19 WC
% FINAL PrfWatch: 0.13 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP20588/ALG171+1.tptp
%
%------------------------------------------------------------------------------