TSTP Solution File: SET921+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET921+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 : art04.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:19:13 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/SystemOnTPTP657/SET921+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP657/SET921+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP657/SET921+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 753
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(3, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(6, conjecture,![X1]:![X2]:![X3]:(in(X1,set_difference(X2,singleton(X3)))<=>(in(X1,X2)&~(X1=X3))),file('/tmp/SRASS.s.p', t64_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:(in(X1,set_difference(X2,singleton(X3)))<=>(in(X1,X2)&~(X1=X3)))),inference(assume_negation,[status(cth)],[6])).
% fof(9, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(14, 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)],[2])).
% fof(15, 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)],[14])).
% fof(16, 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)],[15])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% cnf(21,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[18])).
% cnf(22,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(23, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&~(in(X4,X2))))&((~(in(X4,X1))|in(X4,X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|in(X4,X2)))&(in(X4,X3)|(in(X4,X1)&~(in(X4,X2)))))|X3=set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(24, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|in(X9,X6)))&(in(X9,X7)|(in(X9,X5)&~(in(X9,X6)))))|X7=set_difference(X5,X6))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))&(in(esk2_3(X5,X6,X7),X7)|(in(esk2_3(X5,X6,X7),X5)&~(in(esk2_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7)))|~(X7=set_difference(X5,X6)))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))&(in(esk2_3(X5,X6,X7),X7)|(in(esk2_3(X5,X6,X7),X5)&~(in(esk2_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|in(esk2_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk2_3(X5,X6,X7),X5)|in(esk2_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk2_3(X5,X6,X7),X6))|in(esk2_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[26])).
% cnf(31,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[27])).
% cnf(32,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[27])).
% cnf(33,plain,(in(X4,X2)|X1!=set_difference(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(40, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(in(X1,set_difference(X2,singleton(X3))))|(~(in(X1,X2))|X1=X3))&(in(X1,set_difference(X2,singleton(X3)))|(in(X1,X2)&~(X1=X3)))),inference(fof_nnf,[status(thm)],[7])).
% fof(41, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(in(X4,set_difference(X5,singleton(X6))))|(~(in(X4,X5))|X4=X6))&(in(X4,set_difference(X5,singleton(X6)))|(in(X4,X5)&~(X4=X6)))),inference(variable_rename,[status(thm)],[40])).
% fof(42, negated_conjecture,((~(in(esk5_0,set_difference(esk6_0,singleton(esk7_0))))|(~(in(esk5_0,esk6_0))|esk5_0=esk7_0))&(in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))|(in(esk5_0,esk6_0)&~(esk5_0=esk7_0)))),inference(skolemize,[status(esa)],[41])).
% fof(43, negated_conjecture,((~(in(esk5_0,set_difference(esk6_0,singleton(esk7_0))))|(~(in(esk5_0,esk6_0))|esk5_0=esk7_0))&((in(esk5_0,esk6_0)|in(esk5_0,set_difference(esk6_0,singleton(esk7_0))))&(~(esk5_0=esk7_0)|in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))))),inference(distribute,[status(thm)],[42])).
% cnf(44,negated_conjecture,(in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))|esk5_0!=esk7_0),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,negated_conjecture,(in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))|in(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,negated_conjecture,(esk5_0=esk7_0|~in(esk5_0,esk6_0)|~in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))),inference(split_conjunct,[status(thm)],[43])).
% cnf(47,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[32,theory(equality)])).
% cnf(54,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[21,theory(equality)])).
% cnf(55,plain,(X1=X2|~in(X2,singleton(X1))),inference(er,[status(thm)],[22,theory(equality)])).
% cnf(56,plain,(in(X1,X2)|~in(X1,set_difference(X2,X3))),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(57,plain,(in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(64,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[54,theory(equality)])).
% cnf(65,negated_conjecture,(in(esk5_0,esk6_0)),inference(spm,[status(thm)],[56,45,theory(equality)])).
% cnf(71,negated_conjecture,(esk7_0=esk5_0|~in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))|$false),inference(rw,[status(thm)],[46,65,theory(equality)])).
% cnf(72,negated_conjecture,(esk7_0=esk5_0|~in(esk5_0,set_difference(esk6_0,singleton(esk7_0)))),inference(cn,[status(thm)],[71,theory(equality)])).
% cnf(144,negated_conjecture,(in(esk5_0,set_difference(esk6_0,X1))|in(esk5_0,X1)),inference(spm,[status(thm)],[57,65,theory(equality)])).
% cnf(156,negated_conjecture,(esk7_0=esk5_0|in(esk5_0,singleton(esk7_0))),inference(spm,[status(thm)],[72,144,theory(equality)])).
% cnf(158,negated_conjecture,(esk7_0=esk5_0),inference(csr,[status(thm)],[156,55])).
% cnf(161,negated_conjecture,(in(esk5_0,set_difference(esk6_0,singleton(esk5_0)))|esk7_0!=esk5_0),inference(rw,[status(thm)],[44,158,theory(equality)])).
% cnf(162,negated_conjecture,(in(esk5_0,set_difference(esk6_0,singleton(esk5_0)))|$false),inference(rw,[status(thm)],[161,158,theory(equality)])).
% cnf(163,negated_conjecture,(in(esk5_0,set_difference(esk6_0,singleton(esk5_0)))),inference(cn,[status(thm)],[162,theory(equality)])).
% cnf(166,negated_conjecture,(~in(esk5_0,singleton(esk5_0))),inference(spm,[status(thm)],[47,163,theory(equality)])).
% cnf(168,negated_conjecture,($false),inference(rw,[status(thm)],[166,64,theory(equality)])).
% cnf(169,negated_conjecture,($false),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(170,negated_conjecture,($false),169,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 49
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 41
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 98
% # ...of the previous two non-trivial : 82
% # Contextual simplify-reflections : 1
% # Paramodulations : 89
% # Factorizations : 2
% # Equation resolutions : 7
% # Current number of processed clauses: 35
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 27
% # Current number of unprocessed clauses: 49
% # ...number of literals in the above : 140
% # Clause-clause subsumption calls (NU) : 107
% # Rec. Clause-clause subsumption calls : 95
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 29 leaves, 1.86+/-1.795 terms/leaf
% # Paramod-from index: 11 leaves, 1.45+/-1.157 terms/leaf
% # Paramod-into index: 27 leaves, 1.63+/-1.365 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP657/SET921+1.tptp
%
%------------------------------------------------------------------------------