TSTP Solution File: SEU317+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU317+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 03:29:46 EST 2010
% Result : Theorem 16.19s
% Output : Solution 16.19s
% 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/SystemOnTPTP7477/SEU317+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7477/SEU317+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7477/SEU317+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 7573
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.03 WC
% PrfWatch: 7.92 CPU 8.04 WC
% PrfWatch: 9.91 CPU 10.05 WC
% PrfWatch: 11.90 CPU 12.06 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.88 CPU 14.06 WC
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(6, axiom,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>![X3]:(in(X3,the_carrier(X1))=>(in(X3,topstr_closure(X1,X2))<=>![X4]:(element(X4,powerset(the_carrier(X1)))=>((closed_subset(X4,X1)&subset(X2,X4))=>in(X3,X4))))))),file('/tmp/SRASS.s.p', t45_pre_topc)).
% fof(11, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(43, conjecture,![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset(X2,topstr_closure(X1,X2)))),file('/tmp/SRASS.s.p', t48_pre_topc)).
% fof(44, negated_conjecture,~(![X1]:(top_str(X1)=>![X2]:(element(X2,powerset(the_carrier(X1)))=>subset(X2,topstr_closure(X1,X2))))),inference(assume_negation,[status(cth)],[43])).
% fof(60, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[5])).
% fof(61, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[60])).
% cnf(63,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[61])).
% fof(64, plain,![X1]:(~(top_str(X1))|![X2]:(~(element(X2,powerset(the_carrier(X1))))|![X3]:(~(in(X3,the_carrier(X1)))|((~(in(X3,topstr_closure(X1,X2)))|![X4]:(~(element(X4,powerset(the_carrier(X1))))|((~(closed_subset(X4,X1))|~(subset(X2,X4)))|in(X3,X4))))&(?[X4]:(element(X4,powerset(the_carrier(X1)))&((closed_subset(X4,X1)&subset(X2,X4))&~(in(X3,X4))))|in(X3,topstr_closure(X1,X2))))))),inference(fof_nnf,[status(thm)],[6])).
% fof(65, plain,![X5]:(~(top_str(X5))|![X6]:(~(element(X6,powerset(the_carrier(X5))))|![X7]:(~(in(X7,the_carrier(X5)))|((~(in(X7,topstr_closure(X5,X6)))|![X8]:(~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8))))&(?[X9]:(element(X9,powerset(the_carrier(X5)))&((closed_subset(X9,X5)&subset(X6,X9))&~(in(X7,X9))))|in(X7,topstr_closure(X5,X6))))))),inference(variable_rename,[status(thm)],[64])).
% fof(66, plain,![X5]:(~(top_str(X5))|![X6]:(~(element(X6,powerset(the_carrier(X5))))|![X7]:(~(in(X7,the_carrier(X5)))|((~(in(X7,topstr_closure(X5,X6)))|![X8]:(~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8))))&((element(esk3_3(X5,X6,X7),powerset(the_carrier(X5)))&((closed_subset(esk3_3(X5,X6,X7),X5)&subset(X6,esk3_3(X5,X6,X7)))&~(in(X7,esk3_3(X5,X6,X7)))))|in(X7,topstr_closure(X5,X6))))))),inference(skolemize,[status(esa)],[65])).
% fof(67, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8)))|~(in(X7,topstr_closure(X5,X6))))&((element(esk3_3(X5,X6,X7),powerset(the_carrier(X5)))&((closed_subset(esk3_3(X5,X6,X7),X5)&subset(X6,esk3_3(X5,X6,X7)))&~(in(X7,esk3_3(X5,X6,X7)))))|in(X7,topstr_closure(X5,X6))))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5))),inference(shift_quantors,[status(thm)],[66])).
% fof(68, plain,![X5]:![X6]:![X7]:![X8]:((((((~(element(X8,powerset(the_carrier(X5))))|((~(closed_subset(X8,X5))|~(subset(X6,X8)))|in(X7,X8)))|~(in(X7,topstr_closure(X5,X6))))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))&(((((element(esk3_3(X5,X6,X7),powerset(the_carrier(X5)))|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))&((((((closed_subset(esk3_3(X5,X6,X7),X5)|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))&((((subset(X6,esk3_3(X5,X6,X7))|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5))))&((((~(in(X7,esk3_3(X5,X6,X7)))|in(X7,topstr_closure(X5,X6)))|~(in(X7,the_carrier(X5))))|~(element(X6,powerset(the_carrier(X5)))))|~(top_str(X5)))))),inference(distribute,[status(thm)],[67])).
% cnf(69,plain,(in(X3,topstr_closure(X1,X2))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~in(X3,the_carrier(X1))|~in(X3,esk3_3(X1,X2,X3))),inference(split_conjunct,[status(thm)],[68])).
% cnf(70,plain,(in(X3,topstr_closure(X1,X2))|subset(X2,esk3_3(X1,X2,X3))|~top_str(X1)|~element(X2,powerset(the_carrier(X1)))|~in(X3,the_carrier(X1))),inference(split_conjunct,[status(thm)],[68])).
% fof(91, 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)],[11])).
% fof(92, 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)],[91])).
% fof(93, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[92])).
% fof(94, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk6_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[94])).
% cnf(96,plain,(subset(X1,X2)|~in(esk6_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[95])).
% cnf(97,plain,(subset(X1,X2)|in(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[95])).
% cnf(98,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[95])).
% fof(231, negated_conjecture,?[X1]:(top_str(X1)&?[X2]:(element(X2,powerset(the_carrier(X1)))&~(subset(X2,topstr_closure(X1,X2))))),inference(fof_nnf,[status(thm)],[44])).
% fof(232, negated_conjecture,?[X3]:(top_str(X3)&?[X4]:(element(X4,powerset(the_carrier(X3)))&~(subset(X4,topstr_closure(X3,X4))))),inference(variable_rename,[status(thm)],[231])).
% fof(233, negated_conjecture,(top_str(esk9_0)&(element(esk10_0,powerset(the_carrier(esk9_0)))&~(subset(esk10_0,topstr_closure(esk9_0,esk10_0))))),inference(skolemize,[status(esa)],[232])).
% cnf(234,negated_conjecture,(~subset(esk10_0,topstr_closure(esk9_0,esk10_0))),inference(split_conjunct,[status(thm)],[233])).
% cnf(235,negated_conjecture,(element(esk10_0,powerset(the_carrier(esk9_0)))),inference(split_conjunct,[status(thm)],[233])).
% cnf(236,negated_conjecture,(top_str(esk9_0)),inference(split_conjunct,[status(thm)],[233])).
% cnf(418,plain,(in(X1,X2)|~in(X1,X3)|~element(X3,powerset(X2))),inference(spm,[status(thm)],[98,63,theory(equality)])).
% cnf(420,plain,(in(X1,esk3_3(X2,X3,X4))|in(X4,topstr_closure(X2,X3))|~in(X1,X3)|~in(X4,the_carrier(X2))|~element(X3,powerset(the_carrier(X2)))|~top_str(X2)),inference(spm,[status(thm)],[98,70,theory(equality)])).
% cnf(1368,plain,(in(X1,topstr_closure(X2,X3))|~in(X1,the_carrier(X2))|~element(X3,powerset(the_carrier(X2)))|~top_str(X2)|~in(X1,X3)),inference(spm,[status(thm)],[69,420,theory(equality)])).
% cnf(15870,plain,(in(X1,topstr_closure(X2,X3))|~in(X1,X3)|~element(X3,powerset(the_carrier(X2)))|~top_str(X2)),inference(csr,[status(thm)],[1368,418])).
% cnf(15872,plain,(subset(X1,topstr_closure(X2,X3))|~in(esk6_2(X1,topstr_closure(X2,X3)),X3)|~element(X3,powerset(the_carrier(X2)))|~top_str(X2)),inference(spm,[status(thm)],[96,15870,theory(equality)])).
% cnf(260391,plain,(subset(X1,topstr_closure(X2,X1))|~element(X1,powerset(the_carrier(X2)))|~top_str(X2)),inference(spm,[status(thm)],[15872,97,theory(equality)])).
% cnf(295922,negated_conjecture,(~element(esk10_0,powerset(the_carrier(esk9_0)))|~top_str(esk9_0)),inference(spm,[status(thm)],[234,260391,theory(equality)])).
% cnf(295944,negated_conjecture,($false|~top_str(esk9_0)),inference(rw,[status(thm)],[295922,235,theory(equality)])).
% cnf(295945,negated_conjecture,($false|$false),inference(rw,[status(thm)],[295944,236,theory(equality)])).
% cnf(295946,negated_conjecture,($false),inference(cn,[status(thm)],[295945,theory(equality)])).
% cnf(295947,negated_conjecture,($false),295946,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 42613
% # ...of these trivial : 4
% # ...subsumed : 34883
% # ...remaining for further processing: 7726
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 176
% # Backward-rewritten : 17
% # Generated clauses : 227474
% # ...of the previous two non-trivial : 206686
% # Contextual simplify-reflections : 35052
% # Paramodulations : 227445
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 7439
% # Positive orientable unit clauses: 471
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 177
% # Non-unit-clauses : 6791
% # Current number of unprocessed clauses: 152476
% # ...number of literals in the above : 740987
% # Clause-clause subsumption calls (NU) : 2818962
% # Rec. Clause-clause subsumption calls : 2149009
% # Unit Clause-clause subsumption calls : 39190
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10047
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 712 leaves, 4.61+/-8.768 terms/leaf
% # Paramod-from index: 386 leaves, 4.59+/-8.936 terms/leaf
% # Paramod-into index: 644 leaves, 4.59+/-8.769 terms/leaf
% # -------------------------------------------------
% # User time : 11.574 s
% # System time : 0.285 s
% # Total time : 11.859 s
% # Maximum resident set size: 0 pages
% PrfWatch: 15.15 CPU 15.34 WC
% FINAL PrfWatch: 15.15 CPU 15.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP7477/SEU317+1.tptp
%
%------------------------------------------------------------------------------