%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM007+2 : TPTP v5.0.0. Released v3.2.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 : Tue Dec 28 22:38:11 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/SystemOnTPTP24877/COM007+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP24877/COM007+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24877/COM007+2.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 24973
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:((reflexive_rewrite(b,X1)&reflexive_rewrite(c,X1))=>goal),file('/tmp/SRASS.s.p', goal_ax)).
% fof(2, axiom,![X1]:![X2]:![X3]:((rewrite(X1,X2)&rewrite(X1,X3))=>?[X4]:(rewrite(X2,X4)&rewrite(X3,X4))),file('/tmp/SRASS.s.p', rewrite_diamond)).
% fof(3, axiom,(reflexive_rewrite(a,b)&reflexive_rewrite(a,c)),file('/tmp/SRASS.s.p', assumption)).
% fof(4, axiom,![X1]:![X2]:(reflexive_rewrite(X1,X2)=>(X1=X2|rewrite(X1,X2))),file('/tmp/SRASS.s.p', equal_or_rewrite)).
% fof(5, axiom,![X1]:![X2]:(rewrite(X1,X2)=>reflexive_rewrite(X1,X2)),file('/tmp/SRASS.s.p', rewrite_in_reflexive_rewrite)).
% fof(6, axiom,![X1]:![X2]:(X1=X2=>reflexive_rewrite(X1,X2)),file('/tmp/SRASS.s.p', equal_in_reflexive_rewrite)).
% fof(7, conjecture,goal,file('/tmp/SRASS.s.p', goal_to_be_proved)).
% fof(8, negated_conjecture,~(goal),inference(assume_negation,[status(cth)],[7])).
% fof(9, negated_conjecture,~(goal),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(10, plain,![X1]:((~(reflexive_rewrite(b,X1))|~(reflexive_rewrite(c,X1)))|goal),inference(fof_nnf,[status(thm)],[1])).
% fof(11, plain,![X2]:((~(reflexive_rewrite(b,X2))|~(reflexive_rewrite(c,X2)))|goal),inference(variable_rename,[status(thm)],[10])).
% cnf(12,plain,(goal|~reflexive_rewrite(c,X1)|~reflexive_rewrite(b,X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X1]:![X2]:![X3]:((~(rewrite(X1,X2))|~(rewrite(X1,X3)))|?[X4]:(rewrite(X2,X4)&rewrite(X3,X4))),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X5]:![X6]:![X7]:((~(rewrite(X5,X6))|~(rewrite(X5,X7)))|?[X8]:(rewrite(X6,X8)&rewrite(X7,X8))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X5]:![X6]:![X7]:((~(rewrite(X5,X6))|~(rewrite(X5,X7)))|(rewrite(X6,esk1_3(X5,X6,X7))&rewrite(X7,esk1_3(X5,X6,X7)))),inference(skolemize,[status(esa)],[14])).
% fof(16, plain,![X5]:![X6]:![X7]:((rewrite(X6,esk1_3(X5,X6,X7))|(~(rewrite(X5,X6))|~(rewrite(X5,X7))))&(rewrite(X7,esk1_3(X5,X6,X7))|(~(rewrite(X5,X6))|~(rewrite(X5,X7))))),inference(distribute,[status(thm)],[15])).
% cnf(17,plain,(rewrite(X2,esk1_3(X1,X3,X2))|~rewrite(X1,X2)|~rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(rewrite(X3,esk1_3(X1,X3,X2))|~rewrite(X1,X2)|~rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(reflexive_rewrite(a,c)),inference(split_conjunct,[status(thm)],[3])).
% cnf(20,plain,(reflexive_rewrite(a,b)),inference(split_conjunct,[status(thm)],[3])).
% fof(21, plain,![X1]:![X2]:(~(reflexive_rewrite(X1,X2))|(X1=X2|rewrite(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X3]:![X4]:(~(reflexive_rewrite(X3,X4))|(X3=X4|rewrite(X3,X4))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(rewrite(X1,X2)|X1=X2|~reflexive_rewrite(X1,X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:(~(rewrite(X1,X2))|reflexive_rewrite(X1,X2)),inference(fof_nnf,[status(thm)],[5])).
% fof(25, plain,![X3]:![X4]:(~(rewrite(X3,X4))|reflexive_rewrite(X3,X4)),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(reflexive_rewrite(X1,X2)|~rewrite(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:(~(X1=X2)|reflexive_rewrite(X1,X2)),inference(fof_nnf,[status(thm)],[6])).
% fof(28, plain,![X3]:![X4]:(~(X3=X4)|reflexive_rewrite(X3,X4)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(reflexive_rewrite(X1,X2)|X1!=X2),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,negated_conjecture,(~goal),inference(split_conjunct,[status(thm)],[9])).
% cnf(31,plain,(reflexive_rewrite(X1,X1)),inference(er,[status(thm)],[29,theory(equality)])).
% cnf(32,plain,(~reflexive_rewrite(b,X1)|~reflexive_rewrite(c,X1)),inference(sr,[status(thm)],[12,30,theory(equality)])).
% cnf(33,plain,(a=c|rewrite(a,c)),inference(spm,[status(thm)],[23,19,theory(equality)])).
% cnf(34,plain,(a=b|rewrite(a,b)),inference(spm,[status(thm)],[23,20,theory(equality)])).
% cnf(36,plain,(~reflexive_rewrite(b,X1)|~rewrite(c,X1)),inference(spm,[status(thm)],[32,26,theory(equality)])).
% cnf(37,plain,(~reflexive_rewrite(b,c)),inference(spm,[status(thm)],[32,31,theory(equality)])).
% cnf(39,plain,(~rewrite(c,X1)|~rewrite(b,X1)),inference(spm,[status(thm)],[36,26,theory(equality)])).
% cnf(40,plain,(~rewrite(c,b)),inference(spm,[status(thm)],[36,31,theory(equality)])).
% cnf(41,plain,(~rewrite(b,esk1_3(X1,c,X2))|~rewrite(X1,c)|~rewrite(X1,X2)),inference(spm,[status(thm)],[39,18,theory(equality)])).
% cnf(43,plain,(~rewrite(X1,c)|~rewrite(X1,b)),inference(spm,[status(thm)],[41,17,theory(equality)])).
% cnf(44,plain,(c=a|~rewrite(a,b)),inference(spm,[status(thm)],[43,33,theory(equality)])).
% cnf(45,plain,(c=a|a=b),inference(spm,[status(thm)],[44,34,theory(equality)])).
% cnf(51,plain,(a=b|~rewrite(a,b)),inference(spm,[status(thm)],[40,45,theory(equality)])).
% cnf(56,plain,(a=b),inference(csr,[status(thm)],[51,34])).
% cnf(71,plain,(reflexive_rewrite(b,c)),inference(rw,[status(thm)],[19,56,theory(equality)])).
% cnf(72,plain,($false),inference(sr,[status(thm)],[71,37,theory(equality)])).
% cnf(73,plain,($false),72,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 33
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 8
% # Generated clauses : 23
% # ...of the previous two non-trivial : 23
% # Contextual simplify-reflections : 1
% # Paramodulations : 22
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 3
% # ...number of literals in the above : 6
% # Clause-clause subsumption calls (NU) : 15
% # Rec. Clause-clause subsumption calls : 13
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 20 leaves, 1.25+/-0.536 terms/leaf
% # Paramod-from index: 3 leaves, 1.67+/-0.471 terms/leaf
% # Paramod-into index: 16 leaves, 1.19+/-0.390 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.006 s
% # Total time : 0.014 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/SystemOnTPTP24877/COM007+2.tptp
%
%------------------------------------------------------------------------------