TSTP Solution File: SEU444+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU444+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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 06:31:15 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/SystemOnTPTP9019/SEU444+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9019/SEU444+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9019/SEU444+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 9115
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(m2_relset_1(X3,X2,X1)=>(k1_funct_5(X3)=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)&k2_funct_5(X3)=k10_relset_1(X2,X1,X3,X2))),file('/tmp/SRASS.s.p', t51_relset_2)).
% fof(45, conjecture,![X1]:![X2]:![X3]:(m2_relset_1(X3,X2,X1)=>(k1_funct_5(X3)=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)&k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2))=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)))),file('/tmp/SRASS.s.p', t56_relset_2)).
% fof(46, negated_conjecture,~(![X1]:![X2]:![X3]:(m2_relset_1(X3,X2,X1)=>(k1_funct_5(X3)=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)&k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2))=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))))),inference(assume_negation,[status(cth)],[45])).
% fof(55, plain,![X1]:![X2]:![X3]:(~(m2_relset_1(X3,X2,X1))|(k1_funct_5(X3)=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)&k2_funct_5(X3)=k10_relset_1(X2,X1,X3,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(56, plain,![X4]:![X5]:![X6]:(~(m2_relset_1(X6,X5,X4))|(k1_funct_5(X6)=k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4)&k2_funct_5(X6)=k10_relset_1(X5,X4,X6,X5))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X4]:![X5]:![X6]:((k1_funct_5(X6)=k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4)|~(m2_relset_1(X6,X5,X4)))&(k2_funct_5(X6)=k10_relset_1(X5,X4,X6,X5)|~(m2_relset_1(X6,X5,X4)))),inference(distribute,[status(thm)],[56])).
% cnf(58,plain,(k2_funct_5(X1)=k10_relset_1(X2,X3,X1,X2)|~m2_relset_1(X1,X2,X3)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,plain,(k1_funct_5(X1)=k10_relset_1(X3,X2,k6_relset_1(X2,X3,X1),X3)|~m2_relset_1(X1,X2,X3)),inference(split_conjunct,[status(thm)],[57])).
% fof(177, negated_conjecture,?[X1]:?[X2]:?[X3]:(m2_relset_1(X3,X2,X1)&(~(k1_funct_5(X3)=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1))|~(k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2))=k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))))),inference(fof_nnf,[status(thm)],[46])).
% fof(178, negated_conjecture,?[X4]:?[X5]:?[X6]:(m2_relset_1(X6,X5,X4)&(~(k1_funct_5(X6)=k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4))|~(k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),k10_relset_1(X5,X4,X6,X5))=k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),k2_funct_5(X6))))),inference(variable_rename,[status(thm)],[177])).
% fof(179, negated_conjecture,(m2_relset_1(esk11_0,esk10_0,esk9_0)&(~(k1_funct_5(esk11_0)=k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),esk9_0))|~(k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),k10_relset_1(esk10_0,esk9_0,esk11_0,esk10_0))=k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),k2_funct_5(esk11_0))))),inference(skolemize,[status(esa)],[178])).
% cnf(180,negated_conjecture,(k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),k10_relset_1(esk10_0,esk9_0,esk11_0,esk10_0))!=k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),k2_funct_5(esk11_0))|k1_funct_5(esk11_0)!=k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),esk9_0)),inference(split_conjunct,[status(thm)],[179])).
% cnf(181,negated_conjecture,(m2_relset_1(esk11_0,esk10_0,esk9_0)),inference(split_conjunct,[status(thm)],[179])).
% cnf(207,negated_conjecture,(k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),k10_relset_1(X1,X2,esk11_0,X1))!=k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),k10_relset_1(esk10_0,esk9_0,esk11_0,esk10_0))|k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),esk9_0)!=k1_funct_5(esk11_0)|~m2_relset_1(esk11_0,X1,X2)),inference(spm,[status(thm)],[180,58,theory(equality)])).
% cnf(293,negated_conjecture,(k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),esk9_0)!=k1_funct_5(esk11_0)|~m2_relset_1(esk11_0,esk10_0,esk9_0)),inference(er,[status(thm)],[207,theory(equality)])).
% cnf(296,negated_conjecture,(k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),esk9_0)!=k1_funct_5(esk11_0)|$false),inference(rw,[status(thm)],[293,181,theory(equality)])).
% cnf(297,negated_conjecture,(k10_relset_1(esk9_0,esk10_0,k6_relset_1(esk10_0,esk9_0,esk11_0),esk9_0)!=k1_funct_5(esk11_0)),inference(cn,[status(thm)],[296,theory(equality)])).
% cnf(298,negated_conjecture,(~m2_relset_1(esk11_0,esk10_0,esk9_0)),inference(spm,[status(thm)],[297,59,theory(equality)])).
% cnf(299,negated_conjecture,($false),inference(rw,[status(thm)],[298,181,theory(equality)])).
% cnf(300,negated_conjecture,($false),inference(cn,[status(thm)],[299,theory(equality)])).
% cnf(301,negated_conjecture,($false),300,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 128
% # ...of these trivial : 2
% # ...subsumed : 6
% # ...remaining for further processing: 120
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 91
% # ...of the previous two non-trivial : 77
% # Contextual simplify-reflections : 2
% # Paramodulations : 87
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 65
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 121
% # Clause-clause subsumption calls (NU) : 56
% # Rec. Clause-clause subsumption calls : 54
% # Unit Clause-clause subsumption calls : 64
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 70 leaves, 1.36+/-0.793 terms/leaf
% # Paramod-from index: 37 leaves, 1.14+/-0.413 terms/leaf
% # Paramod-into index: 65 leaves, 1.26+/-0.686 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP9019/SEU444+1.tptp
%
%------------------------------------------------------------------------------