TSTP Solution File: ALG070+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : ALG070+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 : art01.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:47:27 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP4899/ALG070+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4899/ALG070+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4899/ALG070+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 4995
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(sorti2(X1)=>![X2]:(sorti2(X2)=>sorti2(op2(X1,X2)))),file('/tmp/SRASS.s.p', ax2)).
% fof(3, axiom,![X1]:(sorti1(X1)=>![X2]:(sorti1(X2)=>(~(op1(X1,X1)=X2)|op1(X1,X2)=X1))),file('/tmp/SRASS.s.p', ax3)).
% fof(4, axiom,~(![X1]:(sorti2(X1)=>![X2]:(sorti2(X2)=>(~(op2(X1,X1)=X2)|op2(X1,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(11, plain,![X1]:(~(sorti2(X1))|![X2]:(~(sorti2(X2))|sorti2(op2(X1,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(12, plain,![X3]:(~(sorti2(X3))|![X4]:(~(sorti2(X4))|sorti2(op2(X3,X4)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X3]:![X4]:((~(sorti2(X4))|sorti2(op2(X3,X4)))|~(sorti2(X3))),inference(shift_quantors,[status(thm)],[12])).
% cnf(14,plain,(sorti2(op2(X1,X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X1]:(~(sorti1(X1))|![X2]:(~(sorti1(X2))|(~(op1(X1,X1)=X2)|op1(X1,X2)=X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X3]:(~(sorti1(X3))|![X4]:(~(sorti1(X4))|(~(op1(X3,X3)=X4)|op1(X3,X4)=X3))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X3]:![X4]:((~(sorti1(X4))|(~(op1(X3,X3)=X4)|op1(X3,X4)=X3))|~(sorti1(X3))),inference(shift_quantors,[status(thm)],[16])).
% cnf(18,plain,(op1(X1,X2)=X1|~sorti1(X1)|op1(X1,X1)!=X2|~sorti1(X2)),inference(split_conjunct,[status(thm)],[17])).
% fof(19, plain,?[X1]:(sorti2(X1)&?[X2]:(sorti2(X2)&(op2(X1,X1)=X2&~(op2(X1,X2)=X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(20, plain,?[X3]:(sorti2(X3)&?[X4]:(sorti2(X4)&(op2(X3,X3)=X4&~(op2(X3,X4)=X3)))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,(sorti2(esk1_0)&(sorti2(esk2_0)&(op2(esk1_0,esk1_0)=esk2_0&~(op2(esk1_0,esk2_0)=esk1_0)))),inference(skolemize,[status(esa)],[20])).
% cnf(22,plain,(op2(esk1_0,esk2_0)!=esk1_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(op2(esk1_0,esk1_0)=esk2_0),inference(split_conjunct,[status(thm)],[21])).
% cnf(24,plain,(sorti2(esk2_0)),inference(split_conjunct,[status(thm)],[21])).
% cnf(25,plain,(sorti2(esk1_0)),inference(split_conjunct,[status(thm)],[21])).
% fof(26, 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(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(30,negated_conjecture,(sorti1(j(X1))|~sorti2(X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(32,negated_conjecture,(j(op2(X1,X2))=op1(j(X1),j(X2))|~sorti2(X1)|~sorti2(X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(33,negated_conjecture,(h(j(X1))=X1|~sorti2(X1)),inference(split_conjunct,[status(thm)],[28])).
% cnf(35,negated_conjecture,(sorti1(j(esk2_0))),inference(spm,[status(thm)],[30,24,theory(equality)])).
% cnf(36,negated_conjecture,(sorti1(j(esk1_0))),inference(spm,[status(thm)],[30,25,theory(equality)])).
% cnf(38,negated_conjecture,(h(j(esk1_0))=esk1_0),inference(spm,[status(thm)],[33,25,theory(equality)])).
% cnf(39,plain,(sorti2(op2(X1,esk2_0))|~sorti2(X1)),inference(spm,[status(thm)],[14,24,theory(equality)])).
% cnf(41,plain,(op1(X1,op1(X1,X1))=X1|~sorti1(op1(X1,X1))|~sorti1(X1)),inference(er,[status(thm)],[18,theory(equality)])).
% cnf(42,negated_conjecture,(op1(j(X1),j(esk2_0))=j(op2(X1,esk2_0))|~sorti2(X1)),inference(spm,[status(thm)],[32,24,theory(equality)])).
% cnf(43,negated_conjecture,(op1(j(X1),j(esk1_0))=j(op2(X1,esk1_0))|~sorti2(X1)),inference(spm,[status(thm)],[32,25,theory(equality)])).
% cnf(45,plain,(sorti2(op2(esk1_0,esk2_0))),inference(spm,[status(thm)],[39,25,theory(equality)])).
% cnf(68,negated_conjecture,(h(j(op2(esk1_0,esk2_0)))=op2(esk1_0,esk2_0)),inference(spm,[status(thm)],[33,45,theory(equality)])).
% cnf(174,negated_conjecture,(op1(j(esk1_0),j(esk2_0))=j(op2(esk1_0,esk2_0))),inference(spm,[status(thm)],[42,25,theory(equality)])).
% cnf(179,negated_conjecture,(op1(j(esk1_0),j(esk1_0))=j(op2(esk1_0,esk1_0))),inference(spm,[status(thm)],[43,25,theory(equality)])).
% cnf(183,negated_conjecture,(op1(j(esk1_0),j(esk1_0))=j(esk2_0)),inference(rw,[status(thm)],[179,23,theory(equality)])).
% cnf(508,negated_conjecture,(op1(j(esk1_0),j(esk2_0))=j(esk1_0)|~sorti1(j(esk2_0))|~sorti1(j(esk1_0))),inference(spm,[status(thm)],[41,183,theory(equality)])).
% cnf(513,negated_conjecture,(j(op2(esk1_0,esk2_0))=j(esk1_0)|~sorti1(j(esk2_0))|~sorti1(j(esk1_0))),inference(rw,[status(thm)],[508,174,theory(equality)])).
% cnf(514,negated_conjecture,(j(op2(esk1_0,esk2_0))=j(esk1_0)|$false|~sorti1(j(esk1_0))),inference(rw,[status(thm)],[513,35,theory(equality)])).
% cnf(515,negated_conjecture,(j(op2(esk1_0,esk2_0))=j(esk1_0)|$false|$false),inference(rw,[status(thm)],[514,36,theory(equality)])).
% cnf(516,negated_conjecture,(j(op2(esk1_0,esk2_0))=j(esk1_0)),inference(cn,[status(thm)],[515,theory(equality)])).
% cnf(519,negated_conjecture,(esk1_0=op2(esk1_0,esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[68,516,theory(equality)]),38,theory(equality)])).
% cnf(520,negated_conjecture,($false),inference(sr,[status(thm)],[519,22,theory(equality)])).
% cnf(521,negated_conjecture,($false),520,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 80
% # ...of these trivial : 7
% # ...subsumed : 0
% # ...remaining for further processing: 73
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 12
% # Generated clauses : 450
% # ...of the previous two non-trivial : 455
% # Contextual simplify-reflections : 0
% # Paramodulations : 449
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 28
% # Current number of unprocessed clauses: 303
% # ...number of literals in the above : 340
% # Clause-clause subsumption calls (NU) : 59
% # Rec. Clause-clause subsumption calls : 59
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 81 leaves, 1.42+/-1.164 terms/leaf
% # Paramod-from index: 21 leaves, 1.52+/-0.794 terms/leaf
% # Paramod-into index: 48 leaves, 1.27+/-0.603 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.005 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP4899/ALG070+1.tptp
%
%------------------------------------------------------------------------------