%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN724+1 : TPTP v5.0.0. Released v2.5.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 : Thu Dec 30 09:59:14 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP14329/SYN724+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14329/SYN724+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14329/SYN724+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 14425
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, conjecture,(![X1]:(r(X1)=>s(X1))<=>![X1]:((r(X1)&s(X1))<=>r(X1))),file('/tmp/SRASS.s.p', thm31)).
% fof(2, negated_conjecture,~((![X1]:(r(X1)=>s(X1))<=>![X1]:((r(X1)&s(X1))<=>r(X1)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((?[X1]:(r(X1)&~(s(X1)))|?[X1]:(((~(r(X1))|~(s(X1)))|~(r(X1)))&((r(X1)&s(X1))|r(X1))))&(![X1]:(~(r(X1))|s(X1))|![X1]:(((~(r(X1))|~(s(X1)))|r(X1))&(~(r(X1))|(r(X1)&s(X1)))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((?[X2]:(r(X2)&~(s(X2)))|?[X3]:(((~(r(X3))|~(s(X3)))|~(r(X3)))&((r(X3)&s(X3))|r(X3))))&(![X4]:(~(r(X4))|s(X4))|![X5]:(((~(r(X5))|~(s(X5)))|r(X5))&(~(r(X5))|(r(X5)&s(X5)))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,(((r(esk1_0)&~(s(esk1_0)))|(((~(r(esk2_0))|~(s(esk2_0)))|~(r(esk2_0)))&((r(esk2_0)&s(esk2_0))|r(esk2_0))))&(![X4]:(~(r(X4))|s(X4))|![X5]:(((~(r(X5))|~(s(X5)))|r(X5))&(~(r(X5))|(r(X5)&s(X5)))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X4]:![X5]:(((((~(r(X5))|~(s(X5)))|r(X5))&(~(r(X5))|(r(X5)&s(X5))))|(~(r(X4))|s(X4)))&((r(esk1_0)&~(s(esk1_0)))|(((~(r(esk2_0))|~(s(esk2_0)))|~(r(esk2_0)))&((r(esk2_0)&s(esk2_0))|r(esk2_0))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X4]:![X5]:(((((~(r(X5))|~(s(X5)))|r(X5))|(~(r(X4))|s(X4)))&(((r(X5)|~(r(X5)))|(~(r(X4))|s(X4)))&((s(X5)|~(r(X5)))|(~(r(X4))|s(X4)))))&(((((~(r(esk2_0))|~(s(esk2_0)))|~(r(esk2_0)))|r(esk1_0))&(((r(esk2_0)|r(esk2_0))|r(esk1_0))&((s(esk2_0)|r(esk2_0))|r(esk1_0))))&((((~(r(esk2_0))|~(s(esk2_0)))|~(r(esk2_0)))|~(s(esk1_0)))&(((r(esk2_0)|r(esk2_0))|~(s(esk1_0)))&((s(esk2_0)|r(esk2_0))|~(s(esk1_0))))))),inference(distribute,[status(thm)],[6])).
% cnf(9,negated_conjecture,(r(esk2_0)|r(esk2_0)|~s(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(~s(esk1_0)|~r(esk2_0)|~s(esk2_0)|~r(esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(12,negated_conjecture,(r(esk1_0)|r(esk2_0)|r(esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(13,negated_conjecture,(r(esk1_0)|~r(esk2_0)|~s(esk2_0)|~r(esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(14,negated_conjecture,(s(X1)|s(X2)|~r(X1)|~r(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(19,negated_conjecture,(r(esk1_0)|~s(esk2_0)),inference(csr,[status(thm)],[13,12])).
% cnf(20,negated_conjecture,(~s(esk1_0)|~s(esk2_0)),inference(csr,[status(thm)],[10,9])).
% cnf(21,negated_conjecture,(s(esk1_0)|s(X1)|r(esk2_0)|~r(X1)),inference(spm,[status(thm)],[14,12,theory(equality)])).
% cnf(22,negated_conjecture,(s(X1)|r(esk2_0)|~r(X1)),inference(csr,[status(thm)],[21,9])).
% cnf(24,negated_conjecture,(r(esk2_0)|~r(esk1_0)),inference(spm,[status(thm)],[9,22,theory(equality)])).
% cnf(26,negated_conjecture,(r(esk2_0)),inference(csr,[status(thm)],[24,12])).
% cnf(27,negated_conjecture,(s(esk2_0)|s(X1)|~r(X1)),inference(spm,[status(thm)],[14,26,theory(equality)])).
% cnf(31,negated_conjecture,(s(esk2_0)),inference(spm,[status(thm)],[27,26,theory(equality)])).
% cnf(33,negated_conjecture,(~s(esk1_0)|$false),inference(rw,[status(thm)],[20,31,theory(equality)])).
% cnf(34,negated_conjecture,(~s(esk1_0)),inference(cn,[status(thm)],[33,theory(equality)])).
% cnf(35,negated_conjecture,(r(esk1_0)|$false),inference(rw,[status(thm)],[19,31,theory(equality)])).
% cnf(36,negated_conjecture,(r(esk1_0)),inference(cn,[status(thm)],[35,theory(equality)])).
% cnf(37,negated_conjecture,(s(esk1_0)|s(X1)|~r(X1)),inference(spm,[status(thm)],[14,36,theory(equality)])).
% cnf(38,negated_conjecture,(s(X1)|~r(X1)),inference(sr,[status(thm)],[37,34,theory(equality)])).
% cnf(39,negated_conjecture,(~r(esk1_0)),inference(spm,[status(thm)],[34,38,theory(equality)])).
% cnf(40,negated_conjecture,($false),inference(rw,[status(thm)],[39,36,theory(equality)])).
% cnf(41,negated_conjecture,($false),inference(cn,[status(thm)],[40,theory(equality)])).
% cnf(42,negated_conjecture,($false),41,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 19
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 17
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 6
% # Generated clauses : 8
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 6
% # Paramodulations : 8
% # 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) : 11
% # Rec. Clause-clause subsumption calls : 10
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 9 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 4 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 7 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP14329/SYN724+1.tptp
%
%------------------------------------------------------------------------------