TSTP Solution File: ALG201+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG201+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 : 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 : Tue Dec 28 21:08:21 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP22055/ALG201+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22055/ALG201+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22055/ALG201+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 22238
% 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)=>~(op1(X1,X1)=X1)),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,~(![X1]:(sorti2(X1)=>~(op2(X1,X1)=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))|~(op1(X1,X1)=X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X2]:(~(sorti1(X2))|~(op1(X2,X2)=X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(op1(X1,X1)!=X1|~sorti1(X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,?[X1]:(sorti2(X1)&op2(X1,X1)=X1),inference(fof_nnf,[status(thm)],[4])).
% fof(19, plain,?[X2]:(sorti2(X2)&op2(X2,X2)=X2),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,(sorti2(esk1_0)&op2(esk1_0,esk1_0)=esk1_0),inference(skolemize,[status(esa)],[19])).
% cnf(21,plain,(op2(esk1_0,esk1_0)=esk1_0),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(sorti2(esk1_0)),inference(split_conjunct,[status(thm)],[20])).
% fof(23, 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(24, 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)],[23])).
% fof(25, 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)],[24])).
% cnf(27,negated_conjecture,(sorti1(j(X1))|~sorti2(X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(29,negated_conjecture,(j(op2(X1,X2))=op1(j(X1),j(X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(38,negated_conjecture,(j(op2(X1,X1))!=j(X1)|~sorti1(j(X1))|~sorti2(X1)),inference(spm,[status(thm)],[17,29,theory(equality)])).
% cnf(54,negated_conjecture,(j(op2(X1,X1))!=j(X1)|~sorti2(X1)),inference(csr,[status(thm)],[38,27])).
% cnf(55,negated_conjecture,(~sorti2(esk1_0)),inference(spm,[status(thm)],[54,21,theory(equality)])).
% cnf(57,negated_conjecture,($false),inference(rw,[status(thm)],[55,22,theory(equality)])).
% cnf(58,negated_conjecture,($false),inference(cn,[status(thm)],[57,theory(equality)])).
% cnf(59,negated_conjecture,($false),58,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 15
% # ...of the previous two non-trivial : 10
% # Contextual simplify-reflections : 5
% # Paramodulations : 15
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 6
% # ...number of literals in the above : 26
% # Clause-clause subsumption calls (NU) : 14
% # Rec. Clause-clause subsumption calls : 11
% # 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: 24 leaves, 1.29+/-0.455 terms/leaf
% # Paramod-from index: 13 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 21 leaves, 1.24+/-0.426 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.30 WC
% FINAL PrfWatch: 0.11 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP22055/ALG201+1.tptp
%
%------------------------------------------------------------------------------