TSTP Solution File: NUM421+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM421+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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 : Wed Dec 29 18:55:24 EST 2010
% Result : Theorem 3.66s
% Output : Solution 3.66s
% 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/SystemOnTPTP30889/NUM421+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30889/NUM421+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30889/NUM421+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 30985
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.02 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,aInteger0(sz00),file('/tmp/SRASS.s.p', mIntZero)).
% fof(2, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>aInteger0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mIntMult)).
% fof(4, axiom,![X1]:![X2]:((aInteger0(X1)&aInteger0(X2))=>sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),file('/tmp/SRASS.s.p', mMulComm)).
% fof(5, axiom,aInteger0(xa),file('/tmp/SRASS.s.p', m__419)).
% fof(6, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),file('/tmp/SRASS.s.p', mAddZero)).
% fof(7, axiom,![X1]:![X2]:![X3]:(((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),file('/tmp/SRASS.s.p', mDistrib)).
% fof(8, axiom,![X1]:(aInteger0(X1)=>(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),file('/tmp/SRASS.s.p', mMulOne)).
% fof(9, axiom,aInteger0(sz10),file('/tmp/SRASS.s.p', mIntOne)).
% fof(10, axiom,![X1]:(aInteger0(X1)=>aInteger0(smndt0(X1))),file('/tmp/SRASS.s.p', mIntNeg)).
% fof(12, axiom,![X1]:![X2]:![X3]:(((aInteger0(X1)&aInteger0(X2))&aInteger0(X3))=>sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)),file('/tmp/SRASS.s.p', mAddAsso)).
% fof(14, axiom,![X1]:(aInteger0(X1)=>(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),file('/tmp/SRASS.s.p', mAddNeg)).
% fof(16, conjecture,(sdtasdt0(xa,sz00)=sz00&sz00=sdtasdt0(sz00,xa)),file('/tmp/SRASS.s.p', m__)).
% fof(17, negated_conjecture,~((sdtasdt0(xa,sz00)=sz00&sz00=sdtasdt0(sz00,xa))),inference(assume_negation,[status(cth)],[16])).
% cnf(19,plain,(aInteger0(sz00)),inference(split_conjunct,[status(thm)],[1])).
% fof(20, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|aInteger0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|aInteger0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(aInteger0(sdtasdt0(X1,X2))|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(26, plain,![X1]:![X2]:((~(aInteger0(X1))|~(aInteger0(X2)))|sdtasdt0(X1,X2)=sdtasdt0(X2,X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X3]:![X4]:((~(aInteger0(X3))|~(aInteger0(X4)))|sdtasdt0(X3,X4)=sdtasdt0(X4,X3)),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(sdtasdt0(X1,X2)=sdtasdt0(X2,X1)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(aInteger0(xa)),inference(split_conjunct,[status(thm)],[5])).
% fof(30, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,sz00)=X1&X1=sdtpldt0(sz00,X1))),inference(fof_nnf,[status(thm)],[6])).
% fof(31, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,sz00)=X2&X2=sdtpldt0(sz00,X2))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X2]:((sdtpldt0(X2,sz00)=X2|~(aInteger0(X2)))&(X2=sdtpldt0(sz00,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(X1=sdtpldt0(sz00,X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(sdtpldt0(X1,sz00)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(35, plain,![X1]:![X2]:![X3]:(((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, plain,![X4]:![X5]:![X6]:(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6))))&(sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))|((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6))))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aInteger0(X1)|~aInteger0(X2)|~aInteger0(X3)),inference(split_conjunct,[status(thm)],[37])).
% fof(40, plain,![X1]:(~(aInteger0(X1))|(sdtasdt0(X1,sz10)=X1&X1=sdtasdt0(sz10,X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(41, plain,![X2]:(~(aInteger0(X2))|(sdtasdt0(X2,sz10)=X2&X2=sdtasdt0(sz10,X2))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X2]:((sdtasdt0(X2,sz10)=X2|~(aInteger0(X2)))&(X2=sdtasdt0(sz10,X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[41])).
% cnf(44,plain,(sdtasdt0(X1,sz10)=X1|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,plain,(aInteger0(sz10)),inference(split_conjunct,[status(thm)],[9])).
% fof(46, plain,![X1]:(~(aInteger0(X1))|aInteger0(smndt0(X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(47, plain,![X2]:(~(aInteger0(X2))|aInteger0(smndt0(X2))),inference(variable_rename,[status(thm)],[46])).
% cnf(48,plain,(aInteger0(smndt0(X1))|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(52, plain,![X1]:![X2]:![X3]:(((~(aInteger0(X1))|~(aInteger0(X2)))|~(aInteger0(X3)))|sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)),inference(fof_nnf,[status(thm)],[12])).
% fof(53, plain,![X4]:![X5]:![X6]:(((~(aInteger0(X4))|~(aInteger0(X5)))|~(aInteger0(X6)))|sdtpldt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtpldt0(X4,X5),X6)),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(sdtpldt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtpldt0(X1,X2),X3)|~aInteger0(X3)|~aInteger0(X2)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(58, plain,![X1]:(~(aInteger0(X1))|(sdtpldt0(X1,smndt0(X1))=sz00&sz00=sdtpldt0(smndt0(X1),X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(59, plain,![X2]:(~(aInteger0(X2))|(sdtpldt0(X2,smndt0(X2))=sz00&sz00=sdtpldt0(smndt0(X2),X2))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X2]:((sdtpldt0(X2,smndt0(X2))=sz00|~(aInteger0(X2)))&(sz00=sdtpldt0(smndt0(X2),X2)|~(aInteger0(X2)))),inference(distribute,[status(thm)],[59])).
% cnf(61,plain,(sz00=sdtpldt0(smndt0(X1),X1)|~aInteger0(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(65, negated_conjecture,(~(sdtasdt0(xa,sz00)=sz00)|~(sz00=sdtasdt0(sz00,xa))),inference(fof_nnf,[status(thm)],[17])).
% cnf(66,negated_conjecture,(sz00!=sdtasdt0(sz00,xa)|sdtasdt0(xa,sz00)!=sz00),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(aInteger0(smndt0(xa))),inference(spm,[status(thm)],[48,29,theory(equality)])).
% cnf(71,plain,(sdtasdt0(xa,sz10)=xa),inference(spm,[status(thm)],[44,29,theory(equality)])).
% cnf(73,plain,(sdtpldt0(sz10,sz00)=sz10),inference(spm,[status(thm)],[34,45,theory(equality)])).
% cnf(86,plain,(aInteger0(sdtasdt0(X1,xa))|~aInteger0(X1)),inference(spm,[status(thm)],[22,29,theory(equality)])).
% cnf(92,plain,(sdtpldt0(smndt0(xa),xa)=sz00),inference(spm,[status(thm)],[61,29,theory(equality)])).
% cnf(95,plain,(sdtasdt0(X1,xa)=sdtasdt0(xa,X1)|~aInteger0(X1)),inference(spm,[status(thm)],[28,29,theory(equality)])).
% cnf(107,plain,(sdtpldt0(sdtasdt0(xa,X1),sdtasdt0(xa,X2))=sdtasdt0(xa,sdtpldt0(X1,X2))|~aInteger0(X1)|~aInteger0(X2)),inference(spm,[status(thm)],[39,29,theory(equality)])).
% cnf(170,plain,(aInteger0(sdtasdt0(sz00,xa))),inference(spm,[status(thm)],[86,19,theory(equality)])).
% cnf(343,plain,(sdtpldt0(sz00,sdtasdt0(sz00,xa))=sdtasdt0(sz00,xa)),inference(spm,[status(thm)],[33,170,theory(equality)])).
% cnf(364,plain,(sdtpldt0(sdtpldt0(X1,X2),sdtasdt0(sz00,xa))=sdtpldt0(X1,sdtpldt0(X2,sdtasdt0(sz00,xa)))|~aInteger0(X2)|~aInteger0(X1)),inference(spm,[status(thm)],[54,170,theory(equality)])).
% cnf(458,plain,(sdtasdt0(sz00,xa)=sdtasdt0(xa,sz00)),inference(spm,[status(thm)],[95,19,theory(equality)])).
% cnf(564,negated_conjecture,(sdtasdt0(sz00,xa)!=sz00|sdtasdt0(sz00,xa)!=sz00),inference(rw,[status(thm)],[66,458,theory(equality)])).
% cnf(565,negated_conjecture,(sdtasdt0(sz00,xa)!=sz00),inference(cn,[status(thm)],[564,theory(equality)])).
% cnf(10053,plain,(sdtpldt0(sdtasdt0(xa,sz10),sdtasdt0(xa,X1))=sdtasdt0(xa,sdtpldt0(sz10,X1))|~aInteger0(X1)),inference(spm,[status(thm)],[107,45,theory(equality)])).
% cnf(10108,plain,(sdtpldt0(xa,sdtasdt0(xa,X1))=sdtasdt0(xa,sdtpldt0(sz10,X1))|~aInteger0(X1)),inference(rw,[status(thm)],[10053,71,theory(equality)])).
% cnf(12625,plain,(sdtpldt0(xa,sdtasdt0(xa,sz00))=sdtasdt0(xa,sdtpldt0(sz10,sz00))),inference(spm,[status(thm)],[10108,19,theory(equality)])).
% cnf(12629,plain,(sdtpldt0(xa,sdtasdt0(sz00,xa))=sdtasdt0(xa,sdtpldt0(sz10,sz00))),inference(rw,[status(thm)],[12625,458,theory(equality)])).
% cnf(12630,plain,(sdtpldt0(xa,sdtasdt0(sz00,xa))=xa),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12629,73,theory(equality)]),71,theory(equality)])).
% cnf(83289,plain,(sdtpldt0(sdtpldt0(X1,xa),sdtasdt0(sz00,xa))=sdtpldt0(X1,sdtpldt0(xa,sdtasdt0(sz00,xa)))|~aInteger0(X1)),inference(spm,[status(thm)],[364,29,theory(equality)])).
% cnf(83402,plain,(sdtpldt0(sdtpldt0(X1,xa),sdtasdt0(sz00,xa))=sdtpldt0(X1,xa)|~aInteger0(X1)),inference(rw,[status(thm)],[83289,12630,theory(equality)])).
% cnf(85259,plain,(sdtpldt0(sdtpldt0(smndt0(xa),xa),sdtasdt0(sz00,xa))=sdtpldt0(smndt0(xa),xa)),inference(spm,[status(thm)],[83402,68,theory(equality)])).
% cnf(85489,plain,(sdtasdt0(sz00,xa)=sdtpldt0(smndt0(xa),xa)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[85259,92,theory(equality)]),343,theory(equality)])).
% cnf(85490,plain,(sdtasdt0(sz00,xa)=sz00),inference(rw,[status(thm)],[85489,92,theory(equality)])).
% cnf(85491,plain,($false),inference(sr,[status(thm)],[85490,565,theory(equality)])).
% cnf(85492,plain,($false),85491,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1015
% # ...of these trivial : 75
% # ...subsumed : 106
% # ...remaining for further processing: 834
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 248
% # Generated clauses : 84547
% # ...of the previous two non-trivial : 84259
% # Contextual simplify-reflections : 0
% # Paramodulations : 84547
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 586
% # Positive orientable unit clauses: 358
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 227
% # Current number of unprocessed clauses: 57227
% # ...number of literals in the above : 66243
% # Clause-clause subsumption calls (NU) : 4443
% # Rec. Clause-clause subsumption calls : 4435
% # Unit Clause-clause subsumption calls : 127
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 907
% # Indexed BW rewrite successes : 80
% # Backwards rewriting index: 529 leaves, 1.97+/-2.590 terms/leaf
% # Paramod-from index: 164 leaves, 2.18+/-2.301 terms/leaf
% # Paramod-into index: 341 leaves, 1.81+/-1.731 terms/leaf
% # -------------------------------------------------
% # User time : 1.543 s
% # System time : 0.078 s
% # Total time : 1.621 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.85 CPU 3.26 WC
% FINAL PrfWatch: 2.85 CPU 3.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP30889/NUM421+1.tptp
%
%------------------------------------------------------------------------------