TSTP Solution File: RNG059+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG059+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 : art05.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:13:40 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP22554/RNG059+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22554/RNG059+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22554/RNG059+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 22650
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>aScalar0(sdtasdt0(X1,X2))),file('/tmp/SRASS.s.p', mMulSc)).
% fof(2, axiom,![X1]:(aScalar0(X1)=>aScalar0(smndt0(X1))),file('/tmp/SRASS.s.p', mNegSc)).
% fof(3, axiom,![X1]:![X2]:((aScalar0(X1)&aScalar0(X2))=>(sdtasdt0(X1,smndt0(X2))=smndt0(sdtasdt0(X1,X2))&sdtasdt0(smndt0(X1),X2)=smndt0(sdtasdt0(X1,X2)))),file('/tmp/SRASS.s.p', mMNeg)).
% fof(20, axiom,(aScalar0(xD)&xD=sdtasasdt0(xq,xq)),file('/tmp/SRASS.s.p', m__1800)).
% fof(22, axiom,(aScalar0(xF)&xF=sdtasdt0(xA,xA)),file('/tmp/SRASS.s.p', m__1837)).
% fof(25, axiom,(aScalar0(xR)&xR=sdtasdt0(xC,xG)),file('/tmp/SRASS.s.p', m__1892)).
% fof(27, axiom,(aScalar0(xS)&xS=sdtasdt0(xF,xD)),file('/tmp/SRASS.s.p', m__1930)).
% fof(28, axiom,(aScalar0(xN)&xN=sdtasdt0(xR,xS)),file('/tmp/SRASS.s.p', m__1949)).
% fof(40, 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(58, conjecture,sdtasdt0(smndt0(xS),xR)=smndt0(xN),file('/tmp/SRASS.s.p', m__)).
% fof(59, negated_conjecture,~(sdtasdt0(smndt0(xS),xR)=smndt0(xN)),inference(assume_negation,[status(cth)],[58])).
% fof(65, negated_conjecture,~(sdtasdt0(smndt0(xS),xR)=smndt0(xN)),inference(fof_simplification,[status(thm)],[59,theory(equality)])).
% fof(66, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(67, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[67])).
% fof(69, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(70, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(72, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|(sdtasdt0(X1,smndt0(X2))=smndt0(sdtasdt0(X1,X2))&sdtasdt0(smndt0(X1),X2)=smndt0(sdtasdt0(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(73, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|(sdtasdt0(X3,smndt0(X4))=smndt0(sdtasdt0(X3,X4))&sdtasdt0(smndt0(X3),X4)=smndt0(sdtasdt0(X3,X4)))),inference(variable_rename,[status(thm)],[72])).
% fof(74, plain,![X3]:![X4]:((sdtasdt0(X3,smndt0(X4))=smndt0(sdtasdt0(X3,X4))|(~(aScalar0(X3))|~(aScalar0(X4))))&(sdtasdt0(smndt0(X3),X4)=smndt0(sdtasdt0(X3,X4))|(~(aScalar0(X3))|~(aScalar0(X4))))),inference(distribute,[status(thm)],[73])).
% cnf(76,plain,(sdtasdt0(X2,smndt0(X1))=smndt0(sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[74])).
% cnf(116,plain,(aScalar0(xD)),inference(split_conjunct,[status(thm)],[20])).
% cnf(120,plain,(aScalar0(xF)),inference(split_conjunct,[status(thm)],[22])).
% cnf(126,plain,(aScalar0(xR)),inference(split_conjunct,[status(thm)],[25])).
% cnf(129,plain,(xS=sdtasdt0(xF,xD)),inference(split_conjunct,[status(thm)],[27])).
% cnf(130,plain,(aScalar0(xS)),inference(split_conjunct,[status(thm)],[27])).
% cnf(131,plain,(xN=sdtasdt0(xR,xS)),inference(split_conjunct,[status(thm)],[28])).
% fof(169, 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)],[40])).
% fof(170, 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)],[169])).
% fof(171, 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)],[170])).
% cnf(172,plain,(sdtasdt0(X3,X2)=sdtasdt0(X2,X3)|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[171])).
% cnf(235,negated_conjecture,(sdtasdt0(smndt0(xS),xR)!=smndt0(xN)),inference(split_conjunct,[status(thm)],[65])).
% cnf(346,plain,(aScalar0(sdtasdt0(X1,smndt0(X2)))|~aScalar0(sdtasdt0(X1,X2))|~aScalar0(X1)|~aScalar0(X2)),inference(spm,[status(thm)],[71,76,theory(equality)])).
% cnf(353,plain,(smndt0(xN)=sdtasdt0(xR,smndt0(xS))|~aScalar0(xR)|~aScalar0(xS)),inference(spm,[status(thm)],[76,131,theory(equality)])).
% cnf(354,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))|~aScalar0(xF)|~aScalar0(xD)),inference(spm,[status(thm)],[76,129,theory(equality)])).
% cnf(364,plain,(smndt0(xN)=sdtasdt0(xR,smndt0(xS))|$false|~aScalar0(xS)),inference(rw,[status(thm)],[353,126,theory(equality)])).
% cnf(365,plain,(smndt0(xN)=sdtasdt0(xR,smndt0(xS))|$false|$false),inference(rw,[status(thm)],[364,130,theory(equality)])).
% cnf(366,plain,(smndt0(xN)=sdtasdt0(xR,smndt0(xS))),inference(cn,[status(thm)],[365,theory(equality)])).
% cnf(367,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))|$false|~aScalar0(xD)),inference(rw,[status(thm)],[354,120,theory(equality)])).
% cnf(368,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))|$false|$false),inference(rw,[status(thm)],[367,116,theory(equality)])).
% cnf(369,plain,(smndt0(xS)=sdtasdt0(xF,smndt0(xD))),inference(cn,[status(thm)],[368,theory(equality)])).
% cnf(454,negated_conjecture,(sdtasdt0(xR,smndt0(xS))!=smndt0(xN)|~aScalar0(smndt0(xS))|~aScalar0(xR)|~aScalar0(X1)),inference(spm,[status(thm)],[235,172,theory(equality)])).
% cnf(495,negated_conjecture,(sdtasdt0(xR,smndt0(xS))!=smndt0(xN)|~aScalar0(smndt0(xS))|$false|~aScalar0(X1)),inference(rw,[status(thm)],[454,126,theory(equality)])).
% cnf(496,negated_conjecture,(sdtasdt0(xR,smndt0(xS))!=smndt0(xN)|~aScalar0(smndt0(xS))|~aScalar0(X1)),inference(cn,[status(thm)],[495,theory(equality)])).
% cnf(4990,plain,(aScalar0(sdtasdt0(X1,smndt0(X2)))|~aScalar0(X1)|~aScalar0(X2)),inference(csr,[status(thm)],[346,68])).
% cnf(5011,plain,(aScalar0(smndt0(xS))|~aScalar0(xF)|~aScalar0(xD)),inference(spm,[status(thm)],[4990,369,theory(equality)])).
% cnf(5076,plain,(aScalar0(smndt0(xS))|$false|~aScalar0(xD)),inference(rw,[status(thm)],[5011,120,theory(equality)])).
% cnf(5077,plain,(aScalar0(smndt0(xS))|$false|$false),inference(rw,[status(thm)],[5076,116,theory(equality)])).
% cnf(5078,plain,(aScalar0(smndt0(xS))),inference(cn,[status(thm)],[5077,theory(equality)])).
% cnf(6283,negated_conjecture,($false|~aScalar0(smndt0(xS))|~aScalar0(X1)),inference(rw,[status(thm)],[496,366,theory(equality)])).
% cnf(6284,negated_conjecture,($false|$false|~aScalar0(X1)),inference(rw,[status(thm)],[6283,5078,theory(equality)])).
% cnf(6285,negated_conjecture,(~aScalar0(X1)),inference(cn,[status(thm)],[6284,theory(equality)])).
% cnf(6291,plain,($false),inference(sr,[status(thm)],[126,6285,theory(equality)])).
% cnf(6292,plain,($false),6291,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 401
% # ...of these trivial : 18
% # ...subsumed : 11
% # ...remaining for further processing: 372
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 227
% # Generated clauses : 2410
% # ...of the previous two non-trivial : 1511
% # Contextual simplify-reflections : 13
% # Paramodulations : 2376
% # Factorizations : 2
% # Equation resolutions : 12
% # Current number of processed clauses: 121
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 740
% # ...number of literals in the above : 2733
% # Clause-clause subsumption calls (NU) : 1130
% # Rec. Clause-clause subsumption calls : 973
% # Unit Clause-clause subsumption calls : 40
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 174
% # Indexed BW rewrite successes : 43
% # Backwards rewriting index: 163 leaves, 1.25+/-0.966 terms/leaf
% # Paramod-from index: 93 leaves, 1.05+/-0.269 terms/leaf
% # Paramod-into index: 140 leaves, 1.15+/-0.736 terms/leaf
% # -------------------------------------------------
% # User time : 0.100 s
% # System time : 0.006 s
% # Total time : 0.106 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.34 WC
% FINAL PrfWatch: 0.26 CPU 0.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP22554/RNG059+1.tptp
%
%------------------------------------------------------------------------------