TSTP Solution File: SET962+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET962+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:25:10 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP12100/SET962+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12100/SET962+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12100/SET962+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 12196
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(3, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(4, 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(8, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(9, conjecture,![X1]:![X2]:(cartesian_product2(X1,X1)=cartesian_product2(X2,X2)=>X1=X2),file('/tmp/SRASS.s.p', t115_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:(cartesian_product2(X1,X1)=cartesian_product2(X2,X2)=>X1=X2)),inference(assume_negation,[status(cth)],[9])).
% fof(17, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[2])).
% fof(18, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:(((~(in(esk1_2(X4,X5),X4))|~(in(esk1_2(X4,X5),X5)))&(in(esk1_2(X4,X5),X4)|in(esk1_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X4]:![X5]:(((~(in(esk1_2(X4,X5),X4))|~(in(esk1_2(X4,X5),X5)))|X4=X5)&((in(esk1_2(X4,X5),X4)|in(esk1_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(X1=X2|in(esk1_2(X1,X2),X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(X1=X2|~in(esk1_2(X1,X2),X2)|~in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(23, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, 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)],[4])).
% fof(26, 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)],[25])).
% fof(27, 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)],[26])).
% cnf(28,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[27])).
% fof(39, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(40,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, negated_conjecture,?[X1]:?[X2]:(cartesian_product2(X1,X1)=cartesian_product2(X2,X2)&~(X1=X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(42, negated_conjecture,?[X3]:?[X4]:(cartesian_product2(X3,X3)=cartesian_product2(X4,X4)&~(X3=X4)),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,(cartesian_product2(esk4_0,esk4_0)=cartesian_product2(esk5_0,esk5_0)&~(esk4_0=esk5_0)),inference(skolemize,[status(esa)],[42])).
% cnf(44,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,negated_conjecture,(cartesian_product2(esk4_0,esk4_0)=cartesian_product2(esk5_0,esk5_0)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[29,40,theory(equality)]),['unfolding']).
% cnf(48,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[28,40,theory(equality)]),['unfolding']).
% cnf(54,negated_conjecture,(in(X1,esk4_0)|~in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk5_0,esk5_0))),inference(spm,[status(thm)],[46,45,theory(equality)])).
% cnf(55,plain,(in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X3),singleton(X3)),cartesian_product2(X4,X2))),inference(spm,[status(thm)],[46,24,theory(equality)])).
% cnf(72,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk5_0,esk5_0))|~in(X2,esk4_0)|~in(X1,esk4_0)),inference(spm,[status(thm)],[48,45,theory(equality)])).
% cnf(77,negated_conjecture,(in(X1,esk4_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),cartesian_product2(esk5_0,esk5_0))),inference(spm,[status(thm)],[54,24,theory(equality)])).
% cnf(115,negated_conjecture,(in(X1,esk4_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[77,48,theory(equality)])).
% cnf(116,negated_conjecture,(X1=esk4_0|~in(esk1_2(X1,esk4_0),X1)|~in(esk1_2(X1,esk4_0),esk5_0)),inference(spm,[status(thm)],[22,115,theory(equality)])).
% cnf(176,negated_conjecture,(in(X1,esk5_0)|~in(X1,esk4_0)),inference(spm,[status(thm)],[55,72,theory(equality)])).
% cnf(186,negated_conjecture,(in(esk1_2(X1,esk4_0),esk5_0)|X1=esk4_0|in(esk1_2(X1,esk4_0),X1)),inference(spm,[status(thm)],[176,21,theory(equality)])).
% cnf(217,negated_conjecture,(esk5_0=esk4_0|in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(ef,[status(thm)],[186,theory(equality)])).
% cnf(222,negated_conjecture,(in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(sr,[status(thm)],[217,44,theory(equality)])).
% cnf(225,negated_conjecture,(esk5_0=esk4_0|~in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(spm,[status(thm)],[116,222,theory(equality)])).
% cnf(226,negated_conjecture,(esk5_0=esk4_0|$false),inference(rw,[status(thm)],[225,222,theory(equality)])).
% cnf(227,negated_conjecture,(esk5_0=esk4_0),inference(cn,[status(thm)],[226,theory(equality)])).
% cnf(228,negated_conjecture,($false),inference(sr,[status(thm)],[227,44,theory(equality)])).
% cnf(229,negated_conjecture,($false),228,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 114
% # ...of these trivial : 0
% # ...subsumed : 55
% # ...remaining for further processing: 59
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 170
% # ...of the previous two non-trivial : 152
% # Contextual simplify-reflections : 4
% # Paramodulations : 166
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 58
% # ...number of literals in the above : 138
% # Clause-clause subsumption calls (NU) : 1208
% # Rec. Clause-clause subsumption calls : 1112
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 37 leaves, 2.43+/-2.343 terms/leaf
% # Paramod-from index: 10 leaves, 1.30+/-0.458 terms/leaf
% # Paramod-into index: 35 leaves, 2.23+/-2.030 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.003 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP12100/SET962+1.tptp
%
%------------------------------------------------------------------------------