%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM607+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 : art09.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:36:22 EST 2010
% Result : Theorem 13.91s
% Output : Solution 13.91s
% 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/SystemOnTPTP22079/NUM607+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22079/NUM607+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22079/NUM607+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 22175
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.90 CPU 10.03 WC
% # Preprocessing time : 0.619 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.89 CPU 12.04 WC
% # SZS output start CNFRefutation.
% fof(82, axiom,(![X1]:(aElementOf0(X1,xO)=>aElementOf0(X1,xS))&aSubsetOf0(xO,xS)),file('/tmp/SRASS.s.p', m__4998)).
% 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(102, conjecture,((((![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS))|aSubsetOf0(xQ,xS))|![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS)))|aSubsetOf0(xQ,xS))|aElementOf0(xQ,szDzozmdt0(xc))),file('/tmp/SRASS.s.p', m__)).
% fof(103, negated_conjecture,~(((((![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS))|aSubsetOf0(xQ,xS))|![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS)))|aSubsetOf0(xQ,xS))|aElementOf0(xQ,szDzozmdt0(xc)))),inference(assume_negation,[status(cth)],[102])).
% fof(4574, plain,(![X1]:(~(aElementOf0(X1,xO))|aElementOf0(X1,xS))&aSubsetOf0(xO,xS)),inference(fof_nnf,[status(thm)],[82])).
% fof(4575, plain,(![X2]:(~(aElementOf0(X2,xO))|aElementOf0(X2,xS))&aSubsetOf0(xO,xS)),inference(variable_rename,[status(thm)],[4574])).
% fof(4576, plain,![X2]:((~(aElementOf0(X2,xO))|aElementOf0(X2,xS))&aSubsetOf0(xO,xS)),inference(shift_quantors,[status(thm)],[4575])).
% cnf(4578,plain,(aElementOf0(X1,xS)|~aElementOf0(X1,xO)),inference(split_conjunct,[status(thm)],[4576])).
% fof(4579, 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(4580, 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)],[4579])).
% fof(4581, 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)],[4580])).
% cnf(4586,plain,(aElementOf0(X1,xO)|~aElementOf0(X1,xQ)),inference(split_conjunct,[status(thm)],[4581])).
% fof(4668, negated_conjecture,((((?[X1]:(aElementOf0(X1,xQ)&~(aElementOf0(X1,xS)))&~(aSubsetOf0(xQ,xS)))&?[X1]:(aElementOf0(X1,xQ)&~(aElementOf0(X1,xS))))&~(aSubsetOf0(xQ,xS)))&~(aElementOf0(xQ,szDzozmdt0(xc)))),inference(fof_nnf,[status(thm)],[103])).
% fof(4669, negated_conjecture,((((?[X2]:(aElementOf0(X2,xQ)&~(aElementOf0(X2,xS)))&~(aSubsetOf0(xQ,xS)))&?[X3]:(aElementOf0(X3,xQ)&~(aElementOf0(X3,xS))))&~(aSubsetOf0(xQ,xS)))&~(aElementOf0(xQ,szDzozmdt0(xc)))),inference(variable_rename,[status(thm)],[4668])).
% fof(4670, negated_conjecture,(((((aElementOf0(esk40_0,xQ)&~(aElementOf0(esk40_0,xS)))&~(aSubsetOf0(xQ,xS)))&(aElementOf0(esk41_0,xQ)&~(aElementOf0(esk41_0,xS))))&~(aSubsetOf0(xQ,xS)))&~(aElementOf0(xQ,szDzozmdt0(xc)))),inference(skolemize,[status(esa)],[4669])).
% cnf(4673,negated_conjecture,(~aElementOf0(esk41_0,xS)),inference(split_conjunct,[status(thm)],[4670])).
% cnf(4674,negated_conjecture,(aElementOf0(esk41_0,xQ)),inference(split_conjunct,[status(thm)],[4670])).
% cnf(8433,negated_conjecture,(~aElementOf0(esk41_0,xO)),inference(spm,[status(thm)],[4673,4578,theory(equality)])).
% cnf(80457,negated_conjecture,(~aElementOf0(esk41_0,xQ)),inference(spm,[status(thm)],[8433,4586,theory(equality)])).
% cnf(80458,negated_conjecture,($false),inference(rw,[status(thm)],[80457,4674,theory(equality)])).
% cnf(80459,negated_conjecture,($false),inference(cn,[status(thm)],[80458,theory(equality)])).
% cnf(80460,negated_conjecture,($false),80459,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6606
% # ...of these trivial : 2
% # ...subsumed : 529
% # ...remaining for further processing: 6075
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 56554
% # ...of the previous two non-trivial : 47880
% # Contextual simplify-reflections : 3069
% # Paramodulations : 56504
% # Factorizations : 0
% # Equation resolutions : 45
% # Current number of processed clauses: 3035
% # Positive orientable unit clauses: 45
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 2983
% # Current number of unprocessed clauses: 47868
% # ...number of literals in the above : 715146
% # Clause-clause subsumption calls (NU) : 1713675
% # Rec. Clause-clause subsumption calls : 45078
% # Unit Clause-clause subsumption calls : 2636
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 359 leaves, 2.30+/-2.951 terms/leaf
% # Paramod-from index: 157 leaves, 1.01+/-0.112 terms/leaf
% # Paramod-into index: 314 leaves, 1.64+/-1.595 terms/leaf
% # -------------------------------------------------
% # User time : 9.877 s
% # System time : 0.165 s
% # Total time : 10.042 s
% # Maximum resident set size: 0 pages
% PrfWatch: 12.84 CPU 13.00 WC
% FINAL PrfWatch: 12.84 CPU 13.00 WC
% SZS output end Solution for /tmp/SystemOnTPTP22079/NUM607+3.tptp
%
%------------------------------------------------------------------------------