TSTP Solution File: SEU083+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU083+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 : 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 : Thu Dec 30 01:04:35 EST 2010
% Result : Theorem 1.26s
% Output : Solution 1.26s
% 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/SystemOnTPTP9238/SEU083+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9238/SEU083+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9238/SEU083+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 9370
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(X2))=>finite(set_union2(X1,X2))),file('/tmp/SRASS.s.p', fc9_finset_1)).
% fof(62, conjecture,![X1]:![X2]:((finite(X1)&finite(X2))=>finite(set_union2(X1,X2))),file('/tmp/SRASS.s.p', t14_finset_1)).
% fof(63, negated_conjecture,~(![X1]:![X2]:((finite(X1)&finite(X2))=>finite(set_union2(X1,X2)))),inference(assume_negation,[status(cth)],[62])).
% fof(77, plain,![X1]:![X2]:((~(finite(X1))|~(finite(X2)))|finite(set_union2(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(78, plain,![X3]:![X4]:((~(finite(X3))|~(finite(X4)))|finite(set_union2(X3,X4))),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(finite(set_union2(X1,X2))|~finite(X2)|~finite(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(341, negated_conjecture,?[X1]:?[X2]:((finite(X1)&finite(X2))&~(finite(set_union2(X1,X2)))),inference(fof_nnf,[status(thm)],[63])).
% fof(342, negated_conjecture,?[X3]:?[X4]:((finite(X3)&finite(X4))&~(finite(set_union2(X3,X4)))),inference(variable_rename,[status(thm)],[341])).
% fof(343, negated_conjecture,((finite(esk27_0)&finite(esk28_0))&~(finite(set_union2(esk27_0,esk28_0)))),inference(skolemize,[status(esa)],[342])).
% cnf(344,negated_conjecture,(~finite(set_union2(esk27_0,esk28_0))),inference(split_conjunct,[status(thm)],[343])).
% cnf(345,negated_conjecture,(finite(esk28_0)),inference(split_conjunct,[status(thm)],[343])).
% cnf(346,negated_conjecture,(finite(esk27_0)),inference(split_conjunct,[status(thm)],[343])).
% cnf(618,negated_conjecture,(finite(set_union2(X1,esk28_0))|~finite(X1)),inference(pm,[status(thm)],[79,345,theory(equality)])).
% cnf(987,negated_conjecture,(finite(set_union2(esk27_0,esk28_0))),inference(pm,[status(thm)],[618,346,theory(equality)])).
% cnf(992,negated_conjecture,($false),inference(sr,[status(thm)],[987,344,theory(equality)])).
% cnf(993,negated_conjecture,($false),992,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 276
% # ...of these trivial : 19
% # ...subsumed : 22
% # ...remaining for further processing: 235
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 59
% # Generated clauses : 363
% # ...of the previous two non-trivial : 263
% # Contextual simplify-reflections : 0
% # Paramodulations : 354
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 176
% # Positive orientable unit clauses: 98
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 17
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 64
% # ...number of literals in the above : 113
% # Clause-clause subsumption calls (NU) : 76
% # Rec. Clause-clause subsumption calls : 71
% # Unit Clause-clause subsumption calls : 80
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 35
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 203 leaves, 1.08+/-0.382 terms/leaf
% # Paramod-from index: 104 leaves, 1.02+/-0.195 terms/leaf
% # Paramod-into index: 181 leaves, 1.07+/-0.342 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.008 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP9238/SEU083+1.tptp
%
%------------------------------------------------------------------------------