TSTP Solution File: SYN399+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN399+1 : TPTP v5.0.0. Released v2.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 : Thu Dec 30 09:29:04 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.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/SystemOnTPTP19248/SYN399+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19248/SYN399+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19248/SYN399+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 19344
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.008 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:(f(X1)<=>p)=>(![X2]:f(X2)<=>p)),file('/tmp/SRASS.s.p', kalish223)).
% fof(2, negated_conjecture,~((![X1]:(f(X1)<=>p)=>(![X2]:f(X2)<=>p))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,(![X1]:((~(f(X1))|p)&(~(p)|f(X1)))&((?[X2]:~(f(X2))|~(p))&(![X2]:f(X2)|p))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,(![X3]:((~(f(X3))|p)&(~(p)|f(X3)))&((?[X4]:~(f(X4))|~(p))&(![X5]:f(X5)|p))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(![X3]:((~(f(X3))|p)&(~(p)|f(X3)))&((~(f(esk1_0))|~(p))&(![X5]:f(X5)|p))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X3]:![X5]:(((f(X5)|p)&(~(f(esk1_0))|~(p)))&((~(f(X3))|p)&(~(p)|f(X3)))),inference(shift_quantors,[status(thm)],[5])).
% cnf(7,negated_conjecture,(f(X1)|~p),inference(split_conjunct,[status(thm)],[6])).
% cnf(8,negated_conjecture,(p|~f(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(9,negated_conjecture,(~p|~f(esk1_0)),inference(split_conjunct,[status(thm)],[6])).
% cnf(10,negated_conjecture,(p|f(X1)),inference(split_conjunct,[status(thm)],[6])).
% cnf(11,negated_conjecture,(f(X1)),inference(csr,[status(thm)],[7,10])).
% cnf(12,negated_conjecture,(~p|$false),inference(rw,[status(thm)],[9,11,theory(equality)])).
% cnf(13,negated_conjecture,(~p),inference(cn,[status(thm)],[12,theory(equality)])).
% cnf(14,negated_conjecture,(p|$false),inference(rw,[status(thm)],[8,11,theory(equality)])).
% cnf(15,negated_conjecture,(p),inference(cn,[status(thm)],[14,theory(equality)])).
% cnf(16,negated_conjecture,($false),inference(rw,[status(thm)],[13,15,theory(equality)])).
% cnf(17,negated_conjecture,($false),inference(cn,[status(thm)],[16,theory(equality)])).
% cnf(18,negated_conjecture,($false),17,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 5
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 0
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 1
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 2
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 1
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 2 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.006 s
% # System time : 0.002 s
% # Total time : 0.008 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP19248/SYN399+1.tptp
%
%------------------------------------------------------------------------------