TSTP Solution File: SET734+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET734+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:51:19 EST 2010
% Result : Theorem 82.60s
% Output : Solution 83.05s
% 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/SystemOnTPTP9238/SET734+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thII25:
% ---- 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 ... identity:
% CSA axiom identity found
% Looking for CSA axiom ... surjective:
% CSA axiom surjective found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :surjective:identity:compose_function (3)
% Unselected axioms are ... :maps:one_to_one:equal_maps:injective:isomorphism:singleton:unordered_pair:power_set:compose_predicate: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/SystemOnTPTP9238/SET734+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP9238/SET734+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 10516
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(surjective(X1,X2,X3)<=>![X4]:(member(X4,X3)=>?[X5]:(member(X5,X2)&apply(X1,X5,X4)))),file('/tmp/SRASS.s.p', surjective)).
% fof(2, axiom,![X1]:![X2]:(identity(X1,X2)<=>![X6]:(member(X6,X2)=>apply(X1,X6,X6))),file('/tmp/SRASS.s.p', identity)).
% fof(3, axiom,![X7]:![X1]:![X2]:![X3]:![X8]:![X6]:![X9]:((member(X6,X2)&member(X9,X8))=>(apply(compose_function(X7,X1,X2,X3,X8),X6,X9)<=>?[X4]:((member(X4,X3)&apply(X1,X6,X4))&apply(X7,X4,X9)))),file('/tmp/SRASS.s.p', compose_function)).
% fof(4, conjecture,![X1]:![X7]:![X2]:![X3]:(((maps(X7,X2,X3)&maps(X1,X3,X2))&identity(compose_function(X7,X1,X3,X2,X3),X3))=>surjective(X7,X2,X3)),file('/tmp/SRASS.s.p', thII25)).
% fof(5, negated_conjecture,~(![X1]:![X7]:![X2]:![X3]:(((maps(X7,X2,X3)&maps(X1,X3,X2))&identity(compose_function(X7,X1,X3,X2,X3),X3))=>surjective(X7,X2,X3))),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:![X3]:((~(surjective(X1,X2,X3))|![X4]:(~(member(X4,X3))|?[X5]:(member(X5,X2)&apply(X1,X5,X4))))&(?[X4]:(member(X4,X3)&![X5]:(~(member(X5,X2))|~(apply(X1,X5,X4))))|surjective(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(7, plain,![X6]:![X7]:![X8]:((~(surjective(X6,X7,X8))|![X9]:(~(member(X9,X8))|?[X10]:(member(X10,X7)&apply(X6,X10,X9))))&(?[X11]:(member(X11,X8)&![X12]:(~(member(X12,X7))|~(apply(X6,X12,X11))))|surjective(X6,X7,X8))),inference(variable_rename,[status(thm)],[6])).
% fof(8, plain,![X6]:![X7]:![X8]:((~(surjective(X6,X7,X8))|![X9]:(~(member(X9,X8))|(member(esk1_4(X6,X7,X8,X9),X7)&apply(X6,esk1_4(X6,X7,X8,X9),X9))))&((member(esk2_3(X6,X7,X8),X8)&![X12]:(~(member(X12,X7))|~(apply(X6,X12,esk2_3(X6,X7,X8)))))|surjective(X6,X7,X8))),inference(skolemize,[status(esa)],[7])).
% fof(9, plain,![X6]:![X7]:![X8]:![X9]:![X12]:((((~(member(X12,X7))|~(apply(X6,X12,esk2_3(X6,X7,X8))))&member(esk2_3(X6,X7,X8),X8))|surjective(X6,X7,X8))&((~(member(X9,X8))|(member(esk1_4(X6,X7,X8,X9),X7)&apply(X6,esk1_4(X6,X7,X8,X9),X9)))|~(surjective(X6,X7,X8)))),inference(shift_quantors,[status(thm)],[8])).
% fof(10, plain,![X6]:![X7]:![X8]:![X9]:![X12]:((((~(member(X12,X7))|~(apply(X6,X12,esk2_3(X6,X7,X8))))|surjective(X6,X7,X8))&(member(esk2_3(X6,X7,X8),X8)|surjective(X6,X7,X8)))&(((member(esk1_4(X6,X7,X8,X9),X7)|~(member(X9,X8)))|~(surjective(X6,X7,X8)))&((apply(X6,esk1_4(X6,X7,X8,X9),X9)|~(member(X9,X8)))|~(surjective(X6,X7,X8))))),inference(distribute,[status(thm)],[9])).
% cnf(13,plain,(surjective(X1,X2,X3)|member(esk2_3(X1,X2,X3),X3)),inference(split_conjunct,[status(thm)],[10])).
% cnf(14,plain,(surjective(X1,X2,X3)|~apply(X1,X4,esk2_3(X1,X2,X3))|~member(X4,X2)),inference(split_conjunct,[status(thm)],[10])).
% fof(15, plain,![X1]:![X2]:((~(identity(X1,X2))|![X6]:(~(member(X6,X2))|apply(X1,X6,X6)))&(?[X6]:(member(X6,X2)&~(apply(X1,X6,X6)))|identity(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X7]:![X8]:((~(identity(X7,X8))|![X9]:(~(member(X9,X8))|apply(X7,X9,X9)))&(?[X10]:(member(X10,X8)&~(apply(X7,X10,X10)))|identity(X7,X8))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X7]:![X8]:((~(identity(X7,X8))|![X9]:(~(member(X9,X8))|apply(X7,X9,X9)))&((member(esk3_2(X7,X8),X8)&~(apply(X7,esk3_2(X7,X8),esk3_2(X7,X8))))|identity(X7,X8))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X7]:![X8]:![X9]:(((~(member(X9,X8))|apply(X7,X9,X9))|~(identity(X7,X8)))&((member(esk3_2(X7,X8),X8)&~(apply(X7,esk3_2(X7,X8),esk3_2(X7,X8))))|identity(X7,X8))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X7]:![X8]:![X9]:(((~(member(X9,X8))|apply(X7,X9,X9))|~(identity(X7,X8)))&((member(esk3_2(X7,X8),X8)|identity(X7,X8))&(~(apply(X7,esk3_2(X7,X8),esk3_2(X7,X8)))|identity(X7,X8)))),inference(distribute,[status(thm)],[18])).
% cnf(22,plain,(apply(X1,X3,X3)|~identity(X1,X2)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[19])).
% fof(23, plain,![X7]:![X1]:![X2]:![X3]:![X8]:![X6]:![X9]:((~(member(X6,X2))|~(member(X9,X8)))|((~(apply(compose_function(X7,X1,X2,X3,X8),X6,X9))|?[X4]:((member(X4,X3)&apply(X1,X6,X4))&apply(X7,X4,X9)))&(![X4]:((~(member(X4,X3))|~(apply(X1,X6,X4)))|~(apply(X7,X4,X9)))|apply(compose_function(X7,X1,X2,X3,X8),X6,X9)))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:((~(member(X15,X12))|~(member(X16,X14)))|((~(apply(compose_function(X10,X11,X12,X13,X14),X15,X16))|?[X17]:((member(X17,X13)&apply(X11,X15,X17))&apply(X10,X17,X16)))&(![X18]:((~(member(X18,X13))|~(apply(X11,X15,X18)))|~(apply(X10,X18,X16)))|apply(compose_function(X10,X11,X12,X13,X14),X15,X16)))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:((~(member(X15,X12))|~(member(X16,X14)))|((~(apply(compose_function(X10,X11,X12,X13,X14),X15,X16))|((member(esk4_7(X10,X11,X12,X13,X14,X15,X16),X13)&apply(X11,X15,esk4_7(X10,X11,X12,X13,X14,X15,X16)))&apply(X10,esk4_7(X10,X11,X12,X13,X14,X15,X16),X16)))&(![X18]:((~(member(X18,X13))|~(apply(X11,X15,X18)))|~(apply(X10,X18,X16)))|apply(compose_function(X10,X11,X12,X13,X14),X15,X16)))),inference(skolemize,[status(esa)],[24])).
% fof(26, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:![X18]:(((((~(member(X18,X13))|~(apply(X11,X15,X18)))|~(apply(X10,X18,X16)))|apply(compose_function(X10,X11,X12,X13,X14),X15,X16))&(~(apply(compose_function(X10,X11,X12,X13,X14),X15,X16))|((member(esk4_7(X10,X11,X12,X13,X14,X15,X16),X13)&apply(X11,X15,esk4_7(X10,X11,X12,X13,X14,X15,X16)))&apply(X10,esk4_7(X10,X11,X12,X13,X14,X15,X16),X16))))|(~(member(X15,X12))|~(member(X16,X14)))),inference(shift_quantors,[status(thm)],[25])).
% fof(27, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:![X18]:(((((~(member(X18,X13))|~(apply(X11,X15,X18)))|~(apply(X10,X18,X16)))|apply(compose_function(X10,X11,X12,X13,X14),X15,X16))|(~(member(X15,X12))|~(member(X16,X14))))&((((member(esk4_7(X10,X11,X12,X13,X14,X15,X16),X13)|~(apply(compose_function(X10,X11,X12,X13,X14),X15,X16)))|(~(member(X15,X12))|~(member(X16,X14))))&((apply(X11,X15,esk4_7(X10,X11,X12,X13,X14,X15,X16))|~(apply(compose_function(X10,X11,X12,X13,X14),X15,X16)))|(~(member(X15,X12))|~(member(X16,X14)))))&((apply(X10,esk4_7(X10,X11,X12,X13,X14,X15,X16),X16)|~(apply(compose_function(X10,X11,X12,X13,X14),X15,X16)))|(~(member(X15,X12))|~(member(X16,X14)))))),inference(distribute,[status(thm)],[26])).
% cnf(28,plain,(apply(X5,esk4_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)],[27])).
% cnf(30,plain,(member(esk4_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)],[27])).
% fof(32, negated_conjecture,?[X1]:?[X7]:?[X2]:?[X3]:(((maps(X7,X2,X3)&maps(X1,X3,X2))&identity(compose_function(X7,X1,X3,X2,X3),X3))&~(surjective(X7,X2,X3))),inference(fof_nnf,[status(thm)],[5])).
% fof(33, negated_conjecture,?[X8]:?[X9]:?[X10]:?[X11]:(((maps(X9,X10,X11)&maps(X8,X11,X10))&identity(compose_function(X9,X8,X11,X10,X11),X11))&~(surjective(X9,X10,X11))),inference(variable_rename,[status(thm)],[32])).
% fof(34, negated_conjecture,(((maps(esk6_0,esk7_0,esk8_0)&maps(esk5_0,esk8_0,esk7_0))&identity(compose_function(esk6_0,esk5_0,esk8_0,esk7_0,esk8_0),esk8_0))&~(surjective(esk6_0,esk7_0,esk8_0))),inference(skolemize,[status(esa)],[33])).
% cnf(35,negated_conjecture,(~surjective(esk6_0,esk7_0,esk8_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,negated_conjecture,(identity(compose_function(esk6_0,esk5_0,esk8_0,esk7_0,esk8_0),esk8_0)),inference(split_conjunct,[status(thm)],[34])).
% cnf(39,negated_conjecture,(apply(compose_function(esk6_0,esk5_0,esk8_0,esk7_0,esk8_0),X1,X1)|~member(X1,esk8_0)),inference(spm,[status(thm)],[22,36,theory(equality)])).
% cnf(41,plain,(surjective(X1,X2,X3)|~member(esk4_7(X1,X4,X5,X6,X7,X8,esk2_3(X1,X2,X3)),X2)|~apply(compose_function(X1,X4,X5,X6,X7),X8,esk2_3(X1,X2,X3))|~member(X8,X5)|~member(esk2_3(X1,X2,X3),X7)),inference(spm,[status(thm)],[14,28,theory(equality)])).
% cnf(55,plain,(surjective(X1,X2,X3)|~apply(compose_function(X1,X4,X5,X2,X6),X7,esk2_3(X1,X2,X3))|~member(esk2_3(X1,X2,X3),X6)|~member(X7,X5)),inference(spm,[status(thm)],[41,30,theory(equality)])).
% cnf(58,negated_conjecture,(surjective(esk6_0,esk7_0,X1)|~member(esk2_3(esk6_0,esk7_0,X1),esk8_0)),inference(spm,[status(thm)],[55,39,theory(equality)])).
% cnf(60,negated_conjecture,(surjective(esk6_0,esk7_0,esk8_0)),inference(spm,[status(thm)],[58,13,theory(equality)])).
% cnf(61,negated_conjecture,($false),inference(sr,[status(thm)],[60,35,theory(equality)])).
% cnf(62,negated_conjecture,($false),61,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 38
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 38
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 21
% # ...of the previous two non-trivial : 18
% # Contextual simplify-reflections : 0
% # Paramodulations : 21
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 66
% # Clause-clause subsumption calls (NU) : 28
% # Rec. Clause-clause subsumption calls : 10
% # 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: 36 leaves, 2.00+/-2.095 terms/leaf
% # Paramod-from index: 12 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 31 leaves, 1.26+/-0.566 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.17 WC
% FINAL PrfWatch: 0.12 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP9238/SET734+4.tptp
%
%------------------------------------------------------------------------------