TSTP Solution File: NUM386+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM386+1 : TPTP v5.0.0. Released v3.2.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 : Wed Dec 29 18:48:59 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP16267/NUM386+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16267/NUM386+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16267/NUM386+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 16363
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(5, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(8, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(34, conjecture,![X1]:![X2]:(in(X1,succ(X2))<=>(in(X1,X2)|X1=X2)),file('/tmp/SRASS.s.p', t13_ordinal1)).
% fof(35, negated_conjecture,~(![X1]:![X2]:(in(X1,succ(X2))<=>(in(X1,X2)|X1=X2))),inference(assume_negation,[status(cth)],[34])).
% fof(45, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)|in(X4,X2)))&((~(in(X4,X1))&~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))&~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)|in(X4,X2))))|X3=set_union2(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(46, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))&~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)|in(X9,X6))))|X7=set_union2(X5,X6))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))&~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7)))|~(X7=set_union2(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))&~(in(esk1_3(X5,X6,X7),X6))))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[47])).
% fof(49, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk1_3(X5,X6,X7),X5))|~(in(esk1_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk1_3(X5,X6,X7),X6))|~(in(esk1_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[48])).
% cnf(53,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[49])).
% cnf(54,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[49])).
% cnf(55,plain,(in(X4,X3)|in(X4,X2)|X1!=set_union2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(61, 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(62, 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)],[61])).
% fof(63, 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)],[62])).
% fof(64, 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)],[63])).
% fof(65, 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)],[64])).
% cnf(68,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[65])).
% cnf(69,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(75, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[8])).
% cnf(76,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[75])).
% fof(162, negated_conjecture,?[X1]:?[X2]:((~(in(X1,succ(X2)))|(~(in(X1,X2))&~(X1=X2)))&(in(X1,succ(X2))|(in(X1,X2)|X1=X2))),inference(fof_nnf,[status(thm)],[35])).
% fof(163, negated_conjecture,?[X3]:?[X4]:((~(in(X3,succ(X4)))|(~(in(X3,X4))&~(X3=X4)))&(in(X3,succ(X4))|(in(X3,X4)|X3=X4))),inference(variable_rename,[status(thm)],[162])).
% fof(164, negated_conjecture,((~(in(esk14_0,succ(esk15_0)))|(~(in(esk14_0,esk15_0))&~(esk14_0=esk15_0)))&(in(esk14_0,succ(esk15_0))|(in(esk14_0,esk15_0)|esk14_0=esk15_0))),inference(skolemize,[status(esa)],[163])).
% fof(165, negated_conjecture,(((~(in(esk14_0,esk15_0))|~(in(esk14_0,succ(esk15_0))))&(~(esk14_0=esk15_0)|~(in(esk14_0,succ(esk15_0)))))&(in(esk14_0,succ(esk15_0))|(in(esk14_0,esk15_0)|esk14_0=esk15_0))),inference(distribute,[status(thm)],[164])).
% cnf(166,negated_conjecture,(esk14_0=esk15_0|in(esk14_0,esk15_0)|in(esk14_0,succ(esk15_0))),inference(split_conjunct,[status(thm)],[165])).
% cnf(167,negated_conjecture,(~in(esk14_0,succ(esk15_0))|esk14_0!=esk15_0),inference(split_conjunct,[status(thm)],[165])).
% cnf(168,negated_conjecture,(~in(esk14_0,succ(esk15_0))|~in(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[165])).
% cnf(169,negated_conjecture,(esk15_0=esk14_0|in(esk14_0,esk15_0)|in(esk14_0,set_union2(esk15_0,singleton(esk15_0)))),inference(rw,[status(thm)],[166,76,theory(equality)]),['unfolding']).
% cnf(171,negated_conjecture,(esk15_0!=esk14_0|~in(esk14_0,set_union2(esk15_0,singleton(esk15_0)))),inference(rw,[status(thm)],[167,76,theory(equality)]),['unfolding']).
% cnf(172,negated_conjecture,(~in(esk14_0,esk15_0)|~in(esk14_0,set_union2(esk15_0,singleton(esk15_0)))),inference(rw,[status(thm)],[168,76,theory(equality)]),['unfolding']).
% cnf(176,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[68,theory(equality)])).
% cnf(191,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[176,theory(equality)])).
% cnf(215,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[53,theory(equality)])).
% cnf(222,plain,(in(X1,set_union2(X2,X3))|~in(X1,X2)),inference(er,[status(thm)],[54,theory(equality)])).
% cnf(229,plain,(in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2))),inference(er,[status(thm)],[55,theory(equality)])).
% cnf(298,negated_conjecture,(esk14_0!=esk15_0|~in(esk14_0,singleton(esk15_0))),inference(spm,[status(thm)],[171,215,theory(equality)])).
% cnf(365,negated_conjecture,(~in(esk14_0,esk15_0)),inference(spm,[status(thm)],[172,222,theory(equality)])).
% cnf(384,negated_conjecture,(esk14_0=esk15_0|in(esk14_0,set_union2(esk15_0,singleton(esk15_0)))),inference(sr,[status(thm)],[169,365,theory(equality)])).
% cnf(419,negated_conjecture,(in(esk14_0,esk15_0)|in(esk14_0,singleton(esk15_0))|esk14_0=esk15_0),inference(spm,[status(thm)],[229,384,theory(equality)])).
% cnf(427,negated_conjecture,(in(esk14_0,singleton(esk15_0))|esk14_0=esk15_0),inference(sr,[status(thm)],[419,365,theory(equality)])).
% cnf(430,negated_conjecture,(X1=esk14_0|esk14_0=esk15_0|singleton(X1)!=singleton(esk15_0)),inference(spm,[status(thm)],[69,427,theory(equality)])).
% cnf(433,negated_conjecture,(esk14_0=esk15_0),inference(er,[status(thm)],[430,theory(equality)])).
% cnf(445,negated_conjecture,($false|~in(esk14_0,singleton(esk15_0))),inference(rw,[status(thm)],[298,433,theory(equality)])).
% cnf(446,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[445,433,theory(equality)]),191,theory(equality)])).
% cnf(447,negated_conjecture,($false),inference(cn,[status(thm)],[446,theory(equality)])).
% cnf(448,negated_conjecture,($false),447,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 226
% # ...of these trivial : 4
% # ...subsumed : 74
% # ...remaining for further processing: 148
% # Other redundant clauses eliminated : 10
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 17
% # Generated clauses : 230
% # ...of the previous two non-trivial : 182
% # Contextual simplify-reflections : 2
% # Paramodulations : 207
% # Factorizations : 6
% # Equation resolutions : 16
% # Current number of processed clauses: 72
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 12
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 66
% # ...number of literals in the above : 195
% # Clause-clause subsumption calls (NU) : 220
% # Rec. Clause-clause subsumption calls : 205
% # Unit Clause-clause subsumption calls : 35
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 69 leaves, 1.33+/-1.125 terms/leaf
% # Paramod-from index: 36 leaves, 1.11+/-0.458 terms/leaf
% # Paramod-into index: 67 leaves, 1.27+/-0.924 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.003 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP16267/NUM386+1.tptp
%
%------------------------------------------------------------------------------