%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM474+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:25:32 EST 2010
% Result : Theorem 1.26s
% Output : Solution 1.26s
% 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/SystemOnTPTP27056/NUM474+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27056/NUM474+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27056/NUM474+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 27152
% 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(10, axiom,![X1]:![X2]:![X3]:(((aNaturalNumber0(X1)&aNaturalNumber0(X2))&aNaturalNumber0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),file('/tmp/SRASS.s.p', mAMDistr)).
% 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(41, conjecture,sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))=sdtpldt0(sdtasdt0(xl,xp),xn),file('/tmp/SRASS.s.p', m__)).
% fof(42, negated_conjecture,~(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))=sdtpldt0(sdtasdt0(xl,xp),xn)),inference(assume_negation,[status(cth)],[41])).
% fof(45, negated_conjecture,~(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))=sdtpldt0(sdtasdt0(xl,xp),xn)),inference(fof_simplification,[status(thm)],[42,theory(equality)])).
% fof(75, plain,![X1]:![X2]:![X3]:(((~(aNaturalNumber0(X1))|~(aNaturalNumber0(X2)))|~(aNaturalNumber0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X2,X3),X1)=sdtpldt0(sdtasdt0(X2,X1),sdtasdt0(X3,X1)))),inference(fof_nnf,[status(thm)],[10])).
% fof(76, plain,![X4]:![X5]:![X6]:(((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))&(sdtasdt0(sdtpldt0(X5,X6),X4)=sdtpldt0(sdtasdt0(X5,X4),sdtasdt0(X6,X4))|((~(aNaturalNumber0(X4))|~(aNaturalNumber0(X5)))|~(aNaturalNumber0(X6))))),inference(distribute,[status(thm)],[76])).
% cnf(79,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aNaturalNumber0(X1)|~aNaturalNumber0(X2)|~aNaturalNumber0(X3)),inference(split_conjunct,[status(thm)],[77])).
% cnf(169,plain,(aNaturalNumber0(xl)),inference(split_conjunct,[status(thm)],[28])).
% cnf(180,plain,(xm=sdtasdt0(xl,xp)),inference(split_conjunct,[status(thm)],[31])).
% cnf(181,plain,(aNaturalNumber0(xp)),inference(split_conjunct,[status(thm)],[31])).
% cnf(183,plain,(sdtpldt0(xm,xn)=sdtasdt0(xl,xq)),inference(split_conjunct,[status(thm)],[32])).
% cnf(191,plain,(sdtpldt0(xp,xr)=xq),inference(split_conjunct,[status(thm)],[34])).
% cnf(192,plain,(aNaturalNumber0(xr)),inference(split_conjunct,[status(thm)],[34])).
% cnf(212,negated_conjecture,(sdtpldt0(sdtasdt0(xl,xp),sdtasdt0(xl,xr))!=sdtpldt0(sdtasdt0(xl,xp),xn)),inference(split_conjunct,[status(thm)],[45])).
% cnf(213,negated_conjecture,(sdtpldt0(xm,sdtasdt0(xl,xr))!=sdtpldt0(sdtasdt0(xl,xp),xn)),inference(rw,[status(thm)],[212,180,theory(equality)])).
% cnf(214,negated_conjecture,(sdtpldt0(xm,sdtasdt0(xl,xr))!=sdtpldt0(xm,xn)),inference(rw,[status(thm)],[213,180,theory(equality)])).
% cnf(799,plain,(sdtpldt0(xm,sdtasdt0(xl,X1))=sdtasdt0(xl,sdtpldt0(xp,X1))|~aNaturalNumber0(xl)|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(spm,[status(thm)],[79,180,theory(equality)])).
% cnf(831,plain,(sdtpldt0(xm,sdtasdt0(xl,X1))=sdtasdt0(xl,sdtpldt0(xp,X1))|$false|~aNaturalNumber0(xp)|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[799,169,theory(equality)])).
% cnf(832,plain,(sdtpldt0(xm,sdtasdt0(xl,X1))=sdtasdt0(xl,sdtpldt0(xp,X1))|$false|$false|~aNaturalNumber0(X1)),inference(rw,[status(thm)],[831,181,theory(equality)])).
% cnf(833,plain,(sdtpldt0(xm,sdtasdt0(xl,X1))=sdtasdt0(xl,sdtpldt0(xp,X1))|~aNaturalNumber0(X1)),inference(cn,[status(thm)],[832,theory(equality)])).
% cnf(1056,negated_conjecture,(sdtpldt0(xm,sdtasdt0(xl,xr))!=sdtasdt0(xl,xq)),inference(rw,[status(thm)],[214,183,theory(equality)])).
% cnf(5171,negated_conjecture,(sdtasdt0(xl,sdtpldt0(xp,xr))!=sdtasdt0(xl,xq)|~aNaturalNumber0(xr)),inference(spm,[status(thm)],[1056,833,theory(equality)])).
% cnf(5216,negated_conjecture,($false|~aNaturalNumber0(xr)),inference(rw,[status(thm)],[5171,191,theory(equality)])).
% cnf(5217,negated_conjecture,($false|$false),inference(rw,[status(thm)],[5216,192,theory(equality)])).
% cnf(5218,negated_conjecture,($false),inference(cn,[status(thm)],[5217,theory(equality)])).
% cnf(5219,negated_conjecture,($false),5218,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 591
% # ...of these trivial : 18
% # ...subsumed : 273
% # ...remaining for further processing: 300
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 33
% # Generated clauses : 1646
% # ...of the previous two non-trivial : 1445
% # Contextual simplify-reflections : 13
% # Paramodulations : 1609
% # Factorizations : 2
% # Equation resolutions : 35
% # Current number of processed clauses: 265
% # Positive orientable unit clauses: 62
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 200
% # Current number of unprocessed clauses: 797
% # ...number of literals in the above : 3305
% # Clause-clause subsumption calls (NU) : 2733
% # Rec. Clause-clause subsumption calls : 2465
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 185 leaves, 1.22+/-0.740 terms/leaf
% # Paramod-from index: 98 leaves, 1.13+/-0.420 terms/leaf
% # Paramod-into index: 160 leaves, 1.17+/-0.682 terms/leaf
% # -------------------------------------------------
% # User time : 0.096 s
% # System time : 0.009 s
% # Total time : 0.105 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.29 CPU 0.37 WC
% FINAL PrfWatch: 0.29 CPU 0.37 WC
% SZS output end Solution for /tmp/SystemOnTPTP27056/NUM474+2.tptp
%
%------------------------------------------------------------------------------