TSTP Solution File: SET920+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET920+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 : art06.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:07 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP3154/SET920+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3154/SET920+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3154/SET920+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 3250
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, 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(5, 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(9, conjecture,![X1]:![X2]:![X3]:(set_intersection2(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)=>in(X1,X3)),file('/tmp/SRASS.s.p', t63_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:(set_intersection2(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)=>in(X1,X3))),inference(assume_negation,[status(cth)],[9])).
% fof(20, 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)],[4])).
% fof(21, 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)],[20])).
% fof(22, 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)],[21])).
% fof(23, 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)],[22])).
% fof(24, 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)],[23])).
% cnf(29,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[24])).
% fof(31, 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)],[5])).
% fof(32, 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)],[31])).
% fof(33, 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(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_intersection2(X5,X6))),inference(skolemize,[status(esa)],[32])).
% fof(34, 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(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_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, 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(esk2_3(X5,X6,X7),X7))|(~(in(esk2_3(X5,X6,X7),X5))|~(in(esk2_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk2_3(X5,X6,X7),X5)|in(esk2_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk2_3(X5,X6,X7),X6)|in(esk2_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[34])).
% cnf(40,plain,(in(X4,X3)|X1!=set_intersection2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(50, negated_conjecture,?[X1]:?[X2]:?[X3]:(set_intersection2(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)&~(in(X1,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(51, negated_conjecture,?[X4]:?[X5]:?[X6]:(set_intersection2(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5)&~(in(X4,X6))),inference(variable_rename,[status(thm)],[50])).
% fof(52, negated_conjecture,(set_intersection2(unordered_pair(esk5_0,esk6_0),esk7_0)=unordered_pair(esk5_0,esk6_0)&~(in(esk5_0,esk7_0))),inference(skolemize,[status(esa)],[51])).
% cnf(53,negated_conjecture,(~in(esk5_0,esk7_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,negated_conjecture,(set_intersection2(unordered_pair(esk5_0,esk6_0),esk7_0)=unordered_pair(esk5_0,esk6_0)),inference(split_conjunct,[status(thm)],[52])).
% cnf(56,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(61,plain,(in(X1,X2)|~in(X1,set_intersection2(X3,X2))),inference(er,[status(thm)],[40,theory(equality)])).
% cnf(70,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[56,theory(equality)])).
% cnf(243,negated_conjecture,(in(X1,esk7_0)|~in(X1,unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[61,54,theory(equality)])).
% cnf(266,negated_conjecture,(~in(esk5_0,unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[53,243,theory(equality)])).
% cnf(276,negated_conjecture,($false),inference(rw,[status(thm)],[266,70,theory(equality)])).
% cnf(277,negated_conjecture,($false),inference(cn,[status(thm)],[276,theory(equality)])).
% cnf(278,negated_conjecture,($false),277,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 50
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 48
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 202
% # ...of the previous two non-trivial : 168
% # Contextual simplify-reflections : 0
% # Paramodulations : 182
% # Factorizations : 0
% # Equation resolutions : 20
% # Current number of processed clauses: 26
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 4
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 158
% # ...number of literals in the above : 626
% # Clause-clause subsumption calls (NU) : 59
% # Rec. Clause-clause subsumption calls : 54
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 23 leaves, 1.70+/-1.397 terms/leaf
% # Paramod-from index: 9 leaves, 1.67+/-0.816 terms/leaf
% # Paramod-into index: 21 leaves, 1.57+/-1.256 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.005 s
% # Total time : 0.020 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/SystemOnTPTP3154/SET920+1.tptp
%
%------------------------------------------------------------------------------