TSTP Solution File: SET891+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET891+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:20:59 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP31378/SET891+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31378/SET891+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31378/SET891+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 31510
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:union(unordered_pair(X1,X2))=set_union2(X1,X2),file('/tmp/SRASS.s.p', l52_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:unordered_pair(X1,X2)=set_union2(singleton(X1),singleton(X2)),file('/tmp/SRASS.s.p', t41_enumset1)).
% fof(10, conjecture,![X1]:![X2]:union(unordered_pair(singleton(X1),singleton(X2)))=unordered_pair(X1,X2),file('/tmp/SRASS.s.p', t32_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:union(unordered_pair(singleton(X1),singleton(X2)))=unordered_pair(X1,X2)),inference(assume_negation,[status(cth)],[10])).
% fof(17, plain,![X3]:![X4]:union(unordered_pair(X3,X4))=set_union2(X3,X4),inference(variable_rename,[status(thm)],[2])).
% cnf(18,plain,(union(unordered_pair(X1,X2))=set_union2(X1,X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:unordered_pair(X3,X4)=set_union2(singleton(X3),singleton(X4)),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(unordered_pair(X1,X2)=set_union2(singleton(X1),singleton(X2))),inference(split_conjunct,[status(thm)],[19])).
% fof(37, negated_conjecture,?[X1]:?[X2]:~(union(unordered_pair(singleton(X1),singleton(X2)))=unordered_pair(X1,X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(38, negated_conjecture,?[X3]:?[X4]:~(union(unordered_pair(singleton(X3),singleton(X4)))=unordered_pair(X3,X4)),inference(variable_rename,[status(thm)],[37])).
% fof(39, negated_conjecture,~(union(unordered_pair(singleton(esk3_0),singleton(esk4_0)))=unordered_pair(esk3_0,esk4_0)),inference(skolemize,[status(esa)],[38])).
% cnf(40,negated_conjecture,(union(unordered_pair(singleton(esk3_0),singleton(esk4_0)))!=unordered_pair(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(43,plain,(union(unordered_pair(singleton(X1),singleton(X2)))=unordered_pair(X1,X2)),inference(rw,[status(thm)],[20,18,theory(equality)]),['unfolding']).
% cnf(53,negated_conjecture,($false),inference(rw,[status(thm)],[40,43,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(cn,[status(thm)],[53,theory(equality)])).
% cnf(55,negated_conjecture,($false),54,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 6
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 5
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 5
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 5
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 5
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 10 leaves, 1.30+/-0.640 terms/leaf
% # Paramod-from index: 4 leaves, 1.25+/-0.433 terms/leaf
% # Paramod-into index: 9 leaves, 1.33+/-0.667 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.005 s
% # Total time : 0.012 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/SystemOnTPTP31378/SET891+1.tptp
%
%------------------------------------------------------------------------------