TSTP Solution File: SEU117+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU117+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 : art09.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:59 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP1718/SEU117+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1718/SEU117+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1718/SEU117+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 1815
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(9, axiom,![X1]:preboolean(finite_subsets(X1)),file('/tmp/SRASS.s.p', dt_k5_finsub_1)).
% fof(18, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(26, axiom,![X1]:(((~(empty(finite_subsets(X1)))&cup_closed(finite_subsets(X1)))&diff_closed(finite_subsets(X1)))&preboolean(finite_subsets(X1))),file('/tmp/SRASS.s.p', fc2_finsub_1)).
% fof(27, 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(32, conjecture,![X1]:![X2]:(element(X2,finite_subsets(X1))=>element(X2,powerset(X1))),file('/tmp/SRASS.s.p', t32_finsub_1)).
% fof(33, negated_conjecture,~(![X1]:![X2]:(element(X2,finite_subsets(X1))=>element(X2,powerset(X1)))),inference(assume_negation,[status(cth)],[32])).
% fof(43, plain,![X1]:(((~(empty(finite_subsets(X1)))&cup_closed(finite_subsets(X1)))&diff_closed(finite_subsets(X1)))&preboolean(finite_subsets(X1))),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(69, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(70, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[69])).
% cnf(71,plain,(element(X1,powerset(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% fof(73, plain,![X2]:preboolean(finite_subsets(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(74,plain,(preboolean(finite_subsets(X1))),inference(split_conjunct,[status(thm)],[73])).
% fof(106, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(107, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[106])).
% cnf(108,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[107])).
% fof(139, plain,![X2]:(((~(empty(finite_subsets(X2)))&cup_closed(finite_subsets(X2)))&diff_closed(finite_subsets(X2)))&preboolean(finite_subsets(X2))),inference(variable_rename,[status(thm)],[43])).
% cnf(143,plain,(~empty(finite_subsets(X1))),inference(split_conjunct,[status(thm)],[139])).
% fof(144, 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)],[27])).
% fof(145, 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)],[144])).
% fof(146, 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(esk10_2(X4,X5),X5))|(~(subset(esk10_2(X4,X5),X4))|~(finite(esk10_2(X4,X5)))))&(in(esk10_2(X4,X5),X5)|(subset(esk10_2(X4,X5),X4)&finite(esk10_2(X4,X5)))))|X5=finite_subsets(X4)))),inference(skolemize,[status(esa)],[145])).
% fof(147, 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(esk10_2(X4,X5),X5))|(~(subset(esk10_2(X4,X5),X4))|~(finite(esk10_2(X4,X5)))))&(in(esk10_2(X4,X5),X5)|(subset(esk10_2(X4,X5),X4)&finite(esk10_2(X4,X5)))))|X5=finite_subsets(X4)))|~(preboolean(X5))),inference(shift_quantors,[status(thm)],[146])).
% fof(148, 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(esk10_2(X4,X5),X5))|(~(subset(esk10_2(X4,X5),X4))|~(finite(esk10_2(X4,X5)))))|X5=finite_subsets(X4))|~(preboolean(X5)))&((((subset(esk10_2(X4,X5),X4)|in(esk10_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))&(((finite(esk10_2(X4,X5))|in(esk10_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))))),inference(distribute,[status(thm)],[147])).
% cnf(154,plain,(subset(X3,X2)|~preboolean(X1)|X1!=finite_subsets(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[148])).
% fof(174, negated_conjecture,?[X1]:?[X2]:(element(X2,finite_subsets(X1))&~(element(X2,powerset(X1)))),inference(fof_nnf,[status(thm)],[33])).
% fof(175, negated_conjecture,?[X3]:?[X4]:(element(X4,finite_subsets(X3))&~(element(X4,powerset(X3)))),inference(variable_rename,[status(thm)],[174])).
% fof(176, negated_conjecture,(element(esk13_0,finite_subsets(esk12_0))&~(element(esk13_0,powerset(esk12_0)))),inference(skolemize,[status(esa)],[175])).
% cnf(177,negated_conjecture,(~element(esk13_0,powerset(esk12_0))),inference(split_conjunct,[status(thm)],[176])).
% cnf(178,negated_conjecture,(element(esk13_0,finite_subsets(esk12_0))),inference(split_conjunct,[status(thm)],[176])).
% cnf(224,negated_conjecture,(in(esk13_0,finite_subsets(esk12_0))|empty(finite_subsets(esk12_0))),inference(pm,[status(thm)],[108,178,theory(equality)])).
% cnf(228,negated_conjecture,(in(esk13_0,finite_subsets(esk12_0))),inference(sr,[status(thm)],[224,143,theory(equality)])).
% cnf(263,negated_conjecture,(subset(esk13_0,X1)|finite_subsets(X1)!=finite_subsets(esk12_0)|~preboolean(finite_subsets(esk12_0))),inference(pm,[status(thm)],[154,228,theory(equality)])).
% cnf(268,negated_conjecture,(subset(esk13_0,X1)|finite_subsets(X1)!=finite_subsets(esk12_0)|$false),inference(rw,[status(thm)],[263,74,theory(equality)])).
% cnf(269,negated_conjecture,(subset(esk13_0,X1)|finite_subsets(X1)!=finite_subsets(esk12_0)),inference(cn,[status(thm)],[268,theory(equality)])).
% cnf(348,negated_conjecture,(subset(esk13_0,esk12_0)),inference(er,[status(thm)],[269,theory(equality)])).
% cnf(349,negated_conjecture,(element(esk13_0,powerset(esk12_0))),inference(pm,[status(thm)],[71,348,theory(equality)])).
% cnf(351,negated_conjecture,($false),inference(sr,[status(thm)],[349,177,theory(equality)])).
% cnf(352,negated_conjecture,($false),351,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 115
% # ...of these trivial : 6
% # ...subsumed : 7
% # ...remaining for further processing: 102
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 23
% # Generated clauses : 95
% # ...of the previous two non-trivial : 87
% # Contextual simplify-reflections : 0
% # Paramodulations : 85
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 79
% # Positive orientable unit clauses: 36
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 26
% # ...number of literals in the above : 65
% # Clause-clause subsumption calls (NU) : 67
% # Rec. Clause-clause subsumption calls : 47
% # Unit Clause-clause subsumption calls : 214
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 87 leaves, 1.17+/-0.551 terms/leaf
% # Paramod-from index: 41 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 81 leaves, 1.12+/-0.427 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP1718/SEU117+1.tptp
%
%------------------------------------------------------------------------------