TSTP Solution File: NUM404+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM404+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:51:07 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP17562/NUM404+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17562/NUM404+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17562/NUM404+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 17658
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(2, axiom,![X1]:![X2]:(ordinal(X2)=>(in(X1,X2)=>ordinal(X1))),file('/tmp/SRASS.s.p', t23_ordinal1)).
% fof(3, axiom,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),file('/tmp/SRASS.s.p', t24_ordinal1)).
% fof(10, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(11, axiom,![X1]:(epsilon_connected(X1)<=>![X2]:![X3]:~(((((in(X2,X1)&in(X3,X1))&~(in(X2,X3)))&~(X2=X3))&~(in(X3,X2))))),file('/tmp/SRASS.s.p', d3_ordinal1)).
% fof(13, axiom,![X1]:((epsilon_transitive(X1)&epsilon_connected(X1))=>ordinal(X1)),file('/tmp/SRASS.s.p', cc2_ordinal1)).
% fof(18, axiom,![X1]:(epsilon_transitive(X1)<=>![X2]:(in(X2,X1)=>subset(X2,X1))),file('/tmp/SRASS.s.p', d2_ordinal1)).
% fof(41, conjecture,![X1]:~(![X2]:(in(X2,X1)<=>ordinal(X2))),file('/tmp/SRASS.s.p', t37_ordinal1)).
% fof(42, negated_conjecture,~(![X1]:~(![X2]:(in(X2,X1)<=>ordinal(X2)))),inference(assume_negation,[status(cth)],[41])).
% fof(43, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(44, plain,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(46, plain,![X1]:(epsilon_connected(X1)<=>![X2]:![X3]:~(((((in(X2,X1)&in(X3,X1))&~(in(X2,X3)))&~(X2=X3))&~(in(X3,X2))))),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% fof(49, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[43])).
% fof(50, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X1]:![X2]:(~(ordinal(X2))|(~(in(X1,X2))|ordinal(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(53, plain,![X3]:![X4]:(~(ordinal(X4))|(~(in(X3,X4))|ordinal(X3))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(ordinal(X1)|~in(X1,X2)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X1]:(~(ordinal(X1))|![X2]:(~(ordinal(X2))|((in(X1,X2)|X1=X2)|in(X2,X1)))),inference(fof_nnf,[status(thm)],[44])).
% fof(56, plain,![X3]:(~(ordinal(X3))|![X4]:(~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X3]:![X4]:((~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))|~(ordinal(X3))),inference(shift_quantors,[status(thm)],[56])).
% cnf(58,plain,(in(X2,X1)|X1=X2|in(X1,X2)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[57])).
% fof(76, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(77, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk4_2(X4,X5),X4)&~(in(esk4_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk4_2(X4,X5),X4)&~(in(esk4_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[78])).
% fof(80, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk4_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk4_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[79])).
% cnf(81,plain,(subset(X1,X2)|~in(esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[80])).
% cnf(82,plain,(subset(X1,X2)|in(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[80])).
% fof(84, plain,![X1]:((~(epsilon_connected(X1))|![X2]:![X3]:((((~(in(X2,X1))|~(in(X3,X1)))|in(X2,X3))|X2=X3)|in(X3,X2)))&(?[X2]:?[X3]:((((in(X2,X1)&in(X3,X1))&~(in(X2,X3)))&~(X2=X3))&~(in(X3,X2)))|epsilon_connected(X1))),inference(fof_nnf,[status(thm)],[46])).
% fof(85, plain,![X4]:((~(epsilon_connected(X4))|![X5]:![X6]:((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5)))&(?[X7]:?[X8]:((((in(X7,X4)&in(X8,X4))&~(in(X7,X8)))&~(X7=X8))&~(in(X8,X7)))|epsilon_connected(X4))),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X4]:((~(epsilon_connected(X4))|![X5]:![X6]:((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5)))&(((((in(esk5_1(X4),X4)&in(esk6_1(X4),X4))&~(in(esk5_1(X4),esk6_1(X4))))&~(esk5_1(X4)=esk6_1(X4)))&~(in(esk6_1(X4),esk5_1(X4))))|epsilon_connected(X4))),inference(skolemize,[status(esa)],[85])).
% fof(87, plain,![X4]:![X5]:![X6]:((((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5))|~(epsilon_connected(X4)))&(((((in(esk5_1(X4),X4)&in(esk6_1(X4),X4))&~(in(esk5_1(X4),esk6_1(X4))))&~(esk5_1(X4)=esk6_1(X4)))&~(in(esk6_1(X4),esk5_1(X4))))|epsilon_connected(X4))),inference(shift_quantors,[status(thm)],[86])).
% fof(88, plain,![X4]:![X5]:![X6]:((((((~(in(X5,X4))|~(in(X6,X4)))|in(X5,X6))|X5=X6)|in(X6,X5))|~(epsilon_connected(X4)))&(((((in(esk5_1(X4),X4)|epsilon_connected(X4))&(in(esk6_1(X4),X4)|epsilon_connected(X4)))&(~(in(esk5_1(X4),esk6_1(X4)))|epsilon_connected(X4)))&(~(esk5_1(X4)=esk6_1(X4))|epsilon_connected(X4)))&(~(in(esk6_1(X4),esk5_1(X4)))|epsilon_connected(X4)))),inference(distribute,[status(thm)],[87])).
% cnf(89,plain,(epsilon_connected(X1)|~in(esk6_1(X1),esk5_1(X1))),inference(split_conjunct,[status(thm)],[88])).
% cnf(90,plain,(epsilon_connected(X1)|esk5_1(X1)!=esk6_1(X1)),inference(split_conjunct,[status(thm)],[88])).
% cnf(91,plain,(epsilon_connected(X1)|~in(esk5_1(X1),esk6_1(X1))),inference(split_conjunct,[status(thm)],[88])).
% cnf(92,plain,(epsilon_connected(X1)|in(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[88])).
% cnf(93,plain,(epsilon_connected(X1)|in(esk5_1(X1),X1)),inference(split_conjunct,[status(thm)],[88])).
% fof(100, plain,![X1]:((~(epsilon_transitive(X1))|~(epsilon_connected(X1)))|ordinal(X1)),inference(fof_nnf,[status(thm)],[13])).
% fof(101, plain,![X2]:((~(epsilon_transitive(X2))|~(epsilon_connected(X2)))|ordinal(X2)),inference(variable_rename,[status(thm)],[100])).
% cnf(102,plain,(ordinal(X1)|~epsilon_connected(X1)|~epsilon_transitive(X1)),inference(split_conjunct,[status(thm)],[101])).
% fof(120, plain,![X1]:((~(epsilon_transitive(X1))|![X2]:(~(in(X2,X1))|subset(X2,X1)))&(?[X2]:(in(X2,X1)&~(subset(X2,X1)))|epsilon_transitive(X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(121, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&(?[X5]:(in(X5,X3)&~(subset(X5,X3)))|epsilon_transitive(X3))),inference(variable_rename,[status(thm)],[120])).
% fof(122, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&((in(esk8_1(X3),X3)&~(subset(esk8_1(X3),X3)))|epsilon_transitive(X3))),inference(skolemize,[status(esa)],[121])).
% fof(123, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk8_1(X3),X3)&~(subset(esk8_1(X3),X3)))|epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[122])).
% fof(124, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk8_1(X3),X3)|epsilon_transitive(X3))&(~(subset(esk8_1(X3),X3))|epsilon_transitive(X3)))),inference(distribute,[status(thm)],[123])).
% cnf(125,plain,(epsilon_transitive(X1)|~subset(esk8_1(X1),X1)),inference(split_conjunct,[status(thm)],[124])).
% cnf(126,plain,(epsilon_transitive(X1)|in(esk8_1(X1),X1)),inference(split_conjunct,[status(thm)],[124])).
% fof(224, negated_conjecture,?[X1]:![X2]:((~(in(X2,X1))|ordinal(X2))&(~(ordinal(X2))|in(X2,X1))),inference(fof_nnf,[status(thm)],[42])).
% fof(225, negated_conjecture,?[X3]:![X4]:((~(in(X4,X3))|ordinal(X4))&(~(ordinal(X4))|in(X4,X3))),inference(variable_rename,[status(thm)],[224])).
% fof(226, negated_conjecture,![X4]:((~(in(X4,esk19_0))|ordinal(X4))&(~(ordinal(X4))|in(X4,esk19_0))),inference(skolemize,[status(esa)],[225])).
% cnf(227,negated_conjecture,(in(X1,esk19_0)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[226])).
% cnf(228,negated_conjecture,(ordinal(X1)|~in(X1,esk19_0)),inference(split_conjunct,[status(thm)],[226])).
% cnf(244,negated_conjecture,(~in(esk19_0,X1)|~ordinal(X1)),inference(spm,[status(thm)],[51,227,theory(equality)])).
% cnf(263,negated_conjecture,(ordinal(esk5_1(esk19_0))|epsilon_connected(esk19_0)),inference(spm,[status(thm)],[228,93,theory(equality)])).
% cnf(267,negated_conjecture,(ordinal(esk6_1(esk19_0))|epsilon_connected(esk19_0)),inference(spm,[status(thm)],[228,92,theory(equality)])).
% cnf(271,negated_conjecture,(ordinal(esk8_1(esk19_0))|epsilon_transitive(esk19_0)),inference(spm,[status(thm)],[228,126,theory(equality)])).
% cnf(292,plain,(ordinal(esk4_2(X1,X2))|subset(X1,X2)|~ordinal(X1)),inference(spm,[status(thm)],[54,82,theory(equality)])).
% cnf(294,negated_conjecture,(subset(X1,esk19_0)|~ordinal(esk4_2(X1,esk19_0))),inference(spm,[status(thm)],[81,227,theory(equality)])).
% cnf(330,negated_conjecture,(~ordinal(esk19_0)),inference(spm,[status(thm)],[244,227,theory(equality)])).
% cnf(591,negated_conjecture,(subset(X1,esk19_0)|~ordinal(X1)),inference(spm,[status(thm)],[294,292,theory(equality)])).
% cnf(611,negated_conjecture,(epsilon_transitive(esk19_0)|~ordinal(esk8_1(esk19_0))),inference(spm,[status(thm)],[125,591,theory(equality)])).
% cnf(614,negated_conjecture,(epsilon_transitive(esk19_0)),inference(csr,[status(thm)],[611,271])).
% cnf(615,negated_conjecture,(ordinal(esk19_0)|~epsilon_connected(esk19_0)),inference(spm,[status(thm)],[102,614,theory(equality)])).
% cnf(618,negated_conjecture,(~epsilon_connected(esk19_0)),inference(sr,[status(thm)],[615,330,theory(equality)])).
% cnf(621,negated_conjecture,(ordinal(esk5_1(esk19_0))),inference(sr,[status(thm)],[263,618,theory(equality)])).
% cnf(622,negated_conjecture,(ordinal(esk6_1(esk19_0))),inference(sr,[status(thm)],[267,618,theory(equality)])).
% cnf(627,negated_conjecture,(X1=esk5_1(esk19_0)|in(esk5_1(esk19_0),X1)|in(X1,esk5_1(esk19_0))|~ordinal(X1)),inference(spm,[status(thm)],[58,621,theory(equality)])).
% cnf(3766,negated_conjecture,(esk6_1(esk19_0)=esk5_1(esk19_0)|in(esk6_1(esk19_0),esk5_1(esk19_0))|in(esk5_1(esk19_0),esk6_1(esk19_0))),inference(spm,[status(thm)],[627,622,theory(equality)])).
% cnf(5341,negated_conjecture,(epsilon_connected(esk19_0)|esk6_1(esk19_0)=esk5_1(esk19_0)|in(esk5_1(esk19_0),esk6_1(esk19_0))),inference(spm,[status(thm)],[89,3766,theory(equality)])).
% cnf(5355,negated_conjecture,(esk6_1(esk19_0)=esk5_1(esk19_0)|in(esk5_1(esk19_0),esk6_1(esk19_0))),inference(sr,[status(thm)],[5341,618,theory(equality)])).
% cnf(5373,negated_conjecture,(epsilon_connected(esk19_0)|esk6_1(esk19_0)=esk5_1(esk19_0)),inference(spm,[status(thm)],[91,5355,theory(equality)])).
% cnf(5387,negated_conjecture,(esk6_1(esk19_0)=esk5_1(esk19_0)),inference(sr,[status(thm)],[5373,618,theory(equality)])).
% cnf(5388,negated_conjecture,(epsilon_connected(esk19_0)),inference(spm,[status(thm)],[90,5387,theory(equality)])).
% cnf(5491,negated_conjecture,($false),inference(sr,[status(thm)],[5388,618,theory(equality)])).
% cnf(5492,negated_conjecture,($false),5491,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1039
% # ...of these trivial : 9
% # ...subsumed : 491
% # ...remaining for further processing: 539
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 30
% # Backward-rewritten : 64
% # Generated clauses : 3238
% # ...of the previous two non-trivial : 2848
% # Contextual simplify-reflections : 328
% # Paramodulations : 3226
% # Factorizations : 3
% # Equation resolutions : 0
% # Current number of processed clauses: 359
% # Positive orientable unit clauses: 49
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 299
% # Current number of unprocessed clauses: 1532
% # ...number of literals in the above : 7679
% # Clause-clause subsumption calls (NU) : 6756
% # Rec. Clause-clause subsumption calls : 4116
% # Unit Clause-clause subsumption calls : 400
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 306 leaves, 1.17+/-0.575 terms/leaf
% # Paramod-from index: 173 leaves, 1.04+/-0.197 terms/leaf
% # Paramod-into index: 276 leaves, 1.11+/-0.429 terms/leaf
% # -------------------------------------------------
% # User time : 0.177 s
% # System time : 0.007 s
% # Total time : 0.184 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.34 CPU 0.42 WC
% FINAL PrfWatch: 0.34 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP17562/NUM404+1.tptp
%
%------------------------------------------------------------------------------