%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG030+1 : TPTP v5.0.0. Released v2.7.0.
% 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 : Tue Dec 28 20:42:14 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/SystemOnTPTP1091/ALG030+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP1091/ALG030+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1091/ALG030+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 1188
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,~(![X1]:(sorti1(X1)=>![X2]:(sorti1(X2)=>op1(X1,X2)=op1(X2,X1)))),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,~(~(![X1]:(sorti2(X1)=>![X2]:(sorti2(X2)=>op2(X1,X2)=op2(X2,X1))))),file('/tmp/SRASS.s.p', ax4)).
% fof(5, conjecture,((![X1]:(sorti1(X1)=>sorti2(h(X1)))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(sorti1(X4)=>h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(sorti2(X5)=>![X6]:(sorti2(X6)=>j(op2(X5,X6))=op1(j(X5),j(X6)))))&![X7]:(sorti2(X7)=>h(j(X7))=X7))&![X8]:(sorti1(X8)=>j(h(X8))=X8)))),file('/tmp/SRASS.s.p', co1)).
% fof(6, negated_conjecture,~(((![X1]:(sorti1(X1)=>sorti2(h(X1)))&![X2]:(sorti2(X2)=>sorti1(j(X2))))=>~((((![X3]:(sorti1(X3)=>![X4]:(sorti1(X4)=>h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(sorti2(X5)=>![X6]:(sorti2(X6)=>j(op2(X5,X6))=op1(j(X5),j(X6)))))&![X7]:(sorti2(X7)=>h(j(X7))=X7))&![X8]:(sorti1(X8)=>j(h(X8))=X8))))),inference(assume_negation,[status(cth)],[5])).
% fof(15, plain,?[X1]:(sorti1(X1)&?[X2]:(sorti1(X2)&~(op1(X1,X2)=op1(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,?[X3]:(sorti1(X3)&?[X4]:(sorti1(X4)&~(op1(X3,X4)=op1(X4,X3)))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,(sorti1(esk1_0)&(sorti1(esk2_0)&~(op1(esk1_0,esk2_0)=op1(esk2_0,esk1_0)))),inference(skolemize,[status(esa)],[16])).
% cnf(18,plain,(op1(esk1_0,esk2_0)!=op1(esk2_0,esk1_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,plain,(sorti1(esk2_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(20,plain,(sorti1(esk1_0)),inference(split_conjunct,[status(thm)],[17])).
% fof(21, plain,![X1]:(~(sorti2(X1))|![X2]:(~(sorti2(X2))|op2(X1,X2)=op2(X2,X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X3]:(~(sorti2(X3))|![X4]:(~(sorti2(X4))|op2(X3,X4)=op2(X4,X3))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:((~(sorti2(X4))|op2(X3,X4)=op2(X4,X3))|~(sorti2(X3))),inference(shift_quantors,[status(thm)],[22])).
% cnf(24,plain,(op2(X1,X2)=op2(X2,X1)|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, negated_conjecture,((![X1]:(~(sorti1(X1))|sorti2(h(X1)))&![X2]:(~(sorti2(X2))|sorti1(j(X2))))&(((![X3]:(~(sorti1(X3))|![X4]:(~(sorti1(X4))|h(op1(X3,X4))=op2(h(X3),h(X4))))&![X5]:(~(sorti2(X5))|![X6]:(~(sorti2(X6))|j(op2(X5,X6))=op1(j(X5),j(X6)))))&![X7]:(~(sorti2(X7))|h(j(X7))=X7))&![X8]:(~(sorti1(X8))|j(h(X8))=X8))),inference(fof_nnf,[status(thm)],[6])).
% fof(26, negated_conjecture,((![X9]:(~(sorti1(X9))|sorti2(h(X9)))&![X10]:(~(sorti2(X10))|sorti1(j(X10))))&(((![X11]:(~(sorti1(X11))|![X12]:(~(sorti1(X12))|h(op1(X11,X12))=op2(h(X11),h(X12))))&![X13]:(~(sorti2(X13))|![X14]:(~(sorti2(X14))|j(op2(X13,X14))=op1(j(X13),j(X14)))))&![X15]:(~(sorti2(X15))|h(j(X15))=X15))&![X16]:(~(sorti1(X16))|j(h(X16))=X16))),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:(((~(sorti1(X16))|j(h(X16))=X16)&((~(sorti2(X15))|h(j(X15))=X15)&(((~(sorti2(X14))|j(op2(X13,X14))=op1(j(X13),j(X14)))|~(sorti2(X13)))&((~(sorti1(X12))|h(op1(X11,X12))=op2(h(X11),h(X12)))|~(sorti1(X11))))))&((~(sorti2(X10))|sorti1(j(X10)))&(~(sorti1(X9))|sorti2(h(X9))))),inference(shift_quantors,[status(thm)],[26])).
% cnf(28,negated_conjecture,(sorti2(h(X1))|~sorti1(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,negated_conjecture,(h(op1(X1,X2))=op2(h(X1),h(X2))|~sorti1(X1)|~sorti1(X2)),inference(split_conjunct,[status(thm)],[27])).
% cnf(31,negated_conjecture,(j(op2(X1,X2))=op1(j(X1),j(X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[27])).
% cnf(33,negated_conjecture,(j(h(X1))=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[27])).
% cnf(39,negated_conjecture,(op1(j(X1),X2)=j(op2(X1,h(X2)))|~sorti2(h(X2))|~sorti2(X1)|~sorti1(X2)),inference(spm,[status(thm)],[31,33,theory(equality)])).
% cnf(41,negated_conjecture,(h(op1(X1,X2))=op2(h(X2),h(X1))|~sorti2(h(X2))|~sorti2(h(X1))|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[24,30,theory(equality)])).
% cnf(51,negated_conjecture,(j(op2(X1,h(X2)))=op1(j(X1),X2)|~sorti2(X1)|~sorti1(X2)),inference(csr,[status(thm)],[39,28])).
% cnf(58,negated_conjecture,(j(h(op1(X1,X2)))=op1(j(h(X1)),X2)|~sorti2(h(X1))|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[51,30,theory(equality)])).
% cnf(103,negated_conjecture,(op2(h(X2),h(X1))=h(op1(X1,X2))|~sorti2(h(X2))|~sorti1(X2)|~sorti1(X1)),inference(csr,[status(thm)],[41,28])).
% cnf(104,negated_conjecture,(op2(h(X2),h(X1))=h(op1(X1,X2))|~sorti1(X2)|~sorti1(X1)),inference(csr,[status(thm)],[103,28])).
% cnf(112,negated_conjecture,(h(op1(X2,X1))=h(op1(X1,X2))|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[30,104,theory(equality)])).
% cnf(375,negated_conjecture,(op1(j(h(X1)),X2)=j(h(op1(X1,X2)))|~sorti1(X2)|~sorti1(X1)),inference(csr,[status(thm)],[58,28])).
% cnf(398,negated_conjecture,(op1(X1,X2)=j(h(op1(X1,X2)))|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[375,33,theory(equality)])).
% cnf(428,negated_conjecture,(j(h(op1(X2,X1)))=op1(X1,X2)|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[398,112,theory(equality)])).
% cnf(448,negated_conjecture,(op1(X2,X1)=op1(X1,X2)|~sorti1(X2)|~sorti1(X1)),inference(spm,[status(thm)],[398,428,theory(equality)])).
% cnf(462,negated_conjecture,(~sorti1(esk2_0)|~sorti1(esk1_0)),inference(spm,[status(thm)],[18,448,theory(equality)])).
% cnf(498,negated_conjecture,($false|~sorti1(esk1_0)),inference(rw,[status(thm)],[462,19,theory(equality)])).
% cnf(499,negated_conjecture,($false|$false),inference(rw,[status(thm)],[498,20,theory(equality)])).
% cnf(500,negated_conjecture,($false),inference(cn,[status(thm)],[499,theory(equality)])).
% cnf(501,negated_conjecture,($false),500,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 125
% # ...of these trivial : 0
% # ...subsumed : 75
% # ...remaining for further processing: 50
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 381
% # ...of the previous two non-trivial : 341
% # Contextual simplify-reflections : 83
% # Paramodulations : 381
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 240
% # ...number of literals in the above : 1173
% # Clause-clause subsumption calls (NU) : 871
% # Rec. Clause-clause subsumption calls : 748
% # 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: 48 leaves, 1.40+/-0.729 terms/leaf
% # Paramod-from index: 31 leaves, 1.23+/-0.551 terms/leaf
% # Paramod-into index: 40 leaves, 1.30+/-0.600 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.003 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP1091/ALG030+1.tptp
%
%------------------------------------------------------------------------------