TSTP Solution File: SET918+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET918+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 00:23:40 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP307/SET918+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP307/SET918+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP307/SET918+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 439
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(3, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(5, 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(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(10, conjecture,![X1]:![X2]:![X3]:~(((set_intersection2(unordered_pair(X1,X2),X3)=singleton(X1)&in(X2,X3))&~(X1=X2))),file('/tmp/SRASS.s.p', t59_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:~(((set_intersection2(unordered_pair(X1,X2),X3)=singleton(X1)&in(X2,X3))&~(X1=X2)))),inference(assume_negation,[status(cth)],[10])).
% fof(17, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(18,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, 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(22, 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)],[21])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(29,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(30, 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)],[5])).
% fof(31, 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)],[30])).
% fof(32, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[31])).
% fof(33, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, 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)))))&((((~(esk2_3(X5,X6,X7)=X5)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk2_3(X5,X6,X7)=X6)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[33])).
% cnf(39,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[34])).
% fof(41, 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(42, 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)],[41])).
% 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))))&(((~(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)],[42])).
% fof(44, 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)],[43])).
% fof(45, 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)],[44])).
% cnf(49,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(60, negated_conjecture,?[X1]:?[X2]:?[X3]:((set_intersection2(unordered_pair(X1,X2),X3)=singleton(X1)&in(X2,X3))&~(X1=X2)),inference(fof_nnf,[status(thm)],[11])).
% fof(61, negated_conjecture,?[X4]:?[X5]:?[X6]:((set_intersection2(unordered_pair(X4,X5),X6)=singleton(X4)&in(X5,X6))&~(X4=X5)),inference(variable_rename,[status(thm)],[60])).
% fof(62, negated_conjecture,((set_intersection2(unordered_pair(esk6_0,esk7_0),esk8_0)=singleton(esk6_0)&in(esk7_0,esk8_0))&~(esk6_0=esk7_0)),inference(skolemize,[status(esa)],[61])).
% cnf(63,negated_conjecture,(esk6_0!=esk7_0),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,negated_conjecture,(in(esk7_0,esk8_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,negated_conjecture,(set_intersection2(unordered_pair(esk6_0,esk7_0),esk8_0)=singleton(esk6_0)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,negated_conjecture,(set_intersection2(unordered_pair(esk7_0,esk6_0),esk8_0)=singleton(esk6_0)),inference(rw,[status(thm)],[65,18,theory(equality)])).
% cnf(69,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(70,negated_conjecture,(set_intersection2(esk8_0,unordered_pair(esk7_0,esk6_0))=singleton(esk6_0)),inference(rw,[status(thm)],[66,20,theory(equality)])).
% cnf(87,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[69,theory(equality)])).
% cnf(103,negated_conjecture,(in(X1,X2)|singleton(esk6_0)!=X2|~in(X1,unordered_pair(esk7_0,esk6_0))|~in(X1,esk8_0)),inference(spm,[status(thm)],[49,70,theory(equality)])).
% cnf(245,negated_conjecture,(in(esk7_0,X1)|singleton(esk6_0)!=X1|~in(esk7_0,esk8_0)),inference(spm,[status(thm)],[103,87,theory(equality)])).
% cnf(248,negated_conjecture,(in(esk7_0,X1)|singleton(esk6_0)!=X1|$false),inference(rw,[status(thm)],[245,64,theory(equality)])).
% cnf(249,negated_conjecture,(in(esk7_0,X1)|singleton(esk6_0)!=X1),inference(cn,[status(thm)],[248,theory(equality)])).
% cnf(250,negated_conjecture,(in(esk7_0,singleton(esk6_0))),inference(er,[status(thm)],[249,theory(equality)])).
% cnf(252,negated_conjecture,(X1=esk7_0|singleton(X1)!=singleton(esk6_0)),inference(spm,[status(thm)],[29,250,theory(equality)])).
% cnf(261,negated_conjecture,(esk6_0=esk7_0),inference(er,[status(thm)],[252,theory(equality)])).
% cnf(262,negated_conjecture,($false),inference(sr,[status(thm)],[261,63,theory(equality)])).
% cnf(263,negated_conjecture,($false),262,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 131
% # ...of these trivial : 2
% # ...subsumed : 35
% # ...remaining for further processing: 94
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 180
% # ...of the previous two non-trivial : 153
% # Contextual simplify-reflections : 0
% # Paramodulations : 158
% # Factorizations : 4
% # Equation resolutions : 18
% # Current number of processed clauses: 65
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 8
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 72
% # ...number of literals in the above : 249
% # Clause-clause subsumption calls (NU) : 411
% # Rec. Clause-clause subsumption calls : 386
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 52 leaves, 1.50+/-1.394 terms/leaf
% # Paramod-from index: 14 leaves, 1.43+/-0.728 terms/leaf
% # Paramod-into index: 45 leaves, 1.44+/-1.127 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 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/SystemOnTPTP307/SET918+1.tptp
%
%------------------------------------------------------------------------------