%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM614+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 20:37:58 EST 2010
% Result : Theorem 36.04s
% Output : Solution 36.04s
% 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/SystemOnTPTP21444/NUM614+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21444/NUM614+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21444/NUM614+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 21540
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.60 CPU 8.04 WC
% PrfWatch: 9.20 CPU 10.04 WC
% PrfWatch: 11.17 CPU 12.05 WC
% PrfWatch: 13.16 CPU 14.05 WC
% PrfWatch: 15.15 CPU 16.06 WC
% PrfWatch: 17.14 CPU 18.06 WC
% PrfWatch: 19.13 CPU 20.07 WC
% PrfWatch: 21.11 CPU 22.07 WC
% PrfWatch: 22.89 CPU 24.08 WC
% PrfWatch: 24.43 CPU 26.11 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 26.40 CPU 28.12 WC
% PrfWatch: 28.39 CPU 30.12 WC
% PrfWatch: 30.38 CPU 32.13 WC
% PrfWatch: 32.38 CPU 34.13 WC
% PrfWatch: 34.36 CPU 36.14 WC
% # SZS output start CNFRefutation.
% fof(33, 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(50, axiom,(aElementOf0(xk,szNzAzT0)&szszuzczcdt0(xk)=xK),file('/tmp/SRASS.s.p', m__3533)).
% fof(65, axiom,(aSet0(xO)&xO=sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))),file('/tmp/SRASS.s.p', m__4891)).
% fof(78, axiom,aSubsetOf0(xP,xO),file('/tmp/SRASS.s.p', m__5208)).
% fof(79, axiom,sbrdtbr0(xP)=xk,file('/tmp/SRASS.s.p', m__5217)).
% fof(110, conjecture,aElementOf0(xP,slbdtsldtrb0(xO,xk)),file('/tmp/SRASS.s.p', m__)).
% fof(111, negated_conjecture,~(aElementOf0(xP,slbdtsldtrb0(xO,xk))),inference(assume_negation,[status(cth)],[110])).
% fof(124, negated_conjecture,~(aElementOf0(xP,slbdtsldtrb0(xO,xk))),inference(fof_simplification,[status(thm)],[111,theory(equality)])).
% fof(251, 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)],[33])).
% fof(252, 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)],[251])).
% fof(253, 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)],[252])).
% fof(254, 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)],[253])).
% fof(255, 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)],[254])).
% cnf(260,plain,(aElementOf0(X4,X3)|~aElementOf0(X1,szNzAzT0)|~aSet0(X2)|X3!=slbdtsldtrb0(X2,X1)|sbrdtbr0(X4)!=X1|~aSubsetOf0(X4,X2)),inference(split_conjunct,[status(thm)],[255])).
% cnf(335,plain,(aElementOf0(xk,szNzAzT0)),inference(split_conjunct,[status(thm)],[50])).
% cnf(408,plain,(aSet0(xO)),inference(split_conjunct,[status(thm)],[65])).
% cnf(430,plain,(aSubsetOf0(xP,xO)),inference(split_conjunct,[status(thm)],[78])).
% cnf(431,plain,(sbrdtbr0(xP)=xk),inference(split_conjunct,[status(thm)],[79])).
% cnf(583,negated_conjecture,(~aElementOf0(xP,slbdtsldtrb0(xO,xk))),inference(split_conjunct,[status(thm)],[124])).
% cnf(1350,plain,(aElementOf0(X1,slbdtsldtrb0(X2,X3))|sbrdtbr0(X1)!=X3|~aSubsetOf0(X1,X2)|~aElementOf0(X3,szNzAzT0)|~aSet0(X2)),inference(er,[status(thm)],[260,theory(equality)])).
% cnf(17880,plain,(aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1)))|~aSubsetOf0(X1,X2)|~aElementOf0(sbrdtbr0(X1),szNzAzT0)|~aSet0(X2)),inference(er,[status(thm)],[1350,theory(equality)])).
% cnf(535575,plain,(aElementOf0(xP,slbdtsldtrb0(X1,xk))|~aSubsetOf0(xP,X1)|~aElementOf0(xk,szNzAzT0)|~aSet0(X1)),inference(spm,[status(thm)],[17880,431,theory(equality)])).
% cnf(535606,plain,(aElementOf0(xP,slbdtsldtrb0(X1,xk))|~aSubsetOf0(xP,X1)|$false|~aSet0(X1)),inference(rw,[status(thm)],[535575,335,theory(equality)])).
% cnf(535607,plain,(aElementOf0(xP,slbdtsldtrb0(X1,xk))|~aSubsetOf0(xP,X1)|~aSet0(X1)),inference(cn,[status(thm)],[535606,theory(equality)])).
% cnf(535686,negated_conjecture,(~aSubsetOf0(xP,xO)|~aSet0(xO)),inference(spm,[status(thm)],[583,535607,theory(equality)])).
% cnf(535739,negated_conjecture,($false|~aSet0(xO)),inference(rw,[status(thm)],[535686,430,theory(equality)])).
% cnf(535740,negated_conjecture,($false|$false),inference(rw,[status(thm)],[535739,408,theory(equality)])).
% cnf(535741,negated_conjecture,($false),inference(cn,[status(thm)],[535740,theory(equality)])).
% cnf(535742,negated_conjecture,($false),535741,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 36401
% # ...of these trivial : 391
% # ...subsumed : 28475
% # ...remaining for further processing: 7535
% # Other redundant clauses eliminated : 141
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 606
% # Backward-rewritten : 113
% # Generated clauses : 266686
% # ...of the previous two non-trivial : 248471
% # Contextual simplify-reflections : 27174
% # Paramodulations : 266133
% # Factorizations : 3
% # Equation resolutions : 550
% # Current number of processed clauses: 6608
% # Positive orientable unit clauses: 165
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 114
% # Non-unit-clauses : 6329
% # Current number of unprocessed clauses: 199997
% # ...number of literals in the above : 1461094
% # Clause-clause subsumption calls (NU) : 5703638
% # Rec. Clause-clause subsumption calls : 1530549
% # Unit Clause-clause subsumption calls : 27879
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 3838 leaves, 1.44+/-1.490 terms/leaf
% # Paramod-from index: 1381 leaves, 1.15+/-0.636 terms/leaf
% # Paramod-into index: 2599 leaves, 1.32+/-1.211 terms/leaf
% # -------------------------------------------------
% # User time : 24.364 s
% # System time : 0.649 s
% # Total time : 25.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 34.94 CPU 36.72 WC
% FINAL PrfWatch: 34.94 CPU 36.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP21444/NUM614+1.tptp
%
%------------------------------------------------------------------------------