TSTP Solution File: RNG102+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : RNG102+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:37:05 EST 2010
% Result : Theorem 1.43s
% Output : Solution 1.43s
% 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/SystemOnTPTP5028/RNG102+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5028/RNG102+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5028/RNG102+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 5124
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,aElement0(xc),file('/tmp/SRASS.s.p', m__1905)).
% fof(5, axiom,((aElementOf0(xx,slsdtgt0(xc))&aElementOf0(xy,slsdtgt0(xc)))&aElement0(xz)),file('/tmp/SRASS.s.p', m__1933)).
% fof(7, axiom,![X1]:(aElement0(X1)=>![X2]:(X2=slsdtgt0(X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)<=>?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))),file('/tmp/SRASS.s.p', mDefPrIdeal)).
% fof(41, conjecture,?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xy),file('/tmp/SRASS.s.p', m__)).
% fof(42, negated_conjecture,~(?[X1]:(aElement0(X1)&sdtasdt0(xc,X1)=xy)),inference(assume_negation,[status(cth)],[41])).
% cnf(56,plain,(aElement0(xc)),inference(split_conjunct,[status(thm)],[4])).
% cnf(58,plain,(aElementOf0(xy,slsdtgt0(xc))),inference(split_conjunct,[status(thm)],[5])).
% fof(62, plain,![X1]:(~(aElement0(X1))|![X2]:((~(X2=slsdtgt0(X1))|(aSet0(X2)&![X3]:((~(aElementOf0(X3,X2))|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))&(![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3))|aElementOf0(X3,X2)))))&((~(aSet0(X2))|?[X3]:((~(aElementOf0(X3,X2))|![X4]:(~(aElement0(X4))|~(sdtasdt0(X1,X4)=X3)))&(aElementOf0(X3,X2)|?[X4]:(aElement0(X4)&sdtasdt0(X1,X4)=X3))))|X2=slsdtgt0(X1)))),inference(fof_nnf,[status(thm)],[7])).
% fof(63, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|?[X8]:(aElement0(X8)&sdtasdt0(X5,X8)=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|?[X10]:((~(aElementOf0(X10,X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=X10)))&(aElementOf0(X10,X6)|?[X12]:(aElement0(X12)&sdtasdt0(X5,X12)=X10))))|X6=slsdtgt0(X5)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X5]:(~(aElement0(X5))|![X6]:((~(X6=slsdtgt0(X5))|(aSet0(X6)&![X7]:((~(aElementOf0(X7,X6))|(aElement0(esk1_3(X5,X6,X7))&sdtasdt0(X5,esk1_3(X5,X6,X7))=X7))&(![X9]:(~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6)))))&((~(aSet0(X6))|((~(aElementOf0(esk2_2(X5,X6),X6))|![X11]:(~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6))))&(aElementOf0(esk2_2(X5,X6),X6)|(aElement0(esk3_2(X5,X6))&sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6)))))|X6=slsdtgt0(X5)))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6)))|~(aElementOf0(esk2_2(X5,X6),X6)))&(aElementOf0(esk2_2(X5,X6),X6)|(aElement0(esk3_2(X5,X6))&sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6))))|~(aSet0(X6)))|X6=slsdtgt0(X5))&(((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))&(~(aElementOf0(X7,X6))|(aElement0(esk1_3(X5,X6,X7))&sdtasdt0(X5,esk1_3(X5,X6,X7))=X7)))&aSet0(X6))|~(X6=slsdtgt0(X5))))|~(aElement0(X5))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((((~(aElement0(X11))|~(sdtasdt0(X5,X11)=esk2_2(X5,X6)))|~(aElementOf0(esk2_2(X5,X6),X6)))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&(((((aElement0(esk3_2(X5,X6))|aElementOf0(esk2_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))&((((sdtasdt0(X5,esk3_2(X5,X6))=esk2_2(X5,X6)|aElementOf0(esk2_2(X5,X6),X6))|~(aSet0(X6)))|X6=slsdtgt0(X5))|~(aElement0(X5)))))&((((((~(aElement0(X9))|~(sdtasdt0(X5,X9)=X7))|aElementOf0(X7,X6))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&((((aElement0(esk1_3(X5,X6,X7))|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))&(((sdtasdt0(X5,esk1_3(X5,X6,X7))=X7|~(aElementOf0(X7,X6)))|~(X6=slsdtgt0(X5)))|~(aElement0(X5)))))&((aSet0(X6)|~(X6=slsdtgt0(X5)))|~(aElement0(X5))))),inference(distribute,[status(thm)],[65])).
% cnf(68,plain,(sdtasdt0(X1,esk1_3(X1,X2,X3))=X3|~aElement0(X1)|X2!=slsdtgt0(X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[66])).
% cnf(69,plain,(aElement0(esk1_3(X1,X2,X3))|~aElement0(X1)|X2!=slsdtgt0(X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(245, negated_conjecture,![X1]:(~(aElement0(X1))|~(sdtasdt0(xc,X1)=xy)),inference(fof_nnf,[status(thm)],[42])).
% fof(246, negated_conjecture,![X2]:(~(aElement0(X2))|~(sdtasdt0(xc,X2)=xy)),inference(variable_rename,[status(thm)],[245])).
% cnf(247,negated_conjecture,(sdtasdt0(xc,X1)!=xy|~aElement0(X1)),inference(split_conjunct,[status(thm)],[246])).
% cnf(531,negated_conjecture,(X2!=xy|~aElement0(esk1_3(xc,X1,X2))|slsdtgt0(xc)!=X1|~aElementOf0(X2,X1)|~aElement0(xc)),inference(spm,[status(thm)],[247,68,theory(equality)])).
% cnf(542,negated_conjecture,(X2!=xy|~aElement0(esk1_3(xc,X1,X2))|slsdtgt0(xc)!=X1|~aElementOf0(X2,X1)|$false),inference(rw,[status(thm)],[531,56,theory(equality)])).
% cnf(543,negated_conjecture,(X2!=xy|~aElement0(esk1_3(xc,X1,X2))|slsdtgt0(xc)!=X1|~aElementOf0(X2,X1)),inference(cn,[status(thm)],[542,theory(equality)])).
% cnf(14788,negated_conjecture,(slsdtgt0(xc)!=X1|X2!=xy|~aElementOf0(X2,X1)|~aElement0(xc)),inference(spm,[status(thm)],[543,69,theory(equality)])).
% cnf(14789,negated_conjecture,(slsdtgt0(xc)!=X1|X2!=xy|~aElementOf0(X2,X1)|$false),inference(rw,[status(thm)],[14788,56,theory(equality)])).
% cnf(14790,negated_conjecture,(slsdtgt0(xc)!=X1|X2!=xy|~aElementOf0(X2,X1)),inference(cn,[status(thm)],[14789,theory(equality)])).
% cnf(14796,negated_conjecture,($false),inference(spm,[status(thm)],[14790,58,theory(equality)])).
% cnf(14802,negated_conjecture,($false),14796,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1360
% # ...of these trivial : 22
% # ...subsumed : 581
% # ...remaining for further processing: 757
% # Other redundant clauses eliminated : 18
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 16
% # Generated clauses : 7319
% # ...of the previous two non-trivial : 6467
% # Contextual simplify-reflections : 95
% # Paramodulations : 7290
% # Factorizations : 0
% # Equation resolutions : 29
% # Current number of processed clauses: 636
% # Positive orientable unit clauses: 303
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 319
% # Current number of unprocessed clauses: 5119
% # ...number of literals in the above : 20033
% # Clause-clause subsumption calls (NU) : 11713
% # Rec. Clause-clause subsumption calls : 6228
% # Unit Clause-clause subsumption calls : 908
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 288
% # Indexed BW rewrite successes : 15
% # Backwards rewriting index: 679 leaves, 1.21+/-1.119 terms/leaf
% # Paramod-from index: 388 leaves, 1.15+/-1.093 terms/leaf
% # Paramod-into index: 581 leaves, 1.18+/-1.024 terms/leaf
% # -------------------------------------------------
% # User time : 0.302 s
% # System time : 0.015 s
% # Total time : 0.317 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.59 CPU 0.68 WC
% FINAL PrfWatch: 0.59 CPU 0.68 WC
% SZS output end Solution for /tmp/SystemOnTPTP5028/RNG102+1.tptp
%
%------------------------------------------------------------------------------