TSTP Solution File: NUM578+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM578+1 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 20:16:18 EST 2010
% Result : Theorem 1.37s
% Output : Solution 1.37s
% 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/SystemOnTPTP32150/NUM578+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32150/NUM578+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32150/NUM578+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 32246
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(40, axiom,(aElementOf0(xi,szNzAzT0)&aElementOf0(xj,szNzAzT0)),file('/tmp/SRASS.s.p', m__3856)).
% fof(41, axiom,(~(xi=xj)=>(sdtlseqdt0(szszuzczcdt0(xj),xi)|sdtlseqdt0(szszuzczcdt0(xi),xj))),file('/tmp/SRASS.s.p', m__3856_02)).
% fof(86, conjecture,(![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(szszuzczcdt0(X1),X2)=>(aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&~(szmzizndt0(sdtlpdtrp0(xN,X2))=szmzizndt0(sdtlpdtrp0(xN,X1))))))=>(~(xi=xj)=>~(szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj))))),file('/tmp/SRASS.s.p', m__)).
% fof(87, negated_conjecture,~((![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(szszuzczcdt0(X1),X2)=>(aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&~(szmzizndt0(sdtlpdtrp0(xN,X2))=szmzizndt0(sdtlpdtrp0(xN,X1))))))=>(~(xi=xj)=>~(szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj)))))),inference(assume_negation,[status(cth)],[86])).
% cnf(256,plain,(aElementOf0(xj,szNzAzT0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(257,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[40])).
% fof(258, plain,(xi=xj|(sdtlseqdt0(szszuzczcdt0(xj),xi)|sdtlseqdt0(szszuzczcdt0(xi),xj))),inference(fof_nnf,[status(thm)],[41])).
% cnf(259,plain,(sdtlseqdt0(szszuzczcdt0(xi),xj)|sdtlseqdt0(szszuzczcdt0(xj),xi)|xi=xj),inference(split_conjunct,[status(thm)],[258])).
% fof(483, negated_conjecture,(![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(sdtlseqdt0(szszuzczcdt0(X1),X2))|(aSubsetOf0(sdtlpdtrp0(xN,X2),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))))&~(szmzizndt0(sdtlpdtrp0(xN,X2))=szmzizndt0(sdtlpdtrp0(xN,X1))))))&(~(xi=xj)&szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj)))),inference(fof_nnf,[status(thm)],[87])).
% fof(484, negated_conjecture,(![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(sdtlseqdt0(szszuzczcdt0(X3),X4))|(aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))&~(szmzizndt0(sdtlpdtrp0(xN,X4))=szmzizndt0(sdtlpdtrp0(xN,X3))))))&(~(xi=xj)&szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj)))),inference(variable_rename,[status(thm)],[483])).
% fof(485, negated_conjecture,![X3]:![X4]:(((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(sdtlseqdt0(szszuzczcdt0(X3),X4))|(aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))&~(szmzizndt0(sdtlpdtrp0(xN,X4))=szmzizndt0(sdtlpdtrp0(xN,X3))))))&(~(xi=xj)&szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj)))),inference(shift_quantors,[status(thm)],[484])).
% fof(486, negated_conjecture,![X3]:![X4]:((((aSubsetOf0(sdtlpdtrp0(xN,X4),sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))))|~(sdtlseqdt0(szszuzczcdt0(X3),X4)))|(~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0))))&((~(szmzizndt0(sdtlpdtrp0(xN,X4))=szmzizndt0(sdtlpdtrp0(xN,X3)))|~(sdtlseqdt0(szszuzczcdt0(X3),X4)))|(~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))))&(~(xi=xj)&szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj)))),inference(distribute,[status(thm)],[485])).
% cnf(487,negated_conjecture,(szmzizndt0(sdtlpdtrp0(xN,xi))=szmzizndt0(sdtlpdtrp0(xN,xj))),inference(split_conjunct,[status(thm)],[486])).
% cnf(488,negated_conjecture,(xi!=xj),inference(split_conjunct,[status(thm)],[486])).
% cnf(489,negated_conjecture,(~aElementOf0(X1,szNzAzT0)|~aElementOf0(X2,szNzAzT0)|~sdtlseqdt0(szszuzczcdt0(X2),X1)|szmzizndt0(sdtlpdtrp0(xN,X1))!=szmzizndt0(sdtlpdtrp0(xN,X2))),inference(split_conjunct,[status(thm)],[486])).
% cnf(491,plain,(sdtlseqdt0(szszuzczcdt0(xi),xj)|sdtlseqdt0(szszuzczcdt0(xj),xi)),inference(sr,[status(thm)],[259,488,theory(equality)])).
% cnf(991,negated_conjecture,(sdtlseqdt0(szszuzczcdt0(xi),xj)|szmzizndt0(sdtlpdtrp0(xN,xi))!=szmzizndt0(sdtlpdtrp0(xN,xj))|~aElementOf0(xj,szNzAzT0)|~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[489,491,theory(equality)])).
% cnf(996,negated_conjecture,(sdtlseqdt0(szszuzczcdt0(xi),xj)|$false|~aElementOf0(xj,szNzAzT0)|~aElementOf0(xi,szNzAzT0)),inference(rw,[status(thm)],[991,487,theory(equality)])).
% cnf(997,negated_conjecture,(sdtlseqdt0(szszuzczcdt0(xi),xj)|$false|$false|~aElementOf0(xi,szNzAzT0)),inference(rw,[status(thm)],[996,256,theory(equality)])).
% cnf(998,negated_conjecture,(sdtlseqdt0(szszuzczcdt0(xi),xj)|$false|$false|$false),inference(rw,[status(thm)],[997,257,theory(equality)])).
% cnf(999,negated_conjecture,(sdtlseqdt0(szszuzczcdt0(xi),xj)),inference(cn,[status(thm)],[998,theory(equality)])).
% cnf(1368,negated_conjecture,(szmzizndt0(sdtlpdtrp0(xN,xj))!=szmzizndt0(sdtlpdtrp0(xN,xi))|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(spm,[status(thm)],[489,999,theory(equality)])).
% cnf(1375,negated_conjecture,($false|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[1368,487,theory(equality)])).
% cnf(1376,negated_conjecture,($false|$false|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[1375,257,theory(equality)])).
% cnf(1377,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[1376,256,theory(equality)])).
% cnf(1378,negated_conjecture,($false),inference(cn,[status(thm)],[1377,theory(equality)])).
% cnf(1379,negated_conjecture,($false),1378,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 339
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 338
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 573
% # ...of the previous two non-trivial : 524
% # Contextual simplify-reflections : 24
% # Paramodulations : 531
% # Factorizations : 0
% # Equation resolutions : 42
% # Current number of processed clauses: 167
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 143
% # Current number of unprocessed clauses: 517
% # ...number of literals in the above : 2700
% # Clause-clause subsumption calls (NU) : 2355
% # Rec. Clause-clause subsumption calls : 571
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 189 leaves, 1.46+/-1.101 terms/leaf
% # Paramod-from index: 82 leaves, 1.01+/-0.110 terms/leaf
% # Paramod-into index: 160 leaves, 1.26+/-0.675 terms/leaf
% # -------------------------------------------------
% # User time : 0.080 s
% # System time : 0.007 s
% # Total time : 0.087 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.28 WC
% FINAL PrfWatch: 0.23 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP32150/NUM578+1.tptp
%
%------------------------------------------------------------------------------