TSTP Solution File: SET731+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET731+4 : TPTP v5.0.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 : Wed Dec 29 23:44:12 EST 2010
% Result : Theorem 91.83s
% Output : Solution 92.27s
% 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/SystemOnTPTP16750/SET731+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thII22:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... subset:
% CSA axiom subset found
% Looking for CSA axiom ... maps:
% CSA axiom maps found
% Looking for CSA axiom ... surjective:
% CSA axiom surjective found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... image2:
% CSA axiom image2 found
% Looking for CSA axiom ... injective:
% CSA axiom injective found
% Looking for CSA axiom ... equal_maps:
% CSA axiom equal_maps found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :equal_maps:injective:image2:surjective:maps:subset (6)
% Unselected axioms are ... :power_set:equal_set:singleton:unordered_pair:isomorphism:compose_predicate:compose_function:identity:inverse_predicate:inverse_function:image3:inverse_image2:inverse_image3:increasing_function:decreasing_function:one_to_one:intersection:union:empty_set:difference:sum:product (22)
% SZS status THM for /tmp/SystemOnTPTP16750/SET731+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP16750/SET731+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 18091
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X3]:![X10]:(member(X10,image2(X1,X3))<=>?[X5]:(member(X5,X3)&apply(X1,X5,X10))),file('/tmp/SRASS.s.p', image2)).
% fof(4, axiom,![X1]:![X3]:![X4]:(surjective(X1,X3,X4)<=>![X10]:(member(X10,X4)=>?[X11]:(member(X11,X3)&apply(X1,X11,X10)))),file('/tmp/SRASS.s.p', surjective)).
% fof(7, conjecture,![X1]:![X2]:![X3]:![X4]:![X12]:((((maps(X1,X3,X4)&subset(X12,X4))&image2(X1,X3)=X12)&![X5]:![X10]:((member(X5,X3)&member(X10,X12))=>(apply(X2,X5,X10)<=>apply(X1,X5,X10))))=>surjective(X2,X3,X12)),file('/tmp/SRASS.s.p', thII22)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X12]:((((maps(X1,X3,X4)&subset(X12,X4))&image2(X1,X3)=X12)&![X5]:![X10]:((member(X5,X3)&member(X10,X12))=>(apply(X2,X5,X10)<=>apply(X1,X5,X10))))=>surjective(X2,X3,X12))),inference(assume_negation,[status(cth)],[7])).
% fof(33, plain,![X1]:![X3]:![X10]:((~(member(X10,image2(X1,X3)))|?[X5]:(member(X5,X3)&apply(X1,X5,X10)))&(![X5]:(~(member(X5,X3))|~(apply(X1,X5,X10)))|member(X10,image2(X1,X3)))),inference(fof_nnf,[status(thm)],[3])).
% fof(34, plain,![X11]:![X12]:![X13]:((~(member(X13,image2(X11,X12)))|?[X14]:(member(X14,X12)&apply(X11,X14,X13)))&(![X15]:(~(member(X15,X12))|~(apply(X11,X15,X13)))|member(X13,image2(X11,X12)))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X11]:![X12]:![X13]:((~(member(X13,image2(X11,X12)))|(member(esk7_3(X11,X12,X13),X12)&apply(X11,esk7_3(X11,X12,X13),X13)))&(![X15]:(~(member(X15,X12))|~(apply(X11,X15,X13)))|member(X13,image2(X11,X12)))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X11]:![X12]:![X13]:![X15]:(((~(member(X15,X12))|~(apply(X11,X15,X13)))|member(X13,image2(X11,X12)))&(~(member(X13,image2(X11,X12)))|(member(esk7_3(X11,X12,X13),X12)&apply(X11,esk7_3(X11,X12,X13),X13)))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X11]:![X12]:![X13]:![X15]:(((~(member(X15,X12))|~(apply(X11,X15,X13)))|member(X13,image2(X11,X12)))&((member(esk7_3(X11,X12,X13),X12)|~(member(X13,image2(X11,X12))))&(apply(X11,esk7_3(X11,X12,X13),X13)|~(member(X13,image2(X11,X12)))))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(apply(X2,esk7_3(X2,X3,X1),X1)|~member(X1,image2(X2,X3))),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(member(esk7_3(X2,X3,X1),X3)|~member(X1,image2(X2,X3))),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,plain,(member(X1,image2(X2,X3))|~apply(X2,X4,X1)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X1]:![X3]:![X4]:((~(surjective(X1,X3,X4))|![X10]:(~(member(X10,X4))|?[X11]:(member(X11,X3)&apply(X1,X11,X10))))&(?[X10]:(member(X10,X4)&![X11]:(~(member(X11,X3))|~(apply(X1,X11,X10))))|surjective(X1,X3,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(42, plain,![X12]:![X13]:![X14]:((~(surjective(X12,X13,X14))|![X15]:(~(member(X15,X14))|?[X16]:(member(X16,X13)&apply(X12,X16,X15))))&(?[X17]:(member(X17,X14)&![X18]:(~(member(X18,X13))|~(apply(X12,X18,X17))))|surjective(X12,X13,X14))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X12]:![X13]:![X14]:((~(surjective(X12,X13,X14))|![X15]:(~(member(X15,X14))|(member(esk8_4(X12,X13,X14,X15),X13)&apply(X12,esk8_4(X12,X13,X14,X15),X15))))&((member(esk9_3(X12,X13,X14),X14)&![X18]:(~(member(X18,X13))|~(apply(X12,X18,esk9_3(X12,X13,X14)))))|surjective(X12,X13,X14))),inference(skolemize,[status(esa)],[42])).
% fof(44, plain,![X12]:![X13]:![X14]:![X15]:![X18]:((((~(member(X18,X13))|~(apply(X12,X18,esk9_3(X12,X13,X14))))&member(esk9_3(X12,X13,X14),X14))|surjective(X12,X13,X14))&((~(member(X15,X14))|(member(esk8_4(X12,X13,X14,X15),X13)&apply(X12,esk8_4(X12,X13,X14,X15),X15)))|~(surjective(X12,X13,X14)))),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X12]:![X13]:![X14]:![X15]:![X18]:((((~(member(X18,X13))|~(apply(X12,X18,esk9_3(X12,X13,X14))))|surjective(X12,X13,X14))&(member(esk9_3(X12,X13,X14),X14)|surjective(X12,X13,X14)))&(((member(esk8_4(X12,X13,X14,X15),X13)|~(member(X15,X14)))|~(surjective(X12,X13,X14)))&((apply(X12,esk8_4(X12,X13,X14,X15),X15)|~(member(X15,X14)))|~(surjective(X12,X13,X14))))),inference(distribute,[status(thm)],[44])).
% cnf(48,plain,(surjective(X1,X2,X3)|member(esk9_3(X1,X2,X3),X3)),inference(split_conjunct,[status(thm)],[45])).
% cnf(49,plain,(surjective(X1,X2,X3)|~apply(X1,X4,esk9_3(X1,X2,X3))|~member(X4,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(78, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X12]:((((maps(X1,X3,X4)&subset(X12,X4))&image2(X1,X3)=X12)&![X5]:![X10]:((~(member(X5,X3))|~(member(X10,X12)))|((~(apply(X2,X5,X10))|apply(X1,X5,X10))&(~(apply(X1,X5,X10))|apply(X2,X5,X10)))))&~(surjective(X2,X3,X12))),inference(fof_nnf,[status(thm)],[8])).
% fof(79, negated_conjecture,?[X13]:?[X14]:?[X15]:?[X16]:?[X17]:((((maps(X13,X15,X16)&subset(X17,X16))&image2(X13,X15)=X17)&![X18]:![X19]:((~(member(X18,X15))|~(member(X19,X17)))|((~(apply(X14,X18,X19))|apply(X13,X18,X19))&(~(apply(X13,X18,X19))|apply(X14,X18,X19)))))&~(surjective(X14,X15,X17))),inference(variable_rename,[status(thm)],[78])).
% fof(80, negated_conjecture,((((maps(esk16_0,esk18_0,esk19_0)&subset(esk20_0,esk19_0))&image2(esk16_0,esk18_0)=esk20_0)&![X18]:![X19]:((~(member(X18,esk18_0))|~(member(X19,esk20_0)))|((~(apply(esk17_0,X18,X19))|apply(esk16_0,X18,X19))&(~(apply(esk16_0,X18,X19))|apply(esk17_0,X18,X19)))))&~(surjective(esk17_0,esk18_0,esk20_0))),inference(skolemize,[status(esa)],[79])).
% fof(81, negated_conjecture,![X18]:![X19]:((((~(member(X18,esk18_0))|~(member(X19,esk20_0)))|((~(apply(esk17_0,X18,X19))|apply(esk16_0,X18,X19))&(~(apply(esk16_0,X18,X19))|apply(esk17_0,X18,X19))))&((maps(esk16_0,esk18_0,esk19_0)&subset(esk20_0,esk19_0))&image2(esk16_0,esk18_0)=esk20_0))&~(surjective(esk17_0,esk18_0,esk20_0))),inference(shift_quantors,[status(thm)],[80])).
% fof(82, negated_conjecture,![X18]:![X19]:(((((~(apply(esk17_0,X18,X19))|apply(esk16_0,X18,X19))|(~(member(X18,esk18_0))|~(member(X19,esk20_0))))&((~(apply(esk16_0,X18,X19))|apply(esk17_0,X18,X19))|(~(member(X18,esk18_0))|~(member(X19,esk20_0)))))&((maps(esk16_0,esk18_0,esk19_0)&subset(esk20_0,esk19_0))&image2(esk16_0,esk18_0)=esk20_0))&~(surjective(esk17_0,esk18_0,esk20_0))),inference(distribute,[status(thm)],[81])).
% cnf(83,negated_conjecture,(~surjective(esk17_0,esk18_0,esk20_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(image2(esk16_0,esk18_0)=esk20_0),inference(split_conjunct,[status(thm)],[82])).
% cnf(87,negated_conjecture,(apply(esk17_0,X2,X1)|~member(X1,esk20_0)|~member(X2,esk18_0)|~apply(esk16_0,X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% cnf(92,negated_conjecture,(member(X1,image2(esk17_0,X2))|~member(X3,X2)|~apply(esk16_0,X3,X1)|~member(X3,esk18_0)|~member(X1,esk20_0)),inference(spm,[status(thm)],[40,87,theory(equality)])).
% cnf(96,plain,(surjective(X1,X2,X3)|~member(esk7_3(X1,X4,esk9_3(X1,X2,X3)),X2)|~member(esk9_3(X1,X2,X3),image2(X1,X4))),inference(spm,[status(thm)],[49,38,theory(equality)])).
% cnf(136,negated_conjecture,(member(X1,image2(esk17_0,X2))|~member(esk7_3(esk16_0,X3,X1),esk18_0)|~member(X1,esk20_0)|~member(esk7_3(esk16_0,X3,X1),X2)|~member(X1,image2(esk16_0,X3))),inference(spm,[status(thm)],[92,38,theory(equality)])).
% cnf(178,plain,(surjective(X1,X2,X3)|~member(esk9_3(X1,X2,X3),image2(X1,X2))),inference(spm,[status(thm)],[96,39,theory(equality)])).
% cnf(220,negated_conjecture,(member(X1,image2(esk17_0,X2))|~member(esk7_3(esk16_0,esk18_0,X1),X2)|~member(X1,image2(esk16_0,esk18_0))|~member(X1,esk20_0)),inference(spm,[status(thm)],[136,39,theory(equality)])).
% cnf(221,negated_conjecture,(member(X1,image2(esk17_0,X2))|~member(esk7_3(esk16_0,esk18_0,X1),X2)|~member(X1,esk20_0)|~member(X1,esk20_0)),inference(rw,[status(thm)],[220,84,theory(equality)])).
% cnf(222,negated_conjecture,(member(X1,image2(esk17_0,X2))|~member(esk7_3(esk16_0,esk18_0,X1),X2)|~member(X1,esk20_0)),inference(cn,[status(thm)],[221,theory(equality)])).
% cnf(227,negated_conjecture,(member(X1,image2(esk17_0,esk18_0))|~member(X1,esk20_0)|~member(X1,image2(esk16_0,esk18_0))),inference(spm,[status(thm)],[222,39,theory(equality)])).
% cnf(228,negated_conjecture,(member(X1,image2(esk17_0,esk18_0))|~member(X1,esk20_0)|~member(X1,esk20_0)),inference(rw,[status(thm)],[227,84,theory(equality)])).
% cnf(229,negated_conjecture,(member(X1,image2(esk17_0,esk18_0))|~member(X1,esk20_0)),inference(cn,[status(thm)],[228,theory(equality)])).
% cnf(231,negated_conjecture,(surjective(esk17_0,esk18_0,X1)|~member(esk9_3(esk17_0,esk18_0,X1),esk20_0)),inference(spm,[status(thm)],[178,229,theory(equality)])).
% cnf(242,negated_conjecture,(surjective(esk17_0,esk18_0,esk20_0)),inference(spm,[status(thm)],[231,48,theory(equality)])).
% cnf(243,negated_conjecture,($false),inference(sr,[status(thm)],[242,83,theory(equality)])).
% cnf(244,negated_conjecture,($false),243,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 145
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 138
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 147
% # ...of the previous two non-trivial : 139
% # Contextual simplify-reflections : 0
% # Paramodulations : 147
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 93
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 82
% # Current number of unprocessed clauses: 84
% # ...number of literals in the above : 423
% # Clause-clause subsumption calls (NU) : 188
% # Rec. Clause-clause subsumption calls : 141
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 11
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 136 leaves, 1.72+/-1.806 terms/leaf
% # Paramod-from index: 44 leaves, 1.07+/-0.252 terms/leaf
% # Paramod-into index: 109 leaves, 1.37+/-0.864 terms/leaf
% # -------------------------------------------------
% # User time : 0.027 s
% # System time : 0.004 s
% # Total time : 0.031 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP16750/SET731+4.tptp
%
%------------------------------------------------------------------------------