TSTP Solution File: SET903+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET903+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 : art01.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 00:17:26 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP31915/SET903+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31915/SET903+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31915/SET903+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 32011
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:~((((singleton(X1)=set_union2(X2,X3)&~((X2=singleton(X1)&X3=singleton(X1))))&~((X2=empty_set&X3=singleton(X1))))&~((X2=singleton(X1)&X3=empty_set)))),file('/tmp/SRASS.s.p', t43_zfmisc_1)).
% fof(9, conjecture,![X1]:![X2]:![X3]:~((((singleton(X1)=set_union2(X2,X3)&~(X2=X3))&~(X2=empty_set))&~(X3=empty_set))),file('/tmp/SRASS.s.p', t44_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:~((((singleton(X1)=set_union2(X2,X3)&~(X2=X3))&~(X2=empty_set))&~(X3=empty_set)))),inference(assume_negation,[status(cth)],[9])).
% fof(18, plain,![X1]:![X2]:![X3]:(((~(singleton(X1)=set_union2(X2,X3))|(X2=singleton(X1)&X3=singleton(X1)))|(X2=empty_set&X3=singleton(X1)))|(X2=singleton(X1)&X3=empty_set)),inference(fof_nnf,[status(thm)],[3])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(singleton(X4)=set_union2(X5,X6))|(X5=singleton(X4)&X6=singleton(X4)))|(X5=empty_set&X6=singleton(X4)))|(X5=singleton(X4)&X6=empty_set)),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:((((X5=singleton(X4)|(X5=empty_set|(X5=singleton(X4)|~(singleton(X4)=set_union2(X5,X6)))))&(X6=empty_set|(X5=empty_set|(X5=singleton(X4)|~(singleton(X4)=set_union2(X5,X6))))))&((X5=singleton(X4)|(X6=singleton(X4)|(X5=singleton(X4)|~(singleton(X4)=set_union2(X5,X6)))))&(X6=empty_set|(X6=singleton(X4)|(X5=singleton(X4)|~(singleton(X4)=set_union2(X5,X6)))))))&(((X5=singleton(X4)|(X5=empty_set|(X6=singleton(X4)|~(singleton(X4)=set_union2(X5,X6)))))&(X6=empty_set|(X5=empty_set|(X6=singleton(X4)|~(singleton(X4)=set_union2(X5,X6))))))&((X5=singleton(X4)|(X6=singleton(X4)|(X6=singleton(X4)|~(singleton(X4)=set_union2(X5,X6)))))&(X6=empty_set|(X6=singleton(X4)|(X6=singleton(X4)|~(singleton(X4)=set_union2(X5,X6)))))))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(X3=singleton(X1)|X3=singleton(X1)|X3=empty_set|singleton(X1)!=set_union2(X2,X3)),inference(split_conjunct,[status(thm)],[20])).
% cnf(28,plain,(X2=singleton(X1)|X2=empty_set|X2=singleton(X1)|singleton(X1)!=set_union2(X2,X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(42, negated_conjecture,?[X1]:?[X2]:?[X3]:(((singleton(X1)=set_union2(X2,X3)&~(X2=X3))&~(X2=empty_set))&~(X3=empty_set)),inference(fof_nnf,[status(thm)],[10])).
% fof(43, negated_conjecture,?[X4]:?[X5]:?[X6]:(((singleton(X4)=set_union2(X5,X6)&~(X5=X6))&~(X5=empty_set))&~(X6=empty_set)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(((singleton(esk3_0)=set_union2(esk4_0,esk5_0)&~(esk4_0=esk5_0))&~(esk4_0=empty_set))&~(esk5_0=empty_set)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(esk5_0!=empty_set),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(esk4_0!=empty_set),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(48,negated_conjecture,(singleton(esk3_0)=set_union2(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(53,negated_conjecture,(singleton(X1)=esk5_0|empty_set=esk5_0|singleton(esk3_0)!=singleton(X1)),inference(spm,[status(thm)],[21,48,theory(equality)])).
% cnf(57,negated_conjecture,(singleton(X1)=esk5_0|singleton(esk3_0)!=singleton(X1)),inference(sr,[status(thm)],[53,45,theory(equality)])).
% cnf(79,negated_conjecture,(singleton(esk3_0)=esk5_0),inference(er,[status(thm)],[57,theory(equality)])).
% cnf(81,negated_conjecture,(set_union2(esk4_0,esk5_0)=esk5_0),inference(rw,[status(thm)],[48,79,theory(equality)])).
% cnf(84,negated_conjecture,(singleton(X1)=esk4_0|empty_set=esk4_0|esk5_0!=singleton(X1)),inference(spm,[status(thm)],[28,81,theory(equality)])).
% cnf(87,negated_conjecture,(singleton(X1)=esk4_0|singleton(X1)!=esk5_0),inference(sr,[status(thm)],[84,46,theory(equality)])).
% cnf(88,negated_conjecture,(esk5_0=esk4_0),inference(spm,[status(thm)],[87,79,theory(equality)])).
% cnf(89,negated_conjecture,($false),inference(sr,[status(thm)],[88,47,theory(equality)])).
% cnf(90,negated_conjecture,($false),89,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 18
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 29
% # ...of the previous two non-trivial : 19
% # Contextual simplify-reflections : 4
% # Paramodulations : 28
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 28
% # Clause-clause subsumption calls (NU) : 21
% # Rec. Clause-clause subsumption calls : 21
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 16 leaves, 1.31+/-0.982 terms/leaf
% # Paramod-from index: 5 leaves, 1.40+/-0.800 terms/leaf
% # Paramod-into index: 14 leaves, 1.36+/-1.042 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.006 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31915/SET903+1.tptp
%
%------------------------------------------------------------------------------