TSTP Solution File: ALG199+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG199+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 : art03.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:03:31 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/SystemOnTPTP27689/ALG199+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27689/ALG199+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27689/ALG199+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 27785
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.030 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,(((((e0=op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),op(e5,op(e5,e5)))&e1=op(e5,e5))&e2=op(op(e5,op(e5,e5)),op(e5,op(e5,e5))))&e3=op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5))&e4=op(e5,op(e5,e5)))&e6=op(op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5),op(e5,op(e5,e5)))),file('/tmp/SRASS.s.p', ax6)).
% fof(6, axiom,((((((((((((((((((((~(e0=e1)&~(e0=e2))&~(e0=e3))&~(e0=e4))&~(e0=e5))&~(e0=e6))&~(e1=e2))&~(e1=e3))&~(e1=e4))&~(e1=e5))&~(e1=e6))&~(e2=e3))&~(e2=e4))&~(e2=e5))&~(e2=e6))&~(e3=e4))&~(e3=e5))&~(e3=e6))&~(e4=e5))&~(e4=e6))&~(e5=e6)),file('/tmp/SRASS.s.p', ax5)).
% fof(7, conjecture,~(((((((((~(op(e0,e0)=e0)&~(op(e1,e1)=e1))&~(op(e2,e2)=e2))&~(op(e3,e3)=e3))&~(op(e4,e4)=e4))&~(op(e5,e5)=e5))&~(op(e6,e6)=e6))&((((((op(e0,e0)=e0|op(e1,e1)=e1)|op(e2,e2)=e2)|op(e3,e3)=e3)|op(e4,e4)=e4)|op(e5,e5)=e5)|op(e6,e6)=e6))&((((((~(op(e0,e0)=e0)|~(op(e1,e1)=e1))|~(op(e2,e2)=e2))|~(op(e3,e3)=e3))|~(op(e4,e4)=e4))|~(op(e5,e5)=e5))|~(op(e6,e6)=e6)))),file('/tmp/SRASS.s.p', co1)).
% fof(8, negated_conjecture,~(~(((((((((~(op(e0,e0)=e0)&~(op(e1,e1)=e1))&~(op(e2,e2)=e2))&~(op(e3,e3)=e3))&~(op(e4,e4)=e4))&~(op(e5,e5)=e5))&~(op(e6,e6)=e6))&((((((op(e0,e0)=e0|op(e1,e1)=e1)|op(e2,e2)=e2)|op(e3,e3)=e3)|op(e4,e4)=e4)|op(e5,e5)=e5)|op(e6,e6)=e6))&((((((~(op(e0,e0)=e0)|~(op(e1,e1)=e1))|~(op(e2,e2)=e2))|~(op(e3,e3)=e3))|~(op(e4,e4)=e4))|~(op(e5,e5)=e5))|~(op(e6,e6)=e6))))),inference(assume_negation,[status(cth)],[7])).
% cnf(500,plain,(e4=op(e5,op(e5,e5))),inference(split_conjunct,[status(thm)],[5])).
% cnf(502,plain,(e2=op(op(e5,op(e5,e5)),op(e5,op(e5,e5)))),inference(split_conjunct,[status(thm)],[5])).
% cnf(503,plain,(e1=op(e5,e5)),inference(split_conjunct,[status(thm)],[5])).
% cnf(513,plain,(e2!=e4),inference(split_conjunct,[status(thm)],[6])).
% cnf(516,plain,(e1!=e5),inference(split_conjunct,[status(thm)],[6])).
% fof(526, negated_conjecture,((((((((~(op(e0,e0)=e0)&~(op(e1,e1)=e1))&~(op(e2,e2)=e2))&~(op(e3,e3)=e3))&~(op(e4,e4)=e4))&~(op(e5,e5)=e5))&~(op(e6,e6)=e6))&((((((op(e0,e0)=e0|op(e1,e1)=e1)|op(e2,e2)=e2)|op(e3,e3)=e3)|op(e4,e4)=e4)|op(e5,e5)=e5)|op(e6,e6)=e6))&((((((~(op(e0,e0)=e0)|~(op(e1,e1)=e1))|~(op(e2,e2)=e2))|~(op(e3,e3)=e3))|~(op(e4,e4)=e4))|~(op(e5,e5)=e5))|~(op(e6,e6)=e6))),inference(fof_nnf,[status(thm)],[8])).
% cnf(528,negated_conjecture,(op(e6,e6)=e6|op(e5,e5)=e5|op(e4,e4)=e4|op(e3,e3)=e3|op(e2,e2)=e2|op(e1,e1)=e1|op(e0,e0)=e0),inference(split_conjunct,[status(thm)],[526])).
% cnf(529,negated_conjecture,(op(e6,e6)!=e6),inference(split_conjunct,[status(thm)],[526])).
% cnf(532,negated_conjecture,(op(e3,e3)!=e3),inference(split_conjunct,[status(thm)],[526])).
% cnf(533,negated_conjecture,(op(e2,e2)!=e2),inference(split_conjunct,[status(thm)],[526])).
% cnf(534,negated_conjecture,(op(e1,e1)!=e1),inference(split_conjunct,[status(thm)],[526])).
% cnf(535,negated_conjecture,(op(e0,e0)!=e0),inference(split_conjunct,[status(thm)],[526])).
% cnf(536,plain,(op(e5,e1)=e4),inference(rw,[status(thm)],[500,503,theory(equality)])).
% cnf(540,plain,(op(e4,e4)=e2),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[502,503,theory(equality)]),536,theory(equality)]),503,theory(equality)]),536,theory(equality)])).
% cnf(568,negated_conjecture,(op(e0,e0)=e0|op(e1,e1)=e1|op(e2,e2)=e2|op(e3,e3)=e3|e2=e4|op(e5,e5)=e5|op(e6,e6)=e6),inference(rw,[status(thm)],[528,540,theory(equality)])).
% cnf(569,negated_conjecture,(op(e0,e0)=e0|op(e1,e1)=e1|op(e2,e2)=e2|op(e3,e3)=e3|e2=e4|e1=e5|op(e6,e6)=e6),inference(rw,[status(thm)],[568,503,theory(equality)])).
% cnf(570,negated_conjecture,(op(e1,e1)=e1|op(e2,e2)=e2|op(e3,e3)=e3|e2=e4|e1=e5|op(e6,e6)=e6),inference(sr,[status(thm)],[569,535,theory(equality)])).
% cnf(571,negated_conjecture,(op(e2,e2)=e2|op(e3,e3)=e3|e2=e4|e1=e5|op(e6,e6)=e6),inference(sr,[status(thm)],[570,534,theory(equality)])).
% cnf(572,negated_conjecture,(op(e3,e3)=e3|e2=e4|e1=e5|op(e6,e6)=e6),inference(sr,[status(thm)],[571,533,theory(equality)])).
% cnf(573,negated_conjecture,(e2=e4|e1=e5|op(e6,e6)=e6),inference(sr,[status(thm)],[572,532,theory(equality)])).
% cnf(574,negated_conjecture,(e1=e5|op(e6,e6)=e6),inference(sr,[status(thm)],[573,513,theory(equality)])).
% cnf(575,negated_conjecture,(op(e6,e6)=e6),inference(sr,[status(thm)],[574,516,theory(equality)])).
% cnf(576,negated_conjecture,($false),inference(sr,[status(thm)],[575,529,theory(equality)])).
% cnf(577,negated_conjecture,($false),576,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 147
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 146
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 20
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 0
% # Paramodulations : 15
% # Factorizations : 5
% # Equation resolutions : 0
% # Current number of processed clauses: 142
% # Positive orientable unit clauses: 51
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 88
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 397
% # ...number of literals in the above : 1342
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 138
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 110 leaves, 1.35+/-1.338 terms/leaf
% # Paramod-from index: 16 leaves, 3.38+/-2.736 terms/leaf
% # Paramod-into index: 110 leaves, 1.35+/-1.338 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.006 s
% # Total time : 0.036 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP27689/ALG199+1.tptp
%
%------------------------------------------------------------------------------