TSTP Solution File: NUM576+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM576+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 : art04.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:15:42 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP554/NUM576+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP554/NUM576+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP554/NUM576+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 650
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(18, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mLessASymm)).
% fof(20, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1))),file('/tmp/SRASS.s.p', mLessTotal)).
% fof(40, axiom,(aElementOf0(xi,szNzAzT0)&aElementOf0(xj,szNzAzT0)),file('/tmp/SRASS.s.p', m__3856)).
% fof(85, conjecture,(~(xi=xj)=>(sdtlseqdt0(szszuzczcdt0(xj),xi)|sdtlseqdt0(szszuzczcdt0(xi),xj))),file('/tmp/SRASS.s.p', m__)).
% fof(86, negated_conjecture,~((~(xi=xj)=>(sdtlseqdt0(szszuzczcdt0(xj),xi)|sdtlseqdt0(szszuzczcdt0(xi),xj)))),inference(assume_negation,[status(cth)],[85])).
% fof(161, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[18])).
% fof(162, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[161])).
% cnf(163,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[162])).
% fof(167, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1))),inference(fof_nnf,[status(thm)],[20])).
% fof(168, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(sdtlseqdt0(X3,X4)|sdtlseqdt0(szszuzczcdt0(X4),X3))),inference(variable_rename,[status(thm)],[167])).
% cnf(169,plain,(sdtlseqdt0(szszuzczcdt0(X1),X2)|sdtlseqdt0(X2,X1)|~aElementOf0(X1,szNzAzT0)|~aElementOf0(X2,szNzAzT0)),inference(split_conjunct,[status(thm)],[168])).
% cnf(255,plain,(aElementOf0(xj,szNzAzT0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(256,plain,(aElementOf0(xi,szNzAzT0)),inference(split_conjunct,[status(thm)],[40])).
% fof(480, negated_conjecture,(~(xi=xj)&(~(sdtlseqdt0(szszuzczcdt0(xj),xi))&~(sdtlseqdt0(szszuzczcdt0(xi),xj)))),inference(fof_nnf,[status(thm)],[86])).
% cnf(481,negated_conjecture,(~sdtlseqdt0(szszuzczcdt0(xi),xj)),inference(split_conjunct,[status(thm)],[480])).
% cnf(482,negated_conjecture,(~sdtlseqdt0(szszuzczcdt0(xj),xi)),inference(split_conjunct,[status(thm)],[480])).
% cnf(483,negated_conjecture,(xi!=xj),inference(split_conjunct,[status(thm)],[480])).
% cnf(623,negated_conjecture,(sdtlseqdt0(xj,xi)|~aElementOf0(xj,szNzAzT0)|~aElementOf0(xi,szNzAzT0)),inference(spm,[status(thm)],[481,169,theory(equality)])).
% cnf(624,negated_conjecture,(sdtlseqdt0(xi,xj)|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(spm,[status(thm)],[482,169,theory(equality)])).
% cnf(628,negated_conjecture,(sdtlseqdt0(xj,xi)|$false|~aElementOf0(xi,szNzAzT0)),inference(rw,[status(thm)],[623,255,theory(equality)])).
% cnf(629,negated_conjecture,(sdtlseqdt0(xj,xi)|$false|$false),inference(rw,[status(thm)],[628,256,theory(equality)])).
% cnf(630,negated_conjecture,(sdtlseqdt0(xj,xi)),inference(cn,[status(thm)],[629,theory(equality)])).
% cnf(631,negated_conjecture,(sdtlseqdt0(xi,xj)|$false|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[624,256,theory(equality)])).
% cnf(632,negated_conjecture,(sdtlseqdt0(xi,xj)|$false|$false),inference(rw,[status(thm)],[631,255,theory(equality)])).
% cnf(633,negated_conjecture,(sdtlseqdt0(xi,xj)),inference(cn,[status(thm)],[632,theory(equality)])).
% cnf(1312,negated_conjecture,(xj=xi|~sdtlseqdt0(xj,xi)|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(spm,[status(thm)],[163,633,theory(equality)])).
% cnf(1316,negated_conjecture,(xj=xi|$false|~aElementOf0(xi,szNzAzT0)|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[1312,630,theory(equality)])).
% cnf(1317,negated_conjecture,(xj=xi|$false|$false|~aElementOf0(xj,szNzAzT0)),inference(rw,[status(thm)],[1316,256,theory(equality)])).
% cnf(1318,negated_conjecture,(xj=xi|$false|$false|$false),inference(rw,[status(thm)],[1317,255,theory(equality)])).
% cnf(1319,negated_conjecture,(xj=xi),inference(cn,[status(thm)],[1318,theory(equality)])).
% cnf(1320,negated_conjecture,($false),inference(sr,[status(thm)],[1319,483,theory(equality)])).
% cnf(1321,negated_conjecture,($false),1320,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 336
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 335
% # Other redundant clauses eliminated : 14
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 548
% # ...of the previous two non-trivial : 500
% # Contextual simplify-reflections : 24
% # Paramodulations : 506
% # Factorizations : 0
% # Equation resolutions : 42
% # Current number of processed clauses: 167
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 141
% # Current number of unprocessed clauses: 495
% # ...number of literals in the above : 2590
% # Clause-clause subsumption calls (NU) : 960
% # Rec. Clause-clause subsumption calls : 303
% # Unit Clause-clause subsumption calls : 28
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 188 leaves, 1.45+/-1.098 terms/leaf
% # Paramod-from index: 81 leaves, 1.01+/-0.110 terms/leaf
% # Paramod-into index: 161 leaves, 1.24+/-0.657 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.014 s
% # Total time : 0.083 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.29 WC
% FINAL PrfWatch: 0.19 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP554/NUM576+1.tptp
%
%------------------------------------------------------------------------------