TSTP Solution File: SEU129+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU129+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:11:53 EST 2010
% Result : Theorem 6.61s
% Output : Solution 6.61s
% 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/SystemOnTPTP16830/SEU129+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16830/SEU129+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16830/SEU129+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 16926
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.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]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(8, 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(16, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_intersection2(X1,X3),set_intersection2(X2,X3))),file('/tmp/SRASS.s.p', t26_xboole_1)).
% fof(17, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_intersection2(X1,X3),set_intersection2(X2,X3)))),inference(assume_negation,[status(cth)],[16])).
% fof(22, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(27, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(43, 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)],[8])).
% 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))))&(?[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)],[43])).
% fof(45, 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(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)&in(esk4_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[44])).
% fof(46, 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(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)&in(esk4_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[45])).
% fof(47, 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(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk4_3(X5,X6,X7),X6)|in(esk4_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[46])).
% cnf(51,plain,(in(X4,X1)|X1!=set_intersection2(X2,X3)|~in(X4,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[47])).
% cnf(52,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(68, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&~(subset(set_intersection2(X1,X3),set_intersection2(X2,X3)))),inference(fof_nnf,[status(thm)],[17])).
% fof(69, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&~(subset(set_intersection2(X4,X6),set_intersection2(X5,X6)))),inference(variable_rename,[status(thm)],[68])).
% fof(70, negated_conjecture,(subset(esk5_0,esk6_0)&~(subset(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)))),inference(skolemize,[status(esa)],[69])).
% cnf(71,negated_conjecture,(~subset(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0))),inference(split_conjunct,[status(thm)],[70])).
% cnf(72,negated_conjecture,(subset(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[70])).
% cnf(86,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[33,72,theory(equality)])).
% cnf(88,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[52,theory(equality)])).
% cnf(100,plain,(in(X1,set_intersection2(X2,X3))|~in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(135,negated_conjecture,(subset(X1,esk6_0)|~in(esk1_2(X1,esk6_0),esk5_0)),inference(spm,[status(thm)],[31,86,theory(equality)])).
% cnf(147,plain,(in(esk1_2(set_intersection2(X1,X2),X3),X2)|subset(set_intersection2(X1,X2),X3)),inference(spm,[status(thm)],[88,32,theory(equality)])).
% cnf(183,negated_conjecture,(subset(set_intersection2(X1,esk5_0),esk6_0)),inference(spm,[status(thm)],[135,147,theory(equality)])).
% cnf(197,negated_conjecture,(subset(set_intersection2(esk5_0,X1),esk6_0)),inference(spm,[status(thm)],[183,23,theory(equality)])).
% cnf(210,negated_conjecture,(in(X1,esk6_0)|~in(X1,set_intersection2(esk5_0,X2))),inference(spm,[status(thm)],[33,197,theory(equality)])).
% cnf(389,plain,(subset(X1,set_intersection2(X2,X3))|~in(esk1_2(X1,set_intersection2(X2,X3)),X3)|~in(esk1_2(X1,set_intersection2(X2,X3)),X2)),inference(spm,[status(thm)],[31,100,theory(equality)])).
% cnf(424,negated_conjecture,(in(esk1_2(set_intersection2(esk5_0,X1),X2),esk6_0)|subset(set_intersection2(esk5_0,X1),X2)),inference(spm,[status(thm)],[210,32,theory(equality)])).
% cnf(3922,plain,(subset(set_intersection2(X1,X2),set_intersection2(X3,X2))|~in(esk1_2(set_intersection2(X1,X2),set_intersection2(X3,X2)),X3)),inference(spm,[status(thm)],[389,147,theory(equality)])).
% cnf(150807,negated_conjecture,(subset(set_intersection2(esk5_0,X1),set_intersection2(esk6_0,X1))),inference(spm,[status(thm)],[3922,424,theory(equality)])).
% cnf(151035,negated_conjecture,($false),inference(rw,[status(thm)],[71,150807,theory(equality)])).
% cnf(151036,negated_conjecture,($false),inference(cn,[status(thm)],[151035,theory(equality)])).
% cnf(151037,negated_conjecture,($false),151036,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11138
% # ...of these trivial : 198
% # ...subsumed : 10101
% # ...remaining for further processing: 839
% # Other redundant clauses eliminated : 45
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 37
% # Backward-rewritten : 6
% # Generated clauses : 112298
% # ...of the previous two non-trivial : 98302
% # Contextual simplify-reflections : 4720
% # Paramodulations : 111862
% # Factorizations : 308
% # Equation resolutions : 128
% # Current number of processed clauses: 774
% # Positive orientable unit clauses: 76
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 16
% # Non-unit-clauses : 681
% # Current number of unprocessed clauses: 83897
% # ...number of literals in the above : 314110
% # Clause-clause subsumption calls (NU) : 210011
% # Rec. Clause-clause subsumption calls : 168187
% # Unit Clause-clause subsumption calls : 1044
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 475
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 163 leaves, 5.64+/-10.396 terms/leaf
% # Paramod-from index: 63 leaves, 7.29+/-14.387 terms/leaf
% # Paramod-into index: 151 leaves, 5.63+/-10.191 terms/leaf
% # -------------------------------------------------
% # User time : 3.753 s
% # System time : 0.122 s
% # Total time : 3.875 s
% # Maximum resident set size: 0 pages
% PrfWatch: 5.82 CPU 5.92 WC
% FINAL PrfWatch: 5.82 CPU 5.92 WC
% SZS output end Solution for /tmp/SystemOnTPTP16830/SEU129+1.tptp
%
%------------------------------------------------------------------------------