TSTP Solution File: NUM630+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM630+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 : art03.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:42:48 EST 2010
% Result : Theorem 3.19s
% Output : Solution 3.19s
% 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/SystemOnTPTP20557/NUM630+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20557/NUM630+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20557/NUM630+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 20653
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.033 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(56, axiom,((aFunction0(xC)&szDzozmdt0(xC)=szNzAzT0)&![X1]:(aElementOf0(X1,szNzAzT0)=>((aFunction0(sdtlpdtrp0(xC,X1))&szDzozmdt0(sdtlpdtrp0(xC,X1))=slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))&![X2]:((aSet0(X2)&aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk)))=>sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)=sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))))))),file('/tmp/SRASS.s.p', m__4151)).
% fof(74, axiom,(aSet0(xP)&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(81, axiom,((aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))&aElementOf0(xn,szNzAzT0))&sdtlpdtrp0(xe,xn)=xp),file('/tmp/SRASS.s.p', m__5309)).
% fof(84, axiom,xD=sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn))),file('/tmp/SRASS.s.p', m__5585)).
% fof(85, axiom,aElementOf0(xP,slbdtsldtrb0(xD,xk)),file('/tmp/SRASS.s.p', m__5599)).
% fof(116, conjecture,sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))=sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),file('/tmp/SRASS.s.p', m__)).
% fof(117, negated_conjecture,~(sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))=sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP)),inference(assume_negation,[status(cth)],[116])).
% fof(130, negated_conjecture,~(sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))=sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP)),inference(fof_simplification,[status(thm)],[117,theory(equality)])).
% fof(366, plain,((aFunction0(xC)&szDzozmdt0(xC)=szNzAzT0)&![X1]:(~(aElementOf0(X1,szNzAzT0))|((aFunction0(sdtlpdtrp0(xC,X1))&szDzozmdt0(sdtlpdtrp0(xC,X1))=slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))&![X2]:((~(aSet0(X2))|~(aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))))|sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)=sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1)))))))),inference(fof_nnf,[status(thm)],[56])).
% fof(367, plain,((aFunction0(xC)&szDzozmdt0(xC)=szNzAzT0)&![X3]:(~(aElementOf0(X3,szNzAzT0))|((aFunction0(sdtlpdtrp0(xC,X3))&szDzozmdt0(sdtlpdtrp0(xC,X3))=slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))&![X4]:((~(aSet0(X4))|~(aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))))|sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4)=sdtlpdtrp0(xc,sdtpldt0(X4,szmzizndt0(sdtlpdtrp0(xN,X3)))))))),inference(variable_rename,[status(thm)],[366])).
% fof(368, plain,![X3]:![X4]:(((((~(aSet0(X4))|~(aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))))|sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4)=sdtlpdtrp0(xc,sdtpldt0(X4,szmzizndt0(sdtlpdtrp0(xN,X3)))))&(aFunction0(sdtlpdtrp0(xC,X3))&szDzozmdt0(sdtlpdtrp0(xC,X3))=slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk)))|~(aElementOf0(X3,szNzAzT0)))&(aFunction0(xC)&szDzozmdt0(xC)=szNzAzT0)),inference(shift_quantors,[status(thm)],[367])).
% fof(369, plain,![X3]:![X4]:(((((~(aSet0(X4))|~(aElementOf0(X4,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk))))|sdtlpdtrp0(sdtlpdtrp0(xC,X3),X4)=sdtlpdtrp0(xc,sdtpldt0(X4,szmzizndt0(sdtlpdtrp0(xN,X3)))))|~(aElementOf0(X3,szNzAzT0)))&((aFunction0(sdtlpdtrp0(xC,X3))|~(aElementOf0(X3,szNzAzT0)))&(szDzozmdt0(sdtlpdtrp0(xC,X3))=slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X3),szmzizndt0(sdtlpdtrp0(xN,X3))),xk)|~(aElementOf0(X3,szNzAzT0)))))&(aFunction0(xC)&szDzozmdt0(xC)=szNzAzT0)),inference(distribute,[status(thm)],[368])).
% cnf(374,plain,(sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2)=sdtlpdtrp0(xc,sdtpldt0(X2,szmzizndt0(sdtlpdtrp0(xN,X1))))|~aElementOf0(X1,szNzAzT0)|~aElementOf0(X2,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1))),xk))|~aSet0(X2)),inference(split_conjunct,[status(thm)],[369])).
% cnf(432,plain,(aSet0(xP)),inference(split_conjunct,[status(thm)],[74])).
% cnf(440,plain,(aElementOf0(xn,szNzAzT0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(444,plain,(xD=sdtmndt0(sdtlpdtrp0(xN,xn),szmzizndt0(sdtlpdtrp0(xN,xn)))),inference(split_conjunct,[status(thm)],[84])).
% cnf(445,plain,(aElementOf0(xP,slbdtsldtrb0(xD,xk))),inference(split_conjunct,[status(thm)],[85])).
% cnf(597,negated_conjecture,(sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn))))!=sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP)),inference(split_conjunct,[status(thm)],[130])).
% cnf(1802,plain,(sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn))))=sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)|~aElementOf0(X1,slbdtsldtrb0(xD,xk))|~aElementOf0(xn,szNzAzT0)|~aSet0(X1)),inference(spm,[status(thm)],[374,444,theory(equality)])).
% cnf(1827,plain,(sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn))))=sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)|~aElementOf0(X1,slbdtsldtrb0(xD,xk))|$false|~aSet0(X1)),inference(rw,[status(thm)],[1802,440,theory(equality)])).
% cnf(1828,plain,(sdtlpdtrp0(xc,sdtpldt0(X1,szmzizndt0(sdtlpdtrp0(xN,xn))))=sdtlpdtrp0(sdtlpdtrp0(xC,xn),X1)|~aElementOf0(X1,slbdtsldtrb0(xD,xk))|~aSet0(X1)),inference(cn,[status(thm)],[1827,theory(equality)])).
% cnf(29779,negated_conjecture,(~aElementOf0(xP,slbdtsldtrb0(xD,xk))|~aSet0(xP)),inference(spm,[status(thm)],[597,1828,theory(equality)])).
% cnf(29791,negated_conjecture,($false|~aSet0(xP)),inference(rw,[status(thm)],[29779,445,theory(equality)])).
% cnf(29792,negated_conjecture,($false|$false),inference(rw,[status(thm)],[29791,432,theory(equality)])).
% cnf(29793,negated_conjecture,($false),inference(cn,[status(thm)],[29792,theory(equality)])).
% cnf(29794,negated_conjecture,($false),29793,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5085
% # ...of these trivial : 104
% # ...subsumed : 2822
% # ...remaining for further processing: 2159
% # Other redundant clauses eliminated : 25
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 184
% # Backward-rewritten : 21
% # Generated clauses : 15015
% # ...of the previous two non-trivial : 14098
% # Contextual simplify-reflections : 1878
% # Paramodulations : 14881
% # Factorizations : 0
% # Equation resolutions : 134
% # Current number of processed clauses: 1738
% # Positive orientable unit clauses: 151
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 109
% # Non-unit-clauses : 1478
% # Current number of unprocessed clauses: 8752
% # ...number of literals in the above : 52940
% # Clause-clause subsumption calls (NU) : 322033
% # Rec. Clause-clause subsumption calls : 92128
% # Unit Clause-clause subsumption calls : 10421
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 1393 leaves, 1.24+/-0.827 terms/leaf
% # Paramod-from index: 557 leaves, 1.03+/-0.177 terms/leaf
% # Paramod-into index: 1088 leaves, 1.17+/-0.622 terms/leaf
% # -------------------------------------------------
% # User time : 1.584 s
% # System time : 0.049 s
% # Total time : 1.633 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.18 CPU 2.27 WC
% FINAL PrfWatch: 2.18 CPU 2.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP20557/NUM630+1.tptp
%
%------------------------------------------------------------------------------