TSTP Solution File: SEU154+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU154+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:24:47 EST 2010
% Result : Theorem 1.39s
% Output : Solution 1.39s
% 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/SystemOnTPTP23949/SEU154+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23949/SEU154+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23949/SEU154+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 24081
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~((in(X3,X1)&in(X3,X2)))))&~((?[X3]:(in(X3,X1)&in(X3,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t3_xboole_0)).
% fof(5, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(41, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(77, conjecture,![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2)),file('/tmp/SRASS.s.p', l28_zfmisc_1)).
% fof(78, negated_conjecture,~(![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2))),inference(assume_negation,[status(cth)],[77])).
% fof(80, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~((in(X3,X1)&in(X3,X2)))))&~((?[X3]:(in(X3,X1)&in(X3,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(89, negated_conjecture,~(![X1]:![X2]:(~(in(X1,X2))=>disjoint(singleton(X1),X2))),inference(fof_simplification,[status(thm)],[78,theory(equality)])).
% fof(96, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(97, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[96])).
% cnf(98,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[97])).
% fof(99, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:(in(X3,X1)&in(X3,X2)))&(![X3]:(~(in(X3,X1))|~(in(X3,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[80])).
% fof(100, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:(in(X6,X4)&in(X6,X5)))&(![X7]:(~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[99])).
% fof(101, plain,![X4]:![X5]:((disjoint(X4,X5)|(in(esk1_2(X4,X5),X4)&in(esk1_2(X4,X5),X5)))&(![X7]:(~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[100])).
% fof(102, plain,![X4]:![X5]:![X7]:(((~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|(in(esk1_2(X4,X5),X4)&in(esk1_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[101])).
% fof(103, plain,![X4]:![X5]:![X7]:(((~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))&((in(esk1_2(X4,X5),X4)|disjoint(X4,X5))&(in(esk1_2(X4,X5),X5)|disjoint(X4,X5)))),inference(distribute,[status(thm)],[102])).
% cnf(104,plain,(disjoint(X1,X2)|in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[103])).
% cnf(105,plain,(disjoint(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[103])).
% fof(107, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(108, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[108])).
% fof(110, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[109])).
% fof(111, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[110])).
% cnf(115,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[111])).
% fof(262, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[41])).
% cnf(263,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[262])).
% fof(357, negated_conjecture,?[X1]:?[X2]:(~(in(X1,X2))&~(disjoint(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[89])).
% fof(358, negated_conjecture,?[X3]:?[X4]:(~(in(X3,X4))&~(disjoint(singleton(X3),X4))),inference(variable_rename,[status(thm)],[357])).
% fof(359, negated_conjecture,(~(in(esk14_0,esk15_0))&~(disjoint(singleton(esk14_0),esk15_0))),inference(skolemize,[status(esa)],[358])).
% cnf(360,negated_conjecture,(~disjoint(singleton(esk14_0),esk15_0)),inference(split_conjunct,[status(thm)],[359])).
% cnf(361,negated_conjecture,(~in(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[359])).
% cnf(374,plain,(X2=X3|unordered_pair(X2,X2)!=X1|~in(X3,X1)),inference(rw,[status(thm)],[115,263,theory(equality)]),['unfolding']).
% cnf(378,negated_conjecture,(~disjoint(unordered_pair(esk14_0,esk14_0),esk15_0)),inference(rw,[status(thm)],[360,263,theory(equality)]),['unfolding']).
% cnf(464,plain,(disjoint(X1,X2)|in(esk1_2(X2,X1),X1)),inference(spm,[status(thm)],[98,104,theory(equality)])).
% cnf(468,plain,(disjoint(X1,X2)|in(esk1_2(X2,X1),X2)),inference(spm,[status(thm)],[98,105,theory(equality)])).
% cnf(515,plain,(X1=X2|~in(X2,unordered_pair(X1,X1))),inference(er,[status(thm)],[374,theory(equality)])).
% cnf(2126,negated_conjecture,(in(esk1_2(esk15_0,unordered_pair(esk14_0,esk14_0)),unordered_pair(esk14_0,esk14_0))),inference(spm,[status(thm)],[378,464,theory(equality)])).
% cnf(2184,negated_conjecture,(in(esk1_2(esk15_0,unordered_pair(esk14_0,esk14_0)),esk15_0)),inference(spm,[status(thm)],[378,468,theory(equality)])).
% cnf(2425,negated_conjecture,(esk14_0=esk1_2(esk15_0,unordered_pair(esk14_0,esk14_0))),inference(spm,[status(thm)],[515,2126,theory(equality)])).
% cnf(2458,negated_conjecture,(in(esk14_0,esk15_0)),inference(rw,[status(thm)],[2184,2425,theory(equality)])).
% cnf(2459,negated_conjecture,($false),inference(sr,[status(thm)],[2458,361,theory(equality)])).
% cnf(2460,negated_conjecture,($false),2459,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 371
% # ...of these trivial : 7
% # ...subsumed : 82
% # ...remaining for further processing: 282
% # Other redundant clauses eliminated : 50
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 7
% # Generated clauses : 1721
% # ...of the previous two non-trivial : 1408
% # Contextual simplify-reflections : 0
% # Paramodulations : 1639
% # Factorizations : 14
% # Equation resolutions : 68
% # Current number of processed clauses: 157
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 25
% # Non-unit-clauses : 95
% # Current number of unprocessed clauses: 1133
% # ...number of literals in the above : 3470
% # Clause-clause subsumption calls (NU) : 377
% # Rec. Clause-clause subsumption calls : 356
% # Unit Clause-clause subsumption calls : 67
% # Rewrite failures with RHS unbound : 12
% # Indexed BW rewrite attempts : 99
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 98 leaves, 1.68+/-1.657 terms/leaf
% # Paramod-from index: 49 leaves, 1.37+/-0.661 terms/leaf
% # Paramod-into index: 89 leaves, 1.57+/-1.413 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.006 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP23949/SEU154+2.tptp
%
%------------------------------------------------------------------------------