TSTP Solution File: SEU451+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU451+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 : art01.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:46:17 EST 2010
% Result : Theorem 1.40s
% Output : Solution 1.40s
% 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/SystemOnTPTP23084/SEU451+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23084/SEU451+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23084/SEU451+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 23180
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 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,X1,X2)=>(k7_relset_1(X1,X1,X1,X2,k6_partfun1(X1),X3)=X3&k7_relset_1(X1,X2,X2,X2,X3,k6_partfun1(X2))=X3)),file('/tmp/SRASS.s.p', t23_funct_2)).
% fof(4, axiom,![X1]:(v1_partfun1(k6_partfun1(X1),X1,X1)&m2_relset_1(k6_partfun1(X1),X1,X1)),file('/tmp/SRASS.s.p', dt_k6_partfun1)).
% fof(6, axiom,![X1]:![X2]:![X3]:(m2_relset_1(X3,X1,X2)=>m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))),file('/tmp/SRASS.s.p', dt_m2_relset_1)).
% fof(8, axiom,![X1]:![X2]:![X3]:(m2_relset_1(X3,X1,X2)<=>m1_relset_1(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(11, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:((m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))&m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3))))=>k9_relset_2(X1,X2,X3,X4,X5)=k5_relat_1(X4,X5)),file('/tmp/SRASS.s.p', redefinition_k9_relset_2)).
% fof(27, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((m1_relset_1(X5,X1,X2)&m1_relset_1(X6,X3,X4))=>k7_relset_1(X1,X2,X3,X4,X5,X6)=k5_relat_1(X5,X6)),file('/tmp/SRASS.s.p', redefinition_k7_relset_1)).
% fof(48, conjecture,![X1]:![X2]:![X3]:(m2_relset_1(X3,X1,X2)=>k9_relset_2(X1,X1,X2,k6_partfun1(X1),X3)=k9_relset_2(X1,X2,X2,X3,k6_partfun1(X2))),file('/tmp/SRASS.s.p', t65_relset_2)).
% fof(49, negated_conjecture,~(![X1]:![X2]:![X3]:(m2_relset_1(X3,X1,X2)=>k9_relset_2(X1,X1,X2,k6_partfun1(X1),X3)=k9_relset_2(X1,X2,X2,X3,k6_partfun1(X2)))),inference(assume_negation,[status(cth)],[48])).
% fof(58, plain,![X1]:![X2]:![X3]:(~(m2_relset_1(X3,X1,X2))|(k7_relset_1(X1,X1,X1,X2,k6_partfun1(X1),X3)=X3&k7_relset_1(X1,X2,X2,X2,X3,k6_partfun1(X2))=X3)),inference(fof_nnf,[status(thm)],[2])).
% fof(59, plain,![X4]:![X5]:![X6]:(~(m2_relset_1(X6,X4,X5))|(k7_relset_1(X4,X4,X4,X5,k6_partfun1(X4),X6)=X6&k7_relset_1(X4,X5,X5,X5,X6,k6_partfun1(X5))=X6)),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X4]:![X5]:![X6]:((k7_relset_1(X4,X4,X4,X5,k6_partfun1(X4),X6)=X6|~(m2_relset_1(X6,X4,X5)))&(k7_relset_1(X4,X5,X5,X5,X6,k6_partfun1(X5))=X6|~(m2_relset_1(X6,X4,X5)))),inference(distribute,[status(thm)],[59])).
% cnf(61,plain,(k7_relset_1(X2,X3,X3,X3,X1,k6_partfun1(X3))=X1|~m2_relset_1(X1,X2,X3)),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,plain,(k7_relset_1(X2,X2,X2,X3,k6_partfun1(X2),X1)=X1|~m2_relset_1(X1,X2,X3)),inference(split_conjunct,[status(thm)],[60])).
% fof(65, plain,![X2]:(v1_partfun1(k6_partfun1(X2),X2,X2)&m2_relset_1(k6_partfun1(X2),X2,X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(66,plain,(m2_relset_1(k6_partfun1(X1),X1,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(71, plain,![X1]:![X2]:![X3]:(~(m2_relset_1(X3,X1,X2))|m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(72, plain,![X4]:![X5]:![X6]:(~(m2_relset_1(X6,X4,X5))|m1_subset_1(X6,k1_zfmisc_1(k2_zfmisc_1(X4,X5)))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m2_relset_1(X1,X2,X3)),inference(split_conjunct,[status(thm)],[72])).
% fof(77, plain,![X1]:![X2]:![X3]:((~(m2_relset_1(X3,X1,X2))|m1_relset_1(X3,X1,X2))&(~(m1_relset_1(X3,X1,X2))|m2_relset_1(X3,X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(78, plain,![X4]:![X5]:![X6]:((~(m2_relset_1(X6,X4,X5))|m1_relset_1(X6,X4,X5))&(~(m1_relset_1(X6,X4,X5))|m2_relset_1(X6,X4,X5))),inference(variable_rename,[status(thm)],[77])).
% cnf(80,plain,(m1_relset_1(X1,X2,X3)|~m2_relset_1(X1,X2,X3)),inference(split_conjunct,[status(thm)],[78])).
% fof(87, plain,![X1]:![X2]:![X3]:![X4]:![X5]:((~(m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2))))|~(m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))))|k9_relset_2(X1,X2,X3,X4,X5)=k5_relat_1(X4,X5)),inference(fof_nnf,[status(thm)],[11])).
% fof(88, plain,![X6]:![X7]:![X8]:![X9]:![X10]:((~(m1_subset_1(X9,k1_zfmisc_1(k2_zfmisc_1(X6,X7))))|~(m1_subset_1(X10,k1_zfmisc_1(k2_zfmisc_1(X7,X8)))))|k9_relset_2(X6,X7,X8,X9,X10)=k5_relat_1(X9,X10)),inference(variable_rename,[status(thm)],[87])).
% cnf(89,plain,(k9_relset_2(X1,X2,X3,X4,X5)=k5_relat_1(X4,X5)|~m1_subset_1(X5,k1_zfmisc_1(k2_zfmisc_1(X2,X3)))|~m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))),inference(split_conjunct,[status(thm)],[88])).
% fof(141, plain,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((~(m1_relset_1(X5,X1,X2))|~(m1_relset_1(X6,X3,X4)))|k7_relset_1(X1,X2,X3,X4,X5,X6)=k5_relat_1(X5,X6)),inference(fof_nnf,[status(thm)],[27])).
% fof(142, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((~(m1_relset_1(X11,X7,X8))|~(m1_relset_1(X12,X9,X10)))|k7_relset_1(X7,X8,X9,X10,X11,X12)=k5_relat_1(X11,X12)),inference(variable_rename,[status(thm)],[141])).
% cnf(143,plain,(k7_relset_1(X1,X2,X3,X4,X5,X6)=k5_relat_1(X5,X6)|~m1_relset_1(X6,X3,X4)|~m1_relset_1(X5,X1,X2)),inference(split_conjunct,[status(thm)],[142])).
% fof(209, negated_conjecture,?[X1]:?[X2]:?[X3]:(m2_relset_1(X3,X1,X2)&~(k9_relset_2(X1,X1,X2,k6_partfun1(X1),X3)=k9_relset_2(X1,X2,X2,X3,k6_partfun1(X2)))),inference(fof_nnf,[status(thm)],[49])).
% fof(210, negated_conjecture,?[X4]:?[X5]:?[X6]:(m2_relset_1(X6,X4,X5)&~(k9_relset_2(X4,X4,X5,k6_partfun1(X4),X6)=k9_relset_2(X4,X5,X5,X6,k6_partfun1(X5)))),inference(variable_rename,[status(thm)],[209])).
% fof(211, negated_conjecture,(m2_relset_1(esk13_0,esk11_0,esk12_0)&~(k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)=k9_relset_2(esk11_0,esk12_0,esk12_0,esk13_0,k6_partfun1(esk12_0)))),inference(skolemize,[status(esa)],[210])).
% cnf(212,negated_conjecture,(k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)!=k9_relset_2(esk11_0,esk12_0,esk12_0,esk13_0,k6_partfun1(esk12_0))),inference(split_conjunct,[status(thm)],[211])).
% cnf(213,negated_conjecture,(m2_relset_1(esk13_0,esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[211])).
% cnf(257,plain,(k5_relat_1(X3,k6_partfun1(X2))=X3|~m2_relset_1(X3,X1,X2)|~m1_relset_1(k6_partfun1(X2),X2,X2)|~m1_relset_1(X3,X1,X2)),inference(spm,[status(thm)],[61,143,theory(equality)])).
% cnf(258,plain,(k5_relat_1(k6_partfun1(X1),X3)=X3|~m2_relset_1(X3,X1,X2)|~m1_relset_1(X3,X1,X2)|~m1_relset_1(k6_partfun1(X1),X1,X1)),inference(spm,[status(thm)],[62,143,theory(equality)])).
% cnf(262,plain,(k9_relset_2(X1,X2,X3,X4,X5)=k5_relat_1(X4,X5)|~m1_subset_1(X4,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))|~m2_relset_1(X5,X2,X3)),inference(spm,[status(thm)],[89,73,theory(equality)])).
% cnf(427,plain,(k5_relat_1(X3,k6_partfun1(X2))=X3|~m1_relset_1(k6_partfun1(X2),X2,X2)|~m2_relset_1(X3,X1,X2)),inference(csr,[status(thm)],[257,80])).
% cnf(428,plain,(k5_relat_1(X1,k6_partfun1(X2))=X1|~m2_relset_1(X1,X3,X2)|~m2_relset_1(k6_partfun1(X2),X2,X2)),inference(spm,[status(thm)],[427,80,theory(equality)])).
% cnf(429,plain,(k5_relat_1(X1,k6_partfun1(X2))=X1|~m2_relset_1(X1,X3,X2)|$false),inference(rw,[status(thm)],[428,66,theory(equality)])).
% cnf(430,plain,(k5_relat_1(X1,k6_partfun1(X2))=X1|~m2_relset_1(X1,X3,X2)),inference(cn,[status(thm)],[429,theory(equality)])).
% cnf(465,negated_conjecture,(k5_relat_1(esk13_0,k6_partfun1(esk12_0))=esk13_0),inference(spm,[status(thm)],[430,213,theory(equality)])).
% cnf(504,plain,(k5_relat_1(k6_partfun1(X1),X3)=X3|~m1_relset_1(k6_partfun1(X1),X1,X1)|~m2_relset_1(X3,X1,X2)),inference(csr,[status(thm)],[258,80])).
% cnf(505,plain,(k5_relat_1(k6_partfun1(X1),X2)=X2|~m2_relset_1(X2,X1,X3)|~m2_relset_1(k6_partfun1(X1),X1,X1)),inference(spm,[status(thm)],[504,80,theory(equality)])).
% cnf(506,plain,(k5_relat_1(k6_partfun1(X1),X2)=X2|~m2_relset_1(X2,X1,X3)|$false),inference(rw,[status(thm)],[505,66,theory(equality)])).
% cnf(507,plain,(k5_relat_1(k6_partfun1(X1),X2)=X2|~m2_relset_1(X2,X1,X3)),inference(cn,[status(thm)],[506,theory(equality)])).
% cnf(659,plain,(k9_relset_2(X1,X2,X3,X4,X5)=k5_relat_1(X4,X5)|~m2_relset_1(X5,X2,X3)|~m2_relset_1(X4,X1,X2)),inference(spm,[status(thm)],[262,73,theory(equality)])).
% cnf(1379,negated_conjecture,(k5_relat_1(k6_partfun1(esk11_0),esk13_0)=esk13_0),inference(spm,[status(thm)],[507,213,theory(equality)])).
% cnf(8623,negated_conjecture,(k5_relat_1(esk13_0,k6_partfun1(esk12_0))!=k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)|~m2_relset_1(k6_partfun1(esk12_0),esk12_0,esk12_0)|~m2_relset_1(esk13_0,esk11_0,esk12_0)),inference(spm,[status(thm)],[212,659,theory(equality)])).
% cnf(8630,negated_conjecture,(esk13_0!=k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)|~m2_relset_1(k6_partfun1(esk12_0),esk12_0,esk12_0)|~m2_relset_1(esk13_0,esk11_0,esk12_0)),inference(rw,[status(thm)],[8623,465,theory(equality)])).
% cnf(8631,negated_conjecture,(esk13_0!=k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)|$false|~m2_relset_1(esk13_0,esk11_0,esk12_0)),inference(rw,[status(thm)],[8630,66,theory(equality)])).
% cnf(8632,negated_conjecture,(esk13_0!=k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)|$false|$false),inference(rw,[status(thm)],[8631,213,theory(equality)])).
% cnf(8633,negated_conjecture,(esk13_0!=k9_relset_2(esk11_0,esk11_0,esk12_0,k6_partfun1(esk11_0),esk13_0)),inference(cn,[status(thm)],[8632,theory(equality)])).
% cnf(8642,negated_conjecture,(k5_relat_1(k6_partfun1(esk11_0),esk13_0)!=esk13_0|~m2_relset_1(esk13_0,esk11_0,esk12_0)|~m2_relset_1(k6_partfun1(esk11_0),esk11_0,esk11_0)),inference(spm,[status(thm)],[8633,659,theory(equality)])).
% cnf(8644,negated_conjecture,($false|~m2_relset_1(esk13_0,esk11_0,esk12_0)|~m2_relset_1(k6_partfun1(esk11_0),esk11_0,esk11_0)),inference(rw,[status(thm)],[8642,1379,theory(equality)])).
% cnf(8645,negated_conjecture,($false|$false|~m2_relset_1(k6_partfun1(esk11_0),esk11_0,esk11_0)),inference(rw,[status(thm)],[8644,213,theory(equality)])).
% cnf(8646,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[8645,66,theory(equality)])).
% cnf(8647,negated_conjecture,($false),inference(cn,[status(thm)],[8646,theory(equality)])).
% cnf(8648,negated_conjecture,($false),8647,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1090
% # ...of these trivial : 6
% # ...subsumed : 581
% # ...remaining for further processing: 503
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 45
% # Backward-rewritten : 17
% # Generated clauses : 4142
% # ...of the previous two non-trivial : 3630
% # Contextual simplify-reflections : 391
% # Paramodulations : 4118
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 366
% # Positive orientable unit clauses: 90
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 264
% # Current number of unprocessed clauses: 2268
% # ...number of literals in the above : 9426
% # Clause-clause subsumption calls (NU) : 8757
% # Rec. Clause-clause subsumption calls : 7773
% # Unit Clause-clause subsumption calls : 172
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 33
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 277 leaves, 1.47+/-1.602 terms/leaf
% # Paramod-from index: 138 leaves, 1.26+/-1.326 terms/leaf
% # Paramod-into index: 224 leaves, 1.34+/-1.279 terms/leaf
% # -------------------------------------------------
% # User time : 0.184 s
% # System time : 0.013 s
% # Total time : 0.197 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.45 WC
% FINAL PrfWatch: 0.38 CPU 0.45 WC
% SZS output end Solution for /tmp/SystemOnTPTP23084/SEU451+1.tptp
%
%------------------------------------------------------------------------------