%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU113+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 : art04.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 : Thu Dec 30 01:08:29 EST 2010
% Result : Theorem 1.54s
% Output : Solution 1.54s
% 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/SystemOnTPTP13635/SEU113+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13635/SEU113+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13635/SEU113+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 13731
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(3, axiom,![X1]:~(empty(powerset(X1))),file('/tmp/SRASS.s.p', fc1_subset_1)).
% fof(4, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(5, axiom,![X1]:preboolean(finite_subsets(X1)),file('/tmp/SRASS.s.p', dt_k5_finsub_1)).
% fof(13, axiom,![X1]:![X2]:(preboolean(X2)=>(X2=finite_subsets(X1)<=>![X3]:(in(X3,X2)<=>(subset(X3,X1)&finite(X3))))),file('/tmp/SRASS.s.p', d5_finsub_1)).
% fof(24, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(33, conjecture,![X1]:subset(finite_subsets(X1),powerset(X1)),file('/tmp/SRASS.s.p', t26_finsub_1)).
% fof(34, negated_conjecture,~(![X1]:subset(finite_subsets(X1),powerset(X1))),inference(assume_negation,[status(cth)],[33])).
% fof(35, plain,![X1]:~(empty(powerset(X1))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(47, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(48, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(51, plain,![X2]:~(empty(powerset(X2))),inference(variable_rename,[status(thm)],[35])).
% cnf(52,plain,(~empty(powerset(X1))),inference(split_conjunct,[status(thm)],[51])).
% fof(53, 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)],[4])).
% fof(54, 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)],[53])).
% fof(55, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[54])).
% fof(56, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[56])).
% cnf(58,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[57])).
% fof(61, plain,![X2]:preboolean(finite_subsets(X2)),inference(variable_rename,[status(thm)],[5])).
% cnf(62,plain,(preboolean(finite_subsets(X1))),inference(split_conjunct,[status(thm)],[61])).
% fof(88, plain,![X1]:![X2]:(~(preboolean(X2))|((~(X2=finite_subsets(X1))|![X3]:((~(in(X3,X2))|(subset(X3,X1)&finite(X3)))&((~(subset(X3,X1))|~(finite(X3)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|(~(subset(X3,X1))|~(finite(X3))))&(in(X3,X2)|(subset(X3,X1)&finite(X3))))|X2=finite_subsets(X1)))),inference(fof_nnf,[status(thm)],[13])).
% fof(89, plain,![X4]:![X5]:(~(preboolean(X5))|((~(X5=finite_subsets(X4))|![X6]:((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|(~(subset(X7,X4))|~(finite(X7))))&(in(X7,X5)|(subset(X7,X4)&finite(X7))))|X5=finite_subsets(X4)))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X4]:![X5]:(~(preboolean(X5))|((~(X5=finite_subsets(X4))|![X6]:((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))))&(((~(in(esk7_2(X4,X5),X5))|(~(subset(esk7_2(X4,X5),X4))|~(finite(esk7_2(X4,X5)))))&(in(esk7_2(X4,X5),X5)|(subset(esk7_2(X4,X5),X4)&finite(esk7_2(X4,X5)))))|X5=finite_subsets(X4)))),inference(skolemize,[status(esa)],[89])).
% fof(91, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5)))|~(X5=finite_subsets(X4)))&(((~(in(esk7_2(X4,X5),X5))|(~(subset(esk7_2(X4,X5),X4))|~(finite(esk7_2(X4,X5)))))&(in(esk7_2(X4,X5),X5)|(subset(esk7_2(X4,X5),X4)&finite(esk7_2(X4,X5)))))|X5=finite_subsets(X4)))|~(preboolean(X5))),inference(shift_quantors,[status(thm)],[90])).
% fof(92, plain,![X4]:![X5]:![X6]:((((((subset(X6,X4)|~(in(X6,X5)))|~(X5=finite_subsets(X4)))|~(preboolean(X5)))&(((finite(X6)|~(in(X6,X5)))|~(X5=finite_subsets(X4)))|~(preboolean(X5))))&((((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))|~(X5=finite_subsets(X4)))|~(preboolean(X5))))&((((~(in(esk7_2(X4,X5),X5))|(~(subset(esk7_2(X4,X5),X4))|~(finite(esk7_2(X4,X5)))))|X5=finite_subsets(X4))|~(preboolean(X5)))&((((subset(esk7_2(X4,X5),X4)|in(esk7_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))&(((finite(esk7_2(X4,X5))|in(esk7_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))))),inference(distribute,[status(thm)],[91])).
% cnf(98,plain,(subset(X3,X2)|~preboolean(X1)|X1!=finite_subsets(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(142, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(143, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[142])).
% cnf(144,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[143])).
% fof(183, negated_conjecture,?[X1]:~(subset(finite_subsets(X1),powerset(X1))),inference(fof_nnf,[status(thm)],[34])).
% fof(184, negated_conjecture,?[X2]:~(subset(finite_subsets(X2),powerset(X2))),inference(variable_rename,[status(thm)],[183])).
% fof(185, negated_conjecture,~(subset(finite_subsets(esk13_0),powerset(esk13_0))),inference(skolemize,[status(esa)],[184])).
% cnf(186,negated_conjecture,(~subset(finite_subsets(esk13_0),powerset(esk13_0))),inference(split_conjunct,[status(thm)],[185])).
% cnf(264,plain,(subset(esk1_2(X1,X2),X3)|subset(X1,X2)|finite_subsets(X3)!=X1|~preboolean(X1)),inference(pm,[status(thm)],[98,59,theory(equality)])).
% cnf(582,plain,(subset(esk1_2(finite_subsets(X1),X2),X1)|subset(finite_subsets(X1),X2)|~preboolean(finite_subsets(X1))),inference(er,[status(thm)],[264,theory(equality)])).
% cnf(583,plain,(subset(esk1_2(finite_subsets(X1),X2),X1)|subset(finite_subsets(X1),X2)|$false),inference(rw,[status(thm)],[582,62,theory(equality)])).
% cnf(584,plain,(subset(esk1_2(finite_subsets(X1),X2),X1)|subset(finite_subsets(X1),X2)),inference(cn,[status(thm)],[583,theory(equality)])).
% cnf(1995,plain,(element(esk1_2(finite_subsets(X1),X2),powerset(X1))|subset(finite_subsets(X1),X2)),inference(pm,[status(thm)],[49,584,theory(equality)])).
% cnf(7883,plain,(in(esk1_2(finite_subsets(X1),X2),powerset(X1))|empty(powerset(X1))|subset(finite_subsets(X1),X2)),inference(pm,[status(thm)],[144,1995,theory(equality)])).
% cnf(7888,plain,(in(esk1_2(finite_subsets(X1),X2),powerset(X1))|subset(finite_subsets(X1),X2)),inference(sr,[status(thm)],[7883,52,theory(equality)])).
% cnf(13801,plain,(subset(finite_subsets(X1),powerset(X1))),inference(pm,[status(thm)],[58,7888,theory(equality)])).
% cnf(13811,negated_conjecture,($false),inference(rw,[status(thm)],[186,13801,theory(equality)])).
% cnf(13812,negated_conjecture,($false),inference(cn,[status(thm)],[13811,theory(equality)])).
% cnf(13813,negated_conjecture,($false),13812,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1939
% # ...of these trivial : 12
% # ...subsumed : 688
% # ...remaining for further processing: 1239
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 26
% # Backward-rewritten : 91
% # Generated clauses : 11658
% # ...of the previous two non-trivial : 10939
% # Contextual simplify-reflections : 0
% # Paramodulations : 11511
% # Factorizations : 0
% # Equation resolutions : 108
% # Current number of processed clauses: 1122
% # Positive orientable unit clauses: 197
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 74
% # Non-unit-clauses : 851
% # Current number of unprocessed clauses: 7829
% # ...number of literals in the above : 23855
% # Clause-clause subsumption calls (NU) : 7244
% # Rec. Clause-clause subsumption calls : 5770
% # Unit Clause-clause subsumption calls : 7746
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1121
% # Indexed BW rewrite successes : 32
% # Backwards rewriting index: 684 leaves, 2.20+/-4.463 terms/leaf
% # Paramod-from index: 322 leaves, 1.72+/-4.217 terms/leaf
% # Paramod-into index: 615 leaves, 1.91+/-3.950 terms/leaf
% # -------------------------------------------------
% # User time : 0.426 s
% # System time : 0.023 s
% # Total time : 0.449 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.71 CPU 0.79 WC
% FINAL PrfWatch: 0.71 CPU 0.79 WC
% SZS output end Solution for /tmp/SystemOnTPTP13635/SEU113+1.tptp
%
%------------------------------------------------------------------------------