TSTP Solution File: NUM390+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM390+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 : 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 : Wed Dec 29 18:54:14 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP19010/NUM390+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19010/NUM390+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19010/NUM390+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 19142
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(epsilon_transitive(X1)<=>![X2]:(in(X2,X1)=>subset(X2,X1))),file('/tmp/SRASS.s.p', d2_ordinal1)).
% fof(4, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(5, axiom,![X1]:![X2]:~((in(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', t7_ordinal1)).
% fof(6, axiom,![X1]:(epsilon_transitive(X1)=>![X2]:(ordinal(X2)=>(proper_subset(X1,X2)=>in(X1,X2)))),file('/tmp/SRASS.s.p', t21_ordinal1)).
% fof(7, axiom,![X1]:(ordinal(X1)=>(epsilon_transitive(X1)&epsilon_connected(X1))),file('/tmp/SRASS.s.p', cc1_ordinal1)).
% fof(17, axiom,![X1]:![X2]:(proper_subset(X1,X2)<=>(subset(X1,X2)&~(X1=X2))),file('/tmp/SRASS.s.p', d8_xboole_0)).
% fof(38, conjecture,![X1]:(epsilon_transitive(X1)=>![X2]:(ordinal(X2)=>![X3]:(ordinal(X3)=>((subset(X1,X2)&in(X2,X3))=>in(X1,X3))))),file('/tmp/SRASS.s.p', t22_ordinal1)).
% fof(39, negated_conjecture,~(![X1]:(epsilon_transitive(X1)=>![X2]:(ordinal(X2)=>![X3]:(ordinal(X3)=>((subset(X1,X2)&in(X2,X3))=>in(X1,X3)))))),inference(assume_negation,[status(cth)],[38])).
% fof(48, 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)],[2])).
% fof(49, 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)],[48])).
% fof(50, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&((in(esk1_1(X3),X3)&~(subset(esk1_1(X3),X3)))|epsilon_transitive(X3))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk1_1(X3),X3)&~(subset(esk1_1(X3),X3)))|epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[50])).
% fof(52, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk1_1(X3),X3)|epsilon_transitive(X3))&(~(subset(esk1_1(X3),X3))|epsilon_transitive(X3)))),inference(distribute,[status(thm)],[51])).
% cnf(55,plain,(subset(X2,X1)|~epsilon_transitive(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(58, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[4])).
% fof(59, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[58])).
% cnf(60,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X1]:![X2]:(~(in(X1,X2))|~(subset(X2,X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(62, plain,![X3]:![X4]:(~(in(X3,X4))|~(subset(X4,X3))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(~subset(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(64, plain,![X1]:(~(epsilon_transitive(X1))|![X2]:(~(ordinal(X2))|(~(proper_subset(X1,X2))|in(X1,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(65, plain,![X3]:(~(epsilon_transitive(X3))|![X4]:(~(ordinal(X4))|(~(proper_subset(X3,X4))|in(X3,X4)))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,![X3]:![X4]:((~(ordinal(X4))|(~(proper_subset(X3,X4))|in(X3,X4)))|~(epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[65])).
% cnf(67,plain,(in(X1,X2)|~epsilon_transitive(X1)|~proper_subset(X1,X2)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:(~(ordinal(X1))|(epsilon_transitive(X1)&epsilon_connected(X1))),inference(fof_nnf,[status(thm)],[7])).
% fof(69, plain,![X2]:(~(ordinal(X2))|(epsilon_transitive(X2)&epsilon_connected(X2))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X2]:((epsilon_transitive(X2)|~(ordinal(X2)))&(epsilon_connected(X2)|~(ordinal(X2)))),inference(distribute,[status(thm)],[69])).
% cnf(72,plain,(epsilon_transitive(X1)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(101, plain,![X1]:![X2]:((~(proper_subset(X1,X2))|(subset(X1,X2)&~(X1=X2)))&((~(subset(X1,X2))|X1=X2)|proper_subset(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(102, plain,![X3]:![X4]:((~(proper_subset(X3,X4))|(subset(X3,X4)&~(X3=X4)))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(variable_rename,[status(thm)],[101])).
% fof(103, plain,![X3]:![X4]:(((subset(X3,X4)|~(proper_subset(X3,X4)))&(~(X3=X4)|~(proper_subset(X3,X4))))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(distribute,[status(thm)],[102])).
% cnf(104,plain,(proper_subset(X1,X2)|X1=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[103])).
% fof(180, negated_conjecture,?[X1]:(epsilon_transitive(X1)&?[X2]:(ordinal(X2)&?[X3]:(ordinal(X3)&((subset(X1,X2)&in(X2,X3))&~(in(X1,X3)))))),inference(fof_nnf,[status(thm)],[39])).
% fof(181, negated_conjecture,?[X4]:(epsilon_transitive(X4)&?[X5]:(ordinal(X5)&?[X6]:(ordinal(X6)&((subset(X4,X5)&in(X5,X6))&~(in(X4,X6)))))),inference(variable_rename,[status(thm)],[180])).
% fof(182, negated_conjecture,(epsilon_transitive(esk14_0)&(ordinal(esk15_0)&(ordinal(esk16_0)&((subset(esk14_0,esk15_0)&in(esk15_0,esk16_0))&~(in(esk14_0,esk16_0)))))),inference(skolemize,[status(esa)],[181])).
% cnf(183,negated_conjecture,(~in(esk14_0,esk16_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(184,negated_conjecture,(in(esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(185,negated_conjecture,(subset(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(186,negated_conjecture,(ordinal(esk16_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(188,negated_conjecture,(epsilon_transitive(esk14_0)),inference(split_conjunct,[status(thm)],[182])).
% cnf(195,negated_conjecture,(epsilon_transitive(esk16_0)),inference(spm,[status(thm)],[72,186,theory(equality)])).
% cnf(199,negated_conjecture,(~in(esk15_0,esk14_0)),inference(spm,[status(thm)],[63,185,theory(equality)])).
% cnf(229,plain,(in(X1,X2)|X1=X2|~ordinal(X2)|~epsilon_transitive(X1)|~subset(X1,X2)),inference(spm,[status(thm)],[67,104,theory(equality)])).
% cnf(236,negated_conjecture,(subset(X1,esk16_0)|~in(X1,esk16_0)),inference(spm,[status(thm)],[55,195,theory(equality)])).
% cnf(275,negated_conjecture,(subset(X1,esk16_0)|~subset(X1,X2)|~in(X2,esk16_0)),inference(spm,[status(thm)],[60,236,theory(equality)])).
% cnf(412,negated_conjecture,(subset(esk14_0,esk16_0)|~in(esk15_0,esk16_0)),inference(spm,[status(thm)],[275,185,theory(equality)])).
% cnf(421,negated_conjecture,(subset(esk14_0,esk16_0)|$false),inference(rw,[status(thm)],[412,184,theory(equality)])).
% cnf(422,negated_conjecture,(subset(esk14_0,esk16_0)),inference(cn,[status(thm)],[421,theory(equality)])).
% cnf(430,negated_conjecture,(esk14_0=esk16_0|in(esk14_0,esk16_0)|~ordinal(esk16_0)|~epsilon_transitive(esk14_0)),inference(spm,[status(thm)],[229,422,theory(equality)])).
% cnf(435,negated_conjecture,(esk14_0=esk16_0|in(esk14_0,esk16_0)|$false|~epsilon_transitive(esk14_0)),inference(rw,[status(thm)],[430,186,theory(equality)])).
% cnf(436,negated_conjecture,(esk14_0=esk16_0|in(esk14_0,esk16_0)|$false|$false),inference(rw,[status(thm)],[435,188,theory(equality)])).
% cnf(437,negated_conjecture,(esk14_0=esk16_0|in(esk14_0,esk16_0)),inference(cn,[status(thm)],[436,theory(equality)])).
% cnf(438,negated_conjecture,(esk16_0=esk14_0),inference(sr,[status(thm)],[437,183,theory(equality)])).
% cnf(466,negated_conjecture,(in(esk15_0,esk14_0)),inference(rw,[status(thm)],[184,438,theory(equality)])).
% cnf(467,negated_conjecture,($false),inference(sr,[status(thm)],[466,199,theory(equality)])).
% cnf(468,negated_conjecture,($false),467,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 226
% # ...of these trivial : 3
% # ...subsumed : 35
% # ...remaining for further processing: 188
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 19
% # Generated clauses : 190
% # ...of the previous two non-trivial : 173
% # Contextual simplify-reflections : 17
% # Paramodulations : 189
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 106
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 67
% # Current number of unprocessed clauses: 59
% # ...number of literals in the above : 170
% # Clause-clause subsumption calls (NU) : 223
% # Rec. Clause-clause subsumption calls : 202
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 98 leaves, 1.23+/-0.753 terms/leaf
% # Paramod-from index: 51 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 91 leaves, 1.19+/-0.553 terms/leaf
% # -------------------------------------------------
% # User time : 0.024 s
% # System time : 0.003 s
% # Total time : 0.027 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP19010/NUM390+1.tptp
%
%------------------------------------------------------------------------------