TSTP Solution File: SEU148+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU148+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 : art09.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:03 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP6406/SEU148+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6406/SEU148+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6406/SEU148+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 6502
% 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]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(3, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(9, conjecture,![X1]:![X2]:(subset(singleton(X1),singleton(X2))=>X1=X2),file('/tmp/SRASS.s.p', t6_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:(subset(singleton(X1),singleton(X2))=>X1=X2)),inference(assume_negation,[status(cth)],[9])).
% fof(15, plain,![X1]:![X2]:((~(subset(X1,singleton(X2)))|(X1=empty_set|X1=singleton(X2)))&((~(X1=empty_set)&~(X1=singleton(X2)))|subset(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)&~(X3=singleton(X4)))|subset(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)|subset(X3,singleton(X4)))&(~(X3=singleton(X4))|subset(X3,singleton(X4))))),inference(distribute,[status(thm)],[16])).
% cnf(20,plain,(X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[17])).
% fof(21, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[3])).
% cnf(22,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(24, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[26])).
% cnf(30,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[27])).
% cnf(31,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(42, negated_conjecture,?[X1]:?[X2]:(subset(singleton(X1),singleton(X2))&~(X1=X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(43, negated_conjecture,?[X3]:?[X4]:(subset(singleton(X3),singleton(X4))&~(X3=X4)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(subset(singleton(esk4_0),singleton(esk5_0))&~(esk4_0=esk5_0)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(subset(singleton(esk4_0),singleton(esk5_0))),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[30,theory(equality)])).
% cnf(48,negated_conjecture,(singleton(esk5_0)=singleton(esk4_0)|empty_set=singleton(esk4_0)),inference(spm,[status(thm)],[20,46,theory(equality)])).
% cnf(51,negated_conjecture,(singleton(esk5_0)=singleton(esk4_0)),inference(sr,[status(thm)],[48,22,theory(equality)])).
% cnf(57,plain,(X1=X2|singleton(X1)!=X3|singleton(X2)!=X3),inference(spm,[status(thm)],[31,47,theory(equality)])).
% cnf(69,plain,(X1=X2|singleton(X2)!=singleton(X1)),inference(er,[status(thm)],[57,theory(equality)])).
% cnf(72,negated_conjecture,(esk5_0=X1|singleton(X1)!=singleton(esk4_0)),inference(spm,[status(thm)],[69,51,theory(equality)])).
% cnf(77,negated_conjecture,(esk5_0=esk4_0),inference(er,[status(thm)],[72,theory(equality)])).
% cnf(78,negated_conjecture,($false),inference(sr,[status(thm)],[77,45,theory(equality)])).
% cnf(79,negated_conjecture,($false),78,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 0
% # ...subsumed : 5
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 29
% # ...of the previous two non-trivial : 24
% # Contextual simplify-reflections : 0
% # Paramodulations : 22
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 7
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 20
% # Rec. Clause-clause subsumption calls : 19
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 20 leaves, 1.25+/-0.622 terms/leaf
% # Paramod-from index: 7 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 19 leaves, 1.26+/-0.636 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP6406/SEU148+3.tptp
%
%------------------------------------------------------------------------------