TSTP Solution File: NUM625+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM625+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 : art01.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:41:19 EST 2010
% Result : Theorem 2.76s
% Output : Solution 2.76s
% 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/SystemOnTPTP16909/NUM625+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16909/NUM625+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16909/NUM625+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 17005
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.603 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(87, axiom,((aElementOf0(xp,xQ)&![X1]:(aElementOf0(X1,xQ)=>sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),file('/tmp/SRASS.s.p', m__5147)).
% fof(97, axiom,(((aElement0(xx)&aElementOf0(xx,xQ))&~(xx=szmzizndt0(xQ)))&aElementOf0(xx,xP)),file('/tmp/SRASS.s.p', m__5348)).
% fof(104, axiom,xp=xx,file('/tmp/SRASS.s.p', m__5496)).
% fof(4627, plain,((aElementOf0(xp,xQ)&![X1]:(~(aElementOf0(X1,xQ))|sdtlseqdt0(xp,X1)))&xp=szmzizndt0(xQ)),inference(fof_nnf,[status(thm)],[87])).
% fof(4628, plain,((aElementOf0(xp,xQ)&![X2]:(~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2)))&xp=szmzizndt0(xQ)),inference(variable_rename,[status(thm)],[4627])).
% fof(4629, plain,![X2]:(((~(aElementOf0(X2,xQ))|sdtlseqdt0(xp,X2))&aElementOf0(xp,xQ))&xp=szmzizndt0(xQ)),inference(shift_quantors,[status(thm)],[4628])).
% cnf(4630,plain,(xp=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[4629])).
% cnf(4668,plain,(xx!=szmzizndt0(xQ)),inference(split_conjunct,[status(thm)],[97])).
% cnf(4694,plain,(xp=xx),inference(split_conjunct,[status(thm)],[104])).
% cnf(5418,plain,(xp!=xx),inference(rw,[status(thm)],[4668,4630,theory(equality)])).
% cnf(5419,plain,($false),inference(rw,[status(thm)],[5418,4694,theory(equality)])).
% cnf(5420,plain,($false),inference(cn,[status(thm)],[5419,theory(equality)])).
% cnf(5421,plain,($false),5420,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 36
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 33
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 3568
% # ...number of literals in the above : 39106
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 50 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 31 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 49 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.578 s
% # System time : 0.027 s
% # Total time : 0.605 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.54 CPU 1.59 WC
% FINAL PrfWatch: 1.54 CPU 1.59 WC
% SZS output end Solution for /tmp/SystemOnTPTP16909/NUM625+3.tptp
%
%------------------------------------------------------------------------------