TSTP Solution File: SEU161+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU161+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:22:02 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP22560/SEU161+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22560/SEU161+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22560/SEU161+2.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 22656
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.024 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(6, axiom,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', l23_zfmisc_1)).
% fof(20, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(91, conjecture,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', t46_zfmisc_1)).
% fof(92, negated_conjecture,~(![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2)),inference(assume_negation,[status(cth)],[91])).
% fof(132, plain,![X1]:![X2]:(~(in(X1,X2))|set_union2(singleton(X1),X2)=X2),inference(fof_nnf,[status(thm)],[6])).
% fof(133, plain,![X3]:![X4]:(~(in(X3,X4))|set_union2(singleton(X3),X4)=X4),inference(variable_rename,[status(thm)],[132])).
% cnf(134,plain,(set_union2(singleton(X1),X2)=X2|~in(X1,X2)),inference(split_conjunct,[status(thm)],[133])).
% fof(186, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[20])).
% cnf(187,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[186])).
% fof(436, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&~(set_union2(singleton(X1),X2)=X2)),inference(fof_nnf,[status(thm)],[92])).
% fof(437, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&~(set_union2(singleton(X3),X4)=X4)),inference(variable_rename,[status(thm)],[436])).
% fof(438, negated_conjecture,(in(esk22_0,esk23_0)&~(set_union2(singleton(esk22_0),esk23_0)=esk23_0)),inference(skolemize,[status(esa)],[437])).
% cnf(439,negated_conjecture,(set_union2(singleton(esk22_0),esk23_0)!=esk23_0),inference(split_conjunct,[status(thm)],[438])).
% cnf(440,negated_conjecture,(in(esk22_0,esk23_0)),inference(split_conjunct,[status(thm)],[438])).
% cnf(452,plain,(set_union2(unordered_pair(X1,X1),X2)=X2|~in(X1,X2)),inference(rw,[status(thm)],[134,187,theory(equality)]),['unfolding']).
% cnf(464,negated_conjecture,(set_union2(unordered_pair(esk22_0,esk22_0),esk23_0)!=esk23_0),inference(rw,[status(thm)],[439,187,theory(equality)]),['unfolding']).
% cnf(580,negated_conjecture,(~in(esk22_0,esk23_0)),inference(spm,[status(thm)],[464,452,theory(equality)])).
% cnf(585,negated_conjecture,($false),inference(rw,[status(thm)],[580,440,theory(equality)])).
% cnf(586,negated_conjecture,($false),inference(cn,[status(thm)],[585,theory(equality)])).
% cnf(587,negated_conjecture,($false),586,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 178
% # ...of these trivial : 1
% # ...subsumed : 12
% # ...remaining for further processing: 165
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 74
% # ...of the previous two non-trivial : 54
% # Contextual simplify-reflections : 0
% # Paramodulations : 64
% # Factorizations : 0
% # Equation resolutions : 10
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 4
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 147
% # ...number of literals in the above : 337
% # Clause-clause subsumption calls (NU) : 291
% # Rec. Clause-clause subsumption calls : 236
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 4
% # Indexed BW rewrite attempts : 38
% # Indexed BW rewrite successes : 29
% # Backwards rewriting index: 31 leaves, 1.35+/-1.123 terms/leaf
% # Paramod-from index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-into index: 29 leaves, 1.34+/-1.153 terms/leaf
% # -------------------------------------------------
% # User time : 0.032 s
% # System time : 0.005 s
% # Total time : 0.037 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP22560/SEU161+2.tptp
%
%------------------------------------------------------------------------------