TSTP Solution File: NUM385+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM385+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 : art02.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:51 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP16720/NUM385+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16720/NUM385+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16720/NUM385+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 16816
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:in(X1,succ(X1)),file('/tmp/SRASS.s.p', t10_ordinal1)).
% fof(4, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(6, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(10, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(11, 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(35, conjecture,![X1]:![X2]:(succ(X1)=succ(X2)=>X1=X2),file('/tmp/SRASS.s.p', t12_ordinal1)).
% fof(36, negated_conjecture,~(![X1]:![X2]:(succ(X1)=succ(X2)=>X1=X2)),inference(assume_negation,[status(cth)],[35])).
% fof(38, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(48, plain,![X2]:in(X2,succ(X2)),inference(variable_rename,[status(thm)],[3])).
% cnf(49,plain,(in(X1,succ(X1))),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[38])).
% fof(51, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(55, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(56,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(65, 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)],[10])).
% fof(66, 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)],[65])).
% fof(67, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk3_2(X4,X5),X5))|~(esk3_2(X4,X5)=X4))&(in(esk3_2(X4,X5),X5)|esk3_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[66])).
% fof(68, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk3_2(X4,X5),X5))|~(esk3_2(X4,X5)=X4))&(in(esk3_2(X4,X5),X5)|esk3_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[67])).
% fof(69, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk3_2(X4,X5),X5))|~(esk3_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk3_2(X4,X5),X5)|esk3_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[68])).
% cnf(73,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(74, 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)],[11])).
% fof(75, 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)],[74])).
% fof(76, 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(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[75])).
% fof(77, 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(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[76])).
% fof(78, 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(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk4_3(X5,X6,X7),X6))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[77])).
% cnf(84,plain,(in(X4,X3)|in(X4,X2)|X1!=set_union2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(165, negated_conjecture,?[X1]:?[X2]:(succ(X1)=succ(X2)&~(X1=X2)),inference(fof_nnf,[status(thm)],[36])).
% fof(166, negated_conjecture,?[X3]:?[X4]:(succ(X3)=succ(X4)&~(X3=X4)),inference(variable_rename,[status(thm)],[165])).
% fof(167, negated_conjecture,(succ(esk14_0)=succ(esk15_0)&~(esk14_0=esk15_0)),inference(skolemize,[status(esa)],[166])).
% cnf(168,negated_conjecture,(esk14_0!=esk15_0),inference(split_conjunct,[status(thm)],[167])).
% cnf(169,negated_conjecture,(succ(esk14_0)=succ(esk15_0)),inference(split_conjunct,[status(thm)],[167])).
% cnf(170,negated_conjecture,(set_union2(esk15_0,singleton(esk15_0))=set_union2(esk14_0,singleton(esk14_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[169,56,theory(equality)]),56,theory(equality)]),['unfolding']).
% cnf(171,plain,(in(X1,set_union2(X1,singleton(X1)))),inference(rw,[status(thm)],[49,56,theory(equality)]),['unfolding']).
% cnf(201,negated_conjecture,(in(esk14_0,set_union2(esk15_0,singleton(esk15_0)))),inference(spm,[status(thm)],[171,170,theory(equality)])).
% cnf(238,plain,(in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2))),inference(er,[status(thm)],[84,theory(equality)])).
% cnf(481,negated_conjecture,(in(X1,esk14_0)|in(X1,singleton(esk14_0))|~in(X1,set_union2(esk15_0,singleton(esk15_0)))),inference(spm,[status(thm)],[238,170,theory(equality)])).
% cnf(487,negated_conjecture,(in(esk14_0,esk15_0)|in(esk14_0,singleton(esk15_0))),inference(spm,[status(thm)],[238,201,theory(equality)])).
% cnf(500,negated_conjecture,(X1=esk14_0|in(esk14_0,esk15_0)|singleton(X1)!=singleton(esk15_0)),inference(spm,[status(thm)],[73,487,theory(equality)])).
% cnf(501,negated_conjecture,(esk15_0=esk14_0|in(esk14_0,esk15_0)),inference(er,[status(thm)],[500,theory(equality)])).
% cnf(502,negated_conjecture,(in(esk14_0,esk15_0)),inference(sr,[status(thm)],[501,168,theory(equality)])).
% cnf(504,negated_conjecture,(~in(esk15_0,esk14_0)),inference(spm,[status(thm)],[52,502,theory(equality)])).
% cnf(1512,negated_conjecture,(in(esk15_0,singleton(esk14_0))|in(esk15_0,esk14_0)),inference(spm,[status(thm)],[481,171,theory(equality)])).
% cnf(1517,negated_conjecture,(in(esk15_0,singleton(esk14_0))),inference(sr,[status(thm)],[1512,504,theory(equality)])).
% cnf(1520,negated_conjecture,(X1=esk15_0|singleton(X1)!=singleton(esk14_0)),inference(spm,[status(thm)],[73,1517,theory(equality)])).
% cnf(1523,negated_conjecture,(esk14_0=esk15_0),inference(er,[status(thm)],[1520,theory(equality)])).
% cnf(1524,negated_conjecture,($false),inference(sr,[status(thm)],[1523,168,theory(equality)])).
% cnf(1525,negated_conjecture,($false),1524,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 884
% # ...of these trivial : 5
% # ...subsumed : 607
% # ...remaining for further processing: 272
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 11
% # Generated clauses : 1241
% # ...of the previous two non-trivial : 1158
% # Contextual simplify-reflections : 3
% # Paramodulations : 1178
% # Factorizations : 32
% # Equation resolutions : 28
% # Current number of processed clauses: 201
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 77
% # Non-unit-clauses : 89
% # Current number of unprocessed clauses: 372
% # ...number of literals in the above : 1221
% # Clause-clause subsumption calls (NU) : 1442
% # Rec. Clause-clause subsumption calls : 1210
% # Unit Clause-clause subsumption calls : 1056
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 33
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 152 leaves, 1.95+/-2.592 terms/leaf
% # Paramod-from index: 50 leaves, 1.34+/-1.595 terms/leaf
% # Paramod-into index: 145 leaves, 1.86+/-2.491 terms/leaf
% # -------------------------------------------------
% # User time : 0.057 s
% # System time : 0.004 s
% # Total time : 0.061 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.24 WC
% FINAL PrfWatch: 0.16 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP16720/NUM385+1.tptp
%
%------------------------------------------------------------------------------