TSTP Solution File: ALG019+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG019+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:40:12 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP32065/ALG019+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32065/ALG019+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32065/ALG019+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 32161
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(sorti1(X1)=>![X2]:(sorti1(X2)=>sorti1(op1(X1,X2)))),file('/tmp/SRASS.s.p', ax1)).
% fof(3, axiom,~(?[X1]:(sorti1(X1)&![X2]:(sorti1(X2)=>op1(X2,X2)=X1))),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,~(~(?[X1]:(sorti2(X1)&![X2]:(sorti2(X2)=>op2(X2,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(7, plain,![X1]:(~(sorti1(X1))|![X2]:(~(sorti1(X2))|sorti1(op1(X1,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,![X3]:(~(sorti1(X3))|![X4]:(~(sorti1(X4))|sorti1(op1(X3,X4)))),inference(variable_rename,[status(thm)],[7])).
% fof(9, plain,![X3]:![X4]:((~(sorti1(X4))|sorti1(op1(X3,X4)))|~(sorti1(X3))),inference(shift_quantors,[status(thm)],[8])).
% cnf(10,plain,(sorti1(op1(X1,X2))|~sorti1(X1)|~sorti1(X2)),inference(split_conjunct,[status(thm)],[9])).
% fof(15, plain,![X1]:(~(sorti1(X1))|?[X2]:(sorti1(X2)&~(op1(X2,X2)=X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X3]:(~(sorti1(X3))|?[X4]:(sorti1(X4)&~(op1(X4,X4)=X3))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X3]:(~(sorti1(X3))|(sorti1(esk1_1(X3))&~(op1(esk1_1(X3),esk1_1(X3))=X3))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X3]:((sorti1(esk1_1(X3))|~(sorti1(X3)))&(~(op1(esk1_1(X3),esk1_1(X3))=X3)|~(sorti1(X3)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(~sorti1(X1)|op1(esk1_1(X1),esk1_1(X1))!=X1),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(sorti1(esk1_1(X1))|~sorti1(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,?[X1]:(sorti2(X1)&![X2]:(~(sorti2(X2))|op2(X2,X2)=X1)),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,?[X3]:(sorti2(X3)&![X4]:(~(sorti2(X4))|op2(X4,X4)=X3)),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,(sorti2(esk2_0)&![X4]:(~(sorti2(X4))|op2(X4,X4)=esk2_0)),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X4]:((~(sorti2(X4))|op2(X4,X4)=esk2_0)&sorti2(esk2_0)),inference(shift_quantors,[status(thm)],[23])).
% cnf(25,plain,(sorti2(esk2_0)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(op2(X1,X1)=esk2_0|~sorti2(X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(27, 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(28, 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)],[27])).
% fof(29, 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)],[28])).
% cnf(30,negated_conjecture,(sorti2(h(X1))|~sorti1(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(31,negated_conjecture,(sorti1(j(X1))|~sorti2(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,negated_conjecture,(h(op1(X1,X2))=op2(h(X1),h(X2))|~sorti1(X1)|~sorti1(X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(35,negated_conjecture,(j(h(X1))=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(43,negated_conjecture,(h(op1(X1,X1))=esk2_0|~sorti2(h(X1))|~sorti1(X1)),inference(spm,[status(thm)],[26,32,theory(equality)])).
% cnf(47,negated_conjecture,(h(op1(X1,X1))=esk2_0|~sorti1(X1)),inference(csr,[status(thm)],[43,30])).
% cnf(49,negated_conjecture,(j(esk2_0)=op1(X1,X1)|~sorti1(op1(X1,X1))|~sorti1(X1)),inference(spm,[status(thm)],[35,47,theory(equality)])).
% cnf(55,negated_conjecture,(op1(X1,X1)=j(esk2_0)|~sorti1(X1)),inference(spm,[status(thm)],[49,10,theory(equality)])).
% cnf(60,negated_conjecture,(j(esk2_0)!=X1|~sorti1(X1)|~sorti1(esk1_1(X1))),inference(spm,[status(thm)],[19,55,theory(equality)])).
% cnf(64,negated_conjecture,(j(esk2_0)!=X1|~sorti1(X1)),inference(csr,[status(thm)],[60,20])).
% cnf(65,negated_conjecture,(~sorti1(j(esk2_0))),inference(er,[status(thm)],[64,theory(equality)])).
% cnf(66,negated_conjecture,(~sorti2(esk2_0)),inference(spm,[status(thm)],[65,31,theory(equality)])).
% cnf(67,negated_conjecture,($false),inference(rw,[status(thm)],[66,25,theory(equality)])).
% cnf(68,negated_conjecture,($false),inference(cn,[status(thm)],[67,theory(equality)])).
% cnf(69,negated_conjecture,($false),68,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 25
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections : 4
% # Paramodulations : 24
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 15
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 46
% # Clause-clause subsumption calls (NU) : 8
% # Rec. Clause-clause subsumption calls : 8
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 25 leaves, 1.28+/-0.449 terms/leaf
% # Paramod-from index: 14 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 22 leaves, 1.18+/-0.386 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.002 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP32065/ALG019+1.tptp
%
%------------------------------------------------------------------------------