TSTP Solution File: RNG089+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG089+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:29:46 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP4453/RNG089+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4453/RNG089+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4453/RNG089+2.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 4549
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(12, axiom,(((((aSet0(xI)&![X1]:(aElementOf0(X1,xI)=>(![X2]:(aElementOf0(X2,xI)=>aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X1]:(aElementOf0(X1,xJ)=>(![X2]:(aElementOf0(X2,xJ)=>aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(aElement0(X2)=>aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),file('/tmp/SRASS.s.p', m__870)).
% fof(13, axiom,((((?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&sdtpldt0(X1,X2)=xx)&aElementOf0(xx,sdtpldt1(xI,xJ)))&?[X1]:?[X2]:((aElementOf0(X1,xI)&aElementOf0(X2,xJ))&sdtpldt0(X1,X2)=xy))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__901)).
% fof(14, axiom,((aElementOf0(xk,xI)&aElementOf0(xl,xJ))&xx=sdtpldt0(xk,xl)),file('/tmp/SRASS.s.p', m__934)).
% fof(30, conjecture,(aElementOf0(sdtasdt0(xz,xk),xI)&aElementOf0(sdtasdt0(xz,xl),xJ)),file('/tmp/SRASS.s.p', m__)).
% fof(31, negated_conjecture,~((aElementOf0(sdtasdt0(xz,xk),xI)&aElementOf0(sdtasdt0(xz,xl),xJ))),inference(assume_negation,[status(cth)],[30])).
% fof(96, plain,(((((aSet0(xI)&![X1]:(~(aElementOf0(X1,xI))|(![X2]:(~(aElementOf0(X2,xI))|aElementOf0(sdtpldt0(X1,X2),xI))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X1]:(~(aElementOf0(X1,xJ))|(![X2]:(~(aElementOf0(X2,xJ))|aElementOf0(sdtpldt0(X1,X2),xJ))&![X2]:(~(aElement0(X2))|aElementOf0(sdtasdt0(X2,X1),xJ)))))&aIdeal0(xJ)),inference(fof_nnf,[status(thm)],[12])).
% fof(97, plain,(((((aSet0(xI)&![X3]:(~(aElementOf0(X3,xI))|(![X4]:(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))&![X5]:(~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI)))))&aIdeal0(xI))&aSet0(xJ))&![X6]:(~(aElementOf0(X6,xJ))|(![X7]:(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))&![X8]:(~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ)))))&aIdeal0(xJ)),inference(variable_rename,[status(thm)],[96])).
% fof(98, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))&(~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ)))|~(aElementOf0(X6,xJ)))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))&(~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI)))|~(aElementOf0(X3,xI)))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(shift_quantors,[status(thm)],[97])).
% fof(99, plain,![X3]:![X4]:![X5]:![X6]:![X7]:![X8]:(((((~(aElement0(X8))|aElementOf0(sdtasdt0(X8,X6),xJ))|~(aElementOf0(X6,xJ)))&((~(aElementOf0(X7,xJ))|aElementOf0(sdtpldt0(X6,X7),xJ))|~(aElementOf0(X6,xJ))))&((((((~(aElement0(X5))|aElementOf0(sdtasdt0(X5,X3),xI))|~(aElementOf0(X3,xI)))&((~(aElementOf0(X4,xI))|aElementOf0(sdtpldt0(X3,X4),xI))|~(aElementOf0(X3,xI))))&aSet0(xI))&aIdeal0(xI))&aSet0(xJ)))&aIdeal0(xJ)),inference(distribute,[status(thm)],[98])).
% cnf(105,plain,(aElementOf0(sdtasdt0(X2,X1),xI)|~aElementOf0(X1,xI)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[99])).
% cnf(107,plain,(aElementOf0(sdtasdt0(X2,X1),xJ)|~aElementOf0(X1,xJ)|~aElement0(X2)),inference(split_conjunct,[status(thm)],[99])).
% fof(108, plain,((((?[X3]:?[X4]:((aElementOf0(X3,xI)&aElementOf0(X4,xJ))&sdtpldt0(X3,X4)=xx)&aElementOf0(xx,sdtpldt1(xI,xJ)))&?[X5]:?[X6]:((aElementOf0(X5,xI)&aElementOf0(X6,xJ))&sdtpldt0(X5,X6)=xy))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),inference(variable_rename,[status(thm)],[13])).
% fof(109, plain,((((((aElementOf0(esk11_0,xI)&aElementOf0(esk12_0,xJ))&sdtpldt0(esk11_0,esk12_0)=xx)&aElementOf0(xx,sdtpldt1(xI,xJ)))&((aElementOf0(esk13_0,xI)&aElementOf0(esk14_0,xJ))&sdtpldt0(esk13_0,esk14_0)=xy))&aElementOf0(xy,sdtpldt1(xI,xJ)))&aElement0(xz)),inference(skolemize,[status(esa)],[108])).
% cnf(110,plain,(aElement0(xz)),inference(split_conjunct,[status(thm)],[109])).
% cnf(120,plain,(aElementOf0(xl,xJ)),inference(split_conjunct,[status(thm)],[14])).
% cnf(121,plain,(aElementOf0(xk,xI)),inference(split_conjunct,[status(thm)],[14])).
% fof(177, negated_conjecture,(~(aElementOf0(sdtasdt0(xz,xk),xI))|~(aElementOf0(sdtasdt0(xz,xl),xJ))),inference(fof_nnf,[status(thm)],[31])).
% cnf(178,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xl),xJ)|~aElementOf0(sdtasdt0(xz,xk),xI)),inference(split_conjunct,[status(thm)],[177])).
% cnf(262,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)|~aElementOf0(xl,xJ)|~aElement0(xz)),inference(spm,[status(thm)],[178,107,theory(equality)])).
% cnf(271,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)|$false|~aElement0(xz)),inference(rw,[status(thm)],[262,120,theory(equality)])).
% cnf(272,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)|$false|$false),inference(rw,[status(thm)],[271,110,theory(equality)])).
% cnf(273,negated_conjecture,(~aElementOf0(sdtasdt0(xz,xk),xI)),inference(cn,[status(thm)],[272,theory(equality)])).
% cnf(614,negated_conjecture,(~aElementOf0(xk,xI)|~aElement0(xz)),inference(spm,[status(thm)],[273,105,theory(equality)])).
% cnf(621,negated_conjecture,($false|~aElement0(xz)),inference(rw,[status(thm)],[614,121,theory(equality)])).
% cnf(622,negated_conjecture,($false|$false),inference(rw,[status(thm)],[621,110,theory(equality)])).
% cnf(623,negated_conjecture,($false),inference(cn,[status(thm)],[622,theory(equality)])).
% cnf(624,negated_conjecture,($false),623,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 81
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 81
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 253
% # ...of the previous two non-trivial : 221
% # Contextual simplify-reflections : 0
% # Paramodulations : 244
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 25
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 218
% # ...number of literals in the above : 917
% # Clause-clause subsumption calls (NU) : 90
% # Rec. Clause-clause subsumption calls : 70
% # 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: 114 leaves, 1.32+/-1.128 terms/leaf
% # Paramod-from index: 53 leaves, 1.06+/-0.231 terms/leaf
% # Paramod-into index: 100 leaves, 1.12+/-0.475 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.004 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP4453/RNG089+2.tptp
%
%------------------------------------------------------------------------------