TSTP Solution File: SET605+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET605+3 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 : Wed Dec 29 23:15:09 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP32350/SET605+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32350/SET605+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32350/SET605+3.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 32446
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', difference_empty_set)).
% fof(7, axiom,![X1]:![X2]:subset(X1,union(X1,X2)),file('/tmp/SRASS.s.p', subset_of_union)).
% fof(12, conjecture,![X1]:![X2]:difference(X1,union(X1,X2))=empty_set,file('/tmp/SRASS.s.p', prove_th76)).
% fof(13, negated_conjecture,~(![X1]:![X2]:difference(X1,union(X1,X2))=empty_set),inference(assume_negation,[status(cth)],[12])).
% fof(19, plain,![X1]:![X2]:((~(difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[2])).
% fof(20, plain,![X3]:![X4]:((~(difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[19])).
% cnf(21,plain,(difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% fof(46, plain,![X3]:![X4]:subset(X3,union(X3,X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(47,plain,(subset(X1,union(X1,X2))),inference(split_conjunct,[status(thm)],[46])).
% fof(70, negated_conjecture,?[X1]:?[X2]:~(difference(X1,union(X1,X2))=empty_set),inference(fof_nnf,[status(thm)],[13])).
% fof(71, negated_conjecture,?[X3]:?[X4]:~(difference(X3,union(X3,X4))=empty_set),inference(variable_rename,[status(thm)],[70])).
% fof(72, negated_conjecture,~(difference(esk4_0,union(esk4_0,esk5_0))=empty_set),inference(skolemize,[status(esa)],[71])).
% cnf(73,negated_conjecture,(difference(esk4_0,union(esk4_0,esk5_0))!=empty_set),inference(split_conjunct,[status(thm)],[72])).
% cnf(80,negated_conjecture,(~subset(esk4_0,union(esk4_0,esk5_0))),inference(spm,[status(thm)],[73,21,theory(equality)])).
% cnf(81,negated_conjecture,($false),inference(rw,[status(thm)],[80,47,theory(equality)])).
% cnf(82,negated_conjecture,($false),inference(cn,[status(thm)],[81,theory(equality)])).
% cnf(83,negated_conjecture,($false),82,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 29
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 5
% # ...of the previous two non-trivial : 2
% # Contextual simplify-reflections : 0
% # Paramodulations : 3
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 6
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 17
% # ...number of literals in the above : 38
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-from index: 4 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 10 leaves, 1.10+/-0.300 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.002 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP32350/SET605+3.tptp
%
%------------------------------------------------------------------------------