TSTP Solution File: SEU217+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU217+3 : TPTP v5.0.0. Released v3.2.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 01:59:01 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP19159/SEU217+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19159/SEU217+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19159/SEU217+3.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 19255
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:relation(identity_relation(X1)),file('/tmp/SRASS.s.p', dt_k6_relat_1)).
% fof(5, axiom,![X1]:![X2]:((relation(X2)&function(X2))=>(X2=identity_relation(X1)<=>(relation_dom(X2)=X1&![X3]:(in(X3,X1)=>apply(X2,X3)=X3)))),file('/tmp/SRASS.s.p', t34_funct_1)).
% fof(19, axiom,![X1]:(relation(identity_relation(X1))&function(identity_relation(X1))),file('/tmp/SRASS.s.p', fc2_funct_1)).
% fof(31, conjecture,![X1]:![X2]:(in(X2,X1)=>apply(identity_relation(X1),X2)=X2),file('/tmp/SRASS.s.p', t35_funct_1)).
% fof(32, negated_conjecture,~(![X1]:![X2]:(in(X2,X1)=>apply(identity_relation(X1),X2)=X2)),inference(assume_negation,[status(cth)],[31])).
% fof(48, plain,![X2]:relation(identity_relation(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(49,plain,(relation(identity_relation(X1))),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:((~(relation(X2))|~(function(X2)))|((~(X2=identity_relation(X1))|(relation_dom(X2)=X1&![X3]:(~(in(X3,X1))|apply(X2,X3)=X3)))&((~(relation_dom(X2)=X1)|?[X3]:(in(X3,X1)&~(apply(X2,X3)=X3)))|X2=identity_relation(X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(51, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|((~(X5=identity_relation(X4))|(relation_dom(X5)=X4&![X6]:(~(in(X6,X4))|apply(X5,X6)=X6)))&((~(relation_dom(X5)=X4)|?[X7]:(in(X7,X4)&~(apply(X5,X7)=X7)))|X5=identity_relation(X4)))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:((~(relation(X5))|~(function(X5)))|((~(X5=identity_relation(X4))|(relation_dom(X5)=X4&![X6]:(~(in(X6,X4))|apply(X5,X6)=X6)))&((~(relation_dom(X5)=X4)|(in(esk1_2(X4,X5),X4)&~(apply(X5,esk1_2(X4,X5))=esk1_2(X4,X5))))|X5=identity_relation(X4)))),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X4))|apply(X5,X6)=X6)&relation_dom(X5)=X4)|~(X5=identity_relation(X4)))&((~(relation_dom(X5)=X4)|(in(esk1_2(X4,X5),X4)&~(apply(X5,esk1_2(X4,X5))=esk1_2(X4,X5))))|X5=identity_relation(X4)))|(~(relation(X5))|~(function(X5)))),inference(shift_quantors,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X4))|apply(X5,X6)=X6)|~(X5=identity_relation(X4)))|(~(relation(X5))|~(function(X5))))&((relation_dom(X5)=X4|~(X5=identity_relation(X4)))|(~(relation(X5))|~(function(X5)))))&((((in(esk1_2(X4,X5),X4)|~(relation_dom(X5)=X4))|X5=identity_relation(X4))|(~(relation(X5))|~(function(X5))))&(((~(apply(X5,esk1_2(X4,X5))=esk1_2(X4,X5))|~(relation_dom(X5)=X4))|X5=identity_relation(X4))|(~(relation(X5))|~(function(X5)))))),inference(distribute,[status(thm)],[53])).
% cnf(58,plain,(apply(X1,X3)=X3|~function(X1)|~relation(X1)|X1!=identity_relation(X2)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(98, plain,![X2]:(relation(identity_relation(X2))&function(identity_relation(X2))),inference(variable_rename,[status(thm)],[19])).
% cnf(99,plain,(function(identity_relation(X1))),inference(split_conjunct,[status(thm)],[98])).
% fof(140, negated_conjecture,?[X1]:?[X2]:(in(X2,X1)&~(apply(identity_relation(X1),X2)=X2)),inference(fof_nnf,[status(thm)],[32])).
% fof(141, negated_conjecture,?[X3]:?[X4]:(in(X4,X3)&~(apply(identity_relation(X3),X4)=X4)),inference(variable_rename,[status(thm)],[140])).
% fof(142, negated_conjecture,(in(esk12_0,esk11_0)&~(apply(identity_relation(esk11_0),esk12_0)=esk12_0)),inference(skolemize,[status(esa)],[141])).
% cnf(143,negated_conjecture,(apply(identity_relation(esk11_0),esk12_0)!=esk12_0),inference(split_conjunct,[status(thm)],[142])).
% cnf(144,negated_conjecture,(in(esk12_0,esk11_0)),inference(split_conjunct,[status(thm)],[142])).
% cnf(196,negated_conjecture,(apply(X1,esk12_0)=esk12_0|identity_relation(esk11_0)!=X1|~function(X1)|~relation(X1)),inference(pm,[status(thm)],[58,144,theory(equality)])).
% cnf(340,negated_conjecture,(apply(identity_relation(esk11_0),esk12_0)=esk12_0|~function(identity_relation(esk11_0))|~relation(identity_relation(esk11_0))),inference(er,[status(thm)],[196,theory(equality)])).
% cnf(341,negated_conjecture,(apply(identity_relation(esk11_0),esk12_0)=esk12_0|$false|~relation(identity_relation(esk11_0))),inference(rw,[status(thm)],[340,99,theory(equality)])).
% cnf(342,negated_conjecture,(apply(identity_relation(esk11_0),esk12_0)=esk12_0|$false|$false),inference(rw,[status(thm)],[341,49,theory(equality)])).
% cnf(343,negated_conjecture,(apply(identity_relation(esk11_0),esk12_0)=esk12_0),inference(cn,[status(thm)],[342,theory(equality)])).
% cnf(344,negated_conjecture,($false),inference(sr,[status(thm)],[343,143,theory(equality)])).
% cnf(345,negated_conjecture,($false),344,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 100
% # ...of these trivial : 5
% # ...subsumed : 11
% # ...remaining for further processing: 84
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 13
% # Generated clauses : 121
% # ...of the previous two non-trivial : 95
% # Contextual simplify-reflections : 0
% # Paramodulations : 114
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 71
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 9
% # Non-unit-clauses : 33
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 38
% # Clause-clause subsumption calls (NU) : 30
% # Rec. Clause-clause subsumption calls : 24
% # Unit Clause-clause subsumption calls : 55
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 77 leaves, 1.23+/-0.622 terms/leaf
% # Paramod-from index: 33 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 69 leaves, 1.17+/-0.449 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.005 s
% # Total time : 0.020 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/SystemOnTPTP19159/SEU217+3.tptp
%
%------------------------------------------------------------------------------