TSTP Solution File: NUM565+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM565+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.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:07:48 EST 2010
% Result : Theorem 9.86s
% Output : Solution 9.86s
% 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/SystemOnTPTP27107/NUM565+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27107/NUM565+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27107/NUM565+3.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 27203
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.56 CPU 2.02 WC
% PrfWatch: 3.20 CPU 4.03 WC
% PrfWatch: 5.20 CPU 6.03 WC
% # Preprocessing time : 0.536 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.20 CPU 8.03 WC
% # SZS output start CNFRefutation.
% fof(13, axiom,![X1]:(aSet0(X1)=>(sbrdtbr0(X1)=sz00<=>X1=slcrc0)),file('/tmp/SRASS.s.p', mCardEmpty)).
% fof(80, conjecture,![X1]:(((((aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>aElementOf0(X2,xS)))&aSubsetOf0(X1,xS))&sbrdtbr0(X1)=sz00)&aElementOf0(X1,slbdtsldtrb0(xS,sz00)))=>((aSet0(slcrc0)&~(?[X2]:aElementOf0(X2,slcrc0)))=>sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0))),file('/tmp/SRASS.s.p', m__)).
% fof(81, negated_conjecture,~(![X1]:(((((aSet0(X1)&![X2]:(aElementOf0(X2,X1)=>aElementOf0(X2,xS)))&aSubsetOf0(X1,xS))&sbrdtbr0(X1)=sz00)&aElementOf0(X1,slbdtsldtrb0(xS,sz00)))=>((aSet0(slcrc0)&~(?[X2]:aElementOf0(X2,slcrc0)))=>sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0)))),inference(assume_negation,[status(cth)],[80])).
% fof(139, plain,![X1]:(~(aSet0(X1))|((~(sbrdtbr0(X1)=sz00)|X1=slcrc0)&(~(X1=slcrc0)|sbrdtbr0(X1)=sz00))),inference(fof_nnf,[status(thm)],[13])).
% fof(140, plain,![X2]:(~(aSet0(X2))|((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)&(~(X2=slcrc0)|sbrdtbr0(X2)=sz00))),inference(variable_rename,[status(thm)],[139])).
% fof(141, plain,![X2]:(((~(sbrdtbr0(X2)=sz00)|X2=slcrc0)|~(aSet0(X2)))&((~(X2=slcrc0)|sbrdtbr0(X2)=sz00)|~(aSet0(X2)))),inference(distribute,[status(thm)],[140])).
% cnf(143,plain,(X1=slcrc0|~aSet0(X1)|sbrdtbr0(X1)!=sz00),inference(split_conjunct,[status(thm)],[141])).
% fof(4448, negated_conjecture,?[X1]:(((((aSet0(X1)&![X2]:(~(aElementOf0(X2,X1))|aElementOf0(X2,xS)))&aSubsetOf0(X1,xS))&sbrdtbr0(X1)=sz00)&aElementOf0(X1,slbdtsldtrb0(xS,sz00)))&((aSet0(slcrc0)&![X2]:~(aElementOf0(X2,slcrc0)))&~(sdtlpdtrp0(xc,X1)=sdtlpdtrp0(xc,slcrc0)))),inference(fof_nnf,[status(thm)],[81])).
% fof(4449, negated_conjecture,?[X3]:(((((aSet0(X3)&![X4]:(~(aElementOf0(X4,X3))|aElementOf0(X4,xS)))&aSubsetOf0(X3,xS))&sbrdtbr0(X3)=sz00)&aElementOf0(X3,slbdtsldtrb0(xS,sz00)))&((aSet0(slcrc0)&![X5]:~(aElementOf0(X5,slcrc0)))&~(sdtlpdtrp0(xc,X3)=sdtlpdtrp0(xc,slcrc0)))),inference(variable_rename,[status(thm)],[4448])).
% fof(4450, negated_conjecture,(((((aSet0(esk30_0)&![X4]:(~(aElementOf0(X4,esk30_0))|aElementOf0(X4,xS)))&aSubsetOf0(esk30_0,xS))&sbrdtbr0(esk30_0)=sz00)&aElementOf0(esk30_0,slbdtsldtrb0(xS,sz00)))&((aSet0(slcrc0)&![X5]:~(aElementOf0(X5,slcrc0)))&~(sdtlpdtrp0(xc,esk30_0)=sdtlpdtrp0(xc,slcrc0)))),inference(skolemize,[status(esa)],[4449])).
% fof(4451, negated_conjecture,![X4]:![X5]:(((~(aElementOf0(X5,slcrc0))&aSet0(slcrc0))&~(sdtlpdtrp0(xc,esk30_0)=sdtlpdtrp0(xc,slcrc0)))&(((((~(aElementOf0(X4,esk30_0))|aElementOf0(X4,xS))&aSet0(esk30_0))&aSubsetOf0(esk30_0,xS))&sbrdtbr0(esk30_0)=sz00)&aElementOf0(esk30_0,slbdtsldtrb0(xS,sz00)))),inference(shift_quantors,[status(thm)],[4450])).
% cnf(4453,negated_conjecture,(sbrdtbr0(esk30_0)=sz00),inference(split_conjunct,[status(thm)],[4451])).
% cnf(4455,negated_conjecture,(aSet0(esk30_0)),inference(split_conjunct,[status(thm)],[4451])).
% cnf(4457,negated_conjecture,(sdtlpdtrp0(xc,esk30_0)!=sdtlpdtrp0(xc,slcrc0)),inference(split_conjunct,[status(thm)],[4451])).
% cnf(9584,negated_conjecture,(slcrc0=esk30_0|~aSet0(esk30_0)),inference(spm,[status(thm)],[143,4453,theory(equality)])).
% cnf(9586,negated_conjecture,(slcrc0=esk30_0|$false),inference(rw,[status(thm)],[9584,4455,theory(equality)])).
% cnf(9587,negated_conjecture,(slcrc0=esk30_0),inference(cn,[status(thm)],[9586,theory(equality)])).
% cnf(52358,negated_conjecture,($false),inference(rw,[status(thm)],[4457,9587,theory(equality)])).
% cnf(52359,negated_conjecture,($false),inference(cn,[status(thm)],[52358,theory(equality)])).
% cnf(52360,negated_conjecture,($false),52359,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5388
% # ...of these trivial : 2
% # ...subsumed : 254
% # ...remaining for further processing: 5132
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 19
% # Generated clauses : 40085
% # ...of the previous two non-trivial : 29760
% # Contextual simplify-reflections : 2460
% # Paramodulations : 40047
% # Factorizations : 0
% # Equation resolutions : 38
% # Current number of processed clauses: 2547
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 2529
% # Current number of unprocessed clauses: 28525
% # ...number of literals in the above : 469693
% # Clause-clause subsumption calls (NU) : 369565
% # Rec. Clause-clause subsumption calls : 38300
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 202 leaves, 2.39+/-2.837 terms/leaf
% # Paramod-from index: 80 leaves, 1.01+/-0.111 terms/leaf
% # Paramod-into index: 165 leaves, 1.67+/-1.593 terms/leaf
% # -------------------------------------------------
% # User time : 6.330 s
% # System time : 0.118 s
% # Total time : 6.448 s
% # Maximum resident set size: 0 pages
% PrfWatch: 8.87 CPU 9.84 WC
% FINAL PrfWatch: 8.87 CPU 9.84 WC
% SZS output end Solution for /tmp/SystemOnTPTP27107/NUM565+3.tptp
%
%------------------------------------------------------------------------------