TSTP Solution File: SYN051+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN051+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 : art02.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:16:48 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/SystemOnTPTP7868/SYN051+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP7868/SYN051+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7868/SYN051+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 7964
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,?[X1]:(p=>big_f(X1)),file('/tmp/SRASS.s.p', pel21_1)).
% fof(2, axiom,?[X1]:(big_f(X1)=>p),file('/tmp/SRASS.s.p', pel21_2)).
% fof(3, conjecture,?[X1]:(p<=>big_f(X1)),file('/tmp/SRASS.s.p', pel21)).
% fof(4, negated_conjecture,~(?[X1]:(p<=>big_f(X1))),inference(assume_negation,[status(cth)],[3])).
% fof(5, plain,?[X1]:(~(p)|big_f(X1)),inference(fof_nnf,[status(thm)],[1])).
% fof(6, plain,?[X2]:(~(p)|big_f(X2)),inference(variable_rename,[status(thm)],[5])).
% fof(7, plain,(~(p)|big_f(esk1_0)),inference(skolemize,[status(esa)],[6])).
% cnf(8,plain,(big_f(esk1_0)|~p),inference(split_conjunct,[status(thm)],[7])).
% fof(9, plain,?[X1]:(~(big_f(X1))|p),inference(fof_nnf,[status(thm)],[2])).
% fof(10, plain,?[X2]:(~(big_f(X2))|p),inference(variable_rename,[status(thm)],[9])).
% fof(11, plain,(~(big_f(esk2_0))|p),inference(skolemize,[status(esa)],[10])).
% cnf(12,plain,(p|~big_f(esk2_0)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, negated_conjecture,![X1]:((~(p)|~(big_f(X1)))&(p|big_f(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(14, negated_conjecture,![X2]:((~(p)|~(big_f(X2)))&(p|big_f(X2))),inference(variable_rename,[status(thm)],[13])).
% cnf(15,negated_conjecture,(big_f(X1)|p),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,negated_conjecture,(~big_f(X1)|~p),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(big_f(esk1_0)),inference(csr,[status(thm)],[8,15])).
% cnf(18,plain,(p),inference(csr,[status(thm)],[12,15])).
% cnf(19,negated_conjecture,(~big_f(X1)|$false),inference(rw,[status(thm)],[16,18,theory(equality)])).
% cnf(20,negated_conjecture,(~big_f(X1)),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(22,plain,($false),inference(sr,[status(thm)],[17,20,theory(equality)])).
% cnf(23,plain,($false),22,['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 : 0
% # Backward-rewritten : 2
% # Generated clauses : 1
% # ...of the previous two non-trivial : 1
% # Contextual simplify-reflections : 2
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 2
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 2
% # Rec. Clause-clause subsumption calls : 2
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 1
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 3 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 1 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 2 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.007 s
% # System time : 0.002 s
% # Total time : 0.009 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP7868/SYN051+1.tptp
%
%------------------------------------------------------------------------------