TSTP Solution File: SEU150+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU150+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 : art03.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:19:21 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP28771/SEU150+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP28771/SEU150+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28771/SEU150+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 28867
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(2, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(5, conjecture,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3),file('/tmp/SRASS.s.p', t9_zfmisc_1)).
% fof(6, negated_conjecture,~(![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X2=X3)),inference(assume_negation,[status(cth)],[5])).
% fof(7, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(8,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[7])).
% fof(9, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X1=X2),inference(fof_nnf,[status(thm)],[2])).
% fof(10, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X4=X5),inference(variable_rename,[status(thm)],[9])).
% cnf(11,plain,(X1=X2|singleton(X1)!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[10])).
% fof(14, negated_conjecture,?[X1]:?[X2]:?[X3]:(singleton(X1)=unordered_pair(X2,X3)&~(X2=X3)),inference(fof_nnf,[status(thm)],[6])).
% fof(15, negated_conjecture,?[X4]:?[X5]:?[X6]:(singleton(X4)=unordered_pair(X5,X6)&~(X5=X6)),inference(variable_rename,[status(thm)],[14])).
% fof(16, negated_conjecture,(singleton(esk1_0)=unordered_pair(esk2_0,esk3_0)&~(esk2_0=esk3_0)),inference(skolemize,[status(esa)],[15])).
% cnf(17,negated_conjecture,(esk2_0!=esk3_0),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,negated_conjecture,(singleton(esk1_0)=unordered_pair(esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,negated_conjecture,(esk1_0=X1|unordered_pair(X1,X2)!=unordered_pair(esk2_0,esk3_0)),inference(spm,[status(thm)],[11,18,theory(equality)])).
% cnf(20,plain,(X1=X2|unordered_pair(X3,X2)!=singleton(X1)),inference(spm,[status(thm)],[11,8,theory(equality)])).
% cnf(22,negated_conjecture,(esk1_0=esk2_0),inference(er,[status(thm)],[19,theory(equality)])).
% cnf(26,negated_conjecture,(singleton(esk2_0)=unordered_pair(esk2_0,esk3_0)),inference(rw,[status(thm)],[18,22,theory(equality)])).
% cnf(28,negated_conjecture,(esk2_0=X1|unordered_pair(X2,X1)!=unordered_pair(esk2_0,esk3_0)),inference(spm,[status(thm)],[20,26,theory(equality)])).
% cnf(34,negated_conjecture,(esk2_0=esk3_0),inference(er,[status(thm)],[28,theory(equality)])).
% cnf(37,negated_conjecture,($false),inference(sr,[status(thm)],[34,17,theory(equality)])).
% cnf(38,negated_conjecture,($false),37,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 14
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 16
% # ...of the previous two non-trivial : 14
% # Contextual simplify-reflections : 0
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 4
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 8
% # 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 : 5
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 7 leaves, 1.43+/-1.050 terms/leaf
% # Paramod-from index: 3 leaves, 1.33+/-0.471 terms/leaf
% # Paramod-into index: 7 leaves, 1.43+/-1.050 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP28771/SEU150+1.tptp
%
%------------------------------------------------------------------------------