TSTP Solution File: NUM606+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM606+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:35:54 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/SystemOnTPTP15346/NUM606+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15346/NUM606+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15346/NUM606+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 15442
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.031 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)<=>(aSet0(X2)&![X3]:(aElementOf0(X3,X2)=>aElementOf0(X3,X1))))),file('/tmp/SRASS.s.p', mDefSub)).
% fof(9, axiom,![X1]:![X2]:![X3]:(((aSet0(X1)&aSet0(X2))&aSet0(X3))=>((aSubsetOf0(X1,X2)&aSubsetOf0(X2,X3))=>aSubsetOf0(X1,X3))),file('/tmp/SRASS.s.p', mSubTrans)).
% fof(11, axiom,(aSet0(szNzAzT0)&isCountable0(szNzAzT0)),file('/tmp/SRASS.s.p', mNATSet)).
% fof(39, axiom,(aSubsetOf0(xS,szNzAzT0)&isCountable0(xS)),file('/tmp/SRASS.s.p', m__3435)).
% fof(62, axiom,aSubsetOf0(xO,xS),file('/tmp/SRASS.s.p', m__4998)).
% fof(64, axiom,(aSubsetOf0(xQ,xO)&~(xQ=slcrc0)),file('/tmp/SRASS.s.p', m__5093)).
% fof(101, conjecture,aSubsetOf0(xQ,szNzAzT0),file('/tmp/SRASS.s.p', m__)).
% fof(102, negated_conjecture,~(aSubsetOf0(xQ,szNzAzT0)),inference(assume_negation,[status(cth)],[101])).
% fof(115, negated_conjecture,~(aSubsetOf0(xQ,szNzAzT0)),inference(fof_simplification,[status(thm)],[102,theory(equality)])).
% fof(131, 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)],[5])).
% fof(132, 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)],[131])).
% fof(133, plain,![X4]:(~(aSet0(X4))|![X5]:((~(aSubsetOf0(X5,X4))|(aSet0(X5)&![X6]:(~(aElementOf0(X6,X5))|aElementOf0(X6,X4))))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))),inference(skolemize,[status(esa)],[132])).
% fof(134, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))&aSet0(X5))|~(aSubsetOf0(X5,X4)))&((~(aSet0(X5))|(aElementOf0(esk2_2(X4,X5),X5)&~(aElementOf0(esk2_2(X4,X5),X4))))|aSubsetOf0(X5,X4)))|~(aSet0(X4))),inference(shift_quantors,[status(thm)],[133])).
% fof(135, plain,![X4]:![X5]:![X6]:(((((~(aElementOf0(X6,X5))|aElementOf0(X6,X4))|~(aSubsetOf0(X5,X4)))|~(aSet0(X4)))&((aSet0(X5)|~(aSubsetOf0(X5,X4)))|~(aSet0(X4))))&((((aElementOf0(esk2_2(X4,X5),X5)|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4)))&(((~(aElementOf0(esk2_2(X4,X5),X4))|~(aSet0(X5)))|aSubsetOf0(X5,X4))|~(aSet0(X4))))),inference(distribute,[status(thm)],[134])).
% cnf(138,plain,(aSet0(X2)|~aSet0(X1)|~aSubsetOf0(X2,X1)),inference(split_conjunct,[status(thm)],[135])).
% fof(150, plain,![X1]:![X2]:![X3]:(((~(aSet0(X1))|~(aSet0(X2)))|~(aSet0(X3)))|((~(aSubsetOf0(X1,X2))|~(aSubsetOf0(X2,X3)))|aSubsetOf0(X1,X3))),inference(fof_nnf,[status(thm)],[9])).
% fof(151, plain,![X4]:![X5]:![X6]:(((~(aSet0(X4))|~(aSet0(X5)))|~(aSet0(X6)))|((~(aSubsetOf0(X4,X5))|~(aSubsetOf0(X5,X6)))|aSubsetOf0(X4,X6))),inference(variable_rename,[status(thm)],[150])).
% cnf(152,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)|~aSet0(X3)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[151])).
% cnf(158,plain,(aSet0(szNzAzT0)),inference(split_conjunct,[status(thm)],[11])).
% cnf(274,plain,(aSubsetOf0(xS,szNzAzT0)),inference(split_conjunct,[status(thm)],[39])).
% cnf(373,plain,(aSubsetOf0(xO,xS)),inference(split_conjunct,[status(thm)],[62])).
% cnf(376,plain,(aSubsetOf0(xQ,xO)),inference(split_conjunct,[status(thm)],[64])).
% cnf(564,negated_conjecture,(~aSubsetOf0(xQ,szNzAzT0)),inference(split_conjunct,[status(thm)],[115])).
% cnf(573,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X3)|~aSet0(X2)),inference(csr,[status(thm)],[152,138])).
% cnf(574,plain,(aSubsetOf0(X1,X2)|~aSubsetOf0(X3,X2)|~aSubsetOf0(X1,X3)|~aSet0(X2)),inference(csr,[status(thm)],[573,138])).
% cnf(761,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xS)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[574,274,theory(equality)])).
% cnf(769,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xS)|$false),inference(rw,[status(thm)],[761,158,theory(equality)])).
% cnf(770,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xS)),inference(cn,[status(thm)],[769,theory(equality)])).
% cnf(1935,plain,(aSubsetOf0(xO,szNzAzT0)),inference(spm,[status(thm)],[770,373,theory(equality)])).
% cnf(1948,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xO)|~aSet0(szNzAzT0)),inference(spm,[status(thm)],[574,1935,theory(equality)])).
% cnf(1958,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xO)|$false),inference(rw,[status(thm)],[1948,158,theory(equality)])).
% cnf(1959,plain,(aSubsetOf0(X1,szNzAzT0)|~aSubsetOf0(X1,xO)),inference(cn,[status(thm)],[1958,theory(equality)])).
% cnf(1986,plain,(aSubsetOf0(xQ,szNzAzT0)),inference(spm,[status(thm)],[1959,376,theory(equality)])).
% cnf(1992,plain,($false),inference(sr,[status(thm)],[1986,564,theory(equality)])).
% cnf(1993,plain,($false),1992,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 448
% # ...of these trivial : 2
% # ...subsumed : 16
% # ...remaining for further processing: 430
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 809
% # ...of the previous two non-trivial : 748
% # Contextual simplify-reflections : 25
% # Paramodulations : 768
% # Factorizations : 0
% # Equation resolutions : 41
% # Current number of processed clauses: 232
% # Positive orientable unit clauses: 47
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 14
% # Non-unit-clauses : 171
% # Current number of unprocessed clauses: 692
% # ...number of literals in the above : 3695
% # Clause-clause subsumption calls (NU) : 2511
% # Rec. Clause-clause subsumption calls : 738
% # Unit Clause-clause subsumption calls : 1044
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 265 leaves, 1.34+/-0.962 terms/leaf
% # Paramod-from index: 118 leaves, 1.01+/-0.092 terms/leaf
% # Paramod-into index: 228 leaves, 1.18+/-0.583 terms/leaf
% # -------------------------------------------------
% # User time : 0.101 s
% # System time : 0.008 s
% # Total time : 0.109 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/SystemOnTPTP15346/NUM606+1.tptp
%
%------------------------------------------------------------------------------