TSTP Solution File: NUM587+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM587+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 : art07.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:22:39 EST 2010
% Result : Theorem 1.23s
% Output : Solution 1.23s
% 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/SystemOnTPTP1814/NUM587+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1814/NUM587+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1814/NUM587+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 1916
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.029 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(30, axiom,(aSet0(xT)&isFinite0(xT)),file('/tmp/SRASS.s.p', m__3291)).
% fof(33, axiom,((aFunction0(xc)&szDzozmdt0(xc)=slbdtsldtrb0(xS,xK))&aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),file('/tmp/SRASS.s.p', m__3453)).
% fof(47, axiom,(xx=sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))&aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc)))),file('/tmp/SRASS.s.p', m__4263)).
% fof(91, conjecture,aElementOf0(xx,xT),file('/tmp/SRASS.s.p', m__)).
% fof(92, negated_conjecture,~(aElementOf0(xx,xT)),inference(assume_negation,[status(cth)],[91])).
% fof(105, negated_conjecture,~(aElementOf0(xx,xT)),inference(fof_simplification,[status(thm)],[92,theory(equality)])).
% fof(109, plain,![X1]:(~(aSet0(X1))|![X2]:((~(aSubsetOf0(X2,X1))|(aSet0(X2)&![X3]:(~(aElementOf0(X3,X2))|aElementOf0(X3,X1))))&((~(aSet0(X2))|?[X3]:(aElementOf0(X3,X2)&~(aElementOf0(X3,X1))))|aSubsetOf0(X2,X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(110, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|?[X7]:(aElementOf0(X7,X5)&~(aElementOf0(X7,X4))))|aSubsetOf0(X5,X4)))),inference(variable_rename,[status(thm)],[109])).
% fof(111, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[110])).
% fof(112, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk1_2(X4,X5),X5)&~(aElementOf0(esk1_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk1_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk1_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[112])).
% cnf(117,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aElementOf0(X3,X2)),inference(split_conjunct,[status(thm)],[113])).
% cnf(229,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[30])).
% cnf(233,plain,(aSubsetOf0(sdtlcdtrc0(xc,szDzozmdt0(xc)),xT)),inference(split_conjunct,[status(thm)],[33])).
% cnf(286,plain,(aElementOf0(sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),sdtlcdtrc0(xc,szDzozmdt0(xc)))),inference(split_conjunct,[status(thm)],[47])).
% cnf(287,plain,(xx=sdtlpdtrp0(xc,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))),inference(split_conjunct,[status(thm)],[47])).
% cnf(507,negated_conjecture,(~aElementOf0(xx,xT)),inference(split_conjunct,[status(thm)],[105])).
% cnf(515,plain,(aElementOf0(xx,sdtlcdtrc0(xc,szDzozmdt0(xc)))),inference(rw,[status(thm)],[286,287,theory(equality)])).
% cnf(724,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))|~aSet0(xT)),inference(spm,[status(thm)],[117,233,theory(equality)])).
% cnf(730,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))|$false),inference(rw,[status(thm)],[724,229,theory(equality)])).
% cnf(731,plain,(aElementOf0(X1,xT)|~aElementOf0(X1,sdtlcdtrc0(xc,szDzozmdt0(xc)))),inference(cn,[status(thm)],[730,theory(equality)])).
% cnf(2096,plain,(aElementOf0(xx,xT)),inference(spm,[status(thm)],[731,515,theory(equality)])).
% cnf(2108,plain,($false),inference(sr,[status(thm)],[2096,507,theory(equality)])).
% cnf(2109,plain,($false),2108,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 501
% # ...of these trivial : 5
% # ...subsumed : 62
% # ...remaining for further processing: 434
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 0
% # Generated clauses : 949
% # ...of the previous two non-trivial : 863
% # Contextual simplify-reflections : 65
% # Paramodulations : 908
% # Factorizations : 0
% # Equation resolutions : 41
% # Current number of processed clauses: 254
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 17
% # Non-unit-clauses : 187
% # Current number of unprocessed clauses: 708
% # ...number of literals in the above : 3918
% # Clause-clause subsumption calls (NU) : 2769
% # Rec. Clause-clause subsumption calls : 917
% # Unit Clause-clause subsumption calls : 674
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 267 leaves, 1.34+/-0.964 terms/leaf
% # Paramod-from index: 128 leaves, 1.02+/-0.124 terms/leaf
% # Paramod-into index: 234 leaves, 1.20+/-0.617 terms/leaf
% # -------------------------------------------------
% # User time : 0.106 s
% # System time : 0.006 s
% # Total time : 0.112 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.24 CPU 0.32 WC
% FINAL PrfWatch: 0.24 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP1814/NUM587+1.tptp
%
%------------------------------------------------------------------------------