TSTP Solution File: SET722+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET722+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 23:46:45 EST 2010
% Result : Theorem 82.31s
% Output : Solution 82.59s
% 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/SystemOnTPTP5531/SET722+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thII13:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... compose_function:
% CSA axiom compose_function found
% Looking for CSA axiom ... surjective:
% CSA axiom surjective found
% Looking for CSA axiom ... maps:
% CSA axiom maps found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :maps:surjective:compose_function (3)
% Unselected axioms are ... :one_to_one:equal_maps:injective:isomorphism:singleton:unordered_pair:power_set:compose_predicate:identity:inverse_predicate:inverse_function:image2:image3:inverse_image2:inverse_image3:increasing_function:decreasing_function:equal_set:subset:intersection:union:empty_set:difference:sum:product (25)
% SZS status THM for /tmp/SystemOnTPTP5531/SET722+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP5531/SET722+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 6949
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(surjective(X1,X2,X3)<=>![X5]:(member(X5,X3)=>?[X8]:(member(X8,X2)&apply(X1,X8,X5)))),file('/tmp/SRASS.s.p', surjective)).
% fof(3, axiom,![X9]:![X1]:![X2]:![X3]:![X10]:![X4]:![X11]:((member(X4,X2)&member(X11,X10))=>(apply(compose_function(X9,X1,X2,X3,X10),X4,X11)<=>?[X5]:((member(X5,X3)&apply(X1,X4,X5))&apply(X9,X5,X11)))),file('/tmp/SRASS.s.p', compose_function)).
% fof(4, conjecture,![X1]:![X9]:![X2]:![X3]:![X10]:(((maps(X1,X2,X3)&maps(X9,X3,X10))&surjective(compose_function(X9,X1,X2,X3,X10),X2,X10))=>surjective(X9,X3,X10)),file('/tmp/SRASS.s.p', thII13)).
% fof(5, negated_conjecture,~(![X1]:![X9]:![X2]:![X3]:![X10]:(((maps(X1,X2,X3)&maps(X9,X3,X10))&surjective(compose_function(X9,X1,X2,X3,X10),X2,X10))=>surjective(X9,X3,X10))),inference(assume_negation,[status(cth)],[4])).
% fof(26, plain,![X1]:![X2]:![X3]:((~(surjective(X1,X2,X3))|![X5]:(~(member(X5,X3))|?[X8]:(member(X8,X2)&apply(X1,X8,X5))))&(?[X5]:(member(X5,X3)&![X8]:(~(member(X8,X2))|~(apply(X1,X8,X5))))|surjective(X1,X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(27, plain,![X9]:![X10]:![X11]:((~(surjective(X9,X10,X11))|![X12]:(~(member(X12,X11))|?[X13]:(member(X13,X10)&apply(X9,X13,X12))))&(?[X14]:(member(X14,X11)&![X15]:(~(member(X15,X10))|~(apply(X9,X15,X14))))|surjective(X9,X10,X11))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X9]:![X10]:![X11]:((~(surjective(X9,X10,X11))|![X12]:(~(member(X12,X11))|(member(esk6_4(X9,X10,X11,X12),X10)&apply(X9,esk6_4(X9,X10,X11,X12),X12))))&((member(esk7_3(X9,X10,X11),X11)&![X15]:(~(member(X15,X10))|~(apply(X9,X15,esk7_3(X9,X10,X11)))))|surjective(X9,X10,X11))),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X9]:![X10]:![X11]:![X12]:![X15]:((((~(member(X15,X10))|~(apply(X9,X15,esk7_3(X9,X10,X11))))&member(esk7_3(X9,X10,X11),X11))|surjective(X9,X10,X11))&((~(member(X12,X11))|(member(esk6_4(X9,X10,X11,X12),X10)&apply(X9,esk6_4(X9,X10,X11,X12),X12)))|~(surjective(X9,X10,X11)))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X9]:![X10]:![X11]:![X12]:![X15]:((((~(member(X15,X10))|~(apply(X9,X15,esk7_3(X9,X10,X11))))|surjective(X9,X10,X11))&(member(esk7_3(X9,X10,X11),X11)|surjective(X9,X10,X11)))&(((member(esk6_4(X9,X10,X11,X12),X10)|~(member(X12,X11)))|~(surjective(X9,X10,X11)))&((apply(X9,esk6_4(X9,X10,X11,X12),X12)|~(member(X12,X11)))|~(surjective(X9,X10,X11))))),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(apply(X1,esk6_4(X1,X2,X3,X4),X4)|~surjective(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(member(esk6_4(X1,X2,X3,X4),X2)|~surjective(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[30])).
% cnf(33,plain,(surjective(X1,X2,X3)|member(esk7_3(X1,X2,X3),X3)),inference(split_conjunct,[status(thm)],[30])).
% cnf(34,plain,(surjective(X1,X2,X3)|~apply(X1,X4,esk7_3(X1,X2,X3))|~member(X4,X2)),inference(split_conjunct,[status(thm)],[30])).
% fof(35, plain,![X9]:![X1]:![X2]:![X3]:![X10]:![X4]:![X11]:((~(member(X4,X2))|~(member(X11,X10)))|((~(apply(compose_function(X9,X1,X2,X3,X10),X4,X11))|?[X5]:((member(X5,X3)&apply(X1,X4,X5))&apply(X9,X5,X11)))&(![X5]:((~(member(X5,X3))|~(apply(X1,X4,X5)))|~(apply(X9,X5,X11)))|apply(compose_function(X9,X1,X2,X3,X10),X4,X11)))),inference(fof_nnf,[status(thm)],[3])).
% fof(36, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:((~(member(X17,X14))|~(member(X18,X16)))|((~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|?[X19]:((member(X19,X15)&apply(X13,X17,X19))&apply(X12,X19,X18)))&(![X20]:((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:((~(member(X17,X14))|~(member(X18,X16)))|((~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|((member(esk8_7(X12,X13,X14,X15,X16,X17,X18),X15)&apply(X13,X17,esk8_7(X12,X13,X14,X15,X16,X17,X18)))&apply(X12,esk8_7(X12,X13,X14,X15,X16,X17,X18),X18)))&(![X20]:((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X20]:(((((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18))&(~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|((member(esk8_7(X12,X13,X14,X15,X16,X17,X18),X15)&apply(X13,X17,esk8_7(X12,X13,X14,X15,X16,X17,X18)))&apply(X12,esk8_7(X12,X13,X14,X15,X16,X17,X18),X18))))|(~(member(X17,X14))|~(member(X18,X16)))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X12]:![X13]:![X14]:![X15]:![X16]:![X17]:![X18]:![X20]:(((((~(member(X20,X15))|~(apply(X13,X17,X20)))|~(apply(X12,X20,X18)))|apply(compose_function(X12,X13,X14,X15,X16),X17,X18))|(~(member(X17,X14))|~(member(X18,X16))))&((((member(esk8_7(X12,X13,X14,X15,X16,X17,X18),X15)|~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))|(~(member(X17,X14))|~(member(X18,X16))))&((apply(X13,X17,esk8_7(X12,X13,X14,X15,X16,X17,X18))|~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))|(~(member(X17,X14))|~(member(X18,X16)))))&((apply(X12,esk8_7(X12,X13,X14,X15,X16,X17,X18),X18)|~(apply(compose_function(X12,X13,X14,X15,X16),X17,X18)))|(~(member(X17,X14))|~(member(X18,X16)))))),inference(distribute,[status(thm)],[38])).
% cnf(40,plain,(apply(X5,esk8_7(X5,X6,X4,X7,X2,X3,X1),X1)|~member(X1,X2)|~member(X3,X4)|~apply(compose_function(X5,X6,X4,X7,X2),X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% cnf(42,plain,(member(esk8_7(X5,X6,X4,X7,X2,X3,X1),X7)|~member(X1,X2)|~member(X3,X4)|~apply(compose_function(X5,X6,X4,X7,X2),X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(44, negated_conjecture,?[X1]:?[X9]:?[X2]:?[X3]:?[X10]:(((maps(X1,X2,X3)&maps(X9,X3,X10))&surjective(compose_function(X9,X1,X2,X3,X10),X2,X10))&~(surjective(X9,X3,X10))),inference(fof_nnf,[status(thm)],[5])).
% fof(45, negated_conjecture,?[X11]:?[X12]:?[X13]:?[X14]:?[X15]:(((maps(X11,X13,X14)&maps(X12,X14,X15))&surjective(compose_function(X12,X11,X13,X14,X15),X13,X15))&~(surjective(X12,X14,X15))),inference(variable_rename,[status(thm)],[44])).
% fof(46, negated_conjecture,(((maps(esk9_0,esk11_0,esk12_0)&maps(esk10_0,esk12_0,esk13_0))&surjective(compose_function(esk10_0,esk9_0,esk11_0,esk12_0,esk13_0),esk11_0,esk13_0))&~(surjective(esk10_0,esk12_0,esk13_0))),inference(skolemize,[status(esa)],[45])).
% cnf(47,negated_conjecture,(~surjective(esk10_0,esk12_0,esk13_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(48,negated_conjecture,(surjective(compose_function(esk10_0,esk9_0,esk11_0,esk12_0,esk13_0),esk11_0,esk13_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(60,plain,(surjective(X1,X2,X3)|~member(esk8_7(X1,X4,X5,X6,X7,X8,esk7_3(X1,X2,X3)),X2)|~apply(compose_function(X1,X4,X5,X6,X7),X8,esk7_3(X1,X2,X3))|~member(X8,X5)|~member(esk7_3(X1,X2,X3),X7)),inference(spm,[status(thm)],[34,40,theory(equality)])).
% cnf(98,plain,(surjective(X1,X2,X3)|~apply(compose_function(X1,X4,X5,X2,X6),X7,esk7_3(X1,X2,X3))|~member(esk7_3(X1,X2,X3),X6)|~member(X7,X5)),inference(spm,[status(thm)],[60,42,theory(equality)])).
% cnf(100,plain,(surjective(X1,X2,X3)|~member(esk7_3(X1,X2,X3),X6)|~member(esk6_4(compose_function(X1,X4,X5,X2,X6),X7,X8,esk7_3(X1,X2,X3)),X5)|~surjective(compose_function(X1,X4,X5,X2,X6),X7,X8)|~member(esk7_3(X1,X2,X3),X8)),inference(spm,[status(thm)],[98,31,theory(equality)])).
% cnf(102,plain,(surjective(X1,X2,X3)|~surjective(compose_function(X1,X4,X5,X2,X6),X5,X7)|~member(esk7_3(X1,X2,X3),X6)|~member(esk7_3(X1,X2,X3),X7)),inference(spm,[status(thm)],[100,32,theory(equality)])).
% cnf(103,negated_conjecture,(surjective(esk10_0,esk12_0,X1)|~member(esk7_3(esk10_0,esk12_0,X1),esk13_0)),inference(spm,[status(thm)],[102,48,theory(equality)])).
% cnf(104,negated_conjecture,(surjective(esk10_0,esk12_0,esk13_0)),inference(spm,[status(thm)],[103,33,theory(equality)])).
% cnf(105,negated_conjecture,($false),inference(sr,[status(thm)],[104,47,theory(equality)])).
% cnf(106,negated_conjecture,($false),105,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 70
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 70
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 54
% # ...of the previous two non-trivial : 40
% # Contextual simplify-reflections : 0
% # Paramodulations : 54
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 39
% # Current number of unprocessed clauses: 24
% # ...number of literals in the above : 177
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 23
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 43 leaves, 2.21+/-2.388 terms/leaf
% # Paramod-from index: 16 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 39 leaves, 1.44+/-0.841 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.004 s
% # Total time : 0.019 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP5531/SET722+4.tptp
%
%------------------------------------------------------------------------------