TSTP Solution File: RNG046+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG046+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 : art04.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:05:17 EST 2010
% Result : Theorem 3.63s
% Output : Solution 3.63s
% 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/SystemOnTPTP14110/RNG046+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14110/RNG046+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14110/RNG046+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 14206
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.91 CPU 2.01 WC
% # 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(4, axiom,(aScalar0(xx)&aScalar0(xy)),file('/tmp/SRASS.s.p', m__799)).
% fof(8, axiom,![X1]:(aScalar0(X1)=>(((((((sdtpldt0(X1,sz0z00)=X1&sdtpldt0(sz0z00,X1)=X1)&sdtasdt0(X1,sz0z00)=sz0z00)&sdtasdt0(sz0z00,X1)=sz0z00)&sdtpldt0(X1,smndt0(X1))=sz0z00)&sdtpldt0(smndt0(X1),X1)=sz0z00)&smndt0(smndt0(X1))=X1)&smndt0(sz0z00)=sz0z00)),file('/tmp/SRASS.s.p', mScZero)).
% fof(19, conjecture,sdtasdt0(smndt0(xx),smndt0(xy))=sdtasdt0(xx,xy),file('/tmp/SRASS.s.p', m__)).
% fof(20, negated_conjecture,~(sdtasdt0(smndt0(xx),smndt0(xy))=sdtasdt0(xx,xy)),inference(assume_negation,[status(cth)],[19])).
% fof(24, negated_conjecture,~(sdtasdt0(smndt0(xx),smndt0(xy))=sdtasdt0(xx,xy)),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(25, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtasdt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(26, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtasdt0(X3,X4))),inference(variable_rename,[status(thm)],[25])).
% cnf(27,plain,(aScalar0(sdtasdt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X1]:(~(aScalar0(X1))|aScalar0(smndt0(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(29, plain,![X2]:(~(aScalar0(X2))|aScalar0(smndt0(X2))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(aScalar0(smndt0(X1))|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, 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(32, 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)],[31])).
% fof(33, 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)],[32])).
% cnf(34,plain,(sdtasdt0(smndt0(X2),X1)=smndt0(sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(sdtasdt0(X2,smndt0(X1))=smndt0(sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,plain,(aScalar0(xy)),inference(split_conjunct,[status(thm)],[4])).
% cnf(37,plain,(aScalar0(xx)),inference(split_conjunct,[status(thm)],[4])).
% fof(53, plain,![X1]:(~(aScalar0(X1))|(((((((sdtpldt0(X1,sz0z00)=X1&sdtpldt0(sz0z00,X1)=X1)&sdtasdt0(X1,sz0z00)=sz0z00)&sdtasdt0(sz0z00,X1)=sz0z00)&sdtpldt0(X1,smndt0(X1))=sz0z00)&sdtpldt0(smndt0(X1),X1)=sz0z00)&smndt0(smndt0(X1))=X1)&smndt0(sz0z00)=sz0z00)),inference(fof_nnf,[status(thm)],[8])).
% fof(54, plain,![X2]:(~(aScalar0(X2))|(((((((sdtpldt0(X2,sz0z00)=X2&sdtpldt0(sz0z00,X2)=X2)&sdtasdt0(X2,sz0z00)=sz0z00)&sdtasdt0(sz0z00,X2)=sz0z00)&sdtpldt0(X2,smndt0(X2))=sz0z00)&sdtpldt0(smndt0(X2),X2)=sz0z00)&smndt0(smndt0(X2))=X2)&smndt0(sz0z00)=sz0z00)),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X2]:((((((((sdtpldt0(X2,sz0z00)=X2|~(aScalar0(X2)))&(sdtpldt0(sz0z00,X2)=X2|~(aScalar0(X2))))&(sdtasdt0(X2,sz0z00)=sz0z00|~(aScalar0(X2))))&(sdtasdt0(sz0z00,X2)=sz0z00|~(aScalar0(X2))))&(sdtpldt0(X2,smndt0(X2))=sz0z00|~(aScalar0(X2))))&(sdtpldt0(smndt0(X2),X2)=sz0z00|~(aScalar0(X2))))&(smndt0(smndt0(X2))=X2|~(aScalar0(X2))))&(smndt0(sz0z00)=sz0z00|~(aScalar0(X2)))),inference(distribute,[status(thm)],[54])).
% cnf(57,plain,(smndt0(smndt0(X1))=X1|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[55])).
% cnf(92,negated_conjecture,(sdtasdt0(smndt0(xx),smndt0(xy))!=sdtasdt0(xx,xy)),inference(split_conjunct,[status(thm)],[24])).
% cnf(160,plain,(smndt0(sdtasdt0(smndt0(X1),X2))=sdtasdt0(X1,X2)|~aScalar0(sdtasdt0(X1,X2))|~aScalar0(X1)|~aScalar0(X2)),inference(spm,[status(thm)],[57,34,theory(equality)])).
% cnf(163,plain,(sdtasdt0(smndt0(X1),X2)=sdtasdt0(X1,smndt0(X2))|~aScalar0(X1)|~aScalar0(X2)),inference(spm,[status(thm)],[35,34,theory(equality)])).
% cnf(990,plain,(smndt0(sdtasdt0(smndt0(X1),X2))=sdtasdt0(smndt0(X1),smndt0(X2))|~aScalar0(X1)|~aScalar0(smndt0(X2))|~aScalar0(X2)),inference(spm,[status(thm)],[34,163,theory(equality)])).
% cnf(1843,plain,(smndt0(sdtasdt0(smndt0(X1),X2))=sdtasdt0(X1,X2)|~aScalar0(X1)|~aScalar0(X2)),inference(csr,[status(thm)],[160,27])).
% cnf(82235,plain,(smndt0(sdtasdt0(smndt0(X1),X2))=sdtasdt0(smndt0(X1),smndt0(X2))|~aScalar0(X2)|~aScalar0(X1)),inference(csr,[status(thm)],[990,30])).
% cnf(82324,plain,(sdtasdt0(smndt0(X1),smndt0(X2))=sdtasdt0(X1,X2)|~aScalar0(X1)|~aScalar0(X2)),inference(spm,[status(thm)],[1843,82235,theory(equality)])).
% cnf(92819,negated_conjecture,(~aScalar0(xx)|~aScalar0(xy)),inference(spm,[status(thm)],[92,82324,theory(equality)])).
% cnf(92917,negated_conjecture,($false|~aScalar0(xy)),inference(rw,[status(thm)],[92819,37,theory(equality)])).
% cnf(92918,negated_conjecture,($false|$false),inference(rw,[status(thm)],[92917,36,theory(equality)])).
% cnf(92919,negated_conjecture,($false),inference(cn,[status(thm)],[92918,theory(equality)])).
% cnf(92920,negated_conjecture,($false),92919,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1685
% # ...of these trivial : 5
% # ...subsumed : 1349
% # ...remaining for further processing: 331
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 13
% # Backward-rewritten : 8
% # Generated clauses : 42247
% # ...of the previous two non-trivial : 39396
% # Contextual simplify-reflections : 505
% # Paramodulations : 42244
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 310
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 302
% # Current number of unprocessed clauses: 35376
% # ...number of literals in the above : 173752
% # Clause-clause subsumption calls (NU) : 42107
% # Rec. Clause-clause subsumption calls : 29735
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 215 leaves, 1.89+/-2.260 terms/leaf
% # Paramod-from index: 150 leaves, 1.45+/-1.526 terms/leaf
% # Paramod-into index: 171 leaves, 1.97+/-2.318 terms/leaf
% # -------------------------------------------------
% # User time : 1.432 s
% # System time : 0.052 s
% # Total time : 1.484 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.82 CPU 2.91 WC
% FINAL PrfWatch: 2.82 CPU 2.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP14110/RNG046+1.tptp
%
%------------------------------------------------------------------------------