TSTP Solution File: SET987+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET987+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 00:34:55 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP7041/SET987+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7041/SET987+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7041/SET987+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 7173
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2),file('/tmp/SRASS.s.p', t40_xboole_1)).
% fof(5, axiom,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),file('/tmp/SRASS.s.p', t65_zfmisc_1)).
% fof(10, conjecture,![X1]:![X2]:(~(in(X1,X2))=>set_difference(set_union2(X2,singleton(X1)),singleton(X1))=X2),file('/tmp/SRASS.s.p', t141_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:(~(in(X1,X2))=>set_difference(set_union2(X2,singleton(X1)),singleton(X1))=X2)),inference(assume_negation,[status(cth)],[10])).
% fof(13, plain,![X1]:![X2]:(set_difference(X1,singleton(X2))=X1<=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(17, negated_conjecture,~(![X1]:![X2]:(~(in(X1,X2))=>set_difference(set_union2(X2,singleton(X1)),singleton(X1))=X2)),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(25, plain,![X3]:![X4]:set_difference(set_union2(X3,X4),X4)=set_difference(X3,X4),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:((~(set_difference(X1,singleton(X2))=X1)|~(in(X2,X1)))&(in(X2,X1)|set_difference(X1,singleton(X2))=X1)),inference(fof_nnf,[status(thm)],[13])).
% fof(28, plain,![X3]:![X4]:((~(set_difference(X3,singleton(X4))=X3)|~(in(X4,X3)))&(in(X4,X3)|set_difference(X3,singleton(X4))=X3)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(set_difference(X1,singleton(X2))=X1|in(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(43, negated_conjecture,?[X1]:?[X2]:(~(in(X1,X2))&~(set_difference(set_union2(X2,singleton(X1)),singleton(X1))=X2)),inference(fof_nnf,[status(thm)],[17])).
% fof(44, negated_conjecture,?[X3]:?[X4]:(~(in(X3,X4))&~(set_difference(set_union2(X4,singleton(X3)),singleton(X3))=X4)),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,(~(in(esk3_0,esk4_0))&~(set_difference(set_union2(esk4_0,singleton(esk3_0)),singleton(esk3_0))=esk4_0)),inference(skolemize,[status(esa)],[44])).
% cnf(46,negated_conjecture,(set_difference(set_union2(esk4_0,singleton(esk3_0)),singleton(esk3_0))!=esk4_0),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,negated_conjecture,(~in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,negated_conjecture,(set_difference(esk4_0,singleton(esk3_0))!=esk4_0),inference(rw,[status(thm)],[46,26,theory(equality)])).
% cnf(55,negated_conjecture,(in(esk3_0,esk4_0)),inference(spm,[status(thm)],[48,29,theory(equality)])).
% cnf(57,negated_conjecture,($false),inference(sr,[status(thm)],[55,47,theory(equality)])).
% cnf(58,negated_conjecture,($false),57,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 21
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 6
% # ...of the previous two non-trivial : 3
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 10
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 16 leaves, 1.12+/-0.484 terms/leaf
% # Paramod-from index: 4 leaves, 1.50+/-0.866 terms/leaf
% # Paramod-into index: 13 leaves, 1.15+/-0.533 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.002 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP7041/SET987+1.tptp
%
%------------------------------------------------------------------------------