TSTP Solution File: SEU294+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU294+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:10:00 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP14932/SEU294+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14932/SEU294+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14932/SEU294+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 15031
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(9, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(10, axiom,![X1]:(finite(X1)=>![X2]:(element(X2,powerset(X1))=>finite(X2))),file('/tmp/SRASS.s.p', cc2_finset_1)).
% fof(48, conjecture,![X1]:![X2]:((subset(X1,X2)&finite(X2))=>finite(X1)),file('/tmp/SRASS.s.p', t13_finset_1)).
% fof(49, negated_conjecture,~(![X1]:![X2]:((subset(X1,X2)&finite(X2))=>finite(X1))),inference(assume_negation,[status(cth)],[48])).
% fof(87, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(88, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[87])).
% cnf(89,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(91, plain,![X1]:(~(finite(X1))|![X2]:(~(element(X2,powerset(X1)))|finite(X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(92, plain,![X3]:(~(finite(X3))|![X4]:(~(element(X4,powerset(X3)))|finite(X4))),inference(variable_rename,[status(thm)],[91])).
% fof(93, plain,![X3]:![X4]:((~(element(X4,powerset(X3)))|finite(X4))|~(finite(X3))),inference(shift_quantors,[status(thm)],[92])).
% cnf(94,plain,(finite(X2)|~finite(X1)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[93])).
% fof(255, negated_conjecture,?[X1]:?[X2]:((subset(X1,X2)&finite(X2))&~(finite(X1))),inference(fof_nnf,[status(thm)],[49])).
% fof(256, negated_conjecture,?[X3]:?[X4]:((subset(X3,X4)&finite(X4))&~(finite(X3))),inference(variable_rename,[status(thm)],[255])).
% fof(257, negated_conjecture,((subset(esk20_0,esk21_0)&finite(esk21_0))&~(finite(esk20_0))),inference(skolemize,[status(esa)],[256])).
% cnf(258,negated_conjecture,(~finite(esk20_0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(259,negated_conjecture,(finite(esk21_0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(260,negated_conjecture,(subset(esk20_0,esk21_0)),inference(split_conjunct,[status(thm)],[257])).
% cnf(279,negated_conjecture,(element(esk20_0,powerset(esk21_0))),inference(spm,[status(thm)],[89,260,theory(equality)])).
% cnf(411,negated_conjecture,(finite(esk20_0)|~finite(esk21_0)),inference(spm,[status(thm)],[94,279,theory(equality)])).
% cnf(414,negated_conjecture,(finite(esk20_0)|$false),inference(rw,[status(thm)],[411,259,theory(equality)])).
% cnf(415,negated_conjecture,(finite(esk20_0)),inference(cn,[status(thm)],[414,theory(equality)])).
% cnf(416,negated_conjecture,($false),inference(sr,[status(thm)],[415,258,theory(equality)])).
% cnf(417,negated_conjecture,($false),416,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 221
% # ...of these trivial : 6
% # ...subsumed : 2
% # ...remaining for further processing: 213
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 29
% # Generated clauses : 80
% # ...of the previous two non-trivial : 62
% # Contextual simplify-reflections : 5
% # Paramodulations : 74
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 86
% # Positive orientable unit clauses: 45
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 29
% # ...number of literals in the above : 69
% # Clause-clause subsumption calls (NU) : 45
% # Rec. Clause-clause subsumption calls : 40
% # Unit Clause-clause subsumption calls : 20
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 92 leaves, 1.13+/-0.448 terms/leaf
% # Paramod-from index: 57 leaves, 1.02+/-0.131 terms/leaf
% # Paramod-into index: 90 leaves, 1.07+/-0.327 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.006 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.19 WC
% FINAL PrfWatch: 0.13 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP14932/SEU294+1.tptp
%
%------------------------------------------------------------------------------