TSTP Solution File: RNG044+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG044+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:04:56 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP13851/RNG044+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13851/RNG044+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13851/RNG044+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 13947
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 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(sdtpldt0(X1,X2))),file('/tmp/SRASS.s.p', mSumSc)).
% 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(17, 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(18, 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)],[17])).
% fof(22, 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)],[18,theory(equality)])).
% fof(23, plain,![X1]:![X2]:((~(aScalar0(X1))|~(aScalar0(X2)))|aScalar0(sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(24, plain,![X3]:![X4]:((~(aScalar0(X3))|~(aScalar0(X4)))|aScalar0(sdtpldt0(X3,X4))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(aScalar0(sdtpldt0(X1,X2))|~aScalar0(X2)|~aScalar0(X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(36, 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(37, 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)],[36])).
% fof(38, 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)],[37])).
% cnf(39,plain,(sdtasdt0(sdtpldt0(X3,X2),X1)=sdtpldt0(sdtasdt0(X3,X1),sdtasdt0(X2,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(sdtasdt0(X3,sdtpldt0(X2,X1))=sdtpldt0(sdtasdt0(X3,X2),sdtasdt0(X3,X1))|~aScalar0(X1)|~aScalar0(X2)|~aScalar0(X3)),inference(split_conjunct,[status(thm)],[38])).
% cnf(41,plain,(aScalar0(xv)),inference(split_conjunct,[status(thm)],[5])).
% cnf(42,plain,(aScalar0(xu)),inference(split_conjunct,[status(thm)],[5])).
% cnf(43,plain,(aScalar0(xy)),inference(split_conjunct,[status(thm)],[5])).
% cnf(44,plain,(aScalar0(xx)),inference(split_conjunct,[status(thm)],[5])).
% cnf(84,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)],[22])).
% cnf(226,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)],[84,40,theory(equality)])).
% cnf(238,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)],[226,43,theory(equality)])).
% cnf(239,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)],[238,42,theory(equality)])).
% cnf(240,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)],[239,41,theory(equality)])).
% cnf(241,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)],[240,theory(equality)])).
% cnf(281,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)],[241,40,theory(equality)])).
% cnf(297,negated_conjecture,(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|$false|~aScalar0(xu)|~aScalar0(xv)),inference(rw,[status(thm)],[281,44,theory(equality)])).
% cnf(298,negated_conjecture,(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|$false|$false|~aScalar0(xv)),inference(rw,[status(thm)],[297,42,theory(equality)])).
% cnf(299,negated_conjecture,(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))|$false|$false|$false),inference(rw,[status(thm)],[298,41,theory(equality)])).
% cnf(300,negated_conjecture,(sdtpldt0(sdtasdt0(xx,sdtpldt0(xu,xv)),sdtasdt0(xy,sdtpldt0(xu,xv)))!=sdtasdt0(sdtpldt0(xx,xy),sdtpldt0(xu,xv))),inference(cn,[status(thm)],[299,theory(equality)])).
% cnf(303,negated_conjecture,(~aScalar0(xx)|~aScalar0(xy)|~aScalar0(sdtpldt0(xu,xv))),inference(spm,[status(thm)],[300,39,theory(equality)])).
% cnf(304,negated_conjecture,($false|~aScalar0(xy)|~aScalar0(sdtpldt0(xu,xv))),inference(rw,[status(thm)],[303,44,theory(equality)])).
% cnf(305,negated_conjecture,($false|$false|~aScalar0(sdtpldt0(xu,xv))),inference(rw,[status(thm)],[304,43,theory(equality)])).
% cnf(306,negated_conjecture,(~aScalar0(sdtpldt0(xu,xv))),inference(cn,[status(thm)],[305,theory(equality)])).
% cnf(312,negated_conjecture,(~aScalar0(xv)|~aScalar0(xu)),inference(spm,[status(thm)],[306,25,theory(equality)])).
% cnf(313,negated_conjecture,($false|~aScalar0(xu)),inference(rw,[status(thm)],[312,41,theory(equality)])).
% cnf(314,negated_conjecture,($false|$false),inference(rw,[status(thm)],[313,42,theory(equality)])).
% cnf(315,negated_conjecture,($false),inference(cn,[status(thm)],[314,theory(equality)])).
% cnf(316,negated_conjecture,($false),315,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 36
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 116
% # ...of the previous two non-trivial : 104
% # Contextual simplify-reflections : 0
% # Paramodulations : 115
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 98
% # ...number of literals in the above : 406
% # Clause-clause subsumption calls (NU) : 43
% # Rec. Clause-clause subsumption calls : 35
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 58 leaves, 1.21+/-0.713 terms/leaf
% # Paramod-from index: 26 leaves, 1.12+/-0.319 terms/leaf
% # Paramod-into index: 50 leaves, 1.14+/-0.490 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP13851/RNG044+1.tptp
%
%------------------------------------------------------------------------------