TSTP Solution File: ALG177+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG177+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 : art02.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 21:01:04 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/SystemOnTPTP13071/ALG177+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP13071/ALG177+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13071/ALG177+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 13167
% 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(3, axiom,?[X1]:(sorti1(X1)&![X2]:(sorti1(X2)=>~(op1(X1,X2)=X2))),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,~(?[X1]:(sorti2(X1)&![X2]:(sorti2(X2)=>~(op2(X1,X2)=X2)))),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)=X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,?[X3]:(sorti1(X3)&![X4]:(~(sorti1(X4))|~(op1(X3,X4)=X4))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,(sorti1(esk1_0)&![X4]:(~(sorti1(X4))|~(op1(esk1_0,X4)=X4))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:((~(sorti1(X4))|~(op1(esk1_0,X4)=X4))&sorti1(esk1_0)),inference(shift_quantors,[status(thm)],[17])).
% cnf(19,plain,(sorti1(esk1_0)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(op1(esk1_0,X1)!=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(21, plain,![X1]:(~(sorti2(X1))|?[X2]:(sorti2(X2)&op2(X1,X2)=X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X3]:(~(sorti2(X3))|?[X4]:(sorti2(X4)&op2(X3,X4)=X4)),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X3]:(~(sorti2(X3))|(sorti2(esk2_1(X3))&op2(X3,esk2_1(X3))=esk2_1(X3))),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X3]:((sorti2(esk2_1(X3))|~(sorti2(X3)))&(op2(X3,esk2_1(X3))=esk2_1(X3)|~(sorti2(X3)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(op2(X1,esk2_1(X1))=esk2_1(X1)|~sorti2(X1)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(sorti2(esk2_1(X1))|~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(33,negated_conjecture,(j(op2(X1,X2))=op1(j(X1),j(X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[29])).
% cnf(35,negated_conjecture,(j(h(X1))=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[29])).
% cnf(41,negated_conjecture,(op1(X1,j(X2))=j(op2(h(X1),X2))|~sorti2(X2)|~sorti2(h(X1))|~sorti1(X1)),inference(spm,[status(thm)],[33,35,theory(equality)])).
% cnf(80,negated_conjecture,(j(op2(h(X1),X2))=op1(X1,j(X2))|~sorti2(X2)|~sorti1(X1)),inference(csr,[status(thm)],[41,30])).
% cnf(90,negated_conjecture,(j(esk2_1(h(X1)))=op1(X1,j(esk2_1(h(X1))))|~sorti2(esk2_1(h(X1)))|~sorti1(X1)|~sorti2(h(X1))),inference(spm,[status(thm)],[80,25,theory(equality)])).
% cnf(623,negated_conjecture,(op1(X1,j(esk2_1(h(X1))))=j(esk2_1(h(X1)))|~sorti2(esk2_1(h(X1)))|~sorti1(X1)),inference(csr,[status(thm)],[90,30])).
% cnf(624,negated_conjecture,(~sorti1(j(esk2_1(h(esk1_0))))|~sorti2(esk2_1(h(esk1_0)))|~sorti1(esk1_0)),inference(spm,[status(thm)],[20,623,theory(equality)])).
% cnf(659,negated_conjecture,(~sorti1(j(esk2_1(h(esk1_0))))|~sorti2(esk2_1(h(esk1_0)))|$false),inference(rw,[status(thm)],[624,19,theory(equality)])).
% cnf(660,negated_conjecture,(~sorti1(j(esk2_1(h(esk1_0))))|~sorti2(esk2_1(h(esk1_0)))),inference(cn,[status(thm)],[659,theory(equality)])).
% cnf(663,negated_conjecture,(~sorti2(esk2_1(h(esk1_0)))),inference(csr,[status(thm)],[660,31])).
% cnf(664,negated_conjecture,(~sorti2(h(esk1_0))),inference(spm,[status(thm)],[663,26,theory(equality)])).
% cnf(665,negated_conjecture,(~sorti1(esk1_0)),inference(spm,[status(thm)],[664,30,theory(equality)])).
% cnf(666,negated_conjecture,($false),inference(rw,[status(thm)],[665,19,theory(equality)])).
% cnf(667,negated_conjecture,($false),inference(cn,[status(thm)],[666,theory(equality)])).
% cnf(668,negated_conjecture,($false),667,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 164
% # ...of these trivial : 0
% # ...subsumed : 90
% # ...remaining for further processing: 74
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 491
% # ...of the previous two non-trivial : 465
% # Contextual simplify-reflections : 127
% # Paramodulations : 491
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 314
% # ...number of literals in the above : 1620
% # Clause-clause subsumption calls (NU) : 1651
% # Rec. Clause-clause subsumption calls : 1318
% # 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: 72 leaves, 1.69+/-1.319 terms/leaf
% # Paramod-from index: 33 leaves, 1.67+/-1.511 terms/leaf
% # Paramod-into index: 63 leaves, 1.62+/-1.290 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.003 s
% # Total time : 0.032 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/SystemOnTPTP13071/ALG177+1.tptp
%
%------------------------------------------------------------------------------