TSTP Solution File: SYN358+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SYN358+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 : art03.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:25:08 EST 2010

% Result   : Theorem 0.87s
% Output   : Solution 0.87s
% 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/SystemOnTPTP30513/SYN358+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP30513/SYN358+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30513/SYN358+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 30609
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time   : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(?[X1]:(p&big_q(X1))<=>(p&?[X1]:big_q(X1))),file('/tmp/SRASS.s.p', x2109)).
% fof(2, negated_conjecture,~((?[X1]:(p&big_q(X1))<=>(p&?[X1]:big_q(X1)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((![X1]:(~(p)|~(big_q(X1)))|(~(p)|![X1]:~(big_q(X1))))&(?[X1]:(p&big_q(X1))|(p&?[X1]:big_q(X1)))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((![X2]:(~(p)|~(big_q(X2)))|(~(p)|![X3]:~(big_q(X3))))&(?[X4]:(p&big_q(X4))|(p&?[X5]:big_q(X5)))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((![X2]:(~(p)|~(big_q(X2)))|(~(p)|![X3]:~(big_q(X3))))&((p&big_q(esk1_0))|(p&big_q(esk2_0)))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X2]:![X3]:(((~(big_q(X3))|~(p))|(~(p)|~(big_q(X2))))&((p&big_q(esk1_0))|(p&big_q(esk2_0)))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X2]:![X3]:(((~(big_q(X3))|~(p))|(~(p)|~(big_q(X2))))&(((p|p)&(big_q(esk2_0)|p))&((p|big_q(esk1_0))&(big_q(esk2_0)|big_q(esk1_0))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(big_q(esk1_0)|big_q(esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(p|p),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(~big_q(X1)|~p|~p|~big_q(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,($false|~big_q(X2)|~big_q(X1)),inference(rw,[status(thm)],[12,11,theory(equality)])).
% cnf(14,negated_conjecture,(~big_q(X2)|~big_q(X1)),inference(cn,[status(thm)],[13,theory(equality)])).
% fof(15, plain,(~(epred1_0)<=>![X2]:~(big_q(X2))),introduced(definition),['split']).
% cnf(16,plain,(epred1_0|~big_q(X2)),inference(split_equiv,[status(thm)],[15])).
% fof(17, plain,(~(epred2_0)<=>![X1]:~(big_q(X1))),introduced(definition),['split']).
% cnf(18,plain,(epred2_0|~big_q(X1)),inference(split_equiv,[status(thm)],[17])).
% cnf(19,negated_conjecture,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[14,15,theory(equality)]),17,theory(equality)]),['split']).
% cnf(22,negated_conjecture,(epred1_0|big_q(esk1_0)),inference(pm,[status(thm)],[16,8,theory(equality)])).
% cnf(23,negated_conjecture,(epred2_0|big_q(esk1_0)),inference(pm,[status(thm)],[18,8,theory(equality)])).
% cnf(24,negated_conjecture,(epred1_0),inference(pm,[status(thm)],[16,22,theory(equality)])).
% cnf(28,negated_conjecture,(~epred2_0|$false),inference(rw,[status(thm)],[19,24,theory(equality)])).
% cnf(29,negated_conjecture,(~epred2_0),inference(cn,[status(thm)],[28,theory(equality)])).
% cnf(32,negated_conjecture,(big_q(esk1_0)),inference(sr,[status(thm)],[23,29,theory(equality)])).
% cnf(33,negated_conjecture,(epred2_0),inference(pm,[status(thm)],[18,32,theory(equality)])).
% cnf(35,negated_conjecture,($false),inference(sr,[status(thm)],[33,29,theory(equality)])).
% cnf(36,negated_conjecture,($false),35,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                : 13
% # ...of these trivial              : 2
% # ...subsumed                      : 0
% # ...remaining for further processing: 11
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                : 0
% # Backward-rewritten               : 4
% # Generated clauses                : 11
% # ...of the previous two non-trivial : 11
% # Contextual simplify-reflections  : 0
% # Paramodulations                  : 7
% # Factorizations                   : 0
% # Equation resolutions             : 0
% # Current number of processed clauses: 5
% #    Positive orientable unit clauses: 3
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses         : 1
% #    Non-unit-clauses              : 1
% # Current number of unprocessed clauses: 0
% # ...number of literals in the above : 0
% # Clause-clause subsumption calls (NU) : 6
% # Rec. Clause-clause subsumption calls : 6
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts      : 2
% # Indexed BW rewrite successes     : 2
% # Backwards rewriting index:     7 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-from index:            3 leaves,   1.00+/-0.000 terms/leaf
% # Paramod-into index:            6 leaves,   1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time            : 0.006 s
% # System time          : 0.004 s
% # Total time           : 0.010 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/SystemOnTPTP30513/SYN358+1.tptp
% 
%------------------------------------------------------------------------------