TSTP Solution File: SEU353+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SEU353+1 : TPTP v5.0.0. Released v3.3.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 03:55:40 EST 2010

% Result   : Theorem 1.19s
% Output   : Solution 1.19s
% 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/SystemOnTPTP28817/SEU353+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP28817/SEU353+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28817/SEU353+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 28913
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time     : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),file('/tmp/SRASS.s.p', fc1_struct_0)).
% fof(5, axiom,![X1]:(one_sorted_str(X1)=>identity_on_carrier(X1)=identity_as_relation_of(the_carrier(X1))),file('/tmp/SRASS.s.p', d11_grcat_1)).
% fof(8, axiom,![X1]:(one_sorted_str(X1)=>((function(identity_on_carrier(X1))&quasi_total(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1)))&relation_of2_as_subset(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1)))),file('/tmp/SRASS.s.p', dt_k7_grcat_1)).
% fof(17, axiom,![X1]:![X2]:![X3]:![X4]:(((((~(empty(X1))&function(X3))&quasi_total(X3,X1,X2))&relation_of2(X3,X1,X2))&element(X4,X1))=>apply_as_element(X1,X2,X3,X4)=apply(X3,X4)),file('/tmp/SRASS.s.p', redefinition_k8_funct_2)).
% fof(22, axiom,![X1]:identity_as_relation_of(X1)=identity_relation(X1),file('/tmp/SRASS.s.p', redefinition_k6_partfun1)).
% fof(27, axiom,![X1]:![X2]:(element(X1,X2)=>(empty(X2)|in(X1,X2))),file('/tmp/SRASS.s.p', t2_subset)).
% fof(30, axiom,![X1]:![X2]:![X3]:(relation_of2_as_subset(X3,X1,X2)<=>relation_of2(X3,X1,X2)),file('/tmp/SRASS.s.p', redefinition_m2_relset_1)).
% fof(32, axiom,![X1]:![X2]:(in(X2,X1)=>apply(identity_relation(X1),X2)=X2),file('/tmp/SRASS.s.p', t35_funct_1)).
% fof(57, conjecture,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2)=X2)),file('/tmp/SRASS.s.p', t91_tmap_1)).
% fof(58, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2)=X2))),inference(assume_negation,[status(cth)],[57])).
% fof(60, plain,![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>~(empty(the_carrier(X1)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(65, plain,![X1]:![X2]:![X3]:![X4]:(((((~(empty(X1))&function(X3))&quasi_total(X3,X1,X2))&relation_of2(X3,X1,X2))&element(X4,X1))=>apply_as_element(X1,X2,X3,X4)=apply(X3,X4)),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(71, negated_conjecture,~(![X1]:((~(empty_carrier(X1))&one_sorted_str(X1))=>![X2]:(element(X2,the_carrier(X1))=>apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2)=X2))),inference(fof_simplification,[status(thm)],[58,theory(equality)])).
% fof(82, plain,![X1]:((empty_carrier(X1)|~(one_sorted_str(X1)))|~(empty(the_carrier(X1)))),inference(fof_nnf,[status(thm)],[60])).
% fof(83, plain,![X2]:((empty_carrier(X2)|~(one_sorted_str(X2)))|~(empty(the_carrier(X2)))),inference(variable_rename,[status(thm)],[82])).
% cnf(84,plain,(empty_carrier(X1)|~empty(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(85, plain,![X1]:(~(one_sorted_str(X1))|identity_on_carrier(X1)=identity_as_relation_of(the_carrier(X1))),inference(fof_nnf,[status(thm)],[5])).
% fof(86, plain,![X2]:(~(one_sorted_str(X2))|identity_on_carrier(X2)=identity_as_relation_of(the_carrier(X2))),inference(variable_rename,[status(thm)],[85])).
% cnf(87,plain,(identity_on_carrier(X1)=identity_as_relation_of(the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[86])).
% fof(97, plain,![X1]:(~(one_sorted_str(X1))|((function(identity_on_carrier(X1))&quasi_total(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1)))&relation_of2_as_subset(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1)))),inference(fof_nnf,[status(thm)],[8])).
% fof(98, plain,![X2]:(~(one_sorted_str(X2))|((function(identity_on_carrier(X2))&quasi_total(identity_on_carrier(X2),the_carrier(X2),the_carrier(X2)))&relation_of2_as_subset(identity_on_carrier(X2),the_carrier(X2),the_carrier(X2)))),inference(variable_rename,[status(thm)],[97])).
% fof(99, plain,![X2]:(((function(identity_on_carrier(X2))|~(one_sorted_str(X2)))&(quasi_total(identity_on_carrier(X2),the_carrier(X2),the_carrier(X2))|~(one_sorted_str(X2))))&(relation_of2_as_subset(identity_on_carrier(X2),the_carrier(X2),the_carrier(X2))|~(one_sorted_str(X2)))),inference(distribute,[status(thm)],[98])).
% cnf(100,plain,(relation_of2_as_subset(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[99])).
% cnf(101,plain,(quasi_total(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[99])).
% cnf(102,plain,(function(identity_on_carrier(X1))|~one_sorted_str(X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(130, plain,![X1]:![X2]:![X3]:![X4]:(((((empty(X1)|~(function(X3)))|~(quasi_total(X3,X1,X2)))|~(relation_of2(X3,X1,X2)))|~(element(X4,X1)))|apply_as_element(X1,X2,X3,X4)=apply(X3,X4)),inference(fof_nnf,[status(thm)],[65])).
% fof(131, plain,![X5]:![X6]:![X7]:![X8]:(((((empty(X5)|~(function(X7)))|~(quasi_total(X7,X5,X6)))|~(relation_of2(X7,X5,X6)))|~(element(X8,X5)))|apply_as_element(X5,X6,X7,X8)=apply(X7,X8)),inference(variable_rename,[status(thm)],[130])).
% cnf(132,plain,(apply_as_element(X1,X2,X3,X4)=apply(X3,X4)|empty(X1)|~element(X4,X1)|~relation_of2(X3,X1,X2)|~quasi_total(X3,X1,X2)|~function(X3)),inference(split_conjunct,[status(thm)],[131])).
% fof(143, plain,![X2]:identity_as_relation_of(X2)=identity_relation(X2),inference(variable_rename,[status(thm)],[22])).
% cnf(144,plain,(identity_as_relation_of(X1)=identity_relation(X1)),inference(split_conjunct,[status(thm)],[143])).
% fof(158, plain,![X1]:![X2]:(~(element(X1,X2))|(empty(X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[27])).
% fof(159, plain,![X3]:![X4]:(~(element(X3,X4))|(empty(X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[158])).
% cnf(160,plain,(in(X1,X2)|empty(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[159])).
% fof(168, plain,![X1]:![X2]:![X3]:((~(relation_of2_as_subset(X3,X1,X2))|relation_of2(X3,X1,X2))&(~(relation_of2(X3,X1,X2))|relation_of2_as_subset(X3,X1,X2))),inference(fof_nnf,[status(thm)],[30])).
% fof(169, plain,![X4]:![X5]:![X6]:((~(relation_of2_as_subset(X6,X4,X5))|relation_of2(X6,X4,X5))&(~(relation_of2(X6,X4,X5))|relation_of2_as_subset(X6,X4,X5))),inference(variable_rename,[status(thm)],[168])).
% cnf(171,plain,(relation_of2(X1,X2,X3)|~relation_of2_as_subset(X1,X2,X3)),inference(split_conjunct,[status(thm)],[169])).
% fof(178, plain,![X1]:![X2]:(~(in(X2,X1))|apply(identity_relation(X1),X2)=X2),inference(fof_nnf,[status(thm)],[32])).
% fof(179, plain,![X3]:![X4]:(~(in(X4,X3))|apply(identity_relation(X3),X4)=X4),inference(variable_rename,[status(thm)],[178])).
% cnf(180,plain,(apply(identity_relation(X1),X2)=X2|~in(X2,X1)),inference(split_conjunct,[status(thm)],[179])).
% fof(280, negated_conjecture,?[X1]:((~(empty_carrier(X1))&one_sorted_str(X1))&?[X2]:(element(X2,the_carrier(X1))&~(apply_as_element(the_carrier(X1),the_carrier(X1),identity_on_carrier(X1),X2)=X2))),inference(fof_nnf,[status(thm)],[71])).
% fof(281, negated_conjecture,?[X3]:((~(empty_carrier(X3))&one_sorted_str(X3))&?[X4]:(element(X4,the_carrier(X3))&~(apply_as_element(the_carrier(X3),the_carrier(X3),identity_on_carrier(X3),X4)=X4))),inference(variable_rename,[status(thm)],[280])).
% fof(282, negated_conjecture,((~(empty_carrier(esk16_0))&one_sorted_str(esk16_0))&(element(esk17_0,the_carrier(esk16_0))&~(apply_as_element(the_carrier(esk16_0),the_carrier(esk16_0),identity_on_carrier(esk16_0),esk17_0)=esk17_0))),inference(skolemize,[status(esa)],[281])).
% cnf(283,negated_conjecture,(apply_as_element(the_carrier(esk16_0),the_carrier(esk16_0),identity_on_carrier(esk16_0),esk17_0)!=esk17_0),inference(split_conjunct,[status(thm)],[282])).
% cnf(284,negated_conjecture,(element(esk17_0,the_carrier(esk16_0))),inference(split_conjunct,[status(thm)],[282])).
% cnf(285,negated_conjecture,(one_sorted_str(esk16_0)),inference(split_conjunct,[status(thm)],[282])).
% cnf(286,negated_conjecture,(~empty_carrier(esk16_0)),inference(split_conjunct,[status(thm)],[282])).
% cnf(294,plain,(apply(identity_as_relation_of(X1),X2)=X2|~in(X2,X1)),inference(rw,[status(thm)],[180,144,theory(equality)]),['unfolding']).
% cnf(300,negated_conjecture,(~empty(the_carrier(esk16_0))|~one_sorted_str(esk16_0)),inference(spm,[status(thm)],[286,84,theory(equality)])).
% cnf(302,negated_conjecture,(~empty(the_carrier(esk16_0))|$false),inference(rw,[status(thm)],[300,285,theory(equality)])).
% cnf(303,negated_conjecture,(~empty(the_carrier(esk16_0))),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(341,plain,(relation_of2(identity_on_carrier(X1),the_carrier(X1),the_carrier(X1))|~one_sorted_str(X1)),inference(spm,[status(thm)],[171,100,theory(equality)])).
% cnf(346,plain,(apply(identity_on_carrier(X1),X2)=X2|~in(X2,the_carrier(X1))|~one_sorted_str(X1)),inference(spm,[status(thm)],[294,87,theory(equality)])).
% cnf(399,negated_conjecture,(empty(the_carrier(esk16_0))|apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~quasi_total(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))|~element(esk17_0,the_carrier(esk16_0))),inference(spm,[status(thm)],[283,132,theory(equality)])).
% cnf(401,negated_conjecture,(empty(the_carrier(esk16_0))|apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~quasi_total(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))|$false),inference(rw,[status(thm)],[399,284,theory(equality)])).
% cnf(402,negated_conjecture,(empty(the_carrier(esk16_0))|apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~quasi_total(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))),inference(cn,[status(thm)],[401,theory(equality)])).
% cnf(431,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~quasi_total(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))),inference(sr,[status(thm)],[402,303,theory(equality)])).
% cnf(432,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))|~one_sorted_str(esk16_0)),inference(spm,[status(thm)],[431,101,theory(equality)])).
% cnf(433,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))|$false),inference(rw,[status(thm)],[432,285,theory(equality)])).
% cnf(434,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~relation_of2(identity_on_carrier(esk16_0),the_carrier(esk16_0),the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))),inference(cn,[status(thm)],[433,theory(equality)])).
% cnf(461,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~function(identity_on_carrier(esk16_0))|~one_sorted_str(esk16_0)),inference(spm,[status(thm)],[434,341,theory(equality)])).
% cnf(462,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~function(identity_on_carrier(esk16_0))|$false),inference(rw,[status(thm)],[461,285,theory(equality)])).
% cnf(463,negated_conjecture,(apply(identity_on_carrier(esk16_0),esk17_0)!=esk17_0|~function(identity_on_carrier(esk16_0))),inference(cn,[status(thm)],[462,theory(equality)])).
% cnf(484,negated_conjecture,(~function(identity_on_carrier(esk16_0))|~in(esk17_0,the_carrier(esk16_0))|~one_sorted_str(esk16_0)),inference(spm,[status(thm)],[463,346,theory(equality)])).
% cnf(485,negated_conjecture,(~function(identity_on_carrier(esk16_0))|~in(esk17_0,the_carrier(esk16_0))|$false),inference(rw,[status(thm)],[484,285,theory(equality)])).
% cnf(486,negated_conjecture,(~function(identity_on_carrier(esk16_0))|~in(esk17_0,the_carrier(esk16_0))),inference(cn,[status(thm)],[485,theory(equality)])).
% cnf(487,negated_conjecture,(empty(the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))|~element(esk17_0,the_carrier(esk16_0))),inference(spm,[status(thm)],[486,160,theory(equality)])).
% cnf(488,negated_conjecture,(empty(the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))|$false),inference(rw,[status(thm)],[487,284,theory(equality)])).
% cnf(489,negated_conjecture,(empty(the_carrier(esk16_0))|~function(identity_on_carrier(esk16_0))),inference(cn,[status(thm)],[488,theory(equality)])).
% cnf(490,negated_conjecture,(~function(identity_on_carrier(esk16_0))),inference(sr,[status(thm)],[489,303,theory(equality)])).
% cnf(491,negated_conjecture,(~one_sorted_str(esk16_0)),inference(spm,[status(thm)],[490,102,theory(equality)])).
% cnf(492,negated_conjecture,($false),inference(rw,[status(thm)],[491,285,theory(equality)])).
% cnf(493,negated_conjecture,($false),inference(cn,[status(thm)],[492,theory(equality)])).
% cnf(494,negated_conjecture,($false),493,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 237
% # ...of these trivial                : 1
% # ...subsumed                        : 12
% # ...remaining for further processing: 224
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 2
% # Backward-rewritten                 : 7
% # Generated clauses                  : 111
% # ...of the previous two non-trivial : 92
% # Contextual simplify-reflections    : 7
% # Paramodulations                    : 108
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 127
% #    Positive orientable unit clauses: 53
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 12
% #    Non-unit-clauses                : 62
% # Current number of unprocessed clauses: 23
% # ...number of literals in the above : 104
% # Clause-clause subsumption calls (NU) : 91
% # Rec. Clause-clause subsumption calls : 70
% # Unit Clause-clause subsumption calls : 31
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 11
% # Indexed BW rewrite successes       : 4
% # Backwards rewriting index:   152 leaves,   1.16+/-0.501 terms/leaf
% # Paramod-from index:           79 leaves,   1.03+/-0.157 terms/leaf
% # Paramod-into index:          138 leaves,   1.09+/-0.359 terms/leaf
% # -------------------------------------------------
% # User time              : 0.029 s
% # System time            : 0.004 s
% # Total time             : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.21 WC
% FINAL PrfWatch: 0.15 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP28817/SEU353+1.tptp
% 
%------------------------------------------------------------------------------