TSTP Solution File: NUM549+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM549+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:07:56 EST 2010
% Result : Theorem 1.31s
% Output : Solution 1.31s
% 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/SystemOnTPTP13235/NUM549+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13235/NUM549+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13235/NUM549+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 13369
% 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(1, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(2, axiom,![X1]:(X1=slcrc0<=>(aSet0(X1)&~(?[X2]:aElementOf0(X2,X1)))),file('/tmp/SRASS.s.p', mDefEmp)).
% fof(12, axiom,![X1]:(aSet0(X1)=>(sbrdtbr0(X1)=sz00<=>X1=slcrc0)),file('/tmp/SRASS.s.p', mCardEmpty)).
% fof(17, axiom,((aSet0(xS)&aSet0(xT))&~(xk=sz00)),file('/tmp/SRASS.s.p', m__2202_02)).
% fof(21, axiom,((aSet0(xQ)&isFinite0(xQ))&sbrdtbr0(xQ)=xk),file('/tmp/SRASS.s.p', m__2291)).
% fof(67, conjecture,?[X1]:(aElement0(X1)&aElementOf0(X1,xQ)),file('/tmp/SRASS.s.p', m__)).
% fof(68, negated_conjecture,~(?[X1]:(aElement0(X1)&aElementOf0(X1,xQ))),inference(assume_negation,[status(cth)],[67])).
% fof(80, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(81, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[81])).
% cnf(83,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(84, plain,![X1]:((~(X1=slcrc0)|(aSet0(X1)&![X2]:~(aElementOf0(X2,X1))))&((~(aSet0(X1))|?[X2]:aElementOf0(X2,X1))|X1=slcrc0)),inference(fof_nnf,[status(thm)],[2])).
% fof(85, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|?[X5]:aElementOf0(X5,X3))|X3=slcrc0)),inference(variable_rename,[status(thm)],[84])).
% fof(86, plain,![X3]:((~(X3=slcrc0)|(aSet0(X3)&![X4]:~(aElementOf0(X4,X3))))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(skolemize,[status(esa)],[85])).
% fof(87, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))&aSet0(X3))|~(X3=slcrc0))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(shift_quantors,[status(thm)],[86])).
% fof(88, plain,![X3]:![X4]:(((~(aElementOf0(X4,X3))|~(X3=slcrc0))&(aSet0(X3)|~(X3=slcrc0)))&((~(aSet0(X3))|aElementOf0(esk1_1(X3),X3))|X3=slcrc0)),inference(distribute,[status(thm)],[87])).
% cnf(89,plain,(X1=slcrc0|aElementOf0(esk1_1(X1),X1)|~aSet0(X1)),inference(split_conjunct,[status(thm)],[88])).
% cnf(90,plain,(aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[88])).
% fof(124, plain,![X1]:(~(aSet0(X1))|((~(sbrdtbr0(X1)=sz00)|X1=slcrc0)&(~(X1=slcrc0)|sbrdtbr0(X1)=sz00))),inference(fof_nnf,[status(thm)],[12])).
% fof(125, plain,![X2]:(~(aSet0(X2))|((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)&(~(X2=slcrc0)|sbrdtbr0(X2)=sz00))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X2]:(((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)|~(aSet0(X2)))&((~(X2=slcrc0)|sbrdtbr0(X2)=sz00)|~(aSet0(X2)))),inference(distribute,[status(thm)],[125])).
% cnf(127,plain,(sbrdtbr0(X1)=sz00|~aSet0(X1)|X1!=slcrc0),inference(split_conjunct,[status(thm)],[126])).
% cnf(150,plain,(xk!=sz00),inference(split_conjunct,[status(thm)],[17])).
% cnf(157,plain,(sbrdtbr0(xQ)=xk),inference(split_conjunct,[status(thm)],[21])).
% cnf(159,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[21])).
% fof(356, negated_conjecture,![X1]:(~(aElement0(X1))|~(aElementOf0(X1,xQ))),inference(fof_nnf,[status(thm)],[68])).
% fof(357, negated_conjecture,![X2]:(~(aElement0(X2))|~(aElementOf0(X2,xQ))),inference(variable_rename,[status(thm)],[356])).
% cnf(358,negated_conjecture,(~aElementOf0(X1,xQ)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[357])).
% cnf(359,plain,(sbrdtbr0(X1)=sz00|slcrc0!=X1),inference(csr,[status(thm)],[127,90])).
% cnf(387,plain,(sz00=xk|slcrc0!=xQ),inference(spm,[status(thm)],[157,359,theory(equality)])).
% cnf(388,plain,(xQ!=slcrc0),inference(sr,[status(thm)],[387,150,theory(equality)])).
% cnf(432,plain,(aElement0(esk1_1(X1))|slcrc0=X1|~aSet0(X1)),inference(spm,[status(thm)],[83,89,theory(equality)])).
% cnf(900,negated_conjecture,(slcrc0=X1|~aElementOf0(esk1_1(X1),xQ)|~aSet0(X1)),inference(spm,[status(thm)],[358,432,theory(equality)])).
% cnf(908,negated_conjecture,(slcrc0=xQ|~aSet0(xQ)),inference(spm,[status(thm)],[900,89,theory(equality)])).
% cnf(909,negated_conjecture,(slcrc0=xQ|$false),inference(rw,[status(thm)],[908,159,theory(equality)])).
% cnf(910,negated_conjecture,(slcrc0=xQ),inference(cn,[status(thm)],[909,theory(equality)])).
% cnf(911,negated_conjecture,($false),inference(sr,[status(thm)],[910,388,theory(equality)])).
% cnf(912,negated_conjecture,($false),911,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 289
% # ...of these trivial : 2
% # ...subsumed : 19
% # ...remaining for further processing: 268
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 0
% # Generated clauses : 410
% # ...of the previous two non-trivial : 360
% # Contextual simplify-reflections : 24
% # Paramodulations : 379
% # Factorizations : 0
% # Equation resolutions : 31
% # Current number of processed clauses: 147
% # Positive orientable unit clauses: 19
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 10
% # Non-unit-clauses : 118
% # Current number of unprocessed clauses: 302
% # ...number of literals in the above : 1668
% # Clause-clause subsumption calls (NU) : 735
% # Rec. Clause-clause subsumption calls : 294
% # Unit Clause-clause subsumption calls : 158
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 132 leaves, 1.40+/-0.984 terms/leaf
% # Paramod-from index: 66 leaves, 1.02+/-0.122 terms/leaf
% # Paramod-into index: 121 leaves, 1.24+/-0.716 terms/leaf
% # -------------------------------------------------
% # User time : 0.050 s
% # System time : 0.006 s
% # Total time : 0.056 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.23 WC
% FINAL PrfWatch: 0.17 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP13235/NUM549+1.tptp
%
%------------------------------------------------------------------------------