%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM388+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:09 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP18661/NUM388+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18661/NUM388+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18661/NUM388+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 18793
% 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]:(ordinal(X1)=>(epsilon_transitive(X1)&epsilon_connected(X1))),file('/tmp/SRASS.s.p', cc1_ordinal1)).
% fof(5, axiom,![X1]:(epsilon_transitive(X1)<=>![X2]:(in(X2,X1)=>subset(X2,X1))),file('/tmp/SRASS.s.p', d2_ordinal1)).
% fof(6, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(12, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(13, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(18, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(32, conjecture,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>![X3]:(epsilon_transitive(X3)=>((in(X3,X1)&in(X1,X2))=>in(X3,X2))))),file('/tmp/SRASS.s.p', t19_ordinal1)).
% fof(33, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>![X3]:(epsilon_transitive(X3)=>((in(X3,X1)&in(X1,X2))=>in(X3,X2)))))),inference(assume_negation,[status(cth)],[32])).
% fof(40, plain,![X1]:(~(ordinal(X1))|(epsilon_transitive(X1)&epsilon_connected(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(41, plain,![X2]:(~(ordinal(X2))|(epsilon_transitive(X2)&epsilon_connected(X2))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X2]:((epsilon_transitive(X2)|~(ordinal(X2)))&(epsilon_connected(X2)|~(ordinal(X2)))),inference(distribute,[status(thm)],[41])).
% cnf(44,plain,(epsilon_transitive(X1)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(53, 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)],[5])).
% fof(54, 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)],[53])).
% fof(55, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&((in(esk2_1(X3),X3)&~(subset(esk2_1(X3),X3)))|epsilon_transitive(X3))),inference(skolemize,[status(esa)],[54])).
% fof(56, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk2_1(X3),X3)&~(subset(esk2_1(X3),X3)))|epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk2_1(X3),X3)|epsilon_transitive(X3))&(~(subset(esk2_1(X3),X3))|epsilon_transitive(X3)))),inference(distribute,[status(thm)],[56])).
% cnf(60,plain,(subset(X2,X1)|~epsilon_transitive(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(61, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(62, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[61])).
% cnf(63,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(78, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[12])).
% fof(79, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[79])).
% fof(81, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(82, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(98, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[18])).
% fof(99, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[99])).
% fof(151, negated_conjecture,?[X1]:(ordinal(X1)&?[X2]:(ordinal(X2)&?[X3]:(epsilon_transitive(X3)&((in(X3,X1)&in(X1,X2))&~(in(X3,X2)))))),inference(fof_nnf,[status(thm)],[33])).
% fof(152, negated_conjecture,?[X4]:(ordinal(X4)&?[X5]:(ordinal(X5)&?[X6]:(epsilon_transitive(X6)&((in(X6,X4)&in(X4,X5))&~(in(X6,X5)))))),inference(variable_rename,[status(thm)],[151])).
% fof(153, negated_conjecture,(ordinal(esk14_0)&(ordinal(esk15_0)&(epsilon_transitive(esk16_0)&((in(esk16_0,esk14_0)&in(esk14_0,esk15_0))&~(in(esk16_0,esk15_0)))))),inference(skolemize,[status(esa)],[152])).
% cnf(154,negated_conjecture,(~in(esk16_0,esk15_0)),inference(split_conjunct,[status(thm)],[153])).
% cnf(155,negated_conjecture,(in(esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[153])).
% cnf(156,negated_conjecture,(in(esk16_0,esk14_0)),inference(split_conjunct,[status(thm)],[153])).
% cnf(158,negated_conjecture,(ordinal(esk15_0)),inference(split_conjunct,[status(thm)],[153])).
% cnf(165,negated_conjecture,(epsilon_transitive(esk15_0)),inference(spm,[status(thm)],[44,158,theory(equality)])).
% cnf(170,negated_conjecture,(~empty(esk15_0)),inference(spm,[status(thm)],[63,155,theory(equality)])).
% cnf(199,plain,(element(X1,X2)|~in(X1,X3)|~subset(X3,X2)),inference(spm,[status(thm)],[80,100,theory(equality)])).
% cnf(285,plain,(element(X1,X2)|~in(X1,X3)|~epsilon_transitive(X2)|~in(X3,X2)),inference(spm,[status(thm)],[199,60,theory(equality)])).
% cnf(303,negated_conjecture,(element(esk16_0,X1)|~epsilon_transitive(X1)|~in(esk14_0,X1)),inference(spm,[status(thm)],[285,156,theory(equality)])).
% cnf(309,negated_conjecture,(element(esk16_0,esk15_0)|~in(esk14_0,esk15_0)),inference(spm,[status(thm)],[303,165,theory(equality)])).
% cnf(316,negated_conjecture,(element(esk16_0,esk15_0)|$false),inference(rw,[status(thm)],[309,155,theory(equality)])).
% cnf(317,negated_conjecture,(element(esk16_0,esk15_0)),inference(cn,[status(thm)],[316,theory(equality)])).
% cnf(318,negated_conjecture,(empty(esk15_0)|in(esk16_0,esk15_0)),inference(spm,[status(thm)],[83,317,theory(equality)])).
% cnf(319,negated_conjecture,(in(esk16_0,esk15_0)),inference(sr,[status(thm)],[318,170,theory(equality)])).
% cnf(320,negated_conjecture,($false),inference(sr,[status(thm)],[319,154,theory(equality)])).
% cnf(321,negated_conjecture,($false),320,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 179
% # ...of these trivial : 3
% # ...subsumed : 10
% # ...remaining for further processing: 166
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 116
% # ...of the previous two non-trivial : 101
% # Contextual simplify-reflections : 4
% # Paramodulations : 107
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 95
% # Positive orientable unit clauses: 39
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 46
% # Current number of unprocessed clauses: 28
% # ...number of literals in the above : 88
% # Clause-clause subsumption calls (NU) : 273
% # Rec. Clause-clause subsumption calls : 256
% # Unit Clause-clause subsumption calls : 184
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 97 leaves, 1.16+/-0.586 terms/leaf
% # Paramod-from index: 56 leaves, 1.02+/-0.132 terms/leaf
% # Paramod-into index: 92 leaves, 1.14+/-0.480 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.006 s
% # Total time : 0.023 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/SystemOnTPTP18661/NUM388+1.tptp
%
%------------------------------------------------------------------------------