%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG061+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 22:19:03 EST 2010
% Result : Theorem 1.53s
% Output : Solution 1.53s
% 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/SystemOnTPTP21266/RNG061+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21266/RNG061+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21266/RNG061+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 21398
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(3, axiom,![X1]:(aScalar0(X1)=>aScalar0(smndt0(X1))),file('/tmp/SRASS.s.p', mNegSc)).
% fof(4, 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(31, axiom,(aScalar0(xR)&xR=sdtasdt0(xC,xG)),file('/tmp/SRASS.s.p', m__1892)).
% fof(33, axiom,(aScalar0(xS)&xS=sdtasdt0(xF,xD)),file('/tmp/SRASS.s.p', m__1930)).
% fof(37, 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(38, 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(71, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(72, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(74, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(75, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[74])).
% cnf(76,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(77, 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)],[4])).
% fof(78, 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)],[77])).
% fof(79, 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)],[78])).
% cnf(82,plain,(sdtpldt0(X3,X2)=sdtpldt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[79])).
% cnf(152,plain,(aScalar0(xR)),inference(split_conjunct,[status(thm)],[31])).
% cnf(156,plain,(aScalar0(xS)),inference(split_conjunct,[status(thm)],[33])).
% cnf(161,plain,(sdtasdt0(smndt0(xS),smndt0(xS))=sdtasdt0(xS,xS)),inference(split_conjunct,[status(thm)],[37])).
% cnf(163,plain,(sdtasdt0(xR,smndt0(xS))=smndt0(xN)),inference(split_conjunct,[status(thm)],[37])).
% cnf(164,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)],[38])).
% cnf(241,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(306,plain,(aScalar0(smndt0(xN))|~aScalar0(smndt0(xS))|~aScalar0(xR)),inference(spm,[status(thm)],[73,163,theory(equality)])).
% cnf(314,plain,(aScalar0(sdtasdt0(xS,xS))|~aScalar0(smndt0(xS))),inference(spm,[status(thm)],[73,161,theory(equality)])).
% cnf(323,plain,(aScalar0(smndt0(xN))|~aScalar0(smndt0(xS))|$false),inference(rw,[status(thm)],[306,152,theory(equality)])).
% cnf(324,plain,(aScalar0(smndt0(xN))|~aScalar0(smndt0(xS))),inference(cn,[status(thm)],[323,theory(equality)])).
% cnf(479,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)],[164,82,theory(equality)])).
% cnf(496,plain,(~aScalar0(smndt0(xN))|~aScalar0(sdtasdt0(xS,xS))|~aScalar0(X1)),inference(sr,[status(thm)],[479,241,theory(equality)])).
% cnf(4443,plain,(aScalar0(smndt0(xN))|~aScalar0(xS)),inference(spm,[status(thm)],[324,76,theory(equality)])).
% cnf(4444,plain,(aScalar0(smndt0(xN))|$false),inference(rw,[status(thm)],[4443,156,theory(equality)])).
% cnf(4445,plain,(aScalar0(smndt0(xN))),inference(cn,[status(thm)],[4444,theory(equality)])).
% cnf(4728,plain,(aScalar0(sdtasdt0(xS,xS))|~aScalar0(xS)),inference(spm,[status(thm)],[314,76,theory(equality)])).
% cnf(4729,plain,(aScalar0(sdtasdt0(xS,xS))|$false),inference(rw,[status(thm)],[4728,156,theory(equality)])).
% cnf(4730,plain,(aScalar0(sdtasdt0(xS,xS))),inference(cn,[status(thm)],[4729,theory(equality)])).
% cnf(15822,plain,($false|~aScalar0(sdtasdt0(xS,xS))|~aScalar0(X1)),inference(rw,[status(thm)],[496,4445,theory(equality)])).
% cnf(15823,plain,($false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[15822,4730,theory(equality)])).
% cnf(15824,plain,(~aScalar0(X1)),inference(cn,[status(thm)],[15823,theory(equality)])).
% cnf(15831,plain,($false),inference(sr,[status(thm)],[152,15824,theory(equality)])).
% cnf(15832,plain,($false),15831,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 737
% # ...of these trivial : 139
% # ...subsumed : 21
% # ...remaining for further processing: 577
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 341
% # Generated clauses : 5497
% # ...of the previous two non-trivial : 3795
% # Contextual simplify-reflections : 29
% # Paramodulations : 5455
% # Factorizations : 2
% # Equation resolutions : 14
% # Current number of processed clauses: 207
% # Positive orientable unit clauses: 125
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 79
% # Current number of unprocessed clauses: 2127
% # ...number of literals in the above : 7611
% # Clause-clause subsumption calls (NU) : 1729
% # Rec. Clause-clause subsumption calls : 1270
% # Unit Clause-clause subsumption calls : 89
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 356
% # Indexed BW rewrite successes : 84
% # Backwards rewriting index: 272 leaves, 1.17+/-0.772 terms/leaf
% # Paramod-from index: 175 leaves, 1.03+/-0.211 terms/leaf
% # Paramod-into index: 239 leaves, 1.10+/-0.580 terms/leaf
% # -------------------------------------------------
% # User time : 0.181 s
% # System time : 0.011 s
% # Total time : 0.192 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.46 CPU 0.54 WC
% FINAL PrfWatch: 0.46 CPU 0.54 WC
% SZS output end Solution for /tmp/SystemOnTPTP21266/RNG061+1.tptp
%
%------------------------------------------------------------------------------