TSTP Solution File: SEU186+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU186+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:35:19 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/SystemOnTPTP1100/SEU186+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1100/SEU186+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1100/SEU186+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 1197
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:(relation(X1)<=>![X2]:~((in(X2,X1)&![X3]:![X4]:~(X2=ordered_pair(X3,X4))))),file('/tmp/SRASS.s.p', d1_relat_1)).
% fof(4, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(8, axiom,?[X1]:(empty(X1)&relation(X1)),file('/tmp/SRASS.s.p', rc1_relat_1)).
% fof(12, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(13, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(15, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(16, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(20, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(26, conjecture,![X1]:(relation(X1)=>(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))=>X1=empty_set)),file('/tmp/SRASS.s.p', t56_relat_1)).
% fof(27, negated_conjecture,~(![X1]:(relation(X1)=>(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))=>X1=empty_set))),inference(assume_negation,[status(cth)],[26])).
% fof(34, negated_conjecture,~(![X1]:(relation(X1)=>(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))=>X1=empty_set))),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% fof(38, 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(39, 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)],[38])).
% fof(40, 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)],[39])).
% fof(41, 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)],[40])).
% fof(42, 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)],[41])).
% cnf(43,plain,(X2=ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))|~relation(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(48, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[4])).
% fof(49, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(57, plain,?[X2]:(empty(X2)&relation(X2)),inference(variable_rename,[status(thm)],[8])).
% fof(58, plain,(empty(esk4_0)&relation(esk4_0)),inference(skolemize,[status(esa)],[57])).
% cnf(60,plain,(empty(esk4_0)),inference(split_conjunct,[status(thm)],[58])).
% fof(71, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[12])).
% fof(72, plain,![X3]:element(esk6_1(X3),X3),inference(skolemize,[status(esa)],[71])).
% cnf(73,plain,(element(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(74, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[13])).
% fof(75, plain,empty(esk7_0),inference(skolemize,[status(esa)],[74])).
% cnf(76,plain,(empty(esk7_0)),inference(split_conjunct,[status(thm)],[75])).
% fof(80, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[15])).
% cnf(81,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(82, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[16])).
% cnf(83,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[82])).
% fof(91, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(92, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[91])).
% cnf(93,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[92])).
% fof(99, negated_conjecture,?[X1]:(relation(X1)&(![X2]:![X3]:~(in(ordered_pair(X2,X3),X1))&~(X1=empty_set))),inference(fof_nnf,[status(thm)],[34])).
% fof(100, negated_conjecture,?[X4]:(relation(X4)&(![X5]:![X6]:~(in(ordered_pair(X5,X6),X4))&~(X4=empty_set))),inference(variable_rename,[status(thm)],[99])).
% fof(101, negated_conjecture,(relation(esk9_0)&(![X5]:![X6]:~(in(ordered_pair(X5,X6),esk9_0))&~(esk9_0=empty_set))),inference(skolemize,[status(esa)],[100])).
% fof(102, negated_conjecture,![X5]:![X6]:((~(in(ordered_pair(X5,X6),esk9_0))&~(esk9_0=empty_set))&relation(esk9_0)),inference(shift_quantors,[status(thm)],[101])).
% cnf(103,negated_conjecture,(relation(esk9_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(104,negated_conjecture,(esk9_0!=empty_set),inference(split_conjunct,[status(thm)],[102])).
% cnf(105,negated_conjecture,(~in(ordered_pair(X1,X2),esk9_0)),inference(split_conjunct,[status(thm)],[102])).
% cnf(107,plain,(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2)))=X2|~relation(X1)|~in(X2,X1)),inference(rw,[status(thm)],[43,83,theory(equality)]),['unfolding']).
% cnf(109,negated_conjecture,(~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)),inference(rw,[status(thm)],[105,83,theory(equality)]),['unfolding']).
% cnf(111,plain,(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)))=X2|~relation(X1)|~in(X2,X1)),inference(rw,[status(thm)],[107,81,theory(equality)])).
% cnf(112,plain,(empty_set=esk7_0),inference(spm,[status(thm)],[50,76,theory(equality)])).
% cnf(120,negated_conjecture,(~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0)),inference(spm,[status(thm)],[109,81,theory(equality)])).
% cnf(125,plain,(empty(X1)|in(esk6_1(X1),X1)),inference(spm,[status(thm)],[93,73,theory(equality)])).
% cnf(134,plain,(esk7_0=X1|~empty(X1)),inference(rw,[status(thm)],[50,112,theory(equality)])).
% cnf(137,negated_conjecture,(esk9_0!=esk7_0),inference(rw,[status(thm)],[104,112,theory(equality)])).
% cnf(138,plain,(esk7_0=esk4_0),inference(spm,[status(thm)],[134,60,theory(equality)])).
% cnf(139,plain,(esk4_0=X1|~empty(X1)),inference(rw,[status(thm)],[134,138,theory(equality)])).
% cnf(143,negated_conjecture,(esk9_0!=esk4_0),inference(rw,[status(thm)],[137,138,theory(equality)])).
% cnf(158,negated_conjecture,(~in(X2,esk9_0)|~relation(X1)|~in(X2,X1)),inference(spm,[status(thm)],[120,111,theory(equality)])).
% cnf(177,negated_conjecture,(empty(esk9_0)|~relation(X1)|~in(esk6_1(esk9_0),X1)),inference(spm,[status(thm)],[158,125,theory(equality)])).
% cnf(180,negated_conjecture,(empty(esk9_0)|~relation(esk9_0)),inference(spm,[status(thm)],[177,125,theory(equality)])).
% cnf(181,negated_conjecture,(empty(esk9_0)|$false),inference(rw,[status(thm)],[180,103,theory(equality)])).
% cnf(182,negated_conjecture,(empty(esk9_0)),inference(cn,[status(thm)],[181,theory(equality)])).
% cnf(183,negated_conjecture,(esk4_0=esk9_0),inference(spm,[status(thm)],[139,182,theory(equality)])).
% cnf(186,negated_conjecture,($false),inference(sr,[status(thm)],[183,143,theory(equality)])).
% cnf(187,negated_conjecture,($false),186,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 96
% # ...of these trivial : 1
% # ...subsumed : 22
% # ...remaining for further processing: 73
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 10
% # Generated clauses : 61
% # ...of the previous two non-trivial : 60
% # Contextual simplify-reflections : 0
% # Paramodulations : 61
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 8
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 37
% # Clause-clause subsumption calls (NU) : 35
% # Rec. Clause-clause subsumption calls : 34
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 43 leaves, 1.40+/-0.782 terms/leaf
% # Paramod-from index: 14 leaves, 1.07+/-0.258 terms/leaf
% # Paramod-into index: 42 leaves, 1.36+/-0.750 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.001 s
% # Total time : 0.017 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/SystemOnTPTP1100/SEU186+1.tptp
%
%------------------------------------------------------------------------------