TSTP Solution File: SEU115+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU115+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 : art04.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:08:47 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP13894/SEU115+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13894/SEU115+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13894/SEU115+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 13990
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,powerset(empty_set)=singleton(empty_set),file('/tmp/SRASS.s.p', t1_zfmisc_1)).
% fof(5, axiom,empty(empty_set),file('/tmp/SRASS.s.p', fc1_xboole_0)).
% fof(6, axiom,![X1]:(finite(X1)=>finite_subsets(X1)=powerset(X1)),file('/tmp/SRASS.s.p', t27_finsub_1)).
% fof(16, axiom,![X1]:(empty(X1)=>finite(X1)),file('/tmp/SRASS.s.p', cc1_finset_1)).
% fof(35, conjecture,finite_subsets(empty_set)=singleton(empty_set),file('/tmp/SRASS.s.p', t28_finsub_1)).
% fof(36, negated_conjecture,~(finite_subsets(empty_set)=singleton(empty_set)),inference(assume_negation,[status(cth)],[35])).
% fof(49, negated_conjecture,~(finite_subsets(empty_set)=singleton(empty_set)),inference(fof_simplification,[status(thm)],[36,theory(equality)])).
% cnf(53,plain,(powerset(empty_set)=singleton(empty_set)),inference(split_conjunct,[status(thm)],[2])).
% cnf(59,plain,(empty(empty_set)),inference(split_conjunct,[status(thm)],[5])).
% fof(60, plain,![X1]:(~(finite(X1))|finite_subsets(X1)=powerset(X1)),inference(fof_nnf,[status(thm)],[6])).
% fof(61, plain,![X2]:(~(finite(X2))|finite_subsets(X2)=powerset(X2)),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(finite_subsets(X1)=powerset(X1)|~finite(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(92, plain,![X1]:(~(empty(X1))|finite(X1)),inference(fof_nnf,[status(thm)],[16])).
% fof(93, plain,![X2]:(~(empty(X2))|finite(X2)),inference(variable_rename,[status(thm)],[92])).
% cnf(94,plain,(finite(X1)|~empty(X1)),inference(split_conjunct,[status(thm)],[93])).
% cnf(178,negated_conjecture,(finite_subsets(empty_set)!=singleton(empty_set)),inference(split_conjunct,[status(thm)],[49])).
% cnf(179,negated_conjecture,(powerset(empty_set)!=finite_subsets(empty_set)),inference(rw,[status(thm)],[178,53,theory(equality)])).
% cnf(186,negated_conjecture,(~finite(empty_set)),inference(spm,[status(thm)],[179,62,theory(equality)])).
% cnf(237,negated_conjecture,(~empty(empty_set)),inference(spm,[status(thm)],[186,94,theory(equality)])).
% cnf(238,negated_conjecture,($false),inference(rw,[status(thm)],[237,59,theory(equality)])).
% cnf(239,negated_conjecture,($false),inference(cn,[status(thm)],[238,theory(equality)])).
% cnf(240,negated_conjecture,($false),239,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 127
% # ...of these trivial : 1
% # ...subsumed : 2
% # ...remaining for further processing: 124
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 44
% # ...of the previous two non-trivial : 30
% # Contextual simplify-reflections : 0
% # Paramodulations : 44
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 25
% # Current number of unprocessed clauses: 28
% # ...number of literals in the above : 57
% # Clause-clause subsumption calls (NU) : 18
% # Rec. Clause-clause subsumption calls : 18
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 70 leaves, 1.16+/-0.497 terms/leaf
% # Paramod-from index: 39 leaves, 1.03+/-0.158 terms/leaf
% # Paramod-into index: 66 leaves, 1.11+/-0.394 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP13894/SEU115+1.tptp
%
%------------------------------------------------------------------------------