TSTP Solution File: NUM551+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM551+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 : 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:08:39 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/SystemOnTPTP13935/NUM551+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13935/NUM551+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13935/NUM551+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 14067
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.01 CPU 0.02 WC
% # Preprocessing time : 0.025 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(20, axiom,((((aSet0(xQ)&![X1]:(aElementOf0(X1,xQ)=>aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),file('/tmp/SRASS.s.p', m__2270)).
% fof(22, axiom,~((~(?[X1]:aElementOf0(X1,xQ))|xQ=slcrc0)),file('/tmp/SRASS.s.p', m__2313)).
% fof(68, conjecture,?[X1]:(aElement0(X1)&aElementOf0(X1,xQ)),file('/tmp/SRASS.s.p', m__)).
% fof(69, negated_conjecture,~(?[X1]:(aElement0(X1)&aElementOf0(X1,xQ))),inference(assume_negation,[status(cth)],[68])).
% fof(81, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(82, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[81])).
% fof(83, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[82])).
% cnf(84,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[83])).
% fof(187, plain,((((aSet0(xQ)&![X1]:(~(aElementOf0(X1,xQ))|aElementOf0(X1,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(fof_nnf,[status(thm)],[20])).
% fof(188, plain,((((aSet0(xQ)&![X2]:(~(aElementOf0(X2,xQ))|aElementOf0(X2,xS)))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(variable_rename,[status(thm)],[187])).
% fof(189, plain,![X2]:(((((~(aElementOf0(X2,xQ))|aElementOf0(X2,xS))&aSet0(xQ))&aSubsetOf0(xQ,xS))&sbrdtbr0(xQ)=xk)&aElementOf0(xQ,slbdtsldtrb0(xS,xk))),inference(shift_quantors,[status(thm)],[188])).
% cnf(193,plain,(aSet0(xQ)),inference(split_conjunct,[status(thm)],[189])).
% fof(198, plain,(?[X1]:aElementOf0(X1,xQ)&~(xQ=slcrc0)),inference(fof_nnf,[status(thm)],[22])).
% fof(199, plain,(?[X2]:aElementOf0(X2,xQ)&~(xQ=slcrc0)),inference(variable_rename,[status(thm)],[198])).
% fof(200, plain,(aElementOf0(esk8_0,xQ)&~(xQ=slcrc0)),inference(skolemize,[status(esa)],[199])).
% cnf(202,plain,(aElementOf0(esk8_0,xQ)),inference(split_conjunct,[status(thm)],[200])).
% fof(399, negated_conjecture,![X1]:(~(aElement0(X1))|~(aElementOf0(X1,xQ))),inference(fof_nnf,[status(thm)],[69])).
% fof(400, negated_conjecture,![X2]:(~(aElement0(X2))|~(aElementOf0(X2,xQ))),inference(variable_rename,[status(thm)],[399])).
% cnf(401,negated_conjecture,(~aElementOf0(X1,xQ)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[400])).
% cnf(471,plain,(aElement0(esk8_0)|~aSet0(xQ)),inference(spm,[status(thm)],[84,202,theory(equality)])).
% cnf(477,plain,(aElement0(esk8_0)|$false),inference(rw,[status(thm)],[471,193,theory(equality)])).
% cnf(478,plain,(aElement0(esk8_0)),inference(cn,[status(thm)],[477,theory(equality)])).
% cnf(1222,negated_conjecture,(~aElementOf0(esk8_0,xQ)),inference(spm,[status(thm)],[401,478,theory(equality)])).
% cnf(1225,negated_conjecture,($false),inference(rw,[status(thm)],[1222,202,theory(equality)])).
% cnf(1226,negated_conjecture,($false),inference(cn,[status(thm)],[1225,theory(equality)])).
% cnf(1227,negated_conjecture,($false),1226,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 294
% # ...of these trivial : 2
% # ...subsumed : 7
% # ...remaining for further processing: 285
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 511
% # ...of the previous two non-trivial : 460
% # Contextual simplify-reflections : 19
% # Paramodulations : 480
% # Factorizations : 0
% # Equation resolutions : 31
% # Current number of processed clauses: 142
% # Positive orientable unit clauses: 21
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 118
% # Current number of unprocessed clauses: 453
% # ...number of literals in the above : 2159
% # Clause-clause subsumption calls (NU) : 545
% # Rec. Clause-clause subsumption calls : 264
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 132 leaves, 1.41+/-0.969 terms/leaf
% # Paramod-from index: 66 leaves, 1.02+/-0.122 terms/leaf
% # Paramod-into index: 118 leaves, 1.25+/-0.703 terms/leaf
% # -------------------------------------------------
% # User time : 0.061 s
% # System time : 0.002 s
% # Total time : 0.063 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.24 WC
% FINAL PrfWatch: 0.19 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP13935/NUM551+3.tptp
%
%------------------------------------------------------------------------------