TSTP Solution File: GEO127+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO127+1 : TPTP v5.0.0. Released v2.4.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 : Wed Dec 29 04:38:25 EST 2010
% Result : Theorem 0.96s
% Output : Solution 0.96s
% 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/SystemOnTPTP11395/GEO127+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP11395/GEO127+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11395/GEO127+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 11491
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(ordered_by(X1,X2,X3)=>(incident_o(X2,X1)&incident_o(X3,X1))),file('/tmp/SRASS.s.p', o1)).
% fof(3, axiom,![X2]:![X1]:(start_point(X2,X1)<=>(incident_o(X2,X1)&![X3]:((~(X2=X3)&incident_o(X3,X1))=>ordered_by(X1,X2,X3)))),file('/tmp/SRASS.s.p', start_point_defn)).
% fof(6, axiom,![X1]:?[X2]:start_point(X2,X1),file('/tmp/SRASS.s.p', o4)).
% fof(9, axiom,![X1]:?[X6]:(open(X6)&![X2]:(incident_o(X2,X1)<=>incident_c(X2,X6))),file('/tmp/SRASS.s.p', o2)).
% fof(12, axiom,![X6]:(open(X6)<=>?[X2]:end_point(X2,X6)),file('/tmp/SRASS.s.p', open_defn)).
% fof(14, axiom,![X6]:?[X2]:inner_point(X2,X6),file('/tmp/SRASS.s.p', c3)).
% fof(15, axiom,![X2]:![X6]:(end_point(X2,X6)<=>(incident_c(X2,X6)&![X7]:![X9]:((((part_of(X7,X6)&part_of(X9,X6))&incident_c(X2,X7))&incident_c(X2,X9))=>(part_of(X7,X9)|part_of(X9,X7))))),file('/tmp/SRASS.s.p', end_point_defn)).
% fof(22, axiom,![X2]:![X6]:(inner_point(X2,X6)<=>(incident_c(X2,X6)&~(end_point(X2,X6)))),file('/tmp/SRASS.s.p', inner_point_defn)).
% fof(25, axiom,![X6]:(closed(X6)<=>~(?[X2]:end_point(X2,X6))),file('/tmp/SRASS.s.p', closed_defn)).
% fof(28, conjecture,![X1]:![X2]:(incident_o(X2,X1)<=>?[X3]:(ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2))),file('/tmp/SRASS.s.p', theorem_4_12)).
% fof(29, negated_conjecture,~(![X1]:![X2]:(incident_o(X2,X1)<=>?[X3]:(ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2)))),inference(assume_negation,[status(cth)],[28])).
% fof(30, plain,![X2]:![X6]:(inner_point(X2,X6)<=>(incident_c(X2,X6)&~(end_point(X2,X6)))),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% fof(31, plain,![X1]:![X2]:![X3]:(~(ordered_by(X1,X2,X3))|(incident_o(X2,X1)&incident_o(X3,X1))),inference(fof_nnf,[status(thm)],[1])).
% fof(32, plain,![X4]:![X5]:![X6]:(~(ordered_by(X4,X5,X6))|(incident_o(X5,X4)&incident_o(X6,X4))),inference(variable_rename,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:((incident_o(X5,X4)|~(ordered_by(X4,X5,X6)))&(incident_o(X6,X4)|~(ordered_by(X4,X5,X6)))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(incident_o(X3,X1)|~ordered_by(X1,X2,X3)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(incident_o(X2,X1)|~ordered_by(X1,X2,X3)),inference(split_conjunct,[status(thm)],[33])).
% fof(42, plain,![X2]:![X1]:((~(start_point(X2,X1))|(incident_o(X2,X1)&![X3]:((X2=X3|~(incident_o(X3,X1)))|ordered_by(X1,X2,X3))))&((~(incident_o(X2,X1))|?[X3]:((~(X2=X3)&incident_o(X3,X1))&~(ordered_by(X1,X2,X3))))|start_point(X2,X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(43, plain,![X4]:![X5]:((~(start_point(X4,X5))|(incident_o(X4,X5)&![X6]:((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X4,X6))))&((~(incident_o(X4,X5))|?[X7]:((~(X4=X7)&incident_o(X7,X5))&~(ordered_by(X5,X4,X7))))|start_point(X4,X5))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X4]:![X5]:((~(start_point(X4,X5))|(incident_o(X4,X5)&![X6]:((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X4,X6))))&((~(incident_o(X4,X5))|((~(X4=esk3_2(X4,X5))&incident_o(esk3_2(X4,X5),X5))&~(ordered_by(X5,X4,esk3_2(X4,X5)))))|start_point(X4,X5))),inference(skolemize,[status(esa)],[43])).
% fof(45, plain,![X4]:![X5]:![X6]:(((((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X4,X6))&incident_o(X4,X5))|~(start_point(X4,X5)))&((~(incident_o(X4,X5))|((~(X4=esk3_2(X4,X5))&incident_o(esk3_2(X4,X5),X5))&~(ordered_by(X5,X4,esk3_2(X4,X5)))))|start_point(X4,X5))),inference(shift_quantors,[status(thm)],[44])).
% fof(46, plain,![X4]:![X5]:![X6]:(((((X4=X6|~(incident_o(X6,X5)))|ordered_by(X5,X4,X6))|~(start_point(X4,X5)))&(incident_o(X4,X5)|~(start_point(X4,X5))))&((((~(X4=esk3_2(X4,X5))|~(incident_o(X4,X5)))|start_point(X4,X5))&((incident_o(esk3_2(X4,X5),X5)|~(incident_o(X4,X5)))|start_point(X4,X5)))&((~(ordered_by(X5,X4,esk3_2(X4,X5)))|~(incident_o(X4,X5)))|start_point(X4,X5)))),inference(distribute,[status(thm)],[45])).
% cnf(51,plain,(ordered_by(X2,X1,X3)|X1=X3|~start_point(X1,X2)|~incident_o(X3,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(68, plain,![X3]:?[X4]:start_point(X4,X3),inference(variable_rename,[status(thm)],[6])).
% fof(69, plain,![X3]:start_point(esk6_1(X3),X3),inference(skolemize,[status(esa)],[68])).
% cnf(70,plain,(start_point(esk6_1(X1),X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(88, plain,![X1]:?[X6]:(open(X6)&![X2]:((~(incident_o(X2,X1))|incident_c(X2,X6))&(~(incident_c(X2,X6))|incident_o(X2,X1)))),inference(fof_nnf,[status(thm)],[9])).
% fof(89, plain,![X7]:?[X8]:(open(X8)&![X9]:((~(incident_o(X9,X7))|incident_c(X9,X8))&(~(incident_c(X9,X8))|incident_o(X9,X7)))),inference(variable_rename,[status(thm)],[88])).
% fof(90, plain,![X7]:(open(esk8_1(X7))&![X9]:((~(incident_o(X9,X7))|incident_c(X9,esk8_1(X7)))&(~(incident_c(X9,esk8_1(X7)))|incident_o(X9,X7)))),inference(skolemize,[status(esa)],[89])).
% fof(91, plain,![X7]:![X9]:(((~(incident_o(X9,X7))|incident_c(X9,esk8_1(X7)))&(~(incident_c(X9,esk8_1(X7)))|incident_o(X9,X7)))&open(esk8_1(X7))),inference(shift_quantors,[status(thm)],[90])).
% cnf(92,plain,(open(esk8_1(X1))),inference(split_conjunct,[status(thm)],[91])).
% cnf(93,plain,(incident_o(X1,X2)|~incident_c(X1,esk8_1(X2))),inference(split_conjunct,[status(thm)],[91])).
% fof(107, plain,![X6]:((~(open(X6))|?[X2]:end_point(X2,X6))&(![X2]:~(end_point(X2,X6))|open(X6))),inference(fof_nnf,[status(thm)],[12])).
% fof(108, plain,![X7]:((~(open(X7))|?[X8]:end_point(X8,X7))&(![X9]:~(end_point(X9,X7))|open(X7))),inference(variable_rename,[status(thm)],[107])).
% fof(109, plain,![X7]:((~(open(X7))|end_point(esk10_1(X7),X7))&(![X9]:~(end_point(X9,X7))|open(X7))),inference(skolemize,[status(esa)],[108])).
% fof(110, plain,![X7]:![X9]:((~(end_point(X9,X7))|open(X7))&(~(open(X7))|end_point(esk10_1(X7),X7))),inference(shift_quantors,[status(thm)],[109])).
% cnf(111,plain,(end_point(esk10_1(X1),X1)|~open(X1)),inference(split_conjunct,[status(thm)],[110])).
% fof(124, plain,![X7]:?[X8]:inner_point(X8,X7),inference(variable_rename,[status(thm)],[14])).
% fof(125, plain,![X7]:inner_point(esk12_1(X7),X7),inference(skolemize,[status(esa)],[124])).
% cnf(126,plain,(inner_point(esk12_1(X1),X1)),inference(split_conjunct,[status(thm)],[125])).
% fof(127, plain,![X2]:![X6]:((~(end_point(X2,X6))|(incident_c(X2,X6)&![X7]:![X9]:((((~(part_of(X7,X6))|~(part_of(X9,X6)))|~(incident_c(X2,X7)))|~(incident_c(X2,X9)))|(part_of(X7,X9)|part_of(X9,X7)))))&((~(incident_c(X2,X6))|?[X7]:?[X9]:((((part_of(X7,X6)&part_of(X9,X6))&incident_c(X2,X7))&incident_c(X2,X9))&(~(part_of(X7,X9))&~(part_of(X9,X7)))))|end_point(X2,X6))),inference(fof_nnf,[status(thm)],[15])).
% fof(128, plain,![X10]:![X11]:((~(end_point(X10,X11))|(incident_c(X10,X11)&![X12]:![X13]:((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))))&((~(incident_c(X10,X11))|?[X14]:?[X15]:((((part_of(X14,X11)&part_of(X15,X11))&incident_c(X10,X14))&incident_c(X10,X15))&(~(part_of(X14,X15))&~(part_of(X15,X14)))))|end_point(X10,X11))),inference(variable_rename,[status(thm)],[127])).
% fof(129, plain,![X10]:![X11]:((~(end_point(X10,X11))|(incident_c(X10,X11)&![X12]:![X13]:((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))))&((~(incident_c(X10,X11))|((((part_of(esk13_2(X10,X11),X11)&part_of(esk14_2(X10,X11),X11))&incident_c(X10,esk13_2(X10,X11)))&incident_c(X10,esk14_2(X10,X11)))&(~(part_of(esk13_2(X10,X11),esk14_2(X10,X11)))&~(part_of(esk14_2(X10,X11),esk13_2(X10,X11))))))|end_point(X10,X11))),inference(skolemize,[status(esa)],[128])).
% fof(130, plain,![X10]:![X11]:![X12]:![X13]:(((((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))&incident_c(X10,X11))|~(end_point(X10,X11)))&((~(incident_c(X10,X11))|((((part_of(esk13_2(X10,X11),X11)&part_of(esk14_2(X10,X11),X11))&incident_c(X10,esk13_2(X10,X11)))&incident_c(X10,esk14_2(X10,X11)))&(~(part_of(esk13_2(X10,X11),esk14_2(X10,X11)))&~(part_of(esk14_2(X10,X11),esk13_2(X10,X11))))))|end_point(X10,X11))),inference(shift_quantors,[status(thm)],[129])).
% fof(131, plain,![X10]:![X11]:![X12]:![X13]:(((((((~(part_of(X12,X11))|~(part_of(X13,X11)))|~(incident_c(X10,X12)))|~(incident_c(X10,X13)))|(part_of(X12,X13)|part_of(X13,X12)))|~(end_point(X10,X11)))&(incident_c(X10,X11)|~(end_point(X10,X11))))&((((((part_of(esk13_2(X10,X11),X11)|~(incident_c(X10,X11)))|end_point(X10,X11))&((part_of(esk14_2(X10,X11),X11)|~(incident_c(X10,X11)))|end_point(X10,X11)))&((incident_c(X10,esk13_2(X10,X11))|~(incident_c(X10,X11)))|end_point(X10,X11)))&((incident_c(X10,esk14_2(X10,X11))|~(incident_c(X10,X11)))|end_point(X10,X11)))&(((~(part_of(esk13_2(X10,X11),esk14_2(X10,X11)))|~(incident_c(X10,X11)))|end_point(X10,X11))&((~(part_of(esk14_2(X10,X11),esk13_2(X10,X11)))|~(incident_c(X10,X11)))|end_point(X10,X11))))),inference(distribute,[status(thm)],[130])).
% cnf(138,plain,(incident_c(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[131])).
% fof(176, plain,![X2]:![X6]:((~(inner_point(X2,X6))|(incident_c(X2,X6)&~(end_point(X2,X6))))&((~(incident_c(X2,X6))|end_point(X2,X6))|inner_point(X2,X6))),inference(fof_nnf,[status(thm)],[30])).
% fof(177, plain,![X7]:![X8]:((~(inner_point(X7,X8))|(incident_c(X7,X8)&~(end_point(X7,X8))))&((~(incident_c(X7,X8))|end_point(X7,X8))|inner_point(X7,X8))),inference(variable_rename,[status(thm)],[176])).
% fof(178, plain,![X7]:![X8]:(((incident_c(X7,X8)|~(inner_point(X7,X8)))&(~(end_point(X7,X8))|~(inner_point(X7,X8))))&((~(incident_c(X7,X8))|end_point(X7,X8))|inner_point(X7,X8))),inference(distribute,[status(thm)],[177])).
% cnf(180,plain,(~inner_point(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[178])).
% cnf(181,plain,(incident_c(X1,X2)|~inner_point(X1,X2)),inference(split_conjunct,[status(thm)],[178])).
% fof(200, plain,![X6]:((~(closed(X6))|![X2]:~(end_point(X2,X6)))&(?[X2]:end_point(X2,X6)|closed(X6))),inference(fof_nnf,[status(thm)],[25])).
% fof(201, plain,![X7]:((~(closed(X7))|![X8]:~(end_point(X8,X7)))&(?[X9]:end_point(X9,X7)|closed(X7))),inference(variable_rename,[status(thm)],[200])).
% fof(202, plain,![X7]:((~(closed(X7))|![X8]:~(end_point(X8,X7)))&(end_point(esk23_1(X7),X7)|closed(X7))),inference(skolemize,[status(esa)],[201])).
% fof(203, plain,![X7]:![X8]:((~(end_point(X8,X7))|~(closed(X7)))&(end_point(esk23_1(X7),X7)|closed(X7))),inference(shift_quantors,[status(thm)],[202])).
% cnf(204,plain,(closed(X1)|end_point(esk23_1(X1),X1)),inference(split_conjunct,[status(thm)],[203])).
% cnf(205,plain,(~closed(X1)|~end_point(X2,X1)),inference(split_conjunct,[status(thm)],[203])).
% fof(221, negated_conjecture,?[X1]:?[X2]:((~(incident_o(X2,X1))|![X3]:(~(ordered_by(X1,X2,X3))&~(ordered_by(X1,X3,X2))))&(incident_o(X2,X1)|?[X3]:(ordered_by(X1,X2,X3)|ordered_by(X1,X3,X2)))),inference(fof_nnf,[status(thm)],[29])).
% fof(222, negated_conjecture,?[X4]:?[X5]:((~(incident_o(X5,X4))|![X6]:(~(ordered_by(X4,X5,X6))&~(ordered_by(X4,X6,X5))))&(incident_o(X5,X4)|?[X7]:(ordered_by(X4,X5,X7)|ordered_by(X4,X7,X5)))),inference(variable_rename,[status(thm)],[221])).
% fof(223, negated_conjecture,((~(incident_o(esk26_0,esk25_0))|![X6]:(~(ordered_by(esk25_0,esk26_0,X6))&~(ordered_by(esk25_0,X6,esk26_0))))&(incident_o(esk26_0,esk25_0)|(ordered_by(esk25_0,esk26_0,esk27_0)|ordered_by(esk25_0,esk27_0,esk26_0)))),inference(skolemize,[status(esa)],[222])).
% fof(224, negated_conjecture,![X6]:(((~(ordered_by(esk25_0,esk26_0,X6))&~(ordered_by(esk25_0,X6,esk26_0)))|~(incident_o(esk26_0,esk25_0)))&(incident_o(esk26_0,esk25_0)|(ordered_by(esk25_0,esk26_0,esk27_0)|ordered_by(esk25_0,esk27_0,esk26_0)))),inference(shift_quantors,[status(thm)],[223])).
% fof(225, negated_conjecture,![X6]:(((~(ordered_by(esk25_0,esk26_0,X6))|~(incident_o(esk26_0,esk25_0)))&(~(ordered_by(esk25_0,X6,esk26_0))|~(incident_o(esk26_0,esk25_0))))&(incident_o(esk26_0,esk25_0)|(ordered_by(esk25_0,esk26_0,esk27_0)|ordered_by(esk25_0,esk27_0,esk26_0)))),inference(distribute,[status(thm)],[224])).
% cnf(226,negated_conjecture,(ordered_by(esk25_0,esk27_0,esk26_0)|ordered_by(esk25_0,esk26_0,esk27_0)|incident_o(esk26_0,esk25_0)),inference(split_conjunct,[status(thm)],[225])).
% cnf(227,negated_conjecture,(~incident_o(esk26_0,esk25_0)|~ordered_by(esk25_0,X1,esk26_0)),inference(split_conjunct,[status(thm)],[225])).
% cnf(228,negated_conjecture,(~incident_o(esk26_0,esk25_0)|~ordered_by(esk25_0,esk26_0,X1)),inference(split_conjunct,[status(thm)],[225])).
% cnf(229,negated_conjecture,(incident_o(esk26_0,esk25_0)|ordered_by(esk25_0,esk26_0,esk27_0)),inference(csr,[status(thm)],[226,34])).
% cnf(235,negated_conjecture,(incident_o(esk26_0,esk25_0)),inference(spm,[status(thm)],[35,229,theory(equality)])).
% cnf(239,plain,(incident_c(esk12_1(X1),X1)),inference(spm,[status(thm)],[181,126,theory(equality)])).
% cnf(242,plain,(incident_c(esk23_1(X1),X1)|closed(X1)),inference(spm,[status(thm)],[138,204,theory(equality)])).
% cnf(249,plain,(~end_point(esk12_1(X1),X1)),inference(spm,[status(thm)],[180,126,theory(equality)])).
% cnf(251,plain,(~closed(X1)|~open(X1)),inference(spm,[status(thm)],[205,111,theory(equality)])).
% cnf(426,negated_conjecture,($false|~ordered_by(esk25_0,esk26_0,X1)),inference(rw,[status(thm)],[228,235,theory(equality)])).
% cnf(427,negated_conjecture,(~ordered_by(esk25_0,esk26_0,X1)),inference(cn,[status(thm)],[426,theory(equality)])).
% cnf(428,negated_conjecture,($false|~ordered_by(esk25_0,X1,esk26_0)),inference(rw,[status(thm)],[227,235,theory(equality)])).
% cnf(429,negated_conjecture,(~ordered_by(esk25_0,X1,esk26_0)),inference(cn,[status(thm)],[428,theory(equality)])).
% cnf(431,negated_conjecture,(esk26_0=X1|~start_point(esk26_0,esk25_0)|~incident_o(X1,esk25_0)),inference(spm,[status(thm)],[427,51,theory(equality)])).
% cnf(435,negated_conjecture,(X1=esk26_0|~start_point(X1,esk25_0)|~incident_o(esk26_0,esk25_0)),inference(spm,[status(thm)],[429,51,theory(equality)])).
% cnf(436,negated_conjecture,(X1=esk26_0|~start_point(X1,esk25_0)|$false),inference(rw,[status(thm)],[435,235,theory(equality)])).
% cnf(437,negated_conjecture,(X1=esk26_0|~start_point(X1,esk25_0)),inference(cn,[status(thm)],[436,theory(equality)])).
% cnf(438,negated_conjecture,(esk6_1(esk25_0)=esk26_0),inference(spm,[status(thm)],[437,70,theory(equality)])).
% cnf(439,negated_conjecture,(start_point(esk26_0,esk25_0)),inference(spm,[status(thm)],[70,438,theory(equality)])).
% cnf(447,negated_conjecture,(esk26_0=X1|$false|~incident_o(X1,esk25_0)),inference(rw,[status(thm)],[431,439,theory(equality)])).
% cnf(448,negated_conjecture,(esk26_0=X1|~incident_o(X1,esk25_0)),inference(cn,[status(thm)],[447,theory(equality)])).
% cnf(455,negated_conjecture,(esk26_0=X1|~incident_c(X1,esk8_1(esk25_0))),inference(spm,[status(thm)],[448,93,theory(equality)])).
% cnf(461,negated_conjecture,(esk26_0=esk12_1(esk8_1(esk25_0))),inference(spm,[status(thm)],[455,239,theory(equality)])).
% cnf(469,negated_conjecture,(~end_point(esk26_0,esk8_1(esk25_0))),inference(spm,[status(thm)],[249,461,theory(equality)])).
% cnf(481,negated_conjecture,(esk26_0=esk23_1(esk8_1(esk25_0))|closed(esk8_1(esk25_0))),inference(spm,[status(thm)],[455,242,theory(equality)])).
% cnf(483,negated_conjecture,(closed(esk8_1(esk25_0))|end_point(esk26_0,esk8_1(esk25_0))),inference(spm,[status(thm)],[204,481,theory(equality)])).
% cnf(485,negated_conjecture,(closed(esk8_1(esk25_0))),inference(sr,[status(thm)],[483,469,theory(equality)])).
% cnf(524,negated_conjecture,(~open(esk8_1(esk25_0))),inference(spm,[status(thm)],[251,485,theory(equality)])).
% cnf(526,negated_conjecture,($false),inference(rw,[status(thm)],[524,92,theory(equality)])).
% cnf(527,negated_conjecture,($false),inference(cn,[status(thm)],[526,theory(equality)])).
% cnf(528,negated_conjecture,($false),527,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 215
% # ...of these trivial : 1
% # ...subsumed : 4
% # ...remaining for further processing: 210
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 269
% # ...of the previous two non-trivial : 232
% # Contextual simplify-reflections : 5
% # Paramodulations : 251
% # Factorizations : 10
% # Equation resolutions : 8
% # Current number of processed clauses: 116
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 95
% # Current number of unprocessed clauses: 186
% # ...number of literals in the above : 779
% # Clause-clause subsumption calls (NU) : 493
% # Rec. Clause-clause subsumption calls : 297
% # Unit Clause-clause subsumption calls : 94
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 102 leaves, 1.86+/-2.101 terms/leaf
% # Paramod-from index: 45 leaves, 1.16+/-0.419 terms/leaf
% # Paramod-into index: 93 leaves, 1.41+/-1.050 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.007 s
% # Total time : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP11395/GEO127+1.tptp
%
%------------------------------------------------------------------------------