TSTP Solution File: SEU085+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU085+1 : TPTP v5.0.0. Released v3.2.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 01:00:03 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP2980/SEU085+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2980/SEU085+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2980/SEU085+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 3076
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(finite(X1)=>finite(set_difference(X1,X2))),file('/tmp/SRASS.s.p', fc12_finset_1)).
% fof(60, conjecture,![X1]:![X2]:(finite(X1)=>finite(set_difference(X1,X2))),file('/tmp/SRASS.s.p', t16_finset_1)).
% fof(61, negated_conjecture,~(![X1]:![X2]:(finite(X1)=>finite(set_difference(X1,X2)))),inference(assume_negation,[status(cth)],[60])).
% fof(73, plain,![X1]:![X2]:(~(finite(X1))|finite(set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(74, plain,![X3]:![X4]:(~(finite(X3))|finite(set_difference(X3,X4))),inference(variable_rename,[status(thm)],[73])).
% cnf(75,plain,(finite(set_difference(X1,X2))|~finite(X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(331, negated_conjecture,?[X1]:?[X2]:(finite(X1)&~(finite(set_difference(X1,X2)))),inference(fof_nnf,[status(thm)],[61])).
% fof(332, negated_conjecture,?[X3]:?[X4]:(finite(X3)&~(finite(set_difference(X3,X4)))),inference(variable_rename,[status(thm)],[331])).
% fof(333, negated_conjecture,(finite(esk27_0)&~(finite(set_difference(esk27_0,esk28_0)))),inference(skolemize,[status(esa)],[332])).
% cnf(334,negated_conjecture,(~finite(set_difference(esk27_0,esk28_0))),inference(split_conjunct,[status(thm)],[333])).
% cnf(335,negated_conjecture,(finite(esk27_0)),inference(split_conjunct,[status(thm)],[333])).
% cnf(605,negated_conjecture,(finite(set_difference(esk27_0,X1))),inference(pm,[status(thm)],[75,335,theory(equality)])).
% cnf(967,negated_conjecture,($false),inference(rw,[status(thm)],[334,605,theory(equality)])).
% cnf(968,negated_conjecture,($false),inference(cn,[status(thm)],[967,theory(equality)])).
% cnf(969,negated_conjecture,($false),968,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 278
% # ...of these trivial : 20
% # ...subsumed : 24
% # ...remaining for further processing: 234
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 60
% # Generated clauses : 353
% # ...of the previous two non-trivial : 260
% # Contextual simplify-reflections : 0
% # Paramodulations : 344
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 174
% # Positive orientable unit clauses: 100
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 16
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 66
% # ...number of literals in the above : 114
% # Clause-clause subsumption calls (NU) : 65
% # Rec. Clause-clause subsumption calls : 58
% # Unit Clause-clause subsumption calls : 101
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 22
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 205 leaves, 1.07+/-0.350 terms/leaf
% # Paramod-from index: 106 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 183 leaves, 1.04+/-0.284 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.005 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP2980/SEU085+1.tptp
%
%------------------------------------------------------------------------------