%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM605+3 : 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 20:40:26 EST 2010
% Result : Theorem 5.17s
% Output : Solution 5.17s
% 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/SystemOnTPTP12188/NUM605+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12188/NUM605+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12188/NUM605+3.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 12320
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.582 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(36, axiom,![X1]:(aSet0(X1)=>(sbrdtbr0(X1)=sz00<=>X1=slcrc0)),file('/tmp/SRASS.s.p', mCardEmpty)).
% fof(62, axiom,~(xK=sz00),file('/tmp/SRASS.s.p', m__3462)).
% fof(83, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),file('/tmp/SRASS.s.p', m__5078)).
% fof(100, conjecture,~((~(?[X1]:aElementOf0(X1,xQ))&xQ=slcrc0)),file('/tmp/SRASS.s.p', m__)).
% fof(101, negated_conjecture,~(~((~(?[X1]:aElementOf0(X1,xQ))&xQ=slcrc0))),inference(assume_negation,[status(cth)],[100])).
% fof(126, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[2])).
% fof(127, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[126])).
% fof(128, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[127])).
% fof(129, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[128])).
% fof(130, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[129])).
% cnf(132,plain,(aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[130])).
% fof(271, plain,![X1]:(~(aSet0(X1))|((~(sbrdtbr0(X1)=sz00)|X1=slcrc0)&(~(X1=slcrc0)|sbrdtbr0(X1)=sz00))),inference(fof_nnf,[status(thm)],[36])).
% fof(272, plain,![X2]:(~(aSet0(X2))|((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)&(~(X2=slcrc0)|sbrdtbr0(X2)=sz00))),inference(variable_rename,[status(thm)],[271])).
% fof(273, plain,![X2]:(((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)|~(aSet0(X2)))&((~(X2=slcrc0)|sbrdtbr0(X2)=sz00)|~(aSet0(X2)))),inference(distribute,[status(thm)],[272])).
% cnf(274,plain,(sbrdtbr0(X1)=sz00|~aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[273])).
% cnf(4398,plain,(xK!=sz00),inference(split_conjunct,[status(thm)],[62])).
% fof(4577, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(fof_nnf,[status(thm)],[83])).
% fof(4578, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(variable_rename,[status(thm)],[4577])).
% fof(4579, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xO))&aSet0(xQ))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(shift_quantors,[status(thm)],[4578])).
% cnf(4581,plain,(sbrdtbr0(xQ)=xK),inference(split_conjunct,[status(thm)],[4579])).
% fof(4654, negated_conjecture,(![X1]:~(aElementOf0(X1,xQ))&xQ=slcrc0),inference(fof_nnf,[status(thm)],[101])).
% fof(4655, negated_conjecture,(![X2]:~(aElementOf0(X2,xQ))&xQ=slcrc0),inference(variable_rename,[status(thm)],[4654])).
% fof(4656, negated_conjecture,![X2]:(~(aElementOf0(X2,xQ))&xQ=slcrc0),inference(shift_quantors,[status(thm)],[4655])).
% cnf(4657,negated_conjecture,(xQ=slcrc0),inference(split_conjunct,[status(thm)],[4656])).
% cnf(5313,plain,(aSet0(X1)|xQ!=X1),inference(rw,[status(thm)],[132,4657,theory(equality)])).
% cnf(5314,plain,(sbrdtbr0(X1)=sz00|xQ!=X1|~aSet0(X1)),inference(rw,[status(thm)],[274,4657,theory(equality)])).
% cnf(5315,plain,(sbrdtbr0(X1)=sz00|xQ!=X1),inference(csr,[status(thm)],[5314,5313])).
% cnf(8444,plain,(sz00=xK),inference(spm,[status(thm)],[4581,5315,theory(equality)])).
% cnf(8445,plain,($false),inference(sr,[status(thm)],[8444,4398,theory(equality)])).
% cnf(8446,plain,($false),8445,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3607
% # ...of these trivial : 2
% # ...subsumed : 528
% # ...remaining for further processing: 3077
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 19
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 3069
% # Paramodulations : 11
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 46
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 2986
% # ...number of literals in the above : 33620
% # Clause-clause subsumption calls (NU) : 858717
% # Rec. Clause-clause subsumption calls : 25092
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 63 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 40 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 59 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 2.975 s
% # System time : 0.037 s
% # Total time : 3.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.92 CPU 4.00 WC
% FINAL PrfWatch: 3.92 CPU 4.00 WC
% SZS output end Solution for /tmp/SystemOnTPTP12188/NUM605+3.tptp
%
%------------------------------------------------------------------------------