TSTP Solution File: SET908+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET908+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:55 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP32433/SET908+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32433/SET908+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32433/SET908+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 32529
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 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(2, axiom,![X1]:![X2]:set_union2(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence_k2_xboole_0)).
% fof(3, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(4, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(5, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(12, conjecture,![X1]:![X2]:~(set_union2(singleton(X1),X2)=empty_set),file('/tmp/SRASS.s.p', t49_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:~(set_union2(singleton(X1),X2)=empty_set)),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(19, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X3]:![X4]:set_union2(X3,X3)=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(set_union2(X1,X1)=X1),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)],[3])).
% 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(32, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[14])).
% fof(33, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[32])).
% fof(34, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk2_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[33])).
% fof(35, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk2_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[34])).
% cnf(37,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(38, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(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_union2(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(39, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(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_union2(X5,X6))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))&~(in(esk3_3(X5,X6,X7),X6))))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[39])).
% fof(41, 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_union2(X5,X6)))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))&~(in(esk3_3(X5,X6,X7),X6))))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[40])).
% fof(42, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk3_3(X5,X6,X7),X5))|~(in(esk3_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk3_3(X5,X6,X7),X6))|~(in(esk3_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[41])).
% cnf(43,plain,(X1=set_union2(X2,X3)|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X2)|in(esk3_3(X2,X3,X1),X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(X1=set_union2(X2,X3)|~in(esk3_3(X2,X3,X1),X1)|~in(esk3_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[42])).
% cnf(46,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[42])).
% fof(65, negated_conjecture,?[X1]:?[X2]:set_union2(singleton(X1),X2)=empty_set,inference(fof_nnf,[status(thm)],[13])).
% fof(66, negated_conjecture,?[X3]:?[X4]:set_union2(singleton(X3),X4)=empty_set,inference(variable_rename,[status(thm)],[65])).
% fof(67, negated_conjecture,set_union2(singleton(esk6_0),esk7_0)=empty_set,inference(skolemize,[status(esa)],[66])).
% cnf(68,negated_conjecture,(set_union2(singleton(esk6_0),esk7_0)=empty_set),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(set_union2(esk7_0,singleton(esk6_0))=empty_set),inference(rw,[status(thm)],[68,20,theory(equality)])).
% cnf(70,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[30,theory(equality)])).
% cnf(81,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[70,theory(equality)])).
% cnf(95,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[46,theory(equality)])).
% cnf(119,plain,(set_union2(X2,X3)=X1|in(esk3_3(X2,X3,X1),X3)|in(esk3_3(X2,X3,X1),X2)|empty_set!=X1),inference(spm,[status(thm)],[37,43,theory(equality)])).
% cnf(134,plain,(empty_set!=singleton(X1)),inference(spm,[status(thm)],[37,81,theory(equality)])).
% cnf(138,plain,(set_union2(X1,X2)=empty_set|in(esk3_3(X1,X2,empty_set),X1)|in(esk3_3(X1,X2,empty_set),X2)),inference(er,[status(thm)],[119,theory(equality)])).
% cnf(139,plain,(set_union2(X3,X3)=empty_set|in(esk3_3(X3,X3,empty_set),X3)),inference(ef,[status(thm)],[138,theory(equality)])).
% cnf(149,plain,(X3=empty_set|in(esk3_3(X3,X3,empty_set),X3)),inference(rw,[status(thm)],[139,22,theory(equality)])).
% cnf(153,plain,(X1=esk3_3(X2,X2,empty_set)|X2=empty_set|singleton(X1)!=X2),inference(spm,[status(thm)],[31,149,theory(equality)])).
% cnf(169,plain,(X1=esk3_3(singleton(X1),singleton(X1),empty_set)|singleton(X1)=empty_set),inference(er,[status(thm)],[153,theory(equality)])).
% cnf(170,plain,(esk3_3(singleton(X1),singleton(X1),empty_set)=X1),inference(sr,[status(thm)],[169,134,theory(equality)])).
% cnf(171,plain,(set_union2(singleton(X1),singleton(X1))=empty_set|~in(X1,singleton(X1))|~in(X1,empty_set)),inference(spm,[status(thm)],[44,170,theory(equality)])).
% cnf(176,plain,(singleton(X1)=empty_set|~in(X1,singleton(X1))|~in(X1,empty_set)),inference(rw,[status(thm)],[171,22,theory(equality)])).
% cnf(177,plain,(singleton(X1)=empty_set|$false|~in(X1,empty_set)),inference(rw,[status(thm)],[176,81,theory(equality)])).
% cnf(178,plain,(singleton(X1)=empty_set|~in(X1,empty_set)),inference(cn,[status(thm)],[177,theory(equality)])).
% cnf(179,plain,(~in(X1,empty_set)),inference(sr,[status(thm)],[178,134,theory(equality)])).
% cnf(218,negated_conjecture,(in(X1,empty_set)|~in(X1,singleton(esk6_0))),inference(spm,[status(thm)],[95,69,theory(equality)])).
% cnf(222,negated_conjecture,(~in(X1,singleton(esk6_0))),inference(sr,[status(thm)],[218,179,theory(equality)])).
% cnf(228,negated_conjecture,(singleton(esk6_0)=empty_set),inference(spm,[status(thm)],[222,149,theory(equality)])).
% cnf(232,negated_conjecture,($false),inference(sr,[status(thm)],[228,134,theory(equality)])).
% cnf(233,negated_conjecture,($false),232,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 0
% # ...subsumed : 14
% # ...remaining for further processing: 68
% # Other redundant clauses eliminated : 7
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 123
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections : 2
% # Paramodulations : 97
% # Factorizations : 10
% # Equation resolutions : 16
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 29
% # Current number of unprocessed clauses: 54
% # ...number of literals in the above : 168
% # Clause-clause subsumption calls (NU) : 74
% # Rec. Clause-clause subsumption calls : 72
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 37 leaves, 1.57+/-1.366 terms/leaf
% # Paramod-from index: 16 leaves, 1.44+/-1.273 terms/leaf
% # Paramod-into index: 35 leaves, 1.49+/-1.251 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.007 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.21 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP32433/SET908+1.tptp
%
%------------------------------------------------------------------------------