TSTP Solution File: RNG045+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : RNG045+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:05:05 EST 2010

% Result   : Theorem 0.90s
% Output   : Solution 0.90s
% 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/SystemOnTPTP13887/RNG045+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP13887/RNG045+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13887/RNG045+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 13983
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:![X3]:(((aScalar0(X1)&aScalar0(X2))&aScalar0(X3))=>(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),file('/tmp/SRASS.s.p', mDistr)).
% fof(5, axiom,(((aScalar0(xx)&aScalar0(xy))&aScalar0(xu))&aScalar0(xv)),file('/tmp/SRASS.s.p', m__674)).
% fof(6, axiom,sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))=sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv))),file('/tmp/SRASS.s.p', m__733)).
% fof(18, conjecture,sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))=sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv))),file('/tmp/SRASS.s.p', m__)).
% fof(19, negated_conjecture,~(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))=sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),inference(assume_negation,[status(cth)],[18])).
% fof(23, negated_conjecture,~(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))=sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(37, plain,![X1]:![X2]:![X3]:(((~(aScalar0(X1))|~(aScalar0(X2)))|~(aScalar0(X3)))|(sdtasdt0(X1,sdtpldt0(X2,X3))=sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3))&sdtasdt0(sdtpldt0(X1,X2),X3)=sdtpldt0(sdtasdt0(X1,X3),sdtasdt0(X2,X3)))),inference(fof_nnf,[status(thm)],[4])).
% fof(38, plain,![X4]:![X5]:![X6]:(((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6)))|(sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))&sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6)))),inference(variable_rename,[status(thm)],[37])).
% fof(39, plain,![X4]:![X5]:![X6]:((sdtasdt0(X4,sdtpldt0(X5,X6))=sdtpldt0(sdtasdt0(X4,X5),sdtasdt0(X4,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))&(sdtasdt0(sdtpldt0(X4,X5),X6)=sdtpldt0(sdtasdt0(X4,X6),sdtasdt0(X5,X6))|((~(aScalar0(X4))|~(aScalar0(X5)))|~(aScalar0(X6))))),inference(distribute,[status(thm)],[38])).
% cnf(41,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,plain,(aScalar0(xv)),inference(split_conjunct,[status(thm)],[5])).
% cnf(43,plain,(aScalar0(xu)),inference(split_conjunct,[status(thm)],[5])).
% cnf(44,plain,(aScalar0(xy)),inference(split_conjunct,[status(thm)],[5])).
% cnf(45,plain,(aScalar0(xx)),inference(split_conjunct,[status(thm)],[5])).
% cnf(46,plain,(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))=sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))),inference(split_conjunct,[status(thm)],[6])).
% cnf(86,negated_conjecture,(sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))!=sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtpldt0(sdtasdt0(xy,xu),sdtasdt0(xy,xv)))),inference(split_conjunct,[status(thm)],[23])).
% cnf(248,negated_conjecture,(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|~aScalar0(xy)|~aScalar0(xu)|~aScalar0(xv)),inference(spm,[status(thm)],[86,41,theory(equality)])).
% cnf(260,negated_conjecture,(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|$false|~aScalar0(xu)|~aScalar0(xv)),inference(rw,[status(thm)],[248,44,theory(equality)])).
% cnf(261,negated_conjecture,(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|$false|$false|~aScalar0(xv)),inference(rw,[status(thm)],[260,43,theory(equality)])).
% cnf(262,negated_conjecture,(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|$false|$false|$false),inference(rw,[status(thm)],[261,42,theory(equality)])).
% cnf(263,negated_conjecture,(sdtpldt0(sdtpldt0(sdtasdt0(xx,xu),sdtasdt0(xx,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))),inference(cn,[status(thm)],[262,theory(equality)])).
% cnf(303,negated_conjecture,(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|~aScalar0(xx)|~aScalar0(xu)|~aScalar0(xv)),inference(spm,[status(thm)],[263,41,theory(equality)])).
% cnf(319,negated_conjecture,($false|~aScalar0(xx)|~aScalar0(xu)|~aScalar0(xv)),inference(rw,[status(thm)],[303,46,theory(equality)])).
% cnf(320,negated_conjecture,($false|$false|~aScalar0(xu)|~aScalar0(xv)),inference(rw,[status(thm)],[319,45,theory(equality)])).
% cnf(321,negated_conjecture,($false|$false|$false|~aScalar0(xv)),inference(rw,[status(thm)],[320,43,theory(equality)])).
% cnf(322,negated_conjecture,($false|$false|$false|$false),inference(rw,[status(thm)],[321,42,theory(equality)])).
% cnf(323,negated_conjecture,($false),inference(cn,[status(thm)],[322,theory(equality)])).
% cnf(324,negated_conjecture,($false),323,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 32
% # ...of these trivial                : 0
% # ...subsumed                        : 0
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 0
% # Generated clauses                  : 119
% # ...of the previous two non-trivial : 104
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 118
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 32
% #    Positive orientable unit clauses: 7
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 2
% #    Non-unit-clauses                : 23
% # Current number of unprocessed clauses: 103
% # ...number of literals in the above : 412
% # Clause-clause subsumption calls (NU) : 42
% # Rec. Clause-clause subsumption calls : 34
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 0
% # Indexed BW rewrite successes       : 0
% # Backwards rewriting index:    56 leaves,   1.21+/-0.725 terms/leaf
% # Paramod-from index:           27 leaves,   1.11+/-0.314 terms/leaf
% # Paramod-into index:           48 leaves,   1.15+/-0.500 terms/leaf
% # -------------------------------------------------
% # User time              : 0.015 s
% # System time            : 0.004 s
% # Total time             : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP13887/RNG045+1.tptp
% 
%------------------------------------------------------------------------------