%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM532+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 19:56:39 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP23410/NUM532+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP23410/NUM532+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23410/NUM532+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 23506
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aSet0(xA),file('/tmp/SRASS.s.p', m__467)).
% fof(3, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(13, conjecture,aSubsetOf0(xA,xA),file('/tmp/SRASS.s.p', m__)).
% fof(14, negated_conjecture,~(aSubsetOf0(xA,xA)),inference(assume_negation,[status(cth)],[13])).
% fof(20, negated_conjecture,~(aSubsetOf0(xA,xA)),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% cnf(21,plain,(aSet0(xA)),inference(split_conjunct,[status(thm)],[1])).
% fof(26, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(27, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk1_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk1_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(aSubsetOf0(X2,X1)|~aSet0(X1)|~aSet0(X2)|~aElementOf0(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(aSubsetOf0(X2,X1)|aElementOf0(esk1_2(X1,X2),X2)|~aSet0(X1)|~aSet0(X2)),inference(split_conjunct,[status(thm)],[30])).
% cnf(62,negated_conjecture,(~aSubsetOf0(xA,xA)),inference(split_conjunct,[status(thm)],[20])).
% cnf(68,plain,(aSubsetOf0(X1,X1)|~aSet0(X1)),inference(spm,[status(thm)],[31,32,theory(equality)])).
% cnf(77,negated_conjecture,(~aSet0(xA)),inference(spm,[status(thm)],[62,68,theory(equality)])).
% cnf(81,negated_conjecture,($false),inference(rw,[status(thm)],[77,21,theory(equality)])).
% cnf(82,negated_conjecture,($false),inference(cn,[status(thm)],[81,theory(equality)])).
% cnf(83,negated_conjecture,($false),82,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 31
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 13
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 3
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 10
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 16 leaves, 1.56+/-0.864 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 13 leaves, 1.38+/-0.625 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP23410/NUM532+1.tptp
%
%------------------------------------------------------------------------------