TSTP Solution File: NUM555+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM555+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 20:09:35 EST 2010
% Result : Theorem 1.33s
% Output : Solution 1.33s
% 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/SystemOnTPTP14982/NUM555+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14982/NUM555+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14982/NUM555+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 15114
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(10, axiom,![X1]:![X2]:((aSet0(X1)&aElement0(X2))=>![X3]:(X3=sdtmndt0(X1,X2)<=>(aSet0(X3)&![X4]:(aElementOf0(X4,X3)<=>((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))),file('/tmp/SRASS.s.p', mDefDiff)).
% fof(27, axiom,((aSet0(xQ)&isFinite0(xQ))&sbrdtbr0(xQ)=xk),file('/tmp/SRASS.s.p', m__2291)).
% fof(28, axiom,(aElement0(xy)&aElementOf0(xy,xQ)),file('/tmp/SRASS.s.p', m__2304)).
% fof(29, axiom,~(aElementOf0(xx,xQ)),file('/tmp/SRASS.s.p', m__2323)).
% fof(71, conjecture,~(aElementOf0(xx,sdtmndt0(xQ,xy))),file('/tmp/SRASS.s.p', m__)).
% fof(72, negated_conjecture,~(~(aElementOf0(xx,sdtmndt0(xQ,xy)))),inference(assume_negation,[status(cth)],[71])).
% fof(75, plain,~(aElementOf0(xx,xQ)),inference(fof_simplification,[status(thm)],[29,theory(equality)])).
% fof(86, negated_conjecture,aElementOf0(xx,sdtmndt0(xQ,xy)),inference(fof_simplification,[status(thm)],[72,theory(equality)])).
% fof(136, plain,![X1]:![X2]:((~(aSet0(X1))|~(aElement0(X2)))|![X3]:((~(X3=sdtmndt0(X1,X2))|(aSet0(X3)&![X4]:((~(aElementOf0(X4,X3))|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))&(((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2)|aElementOf0(X4,X3)))))&((~(aSet0(X3))|?[X4]:((~(aElementOf0(X4,X3))|((~(aElement0(X4))|~(aElementOf0(X4,X1)))|X4=X2))&(aElementOf0(X4,X3)|((aElement0(X4)&aElementOf0(X4,X1))&~(X4=X2)))))|X3=sdtmndt0(X1,X2)))),inference(fof_nnf,[status(thm)],[10])).
% fof(137, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|?[X9]:((~(aElementOf0(X9,X7))|((~(aElement0(X9))|~(aElementOf0(X9,X5)))|X9=X6))&(aElementOf0(X9,X7)|((aElement0(X9)&aElementOf0(X9,X5))&~(X9=X6)))))|X7=sdtmndt0(X5,X6)))),inference(variable_rename,[status(thm)],[136])).
% fof(138, plain,![X5]:![X6]:((~(aSet0(X5))|~(aElement0(X6)))|![X7]:((~(X7=sdtmndt0(X5,X6))|(aSet0(X7)&![X8]:((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))))&((~(aSet0(X7))|((~(aElementOf0(esk4_3(X5,X6,X7),X7))|((~(aElement0(esk4_3(X5,X6,X7)))|~(aElementOf0(esk4_3(X5,X6,X7),X5)))|esk4_3(X5,X6,X7)=X6))&(aElementOf0(esk4_3(X5,X6,X7),X7)|((aElement0(esk4_3(X5,X6,X7))&aElementOf0(esk4_3(X5,X6,X7),X5))&~(esk4_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))),inference(skolemize,[status(esa)],[137])).
% fof(139, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aElementOf0(X8,X7))|((aElement0(X8)&aElementOf0(X8,X5))&~(X8=X6)))&(((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7)))&aSet0(X7))|~(X7=sdtmndt0(X5,X6)))&((~(aSet0(X7))|((~(aElementOf0(esk4_3(X5,X6,X7),X7))|((~(aElement0(esk4_3(X5,X6,X7)))|~(aElementOf0(esk4_3(X5,X6,X7),X5)))|esk4_3(X5,X6,X7)=X6))&(aElementOf0(esk4_3(X5,X6,X7),X7)|((aElement0(esk4_3(X5,X6,X7))&aElementOf0(esk4_3(X5,X6,X7),X5))&~(esk4_3(X5,X6,X7)=X6)))))|X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))),inference(shift_quantors,[status(thm)],[138])).
% fof(140, plain,![X5]:![X6]:![X7]:![X8]:((((((((aElement0(X8)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6))))&(((aElementOf0(X8,X5)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((~(X8=X6)|~(aElementOf0(X8,X7)))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElement0(X8))|~(aElementOf0(X8,X5)))|X8=X6)|aElementOf0(X8,X7))|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&((aSet0(X7)|~(X7=sdtmndt0(X5,X6)))|(~(aSet0(X5))|~(aElement0(X6)))))&(((((~(aElementOf0(esk4_3(X5,X6,X7),X7))|((~(aElement0(esk4_3(X5,X6,X7)))|~(aElementOf0(esk4_3(X5,X6,X7),X5)))|esk4_3(X5,X6,X7)=X6))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((((aElement0(esk4_3(X5,X6,X7))|aElementOf0(esk4_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))&((((aElementOf0(esk4_3(X5,X6,X7),X5)|aElementOf0(esk4_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6)))))&((((~(esk4_3(X5,X6,X7)=X6)|aElementOf0(esk4_3(X5,X6,X7),X7))|~(aSet0(X7)))|X7=sdtmndt0(X5,X6))|(~(aSet0(X5))|~(aElement0(X6))))))),inference(distribute,[status(thm)],[139])).
% cnf(148,plain,(aElementOf0(X4,X2)|~aElement0(X1)|~aSet0(X2)|X3!=sdtmndt0(X2,X1)|~aElementOf0(X4,X3)),inference(split_conjunct,[status(thm)],[140])).
% cnf(209,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[27])).
% cnf(211,plain,(aElement0(xy)),inference(split_conjunct,[status(thm)],[28])).
% cnf(212,plain,(~aElementOf0(xx,xQ)),inference(split_conjunct,[status(thm)],[75])).
% cnf(368,negated_conjecture,(aElementOf0(xx,sdtmndt0(xQ,xy))),inference(split_conjunct,[status(thm)],[86])).
% cnf(559,plain,(aElementOf0(X1,X2)|~aElement0(X3)|~aElementOf0(X1,sdtmndt0(X2,X3))|~aSet0(X2)),inference(er,[status(thm)],[148,theory(equality)])).
% cnf(1123,negated_conjecture,(aElementOf0(xx,xQ)|~aElement0(xy)|~aSet0(xQ)),inference(spm,[status(thm)],[559,368,theory(equality)])).
% cnf(1124,negated_conjecture,(aElementOf0(xx,xQ)|$false|~aSet0(xQ)),inference(rw,[status(thm)],[1123,211,theory(equality)])).
% cnf(1125,negated_conjecture,(aElementOf0(xx,xQ)|$false|$false),inference(rw,[status(thm)],[1124,209,theory(equality)])).
% cnf(1126,negated_conjecture,(aElementOf0(xx,xQ)),inference(cn,[status(thm)],[1125,theory(equality)])).
% cnf(1127,negated_conjecture,($false),inference(sr,[status(thm)],[1126,212,theory(equality)])).
% cnf(1128,negated_conjecture,($false),1127,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 356
% # ...of these trivial : 4
% # ...subsumed : 40
% # ...remaining for further processing: 312
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 1
% # Generated clauses : 525
% # ...of the previous two non-trivial : 467
% # Contextual simplify-reflections : 55
% # Paramodulations : 485
% # Factorizations : 0
% # Equation resolutions : 40
% # Current number of processed clauses: 183
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 11
% # Non-unit-clauses : 148
% # Current number of unprocessed clauses: 348
% # ...number of literals in the above : 1953
% # Clause-clause subsumption calls (NU) : 865
% # Rec. Clause-clause subsumption calls : 506
% # Unit Clause-clause subsumption calls : 204
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 164 leaves, 1.34+/-0.906 terms/leaf
% # Paramod-from index: 85 leaves, 1.02+/-0.152 terms/leaf
% # Paramod-into index: 142 leaves, 1.23+/-0.706 terms/leaf
% # -------------------------------------------------
% # User time : 0.060 s
% # System time : 0.004 s
% # Total time : 0.064 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.24 WC
% FINAL PrfWatch: 0.18 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP14982/NUM555+1.tptp
%
%------------------------------------------------------------------------------