%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : COM007+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:00 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/SystemOnTPTP4964/COM007+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP4964/COM007+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4964/COM007+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 5060
% 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, axiom,(reflexive_rewrite(a,b)&reflexive_rewrite(a,c)),file('/tmp/SRASS.s.p', assumption)).
% fof(2, axiom,![X1]:equalish(X1,X1),file('/tmp/SRASS.s.p', reflexivity)).
% fof(3, axiom,![X1]:![X2]:(equalish(X1,X2)=>equalish(X2,X1)),file('/tmp/SRASS.s.p', symmtery)).
% fof(4, 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(5, axiom,![X1]:((reflexive_rewrite(b,X1)&reflexive_rewrite(c,X1))=>goal),file('/tmp/SRASS.s.p', goal_ax)).
% fof(6, axiom,![X1]:![X2]:![X3]:((equalish(X1,X2)&reflexive_rewrite(X2,X3))=>reflexive_rewrite(X1,X3)),file('/tmp/SRASS.s.p', substitution)).
% fof(7, axiom,![X1]:![X2]:(equalish(X1,X2)=>reflexive_rewrite(X1,X2)),file('/tmp/SRASS.s.p', equalish_in_reflexive_rewrite)).
% fof(8, axiom,![X1]:![X2]:(reflexive_rewrite(X1,X2)=>(equalish(X1,X2)|rewrite(X1,X2))),file('/tmp/SRASS.s.p', equalish_or_rewrite)).
% fof(9, axiom,![X1]:![X2]:(rewrite(X1,X2)=>reflexive_rewrite(X1,X2)),file('/tmp/SRASS.s.p', rewrite_in_reflexive_rewrite)).
% fof(10, conjecture,goal,file('/tmp/SRASS.s.p', goal_to_be_proved)).
% fof(11, negated_conjecture,~(goal),inference(assume_negation,[status(cth)],[10])).
% fof(12, negated_conjecture,~(goal),inference(fof_simplification,[status(thm)],[11,theory(equality)])).
% cnf(13,plain,(reflexive_rewrite(a,c)),inference(split_conjunct,[status(thm)],[1])).
% cnf(14,plain,(reflexive_rewrite(a,b)),inference(split_conjunct,[status(thm)],[1])).
% fof(15, plain,![X2]:equalish(X2,X2),inference(variable_rename,[status(thm)],[2])).
% cnf(16,plain,(equalish(X1,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X2]:(~(equalish(X1,X2))|equalish(X2,X1)),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X3]:![X4]:(~(equalish(X3,X4))|equalish(X4,X3)),inference(variable_rename,[status(thm)],[17])).
% cnf(19,plain,(equalish(X1,X2)|~equalish(X2,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X2]:![X3]:((~(rewrite(X1,X2))|~(rewrite(X1,X3)))|?[X4]:(rewrite(X2,X4)&rewrite(X3,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(21, plain,![X5]:![X6]:![X7]:((~(rewrite(X5,X6))|~(rewrite(X5,X7)))|?[X8]:(rewrite(X6,X8)&rewrite(X7,X8))),inference(variable_rename,[status(thm)],[20])).
% fof(22, 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)],[21])).
% fof(23, 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)],[22])).
% cnf(24,plain,(rewrite(X2,esk1_3(X1,X3,X2))|~rewrite(X1,X2)|~rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(rewrite(X3,esk1_3(X1,X3,X2))|~rewrite(X1,X2)|~rewrite(X1,X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(26, plain,![X1]:((~(reflexive_rewrite(b,X1))|~(reflexive_rewrite(c,X1)))|goal),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X2]:((~(reflexive_rewrite(b,X2))|~(reflexive_rewrite(c,X2)))|goal),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(goal|~reflexive_rewrite(c,X1)|~reflexive_rewrite(b,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X1]:![X2]:![X3]:((~(equalish(X1,X2))|~(reflexive_rewrite(X2,X3)))|reflexive_rewrite(X1,X3)),inference(fof_nnf,[status(thm)],[6])).
% fof(30, plain,![X4]:![X5]:![X6]:((~(equalish(X4,X5))|~(reflexive_rewrite(X5,X6)))|reflexive_rewrite(X4,X6)),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(reflexive_rewrite(X1,X2)|~reflexive_rewrite(X3,X2)|~equalish(X1,X3)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X1]:![X2]:(~(equalish(X1,X2))|reflexive_rewrite(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(33, plain,![X3]:![X4]:(~(equalish(X3,X4))|reflexive_rewrite(X3,X4)),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(reflexive_rewrite(X1,X2)|~equalish(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:(~(reflexive_rewrite(X1,X2))|(equalish(X1,X2)|rewrite(X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(36, plain,![X3]:![X4]:(~(reflexive_rewrite(X3,X4))|(equalish(X3,X4)|rewrite(X3,X4))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(rewrite(X1,X2)|equalish(X1,X2)|~reflexive_rewrite(X1,X2)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:(~(rewrite(X1,X2))|reflexive_rewrite(X1,X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(39, plain,![X3]:![X4]:(~(rewrite(X3,X4))|reflexive_rewrite(X3,X4)),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(reflexive_rewrite(X1,X2)|~rewrite(X1,X2)),inference(split_conjunct,[status(thm)],[39])).
% cnf(41,negated_conjecture,(~goal),inference(split_conjunct,[status(thm)],[12])).
% cnf(42,plain,(~reflexive_rewrite(b,X1)|~reflexive_rewrite(c,X1)),inference(sr,[status(thm)],[28,41,theory(equality)])).
% cnf(43,plain,(reflexive_rewrite(X1,X1)),inference(spm,[status(thm)],[34,16,theory(equality)])).
% cnf(47,plain,(equalish(X1,X2)|rewrite(X2,X1)|~reflexive_rewrite(X2,X1)),inference(spm,[status(thm)],[19,37,theory(equality)])).
% cnf(50,plain,(reflexive_rewrite(X1,esk1_3(X2,X1,X3))|~rewrite(X2,X1)|~rewrite(X2,X3)),inference(spm,[status(thm)],[40,25,theory(equality)])).
% cnf(51,plain,(reflexive_rewrite(X1,esk1_3(X2,X3,X1))|~rewrite(X2,X3)|~rewrite(X2,X1)),inference(spm,[status(thm)],[40,24,theory(equality)])).
% cnf(52,plain,(~reflexive_rewrite(b,c)),inference(spm,[status(thm)],[42,43,theory(equality)])).
% cnf(53,plain,(reflexive_rewrite(X1,X2)|rewrite(X2,X1)|~reflexive_rewrite(X2,X1)),inference(spm,[status(thm)],[34,47,theory(equality)])).
% cnf(55,plain,(reflexive_rewrite(X1,X2)|rewrite(X3,X1)|~reflexive_rewrite(X3,X2)|~reflexive_rewrite(X3,X1)),inference(spm,[status(thm)],[31,47,theory(equality)])).
% cnf(62,plain,(~reflexive_rewrite(b,esk1_3(X1,c,X2))|~rewrite(X1,c)|~rewrite(X1,X2)),inference(spm,[status(thm)],[42,50,theory(equality)])).
% cnf(66,plain,(rewrite(a,X1)|reflexive_rewrite(X1,c)|~reflexive_rewrite(a,X1)),inference(spm,[status(thm)],[55,13,theory(equality)])).
% cnf(67,plain,(rewrite(a,X1)|reflexive_rewrite(X1,b)|~reflexive_rewrite(a,X1)),inference(spm,[status(thm)],[55,14,theory(equality)])).
% cnf(71,plain,(~rewrite(X1,c)|~rewrite(X1,b)),inference(spm,[status(thm)],[62,51,theory(equality)])).
% cnf(72,plain,(reflexive_rewrite(c,X1)|~rewrite(X1,b)|~reflexive_rewrite(X1,c)),inference(spm,[status(thm)],[71,53,theory(equality)])).
% cnf(83,plain,(reflexive_rewrite(c,a)|reflexive_rewrite(b,c)|~reflexive_rewrite(a,c)|~reflexive_rewrite(a,b)),inference(spm,[status(thm)],[72,66,theory(equality)])).
% cnf(88,plain,(reflexive_rewrite(c,a)|reflexive_rewrite(b,c)|$false|~reflexive_rewrite(a,b)),inference(rw,[status(thm)],[83,13,theory(equality)])).
% cnf(89,plain,(reflexive_rewrite(c,a)|reflexive_rewrite(b,c)|$false|$false),inference(rw,[status(thm)],[88,14,theory(equality)])).
% cnf(90,plain,(reflexive_rewrite(c,a)|reflexive_rewrite(b,c)),inference(cn,[status(thm)],[89,theory(equality)])).
% cnf(91,plain,(reflexive_rewrite(c,a)),inference(sr,[status(thm)],[90,52,theory(equality)])).
% cnf(94,plain,(~reflexive_rewrite(b,a)),inference(spm,[status(thm)],[42,91,theory(equality)])).
% cnf(95,plain,(reflexive_rewrite(c,b)|~rewrite(a,b)|~reflexive_rewrite(a,c)),inference(spm,[status(thm)],[71,67,theory(equality)])).
% cnf(98,plain,(reflexive_rewrite(c,b)|~rewrite(a,b)|$false),inference(rw,[status(thm)],[95,13,theory(equality)])).
% cnf(99,plain,(reflexive_rewrite(c,b)|~rewrite(a,b)),inference(cn,[status(thm)],[98,theory(equality)])).
% cnf(109,plain,(reflexive_rewrite(c,b)|reflexive_rewrite(b,a)|~reflexive_rewrite(a,b)),inference(spm,[status(thm)],[99,53,theory(equality)])).
% cnf(112,plain,(reflexive_rewrite(c,b)|reflexive_rewrite(b,a)|$false),inference(rw,[status(thm)],[109,14,theory(equality)])).
% cnf(113,plain,(reflexive_rewrite(c,b)|reflexive_rewrite(b,a)),inference(cn,[status(thm)],[112,theory(equality)])).
% cnf(114,plain,(reflexive_rewrite(c,b)),inference(sr,[status(thm)],[113,94,theory(equality)])).
% cnf(123,plain,(~reflexive_rewrite(b,b)),inference(spm,[status(thm)],[42,114,theory(equality)])).
% cnf(125,plain,($false),inference(rw,[status(thm)],[123,43,theory(equality)])).
% cnf(126,plain,($false),inference(cn,[status(thm)],[125,theory(equality)])).
% cnf(127,plain,($false),126,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 54
% # ...of the previous two non-trivial : 39
% # Contextual simplify-reflections : 0
% # Paramodulations : 54
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 32
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 56
% # Clause-clause subsumption calls (NU) : 73
% # Rec. Clause-clause subsumption calls : 59
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 29 leaves, 1.59+/-1.300 terms/leaf
% # Paramod-from index: 11 leaves, 1.45+/-0.782 terms/leaf
% # Paramod-into index: 24 leaves, 1.42+/-0.862 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP4964/COM007+1.tptp
%
%------------------------------------------------------------------------------