%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SYN726+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 : 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:59:28 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/SystemOnTPTP20919/SYN726+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP20919/SYN726+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20919/SYN726+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 21015
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:![X2]:![X3]:((p(X1,X2)&p(X2,X3))=>p(X1,X3))&![X1]:![X2]:![X3]:((q(X1,X2)&q(X2,X3))=>q(X1,X3)))&![X1]:![X2]:(q(X1,X2)=>q(X2,X1)))&![X1]:![X2]:(p(X1,X2)|q(X1,X2)))=>![X1]:![X2]:p(X1,X2))|![X1]:![X2]:q(X1,X2)),file('/tmp/SRASS.s.p', thm400)).
% fof(2, negated_conjecture,~((((((![X1]:![X2]:![X3]:((p(X1,X2)&p(X2,X3))=>p(X1,X3))&![X1]:![X2]:![X3]:((q(X1,X2)&q(X2,X3))=>q(X1,X3)))&![X1]:![X2]:(q(X1,X2)=>q(X2,X1)))&![X1]:![X2]:(p(X1,X2)|q(X1,X2)))=>![X1]:![X2]:p(X1,X2))|![X1]:![X2]:q(X1,X2))),inference(assume_negation,[status(cth)],[1])).
% fof(3, plain,(epred1_0=>(((![X1]:![X2]:![X3]:((p(X1,X2)&p(X2,X3))=>p(X1,X3))&![X1]:![X2]:![X3]:((q(X1,X2)&q(X2,X3))=>q(X1,X3)))&![X1]:![X2]:(q(X1,X2)=>q(X2,X1)))&![X1]:![X2]:(p(X1,X2)|q(X1,X2)))),introduced(definition)).
% fof(4, negated_conjecture,~(((epred1_0=>![X1]:![X2]:p(X1,X2))|![X1]:![X2]:q(X1,X2))),inference(apply_def,[status(esa)],[2,3,theory(equality)])).
% fof(5, negated_conjecture,((epred1_0&?[X1]:?[X2]:~(p(X1,X2)))&?[X1]:?[X2]:~(q(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(6, negated_conjecture,((epred1_0&?[X3]:?[X4]:~(p(X3,X4)))&?[X5]:?[X6]:~(q(X5,X6))),inference(variable_rename,[status(thm)],[5])).
% fof(7, negated_conjecture,((epred1_0&~(p(esk1_0,esk2_0)))&~(q(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[6])).
% cnf(8,negated_conjecture,(~q(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(9,negated_conjecture,(~p(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[7])).
% cnf(10,negated_conjecture,(epred1_0),inference(split_conjunct,[status(thm)],[7])).
% fof(11, plain,(~(epred1_0)|(((![X1]:![X2]:![X3]:((~(p(X1,X2))|~(p(X2,X3)))|p(X1,X3))&![X1]:![X2]:![X3]:((~(q(X1,X2))|~(q(X2,X3)))|q(X1,X3)))&![X1]:![X2]:(~(q(X1,X2))|q(X2,X1)))&![X1]:![X2]:(p(X1,X2)|q(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(12, plain,(~(epred1_0)|(((![X4]:![X5]:![X6]:((~(p(X4,X5))|~(p(X5,X6)))|p(X4,X6))&![X7]:![X8]:![X9]:((~(q(X7,X8))|~(q(X8,X9)))|q(X7,X9)))&![X10]:![X11]:(~(q(X10,X11))|q(X11,X10)))&![X12]:![X13]:(p(X12,X13)|q(X12,X13)))),inference(variable_rename,[status(thm)],[11])).
% fof(13, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:(((p(X12,X13)|q(X12,X13))&((~(q(X10,X11))|q(X11,X10))&(((~(q(X7,X8))|~(q(X8,X9)))|q(X7,X9))&((~(p(X4,X5))|~(p(X5,X6)))|p(X4,X6)))))|~(epred1_0)),inference(shift_quantors,[status(thm)],[12])).
% fof(14, plain,![X4]:![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:(((p(X12,X13)|q(X12,X13))|~(epred1_0))&(((~(q(X10,X11))|q(X11,X10))|~(epred1_0))&((((~(q(X7,X8))|~(q(X8,X9)))|q(X7,X9))|~(epred1_0))&(((~(p(X4,X5))|~(p(X5,X6)))|p(X4,X6))|~(epred1_0))))),inference(distribute,[status(thm)],[13])).
% cnf(15,plain,(p(X1,X2)|~epred1_0|~p(X3,X2)|~p(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% cnf(16,plain,(q(X1,X2)|~epred1_0|~q(X3,X2)|~q(X1,X3)),inference(split_conjunct,[status(thm)],[14])).
% cnf(17,plain,(q(X1,X2)|~epred1_0|~q(X2,X1)),inference(split_conjunct,[status(thm)],[14])).
% cnf(18,plain,(q(X1,X2)|p(X1,X2)|~epred1_0),inference(split_conjunct,[status(thm)],[14])).
% cnf(19,plain,(p(X1,X2)|q(X1,X2)|$false),inference(rw,[status(thm)],[18,10,theory(equality)])).
% cnf(20,plain,(p(X1,X2)|q(X1,X2)),inference(cn,[status(thm)],[19,theory(equality)])).
% cnf(21,plain,(q(X1,X2)|$false|~q(X2,X1)),inference(rw,[status(thm)],[17,10,theory(equality)])).
% cnf(22,plain,(q(X1,X2)|~q(X2,X1)),inference(cn,[status(thm)],[21,theory(equality)])).
% cnf(23,plain,(p(X1,X2)|$false|~p(X3,X2)|~p(X1,X3)),inference(rw,[status(thm)],[15,10,theory(equality)])).
% cnf(24,plain,(p(X1,X2)|~p(X3,X2)|~p(X1,X3)),inference(cn,[status(thm)],[23,theory(equality)])).
% cnf(25,plain,(q(X1,X2)|$false|~q(X3,X2)|~q(X1,X3)),inference(rw,[status(thm)],[16,10,theory(equality)])).
% cnf(26,plain,(q(X1,X2)|~q(X3,X2)|~q(X1,X3)),inference(cn,[status(thm)],[25,theory(equality)])).
% cnf(27,negated_conjecture,(q(esk1_0,esk2_0)),inference(spm,[status(thm)],[9,20,theory(equality)])).
% cnf(28,plain,(p(X1,X2)|q(X3,X2)|~p(X1,X3)),inference(spm,[status(thm)],[24,20,theory(equality)])).
% cnf(29,plain,(q(esk2_0,esk1_0)),inference(spm,[status(thm)],[22,27,theory(equality)])).
% cnf(30,plain,(q(X1,esk2_0)|~q(X1,esk1_0)),inference(spm,[status(thm)],[26,27,theory(equality)])).
% cnf(32,plain,(q(X1,esk1_0)|~q(X1,esk2_0)),inference(spm,[status(thm)],[26,29,theory(equality)])).
% cnf(34,plain,(q(esk2_0,X1)|~q(X1,esk1_0)),inference(spm,[status(thm)],[22,30,theory(equality)])).
% cnf(36,plain,(q(X1,X2)|p(X3,X2)|q(X3,X1)),inference(spm,[status(thm)],[28,20,theory(equality)])).
% cnf(50,negated_conjecture,(q(esk1_0,X1)|q(X1,esk2_0)),inference(spm,[status(thm)],[9,36,theory(equality)])).
% cnf(59,plain,(q(X1,esk1_0)|q(X1,esk2_0)),inference(spm,[status(thm)],[22,50,theory(equality)])).
% cnf(64,plain,(q(X1,esk1_0)),inference(csr,[status(thm)],[59,32])).
% cnf(68,plain,(q(X1,esk2_0)|$false),inference(rw,[status(thm)],[30,64,theory(equality)])).
% cnf(69,plain,(q(X1,esk2_0)),inference(cn,[status(thm)],[68,theory(equality)])).
% cnf(70,plain,(q(esk2_0,X1)|$false),inference(rw,[status(thm)],[34,64,theory(equality)])).
% cnf(71,plain,(q(esk2_0,X1)),inference(cn,[status(thm)],[70,theory(equality)])).
% cnf(81,plain,(q(X1,X2)|~q(X1,esk2_0)),inference(spm,[status(thm)],[26,71,theory(equality)])).
% cnf(83,plain,(q(X1,X2)|$false),inference(rw,[status(thm)],[81,69,theory(equality)])).
% cnf(84,plain,(q(X1,X2)),inference(cn,[status(thm)],[83,theory(equality)])).
% cnf(104,negated_conjecture,($false),inference(rw,[status(thm)],[8,84,theory(equality)])).
% cnf(105,negated_conjecture,($false),inference(cn,[status(thm)],[104,theory(equality)])).
% cnf(106,negated_conjecture,($false),105,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 29
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 16
% # Generated clauses : 40
% # ...of the previous two non-trivial : 30
% # Contextual simplify-reflections : 1
% # Paramodulations : 40
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 4
% # Positive orientable unit clauses: 2
% # 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) : 26
% # Rec. Clause-clause subsumption calls : 25
% # Unit Clause-clause subsumption calls : 42
% # Rewrite failures with RHS unbound: 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 16
% # Backwards rewriting index: 7 leaves, 1.29+/-0.700 terms/leaf
% # Paramod-from index: 2 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 6 leaves, 1.00+/-0.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 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/SystemOnTPTP20919/SYN726+1.tptp
%
%------------------------------------------------------------------------------