TSTP Solution File: SEU102+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU102+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 : Thu Dec 30 01:08:28 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP10845/SEU102+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10845/SEU102+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10845/SEU102+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 10977
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, 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(17, 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(32, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(38, conjecture,![X1]:![X2]:![X3]:((~(empty(X3))&preboolean(X3))=>((element(X1,X3)&element(X2,X3))=>element(set_intersection2(X1,X2),X3))),file('/tmp/SRASS.s.p', t13_finsub_1)).
% fof(39, negated_conjecture,~(![X1]:![X2]:![X3]:((~(empty(X3))&preboolean(X3))=>((element(X1,X3)&element(X2,X3))=>element(set_intersection2(X1,X2),X3)))),inference(assume_negation,[status(cth)],[38])).
% fof(41, 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)],[4,theory(equality)])).
% fof(47, 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)],[17,theory(equality)])).
% fof(50, negated_conjecture,~(![X1]:![X2]:![X3]:((~(empty(X3))&preboolean(X3))=>((element(X1,X3)&element(X2,X3))=>element(set_intersection2(X1,X2),X3)))),inference(fof_simplification,[status(thm)],[39,theory(equality)])).
% fof(60, 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)],[41])).
% fof(61, 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)],[60])).
% cnf(62,plain,(element(prebool_difference(X1,X2,X3),X1)|empty(X1)|~element(X3,X1)|~element(X2,X1)|~preboolean(X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(108, 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)],[47])).
% fof(109, 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)],[108])).
% cnf(110,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)],[109])).
% fof(155, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[32])).
% cnf(156,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[155])).
% fof(182, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(empty(X3))&preboolean(X3))&((element(X1,X3)&element(X2,X3))&~(element(set_intersection2(X1,X2),X3)))),inference(fof_nnf,[status(thm)],[50])).
% fof(183, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(empty(X6))&preboolean(X6))&((element(X4,X6)&element(X5,X6))&~(element(set_intersection2(X4,X5),X6)))),inference(variable_rename,[status(thm)],[182])).
% fof(184, negated_conjecture,((~(empty(esk13_0))&preboolean(esk13_0))&((element(esk11_0,esk13_0)&element(esk12_0,esk13_0))&~(element(set_intersection2(esk11_0,esk12_0),esk13_0)))),inference(skolemize,[status(esa)],[183])).
% cnf(185,negated_conjecture,(~element(set_intersection2(esk11_0,esk12_0),esk13_0)),inference(split_conjunct,[status(thm)],[184])).
% cnf(186,negated_conjecture,(element(esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[184])).
% cnf(187,negated_conjecture,(element(esk11_0,esk13_0)),inference(split_conjunct,[status(thm)],[184])).
% cnf(188,negated_conjecture,(preboolean(esk13_0)),inference(split_conjunct,[status(thm)],[184])).
% cnf(189,negated_conjecture,(~empty(esk13_0)),inference(split_conjunct,[status(thm)],[184])).
% cnf(195,negated_conjecture,(~element(set_difference(esk11_0,set_difference(esk11_0,esk12_0)),esk13_0)),inference(rw,[status(thm)],[185,156,theory(equality)]),['unfolding']).
% cnf(278,plain,(empty(X1)|element(set_difference(X2,X3),X1)|~preboolean(X1)|~element(X3,X1)|~element(X2,X1)),inference(spm,[status(thm)],[62,110,theory(equality)])).
% cnf(550,negated_conjecture,(empty(esk13_0)|element(set_difference(X1,X2),esk13_0)|~element(X2,esk13_0)|~element(X1,esk13_0)),inference(spm,[status(thm)],[278,188,theory(equality)])).
% cnf(552,negated_conjecture,(element(set_difference(X1,X2),esk13_0)|~element(X2,esk13_0)|~element(X1,esk13_0)),inference(sr,[status(thm)],[550,189,theory(equality)])).
% cnf(555,negated_conjecture,(~element(set_difference(esk11_0,esk12_0),esk13_0)|~element(esk11_0,esk13_0)),inference(spm,[status(thm)],[195,552,theory(equality)])).
% cnf(562,negated_conjecture,(~element(set_difference(esk11_0,esk12_0),esk13_0)|$false),inference(rw,[status(thm)],[555,187,theory(equality)])).
% cnf(563,negated_conjecture,(~element(set_difference(esk11_0,esk12_0),esk13_0)),inference(cn,[status(thm)],[562,theory(equality)])).
% cnf(564,negated_conjecture,(~element(esk12_0,esk13_0)|~element(esk11_0,esk13_0)),inference(spm,[status(thm)],[563,552,theory(equality)])).
% cnf(565,negated_conjecture,($false|~element(esk11_0,esk13_0)),inference(rw,[status(thm)],[564,186,theory(equality)])).
% cnf(566,negated_conjecture,($false|$false),inference(rw,[status(thm)],[565,187,theory(equality)])).
% cnf(567,negated_conjecture,($false),inference(cn,[status(thm)],[566,theory(equality)])).
% cnf(568,negated_conjecture,($false),567,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 233
% # ...of these trivial : 5
% # ...subsumed : 15
% # ...remaining for further processing: 213
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 15
% # Generated clauses : 233
% # ...of the previous two non-trivial : 207
% # Contextual simplify-reflections : 17
% # Paramodulations : 230
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 135
% # Positive orientable unit clauses: 28
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 97
% # Current number of unprocessed clauses: 89
% # ...number of literals in the above : 278
% # Clause-clause subsumption calls (NU) : 326
% # Rec. Clause-clause subsumption calls : 291
% # Unit Clause-clause subsumption calls : 61
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 152 leaves, 1.38+/-0.873 terms/leaf
% # Paramod-from index: 54 leaves, 1.22+/-0.711 terms/leaf
% # Paramod-into index: 142 leaves, 1.32+/-0.737 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.005 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP10845/SEU102+1.tptp
%
%------------------------------------------------------------------------------