TSTP Solution File: SET961+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET961+1 : TPTP v5.0.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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:24:46 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/SystemOnTPTP11841/SET961+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11841/SET961+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11841/SET961+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 11937
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(6, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(8, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', l55_zfmisc_1)).
% fof(9, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(11, conjecture,![X1]:![X2]:(cartesian_product2(X1,X2)=cartesian_product2(X2,X1)=>((X1=empty_set|X2=empty_set)|X1=X2)),file('/tmp/SRASS.s.p', t114_zfmisc_1)).
% fof(12, negated_conjecture,~(![X1]:![X2]:(cartesian_product2(X1,X2)=cartesian_product2(X2,X1)=>((X1=empty_set|X2=empty_set)|X1=X2))),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(17, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[13])).
% fof(18, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[19])).
% cnf(21,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(33, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[6])).
% fof(34, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:(((~(in(esk4_2(X4,X5),X4))|~(in(esk4_2(X4,X5),X5)))&(in(esk4_2(X4,X5),X4)|in(esk4_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X4]:![X5]:(((~(in(esk4_2(X4,X5),X4))|~(in(esk4_2(X4,X5),X5)))|X4=X5)&((in(esk4_2(X4,X5),X4)|in(esk4_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[35])).
% cnf(37,plain,(X1=X2|in(esk4_2(X1,X2),X2)|in(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[36])).
% cnf(38,plain,(X1=X2|~in(esk4_2(X1,X2),X2)|~in(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(41, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[8])).
% fof(42, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[43])).
% fof(47, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(48,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(51, negated_conjecture,?[X1]:?[X2]:(cartesian_product2(X1,X2)=cartesian_product2(X2,X1)&((~(X1=empty_set)&~(X2=empty_set))&~(X1=X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(52, negated_conjecture,?[X3]:?[X4]:(cartesian_product2(X3,X4)=cartesian_product2(X4,X3)&((~(X3=empty_set)&~(X4=empty_set))&~(X3=X4))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(cartesian_product2(esk5_0,esk6_0)=cartesian_product2(esk6_0,esk5_0)&((~(esk5_0=empty_set)&~(esk6_0=empty_set))&~(esk5_0=esk6_0))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(esk5_0!=esk6_0),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,negated_conjecture,(esk6_0!=empty_set),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,negated_conjecture,(esk5_0!=empty_set),inference(split_conjunct,[status(thm)],[53])).
% cnf(57,negated_conjecture,(cartesian_product2(esk5_0,esk6_0)=cartesian_product2(esk6_0,esk5_0)),inference(split_conjunct,[status(thm)],[53])).
% cnf(58,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[45,48,theory(equality)]),['unfolding']).
% cnf(59,plain,(in(X1,X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[46,48,theory(equality)]),['unfolding']).
% cnf(60,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[44,48,theory(equality)]),['unfolding']).
% cnf(68,negated_conjecture,(in(X1,esk6_0)|~in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk6_0,esk5_0))),inference(spm,[status(thm)],[58,57,theory(equality)])).
% cnf(73,negated_conjecture,(in(X1,esk5_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk6_0,esk5_0))),inference(spm,[status(thm)],[59,57,theory(equality)])).
% cnf(111,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk5_0)|~in(X2,esk6_0)),inference(spm,[status(thm)],[68,60,theory(equality)])).
% cnf(123,negated_conjecture,(in(esk4_2(X1,esk5_0),esk6_0)|X1=esk5_0|in(esk4_2(X1,esk5_0),X1)|~in(X2,esk6_0)),inference(spm,[status(thm)],[111,37,theory(equality)])).
% cnf(169,negated_conjecture,(in(X1,esk5_0)|~in(X2,esk5_0)|~in(X1,esk6_0)),inference(spm,[status(thm)],[73,60,theory(equality)])).
% cnf(174,negated_conjecture,(in(X1,esk5_0)|empty_set=esk5_0|~in(X1,esk6_0)),inference(spm,[status(thm)],[169,21,theory(equality)])).
% cnf(175,negated_conjecture,(in(X1,esk5_0)|~in(X1,esk6_0)),inference(sr,[status(thm)],[174,56,theory(equality)])).
% cnf(176,negated_conjecture,(X1=esk5_0|~in(esk4_2(X1,esk5_0),X1)|~in(esk4_2(X1,esk5_0),esk6_0)),inference(spm,[status(thm)],[38,175,theory(equality)])).
% cnf(305,negated_conjecture,(X1=esk5_0|in(esk4_2(X1,esk5_0),esk6_0)|in(esk4_2(X1,esk5_0),X1)|empty_set=esk6_0),inference(spm,[status(thm)],[123,21,theory(equality)])).
% cnf(307,negated_conjecture,(X1=esk5_0|in(esk4_2(X1,esk5_0),esk6_0)|in(esk4_2(X1,esk5_0),X1)),inference(sr,[status(thm)],[305,55,theory(equality)])).
% cnf(308,negated_conjecture,(esk6_0=esk5_0|in(esk4_2(esk6_0,esk5_0),esk6_0)),inference(ef,[status(thm)],[307,theory(equality)])).
% cnf(315,negated_conjecture,(in(esk4_2(esk6_0,esk5_0),esk6_0)),inference(sr,[status(thm)],[308,54,theory(equality)])).
% cnf(319,negated_conjecture,(esk6_0=esk5_0|~in(esk4_2(esk6_0,esk5_0),esk6_0)),inference(spm,[status(thm)],[176,315,theory(equality)])).
% cnf(320,negated_conjecture,(esk6_0=esk5_0|$false),inference(rw,[status(thm)],[319,315,theory(equality)])).
% cnf(321,negated_conjecture,(esk6_0=esk5_0),inference(cn,[status(thm)],[320,theory(equality)])).
% cnf(322,negated_conjecture,($false),inference(sr,[status(thm)],[321,54,theory(equality)])).
% cnf(323,negated_conjecture,($false),322,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 155
% # ...of these trivial : 2
% # ...subsumed : 68
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 1
% # Generated clauses : 242
% # ...of the previous two non-trivial : 213
% # Contextual simplify-reflections : 5
% # Paramodulations : 238
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 63
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 10
% # Non-unit-clauses : 47
% # Current number of unprocessed clauses: 66
% # ...number of literals in the above : 161
% # Clause-clause subsumption calls (NU) : 1266
% # Rec. Clause-clause subsumption calls : 1160
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 49 leaves, 2.16+/-2.189 terms/leaf
% # Paramod-from index: 15 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 47 leaves, 2.00+/-1.913 terms/leaf
% # -------------------------------------------------
% # User time : 0.021 s
% # System time : 0.004 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP11841/SET961+1.tptp
%
%------------------------------------------------------------------------------