%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN377+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:27:02 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/SystemOnTPTP12448/SYN377+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP12448/SYN377+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12448/SYN377+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 12544
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(X1)<=>![X2]:big_p(X2))<=>(?[X1]:big_p(X1)<=>![X2]:big_p(X2))),file('/tmp/SRASS.s.p', x2128)).
% fof(2, negated_conjecture,~((![X1]:(big_p(X1)<=>![X2]:big_p(X2))<=>(?[X1]:big_p(X1)<=>![X2]:big_p(X2)))),inference(assume_negation,[status(cth)],[1])).
% fof(3, negated_conjecture,((?[X1]:((~(big_p(X1))|?[X2]:~(big_p(X2)))&(big_p(X1)|![X2]:big_p(X2)))|((![X1]:~(big_p(X1))|?[X2]:~(big_p(X2)))&(?[X1]:big_p(X1)|![X2]:big_p(X2))))&(![X1]:((~(big_p(X1))|![X2]:big_p(X2))&(?[X2]:~(big_p(X2))|big_p(X1)))|((![X1]:~(big_p(X1))|![X2]:big_p(X2))&(?[X2]:~(big_p(X2))|?[X1]:big_p(X1))))),inference(fof_nnf,[status(thm)],[2])).
% fof(4, negated_conjecture,((?[X3]:((~(big_p(X3))|?[X4]:~(big_p(X4)))&(big_p(X3)|![X5]:big_p(X5)))|((![X6]:~(big_p(X6))|?[X7]:~(big_p(X7)))&(?[X8]:big_p(X8)|![X9]:big_p(X9))))&(![X10]:((~(big_p(X10))|![X11]:big_p(X11))&(?[X12]:~(big_p(X12))|big_p(X10)))|((![X13]:~(big_p(X13))|![X14]:big_p(X14))&(?[X15]:~(big_p(X15))|?[X16]:big_p(X16))))),inference(variable_rename,[status(thm)],[3])).
% fof(5, negated_conjecture,((((~(big_p(esk1_0))|~(big_p(esk2_0)))&(big_p(esk1_0)|![X5]:big_p(X5)))|((![X6]:~(big_p(X6))|~(big_p(esk3_0)))&(big_p(esk4_0)|![X9]:big_p(X9))))&(![X10]:((~(big_p(X10))|![X11]:big_p(X11))&(~(big_p(esk5_1(X10)))|big_p(X10)))|((![X13]:~(big_p(X13))|![X14]:big_p(X14))&(~(big_p(esk6_0))|big_p(esk7_0))))),inference(skolemize,[status(esa)],[4])).
% fof(6, negated_conjecture,![X5]:![X6]:![X9]:![X10]:![X11]:![X13]:![X14]:((((big_p(X14)|~(big_p(X13)))&(~(big_p(esk6_0))|big_p(esk7_0)))|((big_p(X11)|~(big_p(X10)))&(~(big_p(esk5_1(X10)))|big_p(X10))))&(((big_p(X9)|big_p(esk4_0))&(~(big_p(X6))|~(big_p(esk3_0))))|((big_p(X5)|big_p(esk1_0))&(~(big_p(esk1_0))|~(big_p(esk2_0)))))),inference(shift_quantors,[status(thm)],[5])).
% fof(7, negated_conjecture,![X5]:![X6]:![X9]:![X10]:![X11]:![X13]:![X14]:(((((big_p(X11)|~(big_p(X10)))|(big_p(X14)|~(big_p(X13))))&((~(big_p(esk5_1(X10)))|big_p(X10))|(big_p(X14)|~(big_p(X13)))))&(((big_p(X11)|~(big_p(X10)))|(~(big_p(esk6_0))|big_p(esk7_0)))&((~(big_p(esk5_1(X10)))|big_p(X10))|(~(big_p(esk6_0))|big_p(esk7_0)))))&((((big_p(X5)|big_p(esk1_0))|(big_p(X9)|big_p(esk4_0)))&((~(big_p(esk1_0))|~(big_p(esk2_0)))|(big_p(X9)|big_p(esk4_0))))&(((big_p(X5)|big_p(esk1_0))|(~(big_p(X6))|~(big_p(esk3_0))))&((~(big_p(esk1_0))|~(big_p(esk2_0)))|(~(big_p(X6))|~(big_p(esk3_0))))))),inference(distribute,[status(thm)],[6])).
% cnf(8,negated_conjecture,(~big_p(esk3_0)|~big_p(X1)|~big_p(esk2_0)|~big_p(esk1_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(11,negated_conjecture,(big_p(esk4_0)|big_p(X1)|big_p(esk1_0)|big_p(X2)),inference(split_conjunct,[status(thm)],[7])).
% cnf(15,negated_conjecture,(big_p(X2)|big_p(X4)|~big_p(X1)|~big_p(X3)),inference(split_conjunct,[status(thm)],[7])).
% cnf(16,negated_conjecture,(big_p(esk1_0)|big_p(esk4_0)|big_p(X3)),inference(ef,[status(thm)],[11,theory(equality)])).
% cnf(27,negated_conjecture,(big_p(esk1_0)|big_p(esk4_0)),inference(ef,[status(thm)],[16,theory(equality)])).
% cnf(32,negated_conjecture,(big_p(X1)|big_p(X2)|big_p(esk1_0)|~big_p(X3)),inference(spm,[status(thm)],[15,27,theory(equality)])).
% cnf(33,negated_conjecture,(big_p(X1)|big_p(X2)|~big_p(X3)),inference(csr,[status(thm)],[32,15])).
% cnf(34,negated_conjecture,(big_p(X1)|big_p(X2)|big_p(esk1_0)),inference(spm,[status(thm)],[33,27,theory(equality)])).
% cnf(35,negated_conjecture,(big_p(X1)|big_p(X2)),inference(csr,[status(thm)],[34,33])).
% cnf(36,negated_conjecture,(big_p(X3)),inference(ef,[status(thm)],[35,theory(equality)])).
% cnf(40,negated_conjecture,($false|~big_p(esk2_0)|~big_p(esk3_0)|~big_p(X1)),inference(rw,[status(thm)],[8,36,theory(equality)])).
% cnf(41,negated_conjecture,($false|$false|~big_p(esk3_0)|~big_p(X1)),inference(rw,[status(thm)],[40,36,theory(equality)])).
% cnf(42,negated_conjecture,($false|$false|$false|~big_p(X1)),inference(rw,[status(thm)],[41,36,theory(equality)])).
% cnf(43,negated_conjecture,($false|$false|$false|$false),inference(rw,[status(thm)],[42,36,theory(equality)])).
% cnf(44,negated_conjecture,($false),inference(cn,[status(thm)],[43,theory(equality)])).
% cnf(45,negated_conjecture,($false),44,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 14
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 1
% # Generated clauses : 22
% # ...of the previous two non-trivial : 19
% # Contextual simplify-reflections : 2
% # Paramodulations : 12
% # Factorizations : 10
% # 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) : 12
% # Rec. Clause-clause subsumption calls : 12
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 5
% # 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.004 s
% # Total time : 0.012 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/SystemOnTPTP12448/SYN377+1.tptp
%
%------------------------------------------------------------------------------