TSTP Solution File: SEU107+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU107+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 : art05.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:05:56 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP8552/SEU107+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8552/SEU107+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8552/SEU107+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 8648
% 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(6, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(9, axiom,![X1]:?[X2]:element(X2,X1),file('/tmp/SRASS.s.p', existence_m1_subset_1)).
% fof(12, axiom,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>element(prebool_difference(X1,X2,X3),X1)),file('/tmp/SRASS.s.p', dt_k2_finsub_1)).
% fof(18, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(21, axiom,![X1]:![X2]:![X3]:((in(X1,X2)&element(X2,powerset(X3)))=>element(X1,X3)),file('/tmp/SRASS.s.p', t4_subset)).
% fof(26, axiom,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>prebool_difference(X1,X2,X3)=set_difference(X2,X3)),file('/tmp/SRASS.s.p', redefinition_k2_finsub_1)).
% fof(27, axiom,![X1]:(~(empty(X1))=>?[X2]:(element(X2,powerset(X1))&~(empty(X2)))),file('/tmp/SRASS.s.p', rc1_subset_1)).
% fof(30, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(33, conjecture,![X1]:((~(empty(X1))&preboolean(X1))=>in(empty_set,X1)),file('/tmp/SRASS.s.p', t18_finsub_1)).
% fof(34, negated_conjecture,~(![X1]:((~(empty(X1))&preboolean(X1))=>in(empty_set,X1))),inference(assume_negation,[status(cth)],[33])).
% fof(37, plain,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>element(prebool_difference(X1,X2,X3),X1)),inference(fof_simplification,[status(thm)],[12,theory(equality)])).
% fof(43, plain,![X1]:![X2]:![X3]:((((~(empty(X1))&preboolean(X1))&element(X2,X1))&element(X3,X1))=>prebool_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_simplification,[status(thm)],[26,theory(equality)])).
% fof(44, plain,![X1]:(~(empty(X1))=>?[X2]:(element(X2,powerset(X1))&~(empty(X2)))),inference(fof_simplification,[status(thm)],[27,theory(equality)])).
% fof(45, negated_conjecture,~(![X1]:((~(empty(X1))&preboolean(X1))=>in(empty_set,X1))),inference(fof_simplification,[status(thm)],[34,theory(equality)])).
% fof(59, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(60, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[60])).
% fof(68, plain,![X3]:?[X4]:element(X4,X3),inference(variable_rename,[status(thm)],[9])).
% fof(69, plain,![X3]:element(esk3_1(X3),X3),inference(skolemize,[status(esa)],[68])).
% cnf(70,plain,(element(esk3_1(X1),X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(77, plain,![X1]:![X2]:![X3]:((((empty(X1)|~(preboolean(X1)))|~(element(X2,X1)))|~(element(X3,X1)))|element(prebool_difference(X1,X2,X3),X1)),inference(fof_nnf,[status(thm)],[37])).
% fof(78, plain,![X4]:![X5]:![X6]:((((empty(X4)|~(preboolean(X4)))|~(element(X5,X4)))|~(element(X6,X4)))|element(prebool_difference(X4,X5,X6),X4)),inference(variable_rename,[status(thm)],[77])).
% cnf(79,plain,(element(prebool_difference(X1,X2,X3),X1)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[78])).
% fof(103, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[18])).
% cnf(104,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[103])).
% fof(109, plain,![X1]:![X2]:![X3]:((~(in(X1,X2))|~(element(X2,powerset(X3))))|element(X1,X3)),inference(fof_nnf,[status(thm)],[21])).
% fof(110, plain,![X4]:![X5]:![X6]:((~(in(X4,X5))|~(element(X5,powerset(X6))))|element(X4,X6)),inference(variable_rename,[status(thm)],[109])).
% cnf(111,plain,(element(X1,X2)|~element(X3,powerset(X2))|~in(X1,X3)),inference(split_conjunct,[status(thm)],[110])).
% fof(131, plain,![X1]:![X2]:![X3]:((((empty(X1)|~(preboolean(X1)))|~(element(X2,X1)))|~(element(X3,X1)))|prebool_difference(X1,X2,X3)=set_difference(X2,X3)),inference(fof_nnf,[status(thm)],[43])).
% fof(132, plain,![X4]:![X5]:![X6]:((((empty(X4)|~(preboolean(X4)))|~(element(X5,X4)))|~(element(X6,X4)))|prebool_difference(X4,X5,X6)=set_difference(X5,X6)),inference(variable_rename,[status(thm)],[131])).
% cnf(133,plain,(prebool_difference(X1,X2,X3)=set_difference(X2,X3)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[132])).
% fof(134, plain,![X1]:(empty(X1)|?[X2]:(element(X2,powerset(X1))&~(empty(X2)))),inference(fof_nnf,[status(thm)],[44])).
% fof(135, plain,![X3]:(empty(X3)|?[X4]:(element(X4,powerset(X3))&~(empty(X4)))),inference(variable_rename,[status(thm)],[134])).
% fof(136, plain,![X3]:(empty(X3)|(element(esk8_1(X3),powerset(X3))&~(empty(esk8_1(X3))))),inference(skolemize,[status(esa)],[135])).
% fof(137, plain,![X3]:((element(esk8_1(X3),powerset(X3))|empty(X3))&(~(empty(esk8_1(X3)))|empty(X3))),inference(distribute,[status(thm)],[136])).
% cnf(138,plain,(empty(X1)|~empty(esk8_1(X1))),inference(split_conjunct,[status(thm)],[137])).
% cnf(139,plain,(empty(X1)|element(esk8_1(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[137])).
% fof(148, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[30])).
% fof(149, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[148])).
% cnf(150,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[149])).
% fof(167, negated_conjecture,?[X1]:((~(empty(X1))&preboolean(X1))&~(in(empty_set,X1))),inference(fof_nnf,[status(thm)],[45])).
% fof(168, negated_conjecture,?[X2]:((~(empty(X2))&preboolean(X2))&~(in(empty_set,X2))),inference(variable_rename,[status(thm)],[167])).
% fof(169, negated_conjecture,((~(empty(esk11_0))&preboolean(esk11_0))&~(in(empty_set,esk11_0))),inference(skolemize,[status(esa)],[168])).
% cnf(170,negated_conjecture,(~in(empty_set,esk11_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(171,negated_conjecture,(preboolean(esk11_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(172,negated_conjecture,(~empty(esk11_0)),inference(split_conjunct,[status(thm)],[169])).
% cnf(185,plain,(set_difference(X1,X1)=empty_set),inference(spm,[status(thm)],[150,104,theory(equality)])).
% cnf(186,negated_conjecture,(empty(esk11_0)|~element(empty_set,esk11_0)),inference(spm,[status(thm)],[170,61,theory(equality)])).
% cnf(190,negated_conjecture,(~element(empty_set,esk11_0)),inference(sr,[status(thm)],[186,172,theory(equality)])).
% cnf(213,plain,(element(X1,X2)|empty(X2)|~in(X1,esk8_1(X2))),inference(spm,[status(thm)],[111,139,theory(equality)])).
% cnf(220,plain,(element(set_difference(X2,X3),X1)|empty(X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1)),inference(spm,[status(thm)],[79,133,theory(equality)])).
% cnf(328,plain,(element(X1,X2)|empty(X2)|empty(esk8_1(X2))|~element(X1,esk8_1(X2))),inference(spm,[status(thm)],[213,61,theory(equality)])).
% cnf(382,plain,(element(X1,X2)|empty(X2)|~element(X1,esk8_1(X2))),inference(csr,[status(thm)],[328,138])).
% cnf(383,plain,(element(esk3_1(esk8_1(X1)),X1)|empty(X1)),inference(spm,[status(thm)],[382,70,theory(equality)])).
% cnf(493,plain,(element(empty_set,X2)|empty(X2)|~preboolean(X2)|~element(X1,X2)),inference(spm,[status(thm)],[220,185,theory(equality)])).
% cnf(501,plain,(element(empty_set,X1)|empty(X1)|~preboolean(X1)),inference(spm,[status(thm)],[493,383,theory(equality)])).
% cnf(522,negated_conjecture,(element(empty_set,esk11_0)|empty(esk11_0)),inference(spm,[status(thm)],[501,171,theory(equality)])).
% cnf(524,negated_conjecture,(empty(esk11_0)),inference(sr,[status(thm)],[522,190,theory(equality)])).
% cnf(525,negated_conjecture,($false),inference(sr,[status(thm)],[524,172,theory(equality)])).
% cnf(526,negated_conjecture,($false),525,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 223
% # ...of these trivial : 2
% # ...subsumed : 24
% # ...remaining for further processing: 197
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 15
% # Generated clauses : 214
% # ...of the previous two non-trivial : 157
% # Contextual simplify-reflections : 10
% # Paramodulations : 210
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 73
% # Current number of unprocessed clauses: 32
% # ...number of literals in the above : 134
% # Clause-clause subsumption calls (NU) : 203
% # Rec. Clause-clause subsumption calls : 173
% # Unit Clause-clause subsumption calls : 61
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 103 leaves, 1.48+/-1.078 terms/leaf
% # Paramod-from index: 53 leaves, 1.11+/-0.372 terms/leaf
% # Paramod-into index: 98 leaves, 1.36+/-0.884 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.004 s
% # Total time : 0.031 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/SystemOnTPTP8552/SEU107+1.tptp
%
%------------------------------------------------------------------------------