TSTP Solution File: NUM627+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM627+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 : art02.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:41:44 EST 2010
% Result : Theorem 1.25s
% Output : Solution 1.25s
% 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/SystemOnTPTP13233/NUM627+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13233/NUM627+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13233/NUM627+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 13329
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(13, axiom,![X1]:(aElementOf0(X1,szNzAzT0)=>(aElementOf0(szszuzczcdt0(X1),szNzAzT0)&~(szszuzczcdt0(X1)=sz00))),file('/tmp/SRASS.s.p', mSuccNum)).
% fof(24, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1))),file('/tmp/SRASS.s.p', mLessTotal)).
% fof(53, axiom,![X1]:![X2]:((aElementOf0(X1,szNzAzT0)&aElementOf0(X2,szNzAzT0))=>(sdtlseqdt0(X2,X1)=>aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)))),file('/tmp/SRASS.s.p', m__3754)).
% fof(81, axiom,((aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))&aElementOf0(xn,szNzAzT0))&sdtlpdtrp0(xe,xn)=xp),file('/tmp/SRASS.s.p', m__5309)).
% fof(85, axiom,(aElementOf0(xm,szNzAzT0)&xx=sdtlpdtrp0(xe,xm)),file('/tmp/SRASS.s.p', m__5389)).
% fof(87, axiom,~(aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))),file('/tmp/SRASS.s.p', m__5442)).
% fof(88, axiom,~(aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),file('/tmp/SRASS.s.p', m__5461)).
% fof(124, plain,~(aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))),inference(fof_simplification,[status(thm)],[87,theory(equality)])).
% fof(125, plain,~(aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),inference(fof_simplification,[status(thm)],[88,theory(equality)])).
% fof(180, plain,![X1]:(~(aElementOf0(X1,szNzAzT0))|(aElementOf0(szszuzczcdt0(X1),szNzAzT0)&~(szszuzczcdt0(X1)=sz00))),inference(fof_nnf,[status(thm)],[13])).
% fof(181, plain,![X2]:(~(aElementOf0(X2,szNzAzT0))|(aElementOf0(szszuzczcdt0(X2),szNzAzT0)&~(szszuzczcdt0(X2)=sz00))),inference(variable_rename,[status(thm)],[180])).
% fof(182, plain,![X2]:((aElementOf0(szszuzczcdt0(X2),szNzAzT0)|~(aElementOf0(X2,szNzAzT0)))&(~(szszuzczcdt0(X2)=sz00)|~(aElementOf0(X2,szNzAzT0)))),inference(distribute,[status(thm)],[181])).
% cnf(184,plain,(aElementOf0(szszuzczcdt0(X1),szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[182])).
% fof(220, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(sdtlseqdt0(X1,X2)|sdtlseqdt0(szszuzczcdt0(X2),X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(221, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(sdtlseqdt0(X3,X4)|sdtlseqdt0(szszuzczcdt0(X4),X3))),inference(variable_rename,[status(thm)],[220])).
% cnf(222,plain,(sdtlseqdt0(szszuzczcdt0(X1),X2)|sdtlseqdt0(X2,X1)|~aElementOf0(X1,szNzAzT0)|~aElementOf0(X2,szNzAzT0)),inference(split_conjunct,[status(thm)],[221])).
% fof(361, plain,![X1]:![X2]:((~(aElementOf0(X1,szNzAzT0))|~(aElementOf0(X2,szNzAzT0)))|(~(sdtlseqdt0(X2,X1))|aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)))),inference(fof_nnf,[status(thm)],[53])).
% fof(362, plain,![X3]:![X4]:((~(aElementOf0(X3,szNzAzT0))|~(aElementOf0(X4,szNzAzT0)))|(~(sdtlseqdt0(X4,X3))|aSubsetOf0(sdtlpdtrp0(xN,X3),sdtlpdtrp0(xN,X4)))),inference(variable_rename,[status(thm)],[361])).
% cnf(363,plain,(aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))|~sdtlseqdt0(X2,X1)|~aElementOf0(X2,szNzAzT0)|~aElementOf0(X1,szNzAzT0)),inference(split_conjunct,[status(thm)],[362])).
% cnf(445,plain,(aElementOf0(xn,szNzAzT0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(452,plain,(aElementOf0(xm,szNzAzT0)),inference(split_conjunct,[status(thm)],[85])).
% cnf(454,plain,(~aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))),inference(split_conjunct,[status(thm)],[124])).
% cnf(455,plain,(~aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))),inference(split_conjunct,[status(thm)],[125])).
% cnf(1342,plain,(~sdtlseqdt0(szszuzczcdt0(xn),xm)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)|~aElementOf0(xm,szNzAzT0)),inference(spm,[status(thm)],[454,363,theory(equality)])).
% cnf(1343,plain,(~sdtlseqdt0(xm,xn)|~aElementOf0(xm,szNzAzT0)|~aElementOf0(xn,szNzAzT0)),inference(spm,[status(thm)],[455,363,theory(equality)])).
% cnf(1346,plain,(~sdtlseqdt0(szszuzczcdt0(xn),xm)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)|$false),inference(rw,[status(thm)],[1342,452,theory(equality)])).
% cnf(1347,plain,(~sdtlseqdt0(szszuzczcdt0(xn),xm)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)),inference(cn,[status(thm)],[1346,theory(equality)])).
% cnf(1348,plain,(~sdtlseqdt0(xm,xn)|$false|~aElementOf0(xn,szNzAzT0)),inference(rw,[status(thm)],[1343,452,theory(equality)])).
% cnf(1349,plain,(~sdtlseqdt0(xm,xn)|$false|$false),inference(rw,[status(thm)],[1348,445,theory(equality)])).
% cnf(1350,plain,(~sdtlseqdt0(xm,xn)),inference(cn,[status(thm)],[1349,theory(equality)])).
% cnf(2310,plain,(sdtlseqdt0(xm,xn)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)|~aElementOf0(xm,szNzAzT0)|~aElementOf0(xn,szNzAzT0)),inference(spm,[status(thm)],[1347,222,theory(equality)])).
% cnf(2311,plain,(sdtlseqdt0(xm,xn)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)|$false|~aElementOf0(xn,szNzAzT0)),inference(rw,[status(thm)],[2310,452,theory(equality)])).
% cnf(2312,plain,(sdtlseqdt0(xm,xn)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)|$false|$false),inference(rw,[status(thm)],[2311,445,theory(equality)])).
% cnf(2313,plain,(sdtlseqdt0(xm,xn)|~aElementOf0(szszuzczcdt0(xn),szNzAzT0)),inference(cn,[status(thm)],[2312,theory(equality)])).
% cnf(2314,plain,(~aElementOf0(szszuzczcdt0(xn),szNzAzT0)),inference(sr,[status(thm)],[2313,1350,theory(equality)])).
% cnf(2315,plain,(~aElementOf0(xn,szNzAzT0)),inference(spm,[status(thm)],[2314,184,theory(equality)])).
% cnf(2316,plain,($false),inference(rw,[status(thm)],[2315,445,theory(equality)])).
% cnf(2317,plain,($false),inference(cn,[status(thm)],[2316,theory(equality)])).
% cnf(2318,plain,($false),2317,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 526
% # ...of these trivial : 8
% # ...subsumed : 25
% # ...remaining for further processing: 493
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 964
% # ...of the previous two non-trivial : 894
% # Contextual simplify-reflections : 25
% # Paramodulations : 923
% # Factorizations : 0
% # Equation resolutions : 41
% # Current number of processed clauses: 272
% # Positive orientable unit clauses: 75
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 28
% # Non-unit-clauses : 169
% # Current number of unprocessed clauses: 806
% # ...number of literals in the above : 4128
% # Clause-clause subsumption calls (NU) : 2915
% # Rec. Clause-clause subsumption calls : 785
% # Unit Clause-clause subsumption calls : 1797
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 308 leaves, 1.29+/-0.900 terms/leaf
% # Paramod-from index: 148 leaves, 1.01+/-0.082 terms/leaf
% # Paramod-into index: 272 leaves, 1.15+/-0.541 terms/leaf
% # -------------------------------------------------
% # User time : 0.113 s
% # System time : 0.009 s
% # Total time : 0.122 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.33 WC
% FINAL PrfWatch: 0.25 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP13233/NUM627+1.tptp
%
%------------------------------------------------------------------------------