TSTP Solution File: SEU161+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU161+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:08 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/SystemOnTPTP21449/SEU161+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21449/SEU161+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21449/SEU161+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 21545
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', l23_zfmisc_1)).
% fof(9, conjecture,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', t46_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2)),inference(assume_negation,[status(cth)],[9])).
% fof(15, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(22, plain,![X1]:![X2]:(~(in(X1,X2))|set_union2(singleton(X1),X2)=X2),inference(fof_nnf,[status(thm)],[4])).
% fof(23, plain,![X3]:![X4]:(~(in(X3,X4))|set_union2(singleton(X3),X4)=X4),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(set_union2(singleton(X1),X2)=X2|~in(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(37, negated_conjecture,?[X1]:?[X2]:(in(X1,X2)&~(set_union2(singleton(X1),X2)=X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(38, negated_conjecture,?[X3]:?[X4]:(in(X3,X4)&~(set_union2(singleton(X3),X4)=X4)),inference(variable_rename,[status(thm)],[37])).
% fof(39, negated_conjecture,(in(esk3_0,esk4_0)&~(set_union2(singleton(esk3_0),esk4_0)=esk4_0)),inference(skolemize,[status(esa)],[38])).
% cnf(40,negated_conjecture,(set_union2(singleton(esk3_0),esk4_0)!=esk4_0),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,negated_conjecture,(in(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,negated_conjecture,(set_union2(esk4_0,singleton(esk3_0))!=esk4_0),inference(rw,[status(thm)],[40,16,theory(equality)])).
% cnf(47,plain,(X2=set_union2(X2,singleton(X1))|~in(X1,X2)),inference(spm,[status(thm)],[16,24,theory(equality)])).
% cnf(58,negated_conjecture,(~in(esk3_0,esk4_0)),inference(spm,[status(thm)],[42,47,theory(equality)])).
% cnf(64,negated_conjecture,($false),inference(rw,[status(thm)],[58,41,theory(equality)])).
% cnf(65,negated_conjecture,($false),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(66,negated_conjecture,($false),65,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 23
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 19
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 0
% # Paramodulations : 19
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 3
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 13
% # 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 : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 18 leaves, 1.28+/-0.558 terms/leaf
% # Paramod-from index: 5 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-into index: 16 leaves, 1.25+/-0.559 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.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP21449/SEU161+3.tptp
%
%------------------------------------------------------------------------------