TSTP Solution File: NUM610+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM610+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 : 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:37:01 EST 2010
% Result : Theorem 13.94s
% Output : Solution 13.94s
% 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/SystemOnTPTP13353/NUM610+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13353/NUM610+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13353/NUM610+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 13449
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.92 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% PrfWatch: 9.89 CPU 10.03 WC
% # Preprocessing time : 0.613 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.52 CPU 12.03 WC
% # SZS output start CNFRefutation.
% fof(83, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),file('/tmp/SRASS.s.p', m__5078)).
% fof(88, axiom,(((aSet0(xP)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(szmzizndt0(xQ),X1)))&![X1]:(aElementOf0(X1,xP)<=>((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=szmzizndt0(xQ)))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),file('/tmp/SRASS.s.p', m__5164)).
% fof(108, conjecture,(![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xO))|aSubsetOf0(xP,xO)),file('/tmp/SRASS.s.p', m__)).
% fof(109, negated_conjecture,~((![X1]:(aElementOf0(X1,xP)=>aElementOf0(X1,xO))|aSubsetOf0(xP,xO))),inference(assume_negation,[status(cth)],[108])).
% fof(4585, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(fof_nnf,[status(thm)],[83])).
% fof(4586, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xO)))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(variable_rename,[status(thm)],[4585])).
% fof(4587, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xO))&aSet0(xQ))&aSubsetOf0(xQ,xO))&sbrdtbr0(xQ)=xK)&aElementOf0(xQ,slbdtsldtrb0(xO,xK))),inference(shift_quantors,[status(thm)],[4586])).
% cnf(4592,plain,(aElementOf0(X1,xO)|~aElementOf0(X1,xQ)),inference(split_conjunct,[status(thm)],[4587])).
% fof(4619, plain,(((aSet0(xP)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(szmzizndt0(xQ),X1)))&![X1]:((~(aElementOf0(X1,xP))|((aElement0(X1)&aElementOf0(X1,xQ))&~(X1=szmzizndt0(xQ))))&(((~(aElement0(X1))|~(aElementOf0(X1,xQ)))|X1=szmzizndt0(xQ))|aElementOf0(X1,xP))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(fof_nnf,[status(thm)],[88])).
% fof(4620, plain,(((aSet0(xP)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2)))&![X3]:((~(aElementOf0(X3,xP))|((aElement0(X3)&aElementOf0(X3,xQ))&~(X3=szmzizndt0(xQ))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP))))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(variable_rename,[status(thm)],[4619])).
% fof(4621, plain,![X2]:![X3]:((((~(aElementOf0(X3,xP))|((aElement0(X3)&aElementOf0(X3,xQ))&~(X3=szmzizndt0(xQ))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP)))&((~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2))&aSet0(xP)))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(shift_quantors,[status(thm)],[4620])).
% fof(4622, plain,![X2]:![X3]:((((((aElement0(X3)|~(aElementOf0(X3,xP)))&(aElementOf0(X3,xQ)|~(aElementOf0(X3,xP))))&(~(X3=szmzizndt0(xQ))|~(aElementOf0(X3,xP))))&(((~(aElement0(X3))|~(aElementOf0(X3,xQ)))|X3=szmzizndt0(xQ))|aElementOf0(X3,xP)))&((~(aElementOf0(X2,xQ))|sdtlseqdt0(szmzizndt0(xQ),X2))&aSet0(xP)))&xP=sdtmndt0(xQ,szmzizndt0(xQ))),inference(distribute,[status(thm)],[4621])).
% cnf(4628,plain,(aElementOf0(X1,xQ)|~aElementOf0(X1,xP)),inference(split_conjunct,[status(thm)],[4622])).
% fof(4709, negated_conjecture,(?[X1]:(aElementOf0(X1,xP)&~(aElementOf0(X1,xO)))&~(aSubsetOf0(xP,xO))),inference(fof_nnf,[status(thm)],[109])).
% fof(4710, negated_conjecture,(?[X2]:(aElementOf0(X2,xP)&~(aElementOf0(X2,xO)))&~(aSubsetOf0(xP,xO))),inference(variable_rename,[status(thm)],[4709])).
% fof(4711, negated_conjecture,((aElementOf0(esk41_0,xP)&~(aElementOf0(esk41_0,xO)))&~(aSubsetOf0(xP,xO))),inference(skolemize,[status(esa)],[4710])).
% cnf(4713,negated_conjecture,(~aElementOf0(esk41_0,xO)),inference(split_conjunct,[status(thm)],[4711])).
% cnf(4714,negated_conjecture,(aElementOf0(esk41_0,xP)),inference(split_conjunct,[status(thm)],[4711])).
% cnf(8478,plain,(aElementOf0(X1,xO)|~aElementOf0(X1,xP)),inference(spm,[status(thm)],[4592,4628,theory(equality)])).
% cnf(81601,negated_conjecture,(~aElementOf0(esk41_0,xP)),inference(spm,[status(thm)],[4713,8478,theory(equality)])).
% cnf(81740,negated_conjecture,($false),inference(rw,[status(thm)],[81601,4714,theory(equality)])).
% cnf(81741,negated_conjecture,($false),inference(cn,[status(thm)],[81740,theory(equality)])).
% cnf(81742,negated_conjecture,($false),81741,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6642
% # ...of these trivial : 4
% # ...subsumed : 532
% # ...remaining for further processing: 6106
% # Other redundant clauses eliminated : 15
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 0
% # Generated clauses : 57061
% # ...of the previous two non-trivial : 48277
% # Contextual simplify-reflections : 3069
% # Paramodulations : 57011
% # Factorizations : 0
% # Equation resolutions : 45
% # Current number of processed clauses: 3054
% # Positive orientable unit clauses: 56
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 8
% # Non-unit-clauses : 2990
% # Current number of unprocessed clauses: 48257
% # ...number of literals in the above : 718213
% # Clause-clause subsumption calls (NU) : 1852436
% # Rec. Clause-clause subsumption calls : 45430
% # Unit Clause-clause subsumption calls : 15110
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 372 leaves, 2.26+/-2.908 terms/leaf
% # Paramod-from index: 171 leaves, 1.01+/-0.108 terms/leaf
% # Paramod-into index: 328 leaves, 1.62+/-1.565 terms/leaf
% # -------------------------------------------------
% # User time : 9.838 s
% # System time : 0.215 s
% # Total time : 10.052 s
% # Maximum resident set size: 0 pages
% PrfWatch: 12.87 CPU 13.72 WC
% FINAL PrfWatch: 12.87 CPU 13.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP13353/NUM610+3.tptp
%
%------------------------------------------------------------------------------