TSTP Solution File: SET916+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET916+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:18:43 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP32695/SET916+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32695/SET916+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32695/SET916+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 323
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(4, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t4_xboole_0)).
% fof(6, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(7, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(11, conjecture,![X1]:![X2]:![X3]:~(((~(in(X1,X2))&~(in(X3,X2)))&~(disjoint(unordered_pair(X1,X3),X2)))),file('/tmp/SRASS.s.p', t57_zfmisc_1)).
% fof(12, negated_conjecture,~(![X1]:![X2]:![X3]:~(((~(in(X1,X2))&~(in(X3,X2)))&~(disjoint(unordered_pair(X1,X3),X2))))),inference(assume_negation,[status(cth)],[11])).
% fof(14, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(16, negated_conjecture,~(![X1]:![X2]:![X3]:~(((~(in(X1,X2))&~(in(X3,X2)))&~(disjoint(unordered_pair(X1,X3),X2))))),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(23, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk1_3(X5,X6,X7)=X5)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk1_3(X5,X6,X7)=X6)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[26])).
% cnf(33,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(34, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:in(X3,set_intersection2(X1,X2)))&(![X3]:~(in(X3,set_intersection2(X1,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(35, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:in(X6,set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk2_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[35])).
% fof(37, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk2_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[36])).
% cnf(38,plain,(in(esk2_2(X1,X2),set_intersection2(X1,X2))|disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[37])).
% fof(42, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(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_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(43, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(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_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(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_intersection2(X5,X6))),inference(skolemize,[status(esa)],[43])).
% fof(45, 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_intersection2(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_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(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_intersection2(X5,X6))&(((in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk3_3(X5,X6,X7),X6)|in(esk3_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[45])).
% cnf(51,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[46])).
% cnf(52,plain,(in(X4,X2)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(53, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(54,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(63, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(in(X1,X2))&~(in(X3,X2)))&~(disjoint(unordered_pair(X1,X3),X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(64, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(in(X4,X5))&~(in(X6,X5)))&~(disjoint(unordered_pair(X4,X6),X5))),inference(variable_rename,[status(thm)],[63])).
% fof(65, negated_conjecture,((~(in(esk6_0,esk7_0))&~(in(esk8_0,esk7_0)))&~(disjoint(unordered_pair(esk6_0,esk8_0),esk7_0))),inference(skolemize,[status(esa)],[64])).
% cnf(66,negated_conjecture,(~disjoint(unordered_pair(esk6_0,esk8_0),esk7_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(~in(esk8_0,esk7_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,negated_conjecture,(~in(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(78,negated_conjecture,(in(esk2_2(unordered_pair(esk6_0,esk8_0),esk7_0),set_intersection2(unordered_pair(esk6_0,esk8_0),esk7_0))),inference(spm,[status(thm)],[66,38,theory(equality)])).
% cnf(83,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(89,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(94,plain,(in(X1,X2)|~in(X1,set_intersection2(X2,X3))),inference(er,[status(thm)],[52,theory(equality)])).
% cnf(186,negated_conjecture,(in(esk2_2(unordered_pair(esk6_0,esk8_0),esk7_0),set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))),inference(rw,[status(thm)],[78,54,theory(equality)])).
% cnf(188,negated_conjecture,(~disjoint(esk7_0,unordered_pair(esk6_0,esk8_0))),inference(spm,[status(thm)],[39,186,theory(equality)])).
% cnf(206,negated_conjecture,(in(esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0)),set_intersection2(esk7_0,unordered_pair(esk6_0,esk8_0)))),inference(spm,[status(thm)],[188,38,theory(equality)])).
% cnf(258,negated_conjecture,(in(esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0)),unordered_pair(esk6_0,esk8_0))),inference(spm,[status(thm)],[89,206,theory(equality)])).
% cnf(269,negated_conjecture,(in(esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0)),esk7_0)),inference(spm,[status(thm)],[94,206,theory(equality)])).
% cnf(289,negated_conjecture,(esk6_0=esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0))|esk8_0=esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0))),inference(spm,[status(thm)],[83,258,theory(equality)])).
% cnf(315,negated_conjecture,(in(esk8_0,esk7_0)|esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0))=esk6_0),inference(spm,[status(thm)],[269,289,theory(equality)])).
% cnf(322,negated_conjecture,(esk2_2(esk7_0,unordered_pair(esk6_0,esk8_0))=esk6_0),inference(sr,[status(thm)],[315,67,theory(equality)])).
% cnf(329,negated_conjecture,(in(esk6_0,esk7_0)),inference(rw,[status(thm)],[269,322,theory(equality)])).
% cnf(330,negated_conjecture,($false),inference(sr,[status(thm)],[329,68,theory(equality)])).
% cnf(331,negated_conjecture,($false),330,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 87
% # ...of these trivial : 2
% # ...subsumed : 16
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 242
% # ...of the previous two non-trivial : 214
% # Contextual simplify-reflections : 0
% # Paramodulations : 223
% # Factorizations : 5
% # Equation resolutions : 14
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 7
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 136
% # ...number of literals in the above : 525
% # Clause-clause subsumption calls (NU) : 83
% # Rec. Clause-clause subsumption calls : 77
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 32 leaves, 1.75+/-1.323 terms/leaf
% # Paramod-from index: 12 leaves, 1.50+/-0.764 terms/leaf
% # Paramod-into index: 29 leaves, 1.62+/-1.243 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.006 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.19 WC
% FINAL PrfWatch: 0.13 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP32695/SET916+1.tptp
%
%------------------------------------------------------------------------------