%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU306+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 : Thu Dec 30 03:21:38 EST 2010
% Result : Theorem 12.47s
% Output : Solution 12.47s
% 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/SystemOnTPTP5103/SEU306+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5103/SEU306+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5103/SEU306+2.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 5261
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.209 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1)),file('/tmp/SRASS.s.p', d3_pre_topc)).
% fof(474, conjecture,![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1)),file('/tmp/SRASS.s.p', t12_pre_topc)).
% fof(475, negated_conjecture,~(![X1]:(one_sorted_str(X1)=>cast_as_carrier_subset(X1)=the_carrier(X1))),inference(assume_negation,[status(cth)],[474])).
% fof(555, plain,![X1]:(~(one_sorted_str(X1))|cast_as_carrier_subset(X1)=the_carrier(X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(556, plain,![X2]:(~(one_sorted_str(X2))|cast_as_carrier_subset(X2)=the_carrier(X2)),inference(variable_rename,[status(thm)],[555])).
% cnf(557,plain,(cast_as_carrier_subset(X1)=the_carrier(X1)|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[556])).
% fof(3562, negated_conjecture,?[X1]:(one_sorted_str(X1)&~(cast_as_carrier_subset(X1)=the_carrier(X1))),inference(fof_nnf,[status(thm)],[475])).
% fof(3563, negated_conjecture,?[X2]:(one_sorted_str(X2)&~(cast_as_carrier_subset(X2)=the_carrier(X2))),inference(variable_rename,[status(thm)],[3562])).
% fof(3564, negated_conjecture,(one_sorted_str(esk310_0)&~(cast_as_carrier_subset(esk310_0)=the_carrier(esk310_0))),inference(skolemize,[status(esa)],[3563])).
% cnf(3565,negated_conjecture,(cast_as_carrier_subset(esk310_0)!=the_carrier(esk310_0)),inference(split_conjunct,[status(thm)],[3564])).
% cnf(3566,negated_conjecture,(one_sorted_str(esk310_0)),inference(split_conjunct,[status(thm)],[3564])).
% cnf(5053,negated_conjecture,(~one_sorted_str(esk310_0)),inference(spm,[status(thm)],[3565,557,theory(equality)])).
% cnf(5054,negated_conjecture,($false),inference(rw,[status(thm)],[5053,3566,theory(equality)])).
% cnf(5055,negated_conjecture,($false),inference(cn,[status(thm)],[5054,theory(equality)])).
% cnf(5056,negated_conjecture,($false),5055,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1928
% # ...of these trivial : 10
% # ...subsumed : 74
% # ...remaining for further processing: 1844
% # Other redundant clauses eliminated : 183
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 137
% # ...of the previous two non-trivial : 134
% # Contextual simplify-reflections : 219
% # Paramodulations : 1
% # Factorizations : 0
% # Equation resolutions : 183
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 1696
% # ...number of literals in the above : 7165
% # Clause-clause subsumption calls (NU) : 948733
% # Rec. Clause-clause subsumption calls : 50149
% # Unit Clause-clause subsumption calls : 40
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 17
% # Indexed BW rewrite successes : 14
% # Backwards rewriting index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 5 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 10 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 1.125 s
% # System time : 0.033 s
% # Total time : 1.158 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.48 CPU 1.90 WC
% FINAL PrfWatch: 1.48 CPU 1.90 WC
% SZS output end Solution for /tmp/SystemOnTPTP5103/SEU306+2.tptp
%
%------------------------------------------------------------------------------