%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN063+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 : art05.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:18:09 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP23092/SYN063+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP23092/SYN063+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23092/SYN063+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 23188
% 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]:((big_p(a)&(big_p(X1)=>big_p(b)))=>big_p(c))<=>![X2]:(((~(big_p(a))|big_p(X2))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c)))),file('/tmp/SRASS.s.p', pel33)).
% fof(2, negated_conjecture,~((![X1]:((big_p(a)&(big_p(X1)=>big_p(b)))=>big_p(c))<=>![X2]:(((~(big_p(a))|big_p(X2))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c))))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,~((![X1]:((big_p(a)&(big_p(X1)=>big_p(b)))=>big_p(c))<=>![X2]:(((~(big_p(a))|big_p(X2))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c))))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(4, negated_conjecture,((?[X1]:((big_p(a)&(~(big_p(X1))|big_p(b)))&~(big_p(c)))|?[X2]:(((big_p(a)&~(big_p(X2)))&~(big_p(c)))|((big_p(a)&big_p(b))&~(big_p(c)))))&(![X1]:((~(big_p(a))|(big_p(X1)&~(big_p(b))))|big_p(c))|![X2]:(((~(big_p(a))|big_p(X2))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c))))),inference(fof_nnf,[status(thm)],[3])).
% fof(5, negated_conjecture,((?[X3]:((big_p(a)&(~(big_p(X3))|big_p(b)))&~(big_p(c)))|?[X4]:(((big_p(a)&~(big_p(X4)))&~(big_p(c)))|((big_p(a)&big_p(b))&~(big_p(c)))))&(![X5]:((~(big_p(a))|(big_p(X5)&~(big_p(b))))|big_p(c))|![X6]:(((~(big_p(a))|big_p(X6))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c))))),inference(variable_rename,[status(thm)],[4])).
% fof(6, negated_conjecture,((((big_p(a)&(~(big_p(esk1_0))|big_p(b)))&~(big_p(c)))|(((big_p(a)&~(big_p(esk2_0)))&~(big_p(c)))|((big_p(a)&big_p(b))&~(big_p(c)))))&(![X5]:((~(big_p(a))|(big_p(X5)&~(big_p(b))))|big_p(c))|![X6]:(((~(big_p(a))|big_p(X6))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c))))),inference(skolemize,[status(esa)],[5])).
% fof(7, negated_conjecture,![X5]:![X6]:(((((~(big_p(a))|big_p(X6))|big_p(c))&((~(big_p(a))|~(big_p(b)))|big_p(c)))|((~(big_p(a))|(big_p(X5)&~(big_p(b))))|big_p(c)))&(((big_p(a)&(~(big_p(esk1_0))|big_p(b)))&~(big_p(c)))|(((big_p(a)&~(big_p(esk2_0)))&~(big_p(c)))|((big_p(a)&big_p(b))&~(big_p(c)))))),inference(shift_quantors,[status(thm)],[6])).
% fof(8, negated_conjecture,![X5]:![X6]:((((((big_p(X5)|~(big_p(a)))|big_p(c))|((~(big_p(a))|big_p(X6))|big_p(c)))&(((~(big_p(b))|~(big_p(a)))|big_p(c))|((~(big_p(a))|big_p(X6))|big_p(c))))&((((big_p(X5)|~(big_p(a)))|big_p(c))|((~(big_p(a))|~(big_p(b)))|big_p(c)))&(((~(big_p(b))|~(big_p(a)))|big_p(c))|((~(big_p(a))|~(big_p(b)))|big_p(c)))))&((((((((big_p(a)|big_p(a))|big_p(a))&((big_p(b)|big_p(a))|big_p(a)))&((~(big_p(c))|big_p(a))|big_p(a)))&((((big_p(a)|~(big_p(esk2_0)))|big_p(a))&((big_p(b)|~(big_p(esk2_0)))|big_p(a)))&((~(big_p(c))|~(big_p(esk2_0)))|big_p(a))))&((((big_p(a)|~(big_p(c)))|big_p(a))&((big_p(b)|~(big_p(c)))|big_p(a)))&((~(big_p(c))|~(big_p(c)))|big_p(a))))&((((((big_p(a)|big_p(a))|(~(big_p(esk1_0))|big_p(b)))&((big_p(b)|big_p(a))|(~(big_p(esk1_0))|big_p(b))))&((~(big_p(c))|big_p(a))|(~(big_p(esk1_0))|big_p(b))))&((((big_p(a)|~(big_p(esk2_0)))|(~(big_p(esk1_0))|big_p(b)))&((big_p(b)|~(big_p(esk2_0)))|(~(big_p(esk1_0))|big_p(b))))&((~(big_p(c))|~(big_p(esk2_0)))|(~(big_p(esk1_0))|big_p(b)))))&((((big_p(a)|~(big_p(c)))|(~(big_p(esk1_0))|big_p(b)))&((big_p(b)|~(big_p(c)))|(~(big_p(esk1_0))|big_p(b))))&((~(big_p(c))|~(big_p(c)))|(~(big_p(esk1_0))|big_p(b))))))&((((((big_p(a)|big_p(a))|~(big_p(c)))&((big_p(b)|big_p(a))|~(big_p(c))))&((~(big_p(c))|big_p(a))|~(big_p(c))))&((((big_p(a)|~(big_p(esk2_0)))|~(big_p(c)))&((big_p(b)|~(big_p(esk2_0)))|~(big_p(c))))&((~(big_p(c))|~(big_p(esk2_0)))|~(big_p(c)))))&((((big_p(a)|~(big_p(c)))|~(big_p(c)))&((big_p(b)|~(big_p(c)))|~(big_p(c))))&((~(big_p(c))|~(big_p(c)))|~(big_p(c))))))),inference(distribute,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~big_p(c)|~big_p(c)|~big_p(c)),inference(split_conjunct,[status(thm)],[8])).
% cnf(35,negated_conjecture,(big_p(a)|big_p(a)|big_p(a)),inference(split_conjunct,[status(thm)],[8])).
% cnf(36,negated_conjecture,(big_p(c)|big_p(c)|~big_p(b)|~big_p(a)|~big_p(a)|~big_p(b)),inference(split_conjunct,[status(thm)],[8])).
% cnf(39,negated_conjecture,(big_p(c)|big_p(X1)|big_p(c)|big_p(X2)|~big_p(a)|~big_p(a)),inference(split_conjunct,[status(thm)],[8])).
% cnf(55,negated_conjecture,(big_p(c)|$false|~big_p(b)),inference(rw,[status(thm)],[36,35,theory(equality)])).
% cnf(56,negated_conjecture,(big_p(c)|~big_p(b)),inference(cn,[status(thm)],[55,theory(equality)])).
% cnf(57,negated_conjecture,(~big_p(b)),inference(sr,[status(thm)],[56,9,theory(equality)])).
% cnf(68,negated_conjecture,(big_p(X2)|big_p(X1)|big_p(c)|$false),inference(rw,[status(thm)],[39,35,theory(equality)])).
% cnf(69,negated_conjecture,(big_p(X2)|big_p(X1)|big_p(c)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(70,negated_conjecture,(big_p(X2)|big_p(X1)),inference(sr,[status(thm)],[69,9,theory(equality)])).
% cnf(71,negated_conjecture,(big_p(X3)),inference(ef,[status(thm)],[70,theory(equality)])).
% cnf(80,negated_conjecture,($false),inference(rw,[status(thm)],[57,71,theory(equality)])).
% cnf(81,negated_conjecture,($false),inference(cn,[status(thm)],[80,theory(equality)])).
% cnf(82,negated_conjecture,($false),81,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 37
% # ...of these trivial : 18
% # ...subsumed : 8
% # ...remaining for further processing: 11
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 4
% # Generated clauses : 8
% # ...of the previous two non-trivial : 8
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 1
% # Positive orientable unit clauses: 1
% # 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) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-from index: 1 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 1 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.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP23092/SYN063+1.tptp
%
%------------------------------------------------------------------------------