%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG061+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 : art02.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 22:14:24 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP22893/RNG061+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22893/RNG061+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22893/RNG061+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 22989
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(8, axiom,![X1]:(aScalar0(X1)=>aScalar0(smndt0(X1))),file('/tmp/SRASS.s.p', mNegSc)).
% fof(9, axiom,![X1]:![X2]:![X3]:(((aScalar0(X1)&aScalar0(X2))&aScalar0(X3))=>(((sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))&sdtpldt0(X1,X2)=sdtpldt0(X2,X1))&sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3)))&sdtasdt0(X1,X2)=sdtasdt0(X2,X1))),file('/tmp/SRASS.s.p', mArith)).
% fof(39, axiom,(aScalar0(xR)&xR=sdtasdt0(xC,xG)),file('/tmp/SRASS.s.p', m__1892)).
% fof(41, axiom,(aScalar0(xS)&xS=sdtasdt0(xF,xD)),file('/tmp/SRASS.s.p', m__1930)).
% fof(45, axiom,((sdtasdt0(xR,smndt0(xS))=smndt0(xN)&sdtasdt0(smndt0(xS),xR)=smndt0(xN))&sdtasdt0(smndt0(xS),smndt0(xS))=sdtasdt0(xS,xS)),file('/tmp/SRASS.s.p', m__2144)).
% fof(46, axiom,sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS))),file('/tmp/SRASS.s.p', m__2180)).
% fof(60, conjecture,sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN))),file('/tmp/SRASS.s.p', m__)).
% fof(61, negated_conjecture,~(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))),inference(assume_negation,[status(cth)],[60])).
% fof(67, negated_conjecture,~(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))),inference(fof_simplification,[status(thm)],[61,theory(equality)])).
% fof(89, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(90, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[89])).
% cnf(91,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(92, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(93, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[93])).
% fof(95, plain,![X1]:![X2]:![X3]:(((~(aScalar0(X1))|~(aScalar0(X2)))|~(aScalar0(X3)))|(((sdtpldt0(sdtpldt0(X1,X2),X3)=sdtpldt0(X1,sdtpldt0(X2,X3))&sdtpldt0(X1,X2)=sdtpldt0(X2,X1))&sdtasdt0(sdtasdt0(X1,X2),X3)=sdtasdt0(X1,sdtasdt0(X2,X3)))&sdtasdt0(X1,X2)=sdtasdt0(X2,X1))),inference(fof_nnf,[status(thm)],[9])).
% fof(96, plain,![X4]:![X5]:![X6]:(((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))|(((sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))&sdtpldt0(X4,X5)=sdtpldt0(X5,X4))&sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6)))&sdtasdt0(X4,X5)=sdtasdt0(X5,X4))),inference(variable_rename,[status(thm)],[95])).
% fof(97, plain,![X4]:![X5]:![X6]:((((sdtpldt0(sdtpldt0(X4,X5),X6)=sdtpldt0(X4,sdtpldt0(X5,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))&(sdtpldt0(X4,X5)=sdtpldt0(X5,X4)|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))))&(sdtasdt0(sdtasdt0(X4,X5),X6)=sdtasdt0(X4,sdtasdt0(X5,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))))&(sdtasdt0(X4,X5)=sdtasdt0(X5,X4)|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))),inference(distribute,[status(thm)],[96])).
% cnf(100,plain,(sdtpldt0(X3,X2)=sdtpldt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[97])).
% cnf(196,plain,(aScalar0(xR)),inference(split_conjunct,[status(thm)],[39])).
% cnf(200,plain,(aScalar0(xS)),inference(split_conjunct,[status(thm)],[41])).
% cnf(205,plain,(sdtasdt0(smndt0(xS),smndt0(xS))=sdtasdt0(xS,xS)),inference(split_conjunct,[status(thm)],[45])).
% cnf(207,plain,(sdtasdt0(xR,smndt0(xS))=smndt0(xN)),inference(split_conjunct,[status(thm)],[45])).
% cnf(208,plain,(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(smndt0(xN),sdtasdt0(xS,xS)))),inference(split_conjunct,[status(thm)],[46])).
% cnf(251,negated_conjecture,(sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))!=sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))),inference(split_conjunct,[status(thm)],[67])).
% cnf(323,plain,(aScalar0(smndt0(xN))|~aScalar0(smndt0(xS))|~aScalar0(xR)),inference(spm,[status(thm)],[91,207,theory(equality)])).
% cnf(331,plain,(aScalar0(sdtasdt0(xS,xS))|~aScalar0(smndt0(xS))),inference(spm,[status(thm)],[91,205,theory(equality)])).
% cnf(340,plain,(aScalar0(smndt0(xN))|~aScalar0(smndt0(xS))|$false),inference(rw,[status(thm)],[323,196,theory(equality)])).
% cnf(341,plain,(aScalar0(smndt0(xN))|~aScalar0(smndt0(xS))),inference(cn,[status(thm)],[340,theory(equality)])).
% cnf(506,plain,(sdtpldt0(sdtpldt0(sdtasdt0(xR,xR),smndt0(xN)),sdtpldt0(sdtasdt0(xS,xS),smndt0(xN)))=sdtasdt0(sdtpldt0(xR,smndt0(xS)),sdtpldt0(xR,smndt0(xS)))|~aScalar0(smndt0(xN))|~aScalar0(sdtasdt0(xS,xS))|~aScalar0(X1)),inference(spm,[status(thm)],[208,100,theory(equality)])).
% cnf(523,plain,(~aScalar0(smndt0(xN))|~aScalar0(sdtasdt0(xS,xS))|~aScalar0(X1)),inference(sr,[status(thm)],[506,251,theory(equality)])).
% cnf(5233,plain,(aScalar0(smndt0(xN))|~aScalar0(xS)),inference(spm,[status(thm)],[341,94,theory(equality)])).
% cnf(5234,plain,(aScalar0(smndt0(xN))|$false),inference(rw,[status(thm)],[5233,200,theory(equality)])).
% cnf(5235,plain,(aScalar0(smndt0(xN))),inference(cn,[status(thm)],[5234,theory(equality)])).
% cnf(5518,plain,(aScalar0(sdtasdt0(xS,xS))|~aScalar0(xS)),inference(spm,[status(thm)],[331,94,theory(equality)])).
% cnf(5519,plain,(aScalar0(sdtasdt0(xS,xS))|$false),inference(rw,[status(thm)],[5518,200,theory(equality)])).
% cnf(5520,plain,(aScalar0(sdtasdt0(xS,xS))),inference(cn,[status(thm)],[5519,theory(equality)])).
% cnf(17953,plain,($false|~aScalar0(sdtasdt0(xS,xS))|~aScalar0(X1)),inference(rw,[status(thm)],[523,5235,theory(equality)])).
% cnf(17954,plain,($false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[17953,5520,theory(equality)])).
% cnf(17955,plain,(~aScalar0(X1)),inference(cn,[status(thm)],[17954,theory(equality)])).
% cnf(17964,plain,($false),inference(sr,[status(thm)],[196,17955,theory(equality)])).
% cnf(17965,plain,($false),17964,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 858
% # ...of these trivial : 171
% # ...subsumed : 25
% # ...remaining for further processing: 662
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 406
% # Generated clauses : 6231
% # ...of the previous two non-trivial : 4265
% # Contextual simplify-reflections : 29
% # Paramodulations : 6189
% # Factorizations : 2
% # Equation resolutions : 14
% # Current number of processed clauses: 227
% # Positive orientable unit clauses: 136
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 88
% # Current number of unprocessed clauses: 2303
% # ...number of literals in the above : 8146
% # Clause-clause subsumption calls (NU) : 1947
% # Rec. Clause-clause subsumption calls : 1488
% # Unit Clause-clause subsumption calls : 90
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 447
% # Indexed BW rewrite successes : 102
% # Backwards rewriting index: 298 leaves, 1.16+/-0.742 terms/leaf
% # Paramod-from index: 189 leaves, 1.04+/-0.226 terms/leaf
% # Paramod-into index: 262 leaves, 1.10+/-0.560 terms/leaf
% # -------------------------------------------------
% # User time : 0.221 s
% # System time : 0.011 s
% # Total time : 0.232 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.52 CPU 0.60 WC
% FINAL PrfWatch: 0.52 CPU 0.60 WC
% SZS output end Solution for /tmp/SystemOnTPTP22893/RNG061+2.tptp
%
%------------------------------------------------------------------------------