TSTP Solution File: RNG115+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG115+4 : 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:47:22 EST 2010
% Result : Theorem 1.21s
% Output : Solution 1.21s
% 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/SystemOnTPTP18770/RNG115+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18770/RNG115+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18770/RNG115+4.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 18902
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.024 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(29, axiom,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)|aElementOf0(X1,xI))&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),file('/tmp/SRASS.s.p', m__2273)).
% fof(47, conjecture,?[X1]:?[X2]:(((?[X3]:(aElement0(X3)&sdtasdt0(xa,X3)=X1)|aElementOf0(X1,slsdtgt0(xa)))&(?[X3]:(aElement0(X3)&sdtasdt0(xb,X3)=X2)|aElementOf0(X2,slsdtgt0(xb))))&xu=sdtpldt0(X1,X2)),file('/tmp/SRASS.s.p', m__)).
% fof(48, negated_conjecture,~(?[X1]:?[X2]:(((?[X3]:(aElement0(X3)&sdtasdt0(xa,X3)=X1)|aElementOf0(X1,slsdtgt0(xa)))&(?[X3]:(aElement0(X3)&sdtasdt0(xb,X3)=X2)|aElementOf0(X2,slsdtgt0(xb))))&xu=sdtpldt0(X1,X2))),inference(assume_negation,[status(cth)],[47])).
% fof(49, plain,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((?[X2]:?[X3]:((aElementOf0(X2,slsdtgt0(xa))&aElementOf0(X3,slsdtgt0(xb)))&sdtpldt0(X2,X3)=X1)|aElementOf0(X1,xI))&~(X1=sz00))=>~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(278, plain,(((?[X1]:?[X2]:((aElementOf0(X1,slsdtgt0(xa))&aElementOf0(X2,slsdtgt0(xb)))&sdtpldt0(X1,X2)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X1]:(((![X2]:![X3]:((~(aElementOf0(X2,slsdtgt0(xa)))|~(aElementOf0(X3,slsdtgt0(xb))))|~(sdtpldt0(X2,X3)=X1))&~(aElementOf0(X1,xI)))|X1=sz00)|~(iLess0(sbrdtbr0(X1),sbrdtbr0(xu))))),inference(fof_nnf,[status(thm)],[49])).
% fof(279, plain,(((?[X4]:?[X5]:((aElementOf0(X4,slsdtgt0(xa))&aElementOf0(X5,slsdtgt0(xb)))&sdtpldt0(X4,X5)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X6]:(((![X7]:![X8]:((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))),inference(variable_rename,[status(thm)],[278])).
% fof(280, plain,(((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))&![X6]:(((![X7]:![X8]:((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))),inference(skolemize,[status(esa)],[279])).
% fof(281, plain,![X6]:![X7]:![X8]:((((((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))&~(aElementOf0(X6,xI)))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))&((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))),inference(shift_quantors,[status(thm)],[280])).
% fof(282, plain,![X6]:![X7]:![X8]:((((((~(aElementOf0(X7,slsdtgt0(xa)))|~(aElementOf0(X8,slsdtgt0(xb))))|~(sdtpldt0(X7,X8)=X6))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu))))&((~(aElementOf0(X6,xI))|X6=sz00)|~(iLess0(sbrdtbr0(X6),sbrdtbr0(xu)))))&((((aElementOf0(esk34_0,slsdtgt0(xa))&aElementOf0(esk35_0,slsdtgt0(xb)))&sdtpldt0(esk34_0,esk35_0)=xu)&aElementOf0(xu,xI))&~(xu=sz00))),inference(distribute,[status(thm)],[281])).
% cnf(285,plain,(sdtpldt0(esk34_0,esk35_0)=xu),inference(split_conjunct,[status(thm)],[282])).
% cnf(286,plain,(aElementOf0(esk35_0,slsdtgt0(xb))),inference(split_conjunct,[status(thm)],[282])).
% cnf(287,plain,(aElementOf0(esk34_0,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[282])).
% fof(370, negated_conjecture,![X1]:![X2]:(((![X3]:(~(aElement0(X3))|~(sdtasdt0(xa,X3)=X1))&~(aElementOf0(X1,slsdtgt0(xa))))|(![X3]:(~(aElement0(X3))|~(sdtasdt0(xb,X3)=X2))&~(aElementOf0(X2,slsdtgt0(xb)))))|~(xu=sdtpldt0(X1,X2))),inference(fof_nnf,[status(thm)],[48])).
% fof(371, negated_conjecture,![X4]:![X5]:(((![X6]:(~(aElement0(X6))|~(sdtasdt0(xa,X6)=X4))&~(aElementOf0(X4,slsdtgt0(xa))))|(![X7]:(~(aElement0(X7))|~(sdtasdt0(xb,X7)=X5))&~(aElementOf0(X5,slsdtgt0(xb)))))|~(xu=sdtpldt0(X4,X5))),inference(variable_rename,[status(thm)],[370])).
% fof(372, negated_conjecture,![X4]:![X5]:![X6]:![X7]:((((~(aElement0(X7))|~(sdtasdt0(xb,X7)=X5))&~(aElementOf0(X5,slsdtgt0(xb))))|((~(aElement0(X6))|~(sdtasdt0(xa,X6)=X4))&~(aElementOf0(X4,slsdtgt0(xa)))))|~(xu=sdtpldt0(X4,X5))),inference(shift_quantors,[status(thm)],[371])).
% fof(373, negated_conjecture,![X4]:![X5]:![X6]:![X7]:(((((~(aElement0(X6))|~(sdtasdt0(xa,X6)=X4))|(~(aElement0(X7))|~(sdtasdt0(xb,X7)=X5)))|~(xu=sdtpldt0(X4,X5)))&((~(aElementOf0(X4,slsdtgt0(xa)))|(~(aElement0(X7))|~(sdtasdt0(xb,X7)=X5)))|~(xu=sdtpldt0(X4,X5))))&((((~(aElement0(X6))|~(sdtasdt0(xa,X6)=X4))|~(aElementOf0(X5,slsdtgt0(xb))))|~(xu=sdtpldt0(X4,X5)))&((~(aElementOf0(X4,slsdtgt0(xa)))|~(aElementOf0(X5,slsdtgt0(xb))))|~(xu=sdtpldt0(X4,X5))))),inference(distribute,[status(thm)],[372])).
% cnf(374,negated_conjecture,(xu!=sdtpldt0(X1,X2)|~aElementOf0(X2,slsdtgt0(xb))|~aElementOf0(X1,slsdtgt0(xa))),inference(split_conjunct,[status(thm)],[373])).
% cnf(407,negated_conjecture,(~aElementOf0(esk35_0,slsdtgt0(xb))|~aElementOf0(esk34_0,slsdtgt0(xa))),inference(spm,[status(thm)],[374,285,theory(equality)])).
% cnf(408,negated_conjecture,($false|~aElementOf0(esk34_0,slsdtgt0(xa))),inference(rw,[status(thm)],[407,286,theory(equality)])).
% cnf(409,negated_conjecture,($false|$false),inference(rw,[status(thm)],[408,287,theory(equality)])).
% cnf(410,negated_conjecture,($false),inference(cn,[status(thm)],[409,theory(equality)])).
% cnf(411,negated_conjecture,($false),410,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 240
% # ...of these trivial : 1
% # ...subsumed : 2
% # ...remaining for further processing: 237
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 14
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 0
% # Paramodulations : 8
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 49
% # Positive orientable unit clauses: 30
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 148
% # ...number of literals in the above : 570
% # Clause-clause subsumption calls (NU) : 341
% # Rec. Clause-clause subsumption calls : 147
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 64 leaves, 1.05+/-0.276 terms/leaf
% # Paramod-from index: 30 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 59 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.040 s
% # System time : 0.003 s
% # Total time : 0.043 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.21 WC
% FINAL PrfWatch: 0.15 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP18770/RNG115+4.tptp
%
%------------------------------------------------------------------------------