TSTP Solution File: NUM557+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM557+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 : art06.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 20:05:44 EST 2010
% Result : Theorem 1.56s
% Output : Solution 1.56s
% 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/SystemOnTPTP15450/NUM557+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15450/NUM557+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15450/NUM557+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 15546
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.023 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(25, axiom,![X1]:![X2]:((aSet0(X1)&aElementOf0(X2,szNzAzT0))=>![X3]:(X3=slbdtsldtrb0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))),file('/tmp/SRASS.s.p', mDefSel)).
% fof(28, axiom,aElementOf0(xk,szNzAzT0),file('/tmp/SRASS.s.p', m__2202)).
% fof(29, axiom,((aSet0(xS)&aSet0(xT))&~(xk=sz00)),file('/tmp/SRASS.s.p', m__2202_02)).
% fof(39, axiom,(aSubsetOf0(xP,xS)&sbrdtbr0(xP)=xk),file('/tmp/SRASS.s.p', m__2431)).
% fof(73, conjecture,aElementOf0(xP,slbdtsldtrb0(xS,xk)),file('/tmp/SRASS.s.p', m__)).
% fof(74, negated_conjecture,~(aElementOf0(xP,slbdtsldtrb0(xS,xk))),inference(assume_negation,[status(cth)],[73])).
% fof(89, negated_conjecture,~(aElementOf0(xP,slbdtsldtrb0(xS,xk))),inference(fof_simplification,[status(thm)],[74,theory(equality)])).
% fof(207, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElementOf0(X2,szNzAzT0)))|![X3]:((~(X3=slbdtsldtrb0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))&((~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2))|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|(~(aSubsetOf0(X4,X1))|~(sbrdtbr0(X4)=X2)))&(aElementOf0(X4,X3)|(aSubsetOf0(X4,X1)&sbrdtbr0(X4)=X2))))|X3=slbdtsldtrb0(X1,X2)))),inference(fof_nnf,[status(thm)],[25])).
% fof(208, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|(~(aSubsetOf0(X9,X5))|~(sbrdtbr0(X9)=X6)))&(aElementOf0(X9,X7)|(aSubsetOf0(X9,X5)&sbrdtbr0(X9)=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(variable_rename,[status(thm)],[207])).
% fof(209, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))|![X7]:((~(X7=slbdtsldtrb0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk6_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk6_3(X5,X6,X7),X5))|~(sbrdtbr0(esk6_3(X5,X6,X7))=X6)))&(aElementOf0(esk6_3(X5,X6,X7),X7)|(aSubsetOf0(esk6_3(X5,X6,X7),X5)&sbrdtbr0(esk6_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))),inference(skolemize,[status(esa)],[208])).
% fof(210, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|(aSubsetOf0(X8,X5)&sbrdtbr0(X8)=X6))&((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=slbdtsldtrb0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk6_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk6_3(X5,X6,X7),X5))|~(sbrdtbr0(esk6_3(X5,X6,X7))=X6)))&(aElementOf0(esk6_3(X5,X6,X7),X7)|(aSubsetOf0(esk6_3(X5,X6,X7),X5)&sbrdtbr0(esk6_3(X5,X6,X7))=X6))))|X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))),inference(shift_quantors,[status(thm)],[209])).
% fof(211, plain,![X5]:![X6]:![X7]:![X8]:(((((((aSubsetOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((sbrdtbr0(X8)=X6|~(aElementOf0(X8,X7)))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((((~(aSubsetOf0(X8,X5))|~(sbrdtbr0(X8)=X6))|aElementOf0(X8,X7))|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&((aSet0(X7)|~(X7=slbdtsldtrb0(X5,X6)))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0)))))&(((((~(aElementOf0(esk6_3(X5,X6,X7),X7))|(~(aSubsetOf0(esk6_3(X5,X6,X7),X5))|~(sbrdtbr0(esk6_3(X5,X6,X7))=X6)))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&(((((aSubsetOf0(esk6_3(X5,X6,X7),X5)|aElementOf0(esk6_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))&((((sbrdtbr0(esk6_3(X5,X6,X7))=X6|aElementOf0(esk6_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=slbdtsldtrb0(X5,X6))|(~(aSet0(X5))|~(aElementOf0(X6,szNzAzT0))))))),inference(distribute,[status(thm)],[210])).
% cnf(216,plain,(aElementOf0(X4,X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|sbrdtbr0(X4)!=X1|~aSubsetOf0(X4,X2)),inference(split_conjunct,[status(thm)],[211])).
% cnf(227,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[28])).
% cnf(230,plain,(aSet0(xS)),inference(split_conjunct,[status(thm)],[29])).
% cnf(245,plain,(sbrdtbr0(xP)=xk),inference(split_conjunct,[status(thm)],[39])).
% cnf(246,plain,(aSubsetOf0(xP,xS)),inference(split_conjunct,[status(thm)],[39])).
% cnf(375,negated_conjecture,(~aElementOf0(xP,slbdtsldtrb0(xS,xk))),inference(split_conjunct,[status(thm)],[89])).
% cnf(771,plain,(aElementOf0(X1,slbdtsldtrb0(X2,X3))|sbrdtbr0(X1)!=X3|~aSubsetOf0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aSet0(X2)),inference(er,[status(thm)],[216,theory(equality)])).
% cnf(9909,negated_conjecture,(sbrdtbr0(xP)!=xk|~aSubsetOf0(xP,xS)|~aElementOf0(xk,szNzAzT0)|~aSet0(xS)),inference(spm,[status(thm)],[375,771,theory(equality)])).
% cnf(9923,negated_conjecture,($false|~aSubsetOf0(xP,xS)|~aElementOf0(xk,szNzAzT0)|~aSet0(xS)),inference(rw,[status(thm)],[9909,245,theory(equality)])).
% cnf(9924,negated_conjecture,($false|$false|~aElementOf0(xk,szNzAzT0)|~aSet0(xS)),inference(rw,[status(thm)],[9923,246,theory(equality)])).
% cnf(9925,negated_conjecture,($false|$false|$false|~aSet0(xS)),inference(rw,[status(thm)],[9924,227,theory(equality)])).
% cnf(9926,negated_conjecture,($false|$false|$false|$false),inference(rw,[status(thm)],[9925,230,theory(equality)])).
% cnf(9927,negated_conjecture,($false),inference(cn,[status(thm)],[9926,theory(equality)])).
% cnf(9928,negated_conjecture,($false),9927,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1854
% # ...of these trivial : 16
% # ...subsumed : 944
% # ...remaining for further processing: 894
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 48
% # Backward-rewritten : 17
% # Generated clauses : 5443
% # ...of the previous two non-trivial : 4980
% # Contextual simplify-reflections : 757
% # Paramodulations : 5365
% # Factorizations : 0
% # Equation resolutions : 75
% # Current number of processed clauses: 701
% # Positive orientable unit clauses: 46
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 28
% # Non-unit-clauses : 627
% # Current number of unprocessed clauses: 3173
% # ...number of literals in the above : 19668
% # Clause-clause subsumption calls (NU) : 19754
% # Rec. Clause-clause subsumption calls : 9879
% # Unit Clause-clause subsumption calls : 621
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 483 leaves, 1.28+/-0.825 terms/leaf
% # Paramod-from index: 253 leaves, 1.04+/-0.204 terms/leaf
% # Paramod-into index: 411 leaves, 1.20+/-0.691 terms/leaf
% # -------------------------------------------------
% # User time : 0.405 s
% # System time : 0.016 s
% # Total time : 0.421 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.65 CPU 0.73 WC
% FINAL PrfWatch: 0.65 CPU 0.73 WC
% SZS output end Solution for /tmp/SystemOnTPTP15450/NUM557+1.tptp
%
%------------------------------------------------------------------------------