TSTP Solution File: COM016+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM016+4 : TPTP v5.0.0. Released v4.0.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 22:41:48 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/SystemOnTPTP14954/COM016+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14954/COM016+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14954/COM016+4.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 15050
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.039 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,((aElement0(xa)&aElement0(xb))&aElement0(xc)),file('/tmp/SRASS.s.p', m__731)).
% fof(12, axiom,((((aReductOfIn0(xb,xa,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtplgtdt0(X1,xR,xb)))&sdtmndtplgtdt0(xa,xR,xb))&(aReductOfIn0(xc,xa,xR)|?[X1]:((aElement0(X1)&aReductOfIn0(X1,xa,xR))&sdtmndtplgtdt0(X1,xR,xc))))&sdtmndtplgtdt0(xa,xR,xc)),file('/tmp/SRASS.s.p', m__731_02)).
% fof(20, conjecture,?[X1]:((aElement0(X1)&aReductOfIn0(X1,xa,xR))&((((X1=xb|aReductOfIn0(xb,X1,xR))|?[X2]:((aElement0(X2)&aReductOfIn0(X2,X1,xR))&sdtmndtplgtdt0(X2,xR,xb)))|sdtmndtplgtdt0(X1,xR,xb))|sdtmndtasgtdt0(X1,xR,xb))),file('/tmp/SRASS.s.p', m__)).
% fof(21, negated_conjecture,~(?[X1]:((aElement0(X1)&aReductOfIn0(X1,xa,xR))&((((X1=xb|aReductOfIn0(xb,X1,xR))|?[X2]:((aElement0(X2)&aReductOfIn0(X2,X1,xR))&sdtmndtplgtdt0(X2,xR,xb)))|sdtmndtplgtdt0(X1,xR,xb))|sdtmndtasgtdt0(X1,xR,xb)))),inference(assume_negation,[status(cth)],[20])).
% cnf(99,plain,(aElement0(xb)),inference(split_conjunct,[status(thm)],[10])).
% fof(381, plain,((((aReductOfIn0(xb,xa,xR)|?[X2]:((aElement0(X2)&aReductOfIn0(X2,xa,xR))&sdtmndtplgtdt0(X2,xR,xb)))&sdtmndtplgtdt0(xa,xR,xb))&(aReductOfIn0(xc,xa,xR)|?[X3]:((aElement0(X3)&aReductOfIn0(X3,xa,xR))&sdtmndtplgtdt0(X3,xR,xc))))&sdtmndtplgtdt0(xa,xR,xc)),inference(variable_rename,[status(thm)],[12])).
% fof(382, plain,((((aReductOfIn0(xb,xa,xR)|((aElement0(esk14_0)&aReductOfIn0(esk14_0,xa,xR))&sdtmndtplgtdt0(esk14_0,xR,xb)))&sdtmndtplgtdt0(xa,xR,xb))&(aReductOfIn0(xc,xa,xR)|((aElement0(esk15_0)&aReductOfIn0(esk15_0,xa,xR))&sdtmndtplgtdt0(esk15_0,xR,xc))))&sdtmndtplgtdt0(xa,xR,xc)),inference(skolemize,[status(esa)],[381])).
% fof(383, plain,((((((aElement0(esk14_0)|aReductOfIn0(xb,xa,xR))&(aReductOfIn0(esk14_0,xa,xR)|aReductOfIn0(xb,xa,xR)))&(sdtmndtplgtdt0(esk14_0,xR,xb)|aReductOfIn0(xb,xa,xR)))&sdtmndtplgtdt0(xa,xR,xb))&(((aElement0(esk15_0)|aReductOfIn0(xc,xa,xR))&(aReductOfIn0(esk15_0,xa,xR)|aReductOfIn0(xc,xa,xR)))&(sdtmndtplgtdt0(esk15_0,xR,xc)|aReductOfIn0(xc,xa,xR))))&sdtmndtplgtdt0(xa,xR,xc)),inference(distribute,[status(thm)],[382])).
% cnf(389,plain,(aReductOfIn0(xb,xa,xR)|sdtmndtplgtdt0(esk14_0,xR,xb)),inference(split_conjunct,[status(thm)],[383])).
% cnf(390,plain,(aReductOfIn0(xb,xa,xR)|aReductOfIn0(esk14_0,xa,xR)),inference(split_conjunct,[status(thm)],[383])).
% cnf(391,plain,(aReductOfIn0(xb,xa,xR)|aElement0(esk14_0)),inference(split_conjunct,[status(thm)],[383])).
% fof(428, negated_conjecture,![X1]:((~(aElement0(X1))|~(aReductOfIn0(X1,xa,xR)))|((((~(X1=xb)&~(aReductOfIn0(xb,X1,xR)))&![X2]:((~(aElement0(X2))|~(aReductOfIn0(X2,X1,xR)))|~(sdtmndtplgtdt0(X2,xR,xb))))&~(sdtmndtplgtdt0(X1,xR,xb)))&~(sdtmndtasgtdt0(X1,xR,xb)))),inference(fof_nnf,[status(thm)],[21])).
% fof(429, negated_conjecture,![X3]:((~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR)))|((((~(X3=xb)&~(aReductOfIn0(xb,X3,xR)))&![X4]:((~(aElement0(X4))|~(aReductOfIn0(X4,X3,xR)))|~(sdtmndtplgtdt0(X4,xR,xb))))&~(sdtmndtplgtdt0(X3,xR,xb)))&~(sdtmndtasgtdt0(X3,xR,xb)))),inference(variable_rename,[status(thm)],[428])).
% fof(430, negated_conjecture,![X3]:![X4]:((((((~(aElement0(X4))|~(aReductOfIn0(X4,X3,xR)))|~(sdtmndtplgtdt0(X4,xR,xb)))&(~(X3=xb)&~(aReductOfIn0(xb,X3,xR))))&~(sdtmndtplgtdt0(X3,xR,xb)))&~(sdtmndtasgtdt0(X3,xR,xb)))|(~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR)))),inference(shift_quantors,[status(thm)],[429])).
% fof(431, negated_conjecture,![X3]:![X4]:((((((~(aElement0(X4))|~(aReductOfIn0(X4,X3,xR)))|~(sdtmndtplgtdt0(X4,xR,xb)))|(~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR))))&((~(X3=xb)|(~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR))))&(~(aReductOfIn0(xb,X3,xR))|(~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR))))))&(~(sdtmndtplgtdt0(X3,xR,xb))|(~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR)))))&(~(sdtmndtasgtdt0(X3,xR,xb))|(~(aElement0(X3))|~(aReductOfIn0(X3,xa,xR))))),inference(distribute,[status(thm)],[430])).
% cnf(433,negated_conjecture,(~aReductOfIn0(X1,xa,xR)|~aElement0(X1)|~sdtmndtplgtdt0(X1,xR,xb)),inference(split_conjunct,[status(thm)],[431])).
% cnf(435,negated_conjecture,(~aReductOfIn0(X1,xa,xR)|~aElement0(X1)|X1!=xb),inference(split_conjunct,[status(thm)],[431])).
% cnf(437,negated_conjecture,(~aReductOfIn0(xb,xa,xR)|~aElement0(xb)),inference(er,[status(thm)],[435,theory(equality)])).
% cnf(438,negated_conjecture,(~aReductOfIn0(xb,xa,xR)|$false),inference(rw,[status(thm)],[437,99,theory(equality)])).
% cnf(439,negated_conjecture,(~aReductOfIn0(xb,xa,xR)),inference(cn,[status(thm)],[438,theory(equality)])).
% cnf(1725,plain,(aElement0(esk14_0)),inference(sr,[status(thm)],[391,439,theory(equality)])).
% cnf(1726,plain,(aReductOfIn0(esk14_0,xa,xR)),inference(sr,[status(thm)],[390,439,theory(equality)])).
% cnf(1727,plain,(sdtmndtplgtdt0(esk14_0,xR,xb)),inference(sr,[status(thm)],[389,439,theory(equality)])).
% cnf(1888,negated_conjecture,(~aReductOfIn0(esk14_0,xa,xR)|~aElement0(esk14_0)),inference(spm,[status(thm)],[433,1727,theory(equality)])).
% cnf(1919,negated_conjecture,($false|~aElement0(esk14_0)),inference(rw,[status(thm)],[1888,1726,theory(equality)])).
% cnf(1920,negated_conjecture,($false|$false),inference(rw,[status(thm)],[1919,1725,theory(equality)])).
% cnf(1921,negated_conjecture,($false),inference(cn,[status(thm)],[1920,theory(equality)])).
% cnf(1922,negated_conjecture,($false),1921,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 359
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 357
% # Other redundant clauses eliminated : 111
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 507
% # ...of the previous two non-trivial : 454
% # Contextual simplify-reflections : 8
% # Paramodulations : 403
% # Factorizations : 0
% # Equation resolutions : 112
% # Current number of processed clauses: 254
% # Positive orientable unit clauses: 16
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 236
% # Current number of unprocessed clauses: 396
% # ...number of literals in the above : 2390
% # Clause-clause subsumption calls (NU) : 9307
% # Rec. Clause-clause subsumption calls : 3332
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 99 leaves, 1.80+/-2.474 terms/leaf
% # Paramod-from index: 28 leaves, 1.18+/-0.538 terms/leaf
% # Paramod-into index: 56 leaves, 1.41+/-1.265 terms/leaf
% # -------------------------------------------------
% # User time : 0.123 s
% # System time : 0.004 s
% # Total time : 0.127 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP14954/COM016+4.tptp
%
%------------------------------------------------------------------------------