TSTP Solution File: NUM475+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM475+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 19:26:07 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP27577/NUM475+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27577/NUM475+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27577/NUM475+2.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 27673
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:((aNaturalNumber0(X1)&aNaturalNumber0(X2))=>aNaturalNumber0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mSortsB_02)).
% fof(11, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>((sdtpldt0(X1,X2)=sdtpldt0(X1,X3)|sdtpldt0(X2,X1)=sdtpldt0(X3,X1))=>X2=X3)),file('/tmp/SRASS.s.p', mAddCanc)).
% fof(28, axiom,((aNaturalNumber0(xl)&aNaturalNumber0(xm))&aNaturalNumber0(xn)),file('/tmp/SRASS.s.p', m__1324)).
% fof(31, axiom,((aNaturalNumber0(xp)&xm=sdtasdt0(xl,xp))&xp=sdtsldt0(xm,xl)),file('/tmp/SRASS.s.p', m__1360)).
% fof(32, axiom,((aNaturalNumber0(xq)&sdtpldt0(xm,xn)=sdtasdt0(xl,xq))&xq=sdtsldt0(sdtpldt0(xm,xn),xl)),file('/tmp/SRASS.s.p', m__1379)).
% fof(34, axiom,((aNaturalNumber0(xr)&sdtpldt0(xp,xr)=xq)&xr=sdtmndt0(xq,xp)),file('/tmp/SRASS.s.p', m__1422)).
% fof(35, axiom,sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))=sdtpldt0(sdtasdt0(xl,xp),xn),file('/tmp/SRASS.s.p', m__1459)).
% fof(42, conjecture,xn=sdtasdt0(xl,xr),file('/tmp/SRASS.s.p', m__)).
% fof(43, negated_conjecture,~(xn=sdtasdt0(xl,xr)),inference(assume_negation,[status(cth)],[42])).
% fof(46, negated_conjecture,~(xn=sdtasdt0(xl,xr)),inference(fof_simplification,[status(thm)],[43,theory(equality)])).
% fof(51, plain,![X1]:![X2]:((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|aNaturalNumber0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(52, plain,![X3]:![X4]:((~(aNaturalNumber0(X3))|~(aNaturalNumber0(X4)))|aNaturalNumber0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(aNaturalNumber0(sdtasdt0(X1,X2))|~aNaturalNumber0(X2)|~aNaturalNumber0(X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(81, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|((~(sdtpldt0(X1,X2)=sdtpldt0(X1,X3))&~(sdtpldt0(X2,X1)=sdtpldt0(X3,X1)))|X2=X3)),inference(fof_nnf,[status(thm)],[11])).
% fof(82, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|((~(sdtpldt0(X4,X5)=sdtpldt0(X4,X6))&~(sdtpldt0(X5,X4)=sdtpldt0(X6,X4)))|X5=X6)),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X4]:![X5]:![X6]:(((~(sdtpldt0(X4,X5)=sdtpldt0(X4,X6))|X5=X6)|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))&((~(sdtpldt0(X5,X4)=sdtpldt0(X6,X4))|X5=X6)|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))),inference(distribute,[status(thm)],[82])).
% cnf(85,plain,(X2=X1|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)|sdtpldt0(X3,X2)!=sdtpldt0(X3,X1)),inference(split_conjunct,[status(thm)],[83])).
% cnf(168,plain,(aNaturalNumber0(xn)),inference(split_conjunct,[status(thm)],[28])).
% cnf(169,plain,(aNaturalNumber0(xm)),inference(split_conjunct,[status(thm)],[28])).
% cnf(170,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[28])).
% cnf(181,plain,(xm=sdtasdt0(xl,xp)),inference(split_conjunct,[status(thm)],[31])).
% cnf(184,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,xq)),inference(split_conjunct,[status(thm)],[32])).
% cnf(193,plain,(aNaturalNumber0(xr)),inference(split_conjunct,[status(thm)],[34])).
% cnf(194,plain,(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))=sdtpldt0(sdtasdt0(xl,xp),xn)),inference(split_conjunct,[status(thm)],[35])).
% cnf(214,negated_conjecture,(xn!=sdtasdt0(xl,xr)),inference(split_conjunct,[status(thm)],[46])).
% cnf(218,plain,(sdtpldt0(xm,sdtasdt0(xl,xr))=sdtpldt0(sdtasdt0(xl,xp),xn)),inference(rw,[status(thm)],[194,181,theory(equality)])).
% cnf(219,plain,(sdtpldt0(xm,sdtasdt0(xl,xr))=sdtasdt0(xl,xq)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[218,181,theory(equality)]),184,theory(equality)])).
% cnf(439,plain,(X1=xn|sdtpldt0(xm,X1)!=sdtasdt0(xl,xq)|~aNaturalNumber0(xm)|~aNaturalNumber0(xn)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[85,184,theory(equality)])).
% cnf(459,plain,(X1=xn|sdtpldt0(xm,X1)!=sdtasdt0(xl,xq)|$false|~aNaturalNumber0(xn)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[439,169,theory(equality)])).
% cnf(460,plain,(X1=xn|sdtpldt0(xm,X1)!=sdtasdt0(xl,xq)|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[459,168,theory(equality)])).
% cnf(461,plain,(X1=xn|sdtpldt0(xm,X1)!=sdtasdt0(xl,xq)|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[460,theory(equality)])).
% cnf(1601,plain,(sdtasdt0(xl,xr)=xn|~aNaturalNumber0(sdtasdt0(xl,xr))),inference(spm,[status(thm)],[461,219,theory(equality)])).
% cnf(1609,plain,(~aNaturalNumber0(sdtasdt0(xl,xr))),inference(sr,[status(thm)],[1601,214,theory(equality)])).
% cnf(1610,plain,(~aNaturalNumber0(xr)|~aNaturalNumber0(xl)),inference(spm,[status(thm)],[1609,53,theory(equality)])).
% cnf(1611,plain,($false|~aNaturalNumber0(xl)),inference(rw,[status(thm)],[1610,193,theory(equality)])).
% cnf(1612,plain,($false|$false),inference(rw,[status(thm)],[1611,170,theory(equality)])).
% cnf(1613,plain,($false),inference(cn,[status(thm)],[1612,theory(equality)])).
% cnf(1614,plain,($false),1613,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 181
% # ...of these trivial : 2
% # ...subsumed : 46
% # ...remaining for further processing: 133
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 21
% # Generated clauses : 493
% # ...of the previous two non-trivial : 462
% # Contextual simplify-reflections : 8
% # Paramodulations : 464
% # Factorizations : 2
% # Equation resolutions : 27
% # Current number of processed clauses: 111
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 83
% # Current number of unprocessed clauses: 285
% # ...number of literals in the above : 1306
% # Clause-clause subsumption calls (NU) : 370
% # Rec. Clause-clause subsumption calls : 212
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 91 leaves, 1.26+/-0.912 terms/leaf
% # Paramod-from index: 49 leaves, 1.10+/-0.364 terms/leaf
% # Paramod-into index: 75 leaves, 1.23+/-0.903 terms/leaf
% # -------------------------------------------------
% # User time : 0.040 s
% # System time : 0.004 s
% # Total time : 0.044 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.27 WC
% FINAL PrfWatch: 0.17 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP27577/NUM475+2.tptp
%
%------------------------------------------------------------------------------