TSTP Solution File: SEU264+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU264+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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 02:42:16 EST 2010
% Result : Theorem 5.77s
% Output : Solution 5.77s
% 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/SystemOnTPTP2005/SEU264+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP2005/SEU264+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2005/SEU264+2.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 2168
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.075 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(relation_rng(X4),X2)=>relation_of2_as_subset(X4,X3,X2))),file('/tmp/SRASS.s.p', t14_relset_1)).
% fof(13, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)=>(subset(relation_dom(X3),X1)&subset(relation_rng(X3),X2))),file('/tmp/SRASS.s.p', t12_relset_1)).
% fof(331, conjecture,![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(X1,X2)=>relation_of2_as_subset(X4,X3,X2))),file('/tmp/SRASS.s.p', t16_relset_1)).
% fof(332, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(relation_of2_as_subset(X4,X3,X1)=>(subset(X1,X2)=>relation_of2_as_subset(X4,X3,X2)))),inference(assume_negation,[status(cth)],[331])).
% fof(375, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(376, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[375])).
% cnf(377,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[376])).
% fof(378, plain,![X1]:![X2]:![X3]:![X4]:(~(relation_of2_as_subset(X4,X3,X1))|(~(subset(relation_rng(X4),X2))|relation_of2_as_subset(X4,X3,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(379, plain,![X5]:![X6]:![X7]:![X8]:(~(relation_of2_as_subset(X8,X7,X5))|(~(subset(relation_rng(X8),X6))|relation_of2_as_subset(X8,X7,X6))),inference(variable_rename,[status(thm)],[378])).
% cnf(380,plain,(relation_of2_as_subset(X1,X2,X3)|~subset(relation_rng(X1),X3)|~relation_of2_as_subset(X1,X2,X4)),inference(split_conjunct,[status(thm)],[379])).
% fof(413, plain,![X1]:![X2]:![X3]:(~(relation_of2_as_subset(X3,X1,X2))|(subset(relation_dom(X3),X1)&subset(relation_rng(X3),X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(414, plain,![X4]:![X5]:![X6]:(~(relation_of2_as_subset(X6,X4,X5))|(subset(relation_dom(X6),X4)&subset(relation_rng(X6),X5))),inference(variable_rename,[status(thm)],[413])).
% fof(415, plain,![X4]:![X5]:![X6]:((subset(relation_dom(X6),X4)|~(relation_of2_as_subset(X6,X4,X5)))&(subset(relation_rng(X6),X5)|~(relation_of2_as_subset(X6,X4,X5)))),inference(distribute,[status(thm)],[414])).
% cnf(416,plain,(subset(relation_rng(X1),X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[415])).
% fof(1891, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(relation_of2_as_subset(X4,X3,X1)&(subset(X1,X2)&~(relation_of2_as_subset(X4,X3,X2)))),inference(fof_nnf,[status(thm)],[332])).
% fof(1892, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(relation_of2_as_subset(X8,X7,X5)&(subset(X5,X6)&~(relation_of2_as_subset(X8,X7,X6)))),inference(variable_rename,[status(thm)],[1891])).
% fof(1893, negated_conjecture,(relation_of2_as_subset(esk128_0,esk127_0,esk125_0)&(subset(esk125_0,esk126_0)&~(relation_of2_as_subset(esk128_0,esk127_0,esk126_0)))),inference(skolemize,[status(esa)],[1892])).
% cnf(1894,negated_conjecture,(~relation_of2_as_subset(esk128_0,esk127_0,esk126_0)),inference(split_conjunct,[status(thm)],[1893])).
% cnf(1895,negated_conjecture,(subset(esk125_0,esk126_0)),inference(split_conjunct,[status(thm)],[1893])).
% cnf(1896,negated_conjecture,(relation_of2_as_subset(esk128_0,esk127_0,esk125_0)),inference(split_conjunct,[status(thm)],[1893])).
% cnf(2340,negated_conjecture,(subset(relation_rng(esk128_0),esk125_0)),inference(spm,[status(thm)],[416,1896,theory(equality)])).
% cnf(2450,negated_conjecture,(subset(X1,esk126_0)|~subset(X1,esk125_0)),inference(spm,[status(thm)],[377,1895,theory(equality)])).
% cnf(2982,negated_conjecture,(relation_of2_as_subset(esk128_0,esk127_0,X1)|~subset(relation_rng(esk128_0),X1)),inference(spm,[status(thm)],[380,1896,theory(equality)])).
% cnf(12137,negated_conjecture,(~subset(relation_rng(esk128_0),esk126_0)),inference(spm,[status(thm)],[1894,2982,theory(equality)])).
% cnf(12141,negated_conjecture,(~subset(relation_rng(esk128_0),esk125_0)),inference(spm,[status(thm)],[12137,2450,theory(equality)])).
% cnf(12144,negated_conjecture,($false),inference(rw,[status(thm)],[12141,2340,theory(equality)])).
% cnf(12145,negated_conjecture,($false),inference(cn,[status(thm)],[12144,theory(equality)])).
% cnf(12146,negated_conjecture,($false),12145,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1351
% # ...of these trivial : 17
% # ...subsumed : 44
% # ...remaining for further processing: 1290
% # Other redundant clauses eliminated : 91
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 15
% # Generated clauses : 8927
% # ...of the previous two non-trivial : 8540
% # Contextual simplify-reflections : 34
% # Paramodulations : 8781
% # Factorizations : 14
% # Equation resolutions : 132
% # Current number of processed clauses: 641
% # Positive orientable unit clauses: 70
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 15
% # Non-unit-clauses : 553
% # Current number of unprocessed clauses: 8407
% # ...number of literals in the above : 44096
% # Clause-clause subsumption calls (NU) : 65366
% # Rec. Clause-clause subsumption calls : 14685
% # Unit Clause-clause subsumption calls : 224
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 75
% # Indexed BW rewrite successes : 62
% # Backwards rewriting index: 704 leaves, 1.56+/-3.234 terms/leaf
% # Paramod-from index: 290 leaves, 1.17+/-1.556 terms/leaf
% # Paramod-into index: 632 leaves, 1.41+/-2.772 terms/leaf
% # -------------------------------------------------
% # User time : 0.611 s
% # System time : 0.019 s
% # Total time : 0.630 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.00 CPU 1.08 WC
% FINAL PrfWatch: 1.00 CPU 1.08 WC
% SZS output end Solution for /tmp/SystemOnTPTP2005/SEU264+2.tptp
%
%------------------------------------------------------------------------------