TSTP Solution File: SEU186+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU186+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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:35:27 EST 2010
% Result : Theorem 1.98s
% Output : Solution 1.98s
% 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/SystemOnTPTP27204/SEU186+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27204/SEU186+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27204/SEU186+2.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 27300
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.037 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(relation(X1)<=>![X2]:~((in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4))))),file('/tmp/SRASS.s.p', d1_relat_1)).
% fof(3, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(34, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(63, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(111, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(164, conjecture,![X1]:(relation(X1)=>(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))=>X1=empty_set)),file('/tmp/SRASS.s.p', t56_relat_1)).
% fof(165, negated_conjecture,~(![X1]:(relation(X1)=>(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))=>X1=empty_set))),inference(assume_negation,[status(cth)],[164])).
% fof(167, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(189, negated_conjecture,~(![X1]:(relation(X1)=>(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))=>X1=empty_set))),inference(fof_simplification,[status(thm)],[165,theory(equality)])).
% fof(193, plain,![X1]:((~(relation(X1))|![X2]:(~(in(X2,X1))|?[X3]:?[X4]:X2=ordered_pair(X3,X4)))&(?[X2]:(in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4)))|relation(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(194, plain,![X5]:((~(relation(X5))|![X6]:(~(in(X6,X5))|?[X7]:?[X8]:X6=ordered_pair(X7,X8)))&(?[X9]:(in(X9,X5)&![X10]:![X11]:~(X9=ordered_pair(X10,X11)))|relation(X5))),inference(variable_rename,[status(thm)],[193])).
% fof(195, plain,![X5]:((~(relation(X5))|![X6]:(~(in(X6,X5))|X6=ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6))))&((in(esk3_1(X5),X5)&![X10]:![X11]:~(esk3_1(X5)=ordered_pair(X10,X11)))|relation(X5))),inference(skolemize,[status(esa)],[194])).
% fof(196, plain,![X5]:![X6]:![X10]:![X11]:(((~(esk3_1(X5)=ordered_pair(X10,X11))&in(esk3_1(X5),X5))|relation(X5))&((~(in(X6,X5))|X6=ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)))|~(relation(X5)))),inference(shift_quantors,[status(thm)],[195])).
% fof(197, plain,![X5]:![X6]:![X10]:![X11]:(((~(esk3_1(X5)=ordered_pair(X10,X11))|relation(X5))&(in(esk3_1(X5),X5)|relation(X5)))&((~(in(X6,X5))|X6=ordered_pair(esk1_2(X5,X6),esk2_2(X5,X6)))|~(relation(X5)))),inference(distribute,[status(thm)],[196])).
% cnf(198,plain,(X2=ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))|~relation(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[197])).
% fof(201, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[167])).
% fof(202, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[201])).
% fof(203, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk4_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[202])).
% fof(204, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk4_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[203])).
% cnf(205,plain,(X1=empty_set|in(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[204])).
% fof(396, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[34])).
% cnf(397,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[396])).
% fof(497, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[63])).
% cnf(498,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[497])).
% fof(677, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[111])).
% cnf(678,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[677])).
% fof(821, negated_conjecture,?[X1]:(relation(X1)&(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))&~(X1=empty_set))),inference(fof_nnf,[status(thm)],[189])).
% fof(822, negated_conjecture,?[X4]:(relation(X4)&(![X5]:![X6]:~(in(ordered_pair(X5,X6),X4))&~(X4=empty_set))),inference(variable_rename,[status(thm)],[821])).
% fof(823, negated_conjecture,(relation(esk50_0)&(![X5]:![X6]:~(in(ordered_pair(X5,X6),esk50_0))&~(esk50_0=empty_set))),inference(skolemize,[status(esa)],[822])).
% fof(824, negated_conjecture,![X5]:![X6]:((~(in(ordered_pair(X5,X6),esk50_0))&~(esk50_0=empty_set))&relation(esk50_0)),inference(shift_quantors,[status(thm)],[823])).
% cnf(825,negated_conjecture,(relation(esk50_0)),inference(split_conjunct,[status(thm)],[824])).
% cnf(826,negated_conjecture,(esk50_0!=empty_set),inference(split_conjunct,[status(thm)],[824])).
% cnf(827,negated_conjecture,(~in(ordered_pair(X1,X2),esk50_0)),inference(split_conjunct,[status(thm)],[824])).
% cnf(832,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[498,678,theory(equality)]),['unfolding']).
% cnf(886,plain,(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)))=X2|~relation(X1)|~in(X2,X1)),inference(rw,[status(thm)],[198,832,theory(equality)]),['unfolding']).
% cnf(913,negated_conjecture,(~in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),esk50_0)),inference(rw,[status(thm)],[827,832,theory(equality)]),['unfolding']).
% cnf(931,plain,(unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)))=X2|~relation(X1)|~in(X2,X1)),inference(rw,[status(thm)],[886,397,theory(equality)])).
% cnf(990,negated_conjecture,(~in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),esk50_0)),inference(spm,[status(thm)],[913,397,theory(equality)])).
% cnf(4164,negated_conjecture,(~in(X2,esk50_0)|~relation(X1)|~in(X2,X1)),inference(spm,[status(thm)],[990,931,theory(equality)])).
% cnf(4986,negated_conjecture,(empty_set=esk50_0|~relation(X1)|~in(esk4_1(esk50_0),X1)),inference(spm,[status(thm)],[4164,205,theory(equality)])).
% cnf(4995,negated_conjecture,(~relation(X1)|~in(esk4_1(esk50_0),X1)),inference(sr,[status(thm)],[4986,826,theory(equality)])).
% cnf(5024,negated_conjecture,(empty_set=esk50_0|~relation(esk50_0)),inference(spm,[status(thm)],[4995,205,theory(equality)])).
% cnf(5025,negated_conjecture,(empty_set=esk50_0|$false),inference(rw,[status(thm)],[5024,825,theory(equality)])).
% cnf(5026,negated_conjecture,(empty_set=esk50_0),inference(cn,[status(thm)],[5025,theory(equality)])).
% cnf(5027,negated_conjecture,($false),inference(sr,[status(thm)],[5026,826,theory(equality)])).
% cnf(5028,negated_conjecture,($false),5027,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 773
% # ...of these trivial : 14
% # ...subsumed : 179
% # ...remaining for further processing: 580
% # Other redundant clauses eliminated : 57
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 21
% # Generated clauses : 3587
% # ...of the previous two non-trivial : 3324
% # Contextual simplify-reflections : 5
% # Paramodulations : 3485
% # Factorizations : 14
% # Equation resolutions : 83
% # Current number of processed clauses: 309
% # Positive orientable unit clauses: 47
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 32
% # Non-unit-clauses : 227
% # Current number of unprocessed clauses: 2745
% # ...number of literals in the above : 11194
% # Clause-clause subsumption calls (NU) : 2869
% # Rec. Clause-clause subsumption calls : 1426
% # Unit Clause-clause subsumption calls : 234
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 73
% # Indexed BW rewrite successes : 62
% # Backwards rewriting index: 304 leaves, 1.64+/-2.396 terms/leaf
% # Paramod-from index: 132 leaves, 1.20+/-0.633 terms/leaf
% # Paramod-into index: 275 leaves, 1.49+/-1.738 terms/leaf
% # -------------------------------------------------
% # User time : 0.196 s
% # System time : 0.010 s
% # Total time : 0.206 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.46 WC
% FINAL PrfWatch: 0.38 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP27204/SEU186+2.tptp
%
%------------------------------------------------------------------------------