TSTP Solution File: GEO191+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO191+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 05:09:58 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP9377/GEO191+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9377/GEO191+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9377/GEO191+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 9509
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(2, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X3)|convergent_lines(X2,X3))),file('/tmp/SRASS.s.p', apart6)).
% fof(3, axiom,![X1]:![X2]:![X3]:(convergent_lines(X1,X2)=>((apart_point_and_line(X3,X1)|apart_point_and_line(X3,X2))=>distinct_points(X3,intersection_point(X1,X2)))),file('/tmp/SRASS.s.p', con2)).
% fof(4, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>distinct_lines(X1,X2)),file('/tmp/SRASS.s.p', ceq3)).
% fof(5, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(6, axiom,![X1]:~(distinct_lines(X1,X1)),file('/tmp/SRASS.s.p', apart2)).
% fof(7, axiom,![X1]:![X2]:![X3]:(distinct_points(X1,X2)=>(distinct_points(X1,X3)|distinct_points(X2,X3))),file('/tmp/SRASS.s.p', apart4)).
% fof(8, axiom,![X1]:![X2]:![X3]:(distinct_lines(X1,X2)=>(distinct_lines(X1,X3)|distinct_lines(X2,X3))),file('/tmp/SRASS.s.p', apart5)).
% fof(9, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),file('/tmp/SRASS.s.p', ceq1)).
% fof(10, axiom,![X1]:![X2]:![X3]:(apart_point_and_line(X1,X2)=>(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),file('/tmp/SRASS.s.p', ceq2)).
% fof(11, axiom,![X1]:![X2]:![X4]:![X5]:((distinct_points(X1,X2)&distinct_lines(X4,X5))=>(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),file('/tmp/SRASS.s.p', cu1)).
% fof(13, conjecture,![X1]:![X2]:![X4]:![X5]:(((convergent_lines(X1,X2)&convergent_lines(X4,X5))&(apart_point_and_line(intersection_point(X1,X2),X4)|apart_point_and_line(intersection_point(X1,X2),X5)))=>(apart_point_and_line(intersection_point(X4,X5),X1)|apart_point_and_line(intersection_point(X4,X5),X2))),file('/tmp/SRASS.s.p', con)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X4]:![X5]:(((convergent_lines(X1,X2)&convergent_lines(X4,X5))&(apart_point_and_line(intersection_point(X1,X2),X4)|apart_point_and_line(intersection_point(X1,X2),X5)))=>(apart_point_and_line(intersection_point(X4,X5),X1)|apart_point_and_line(intersection_point(X4,X5),X2)))),inference(assume_negation,[status(cth)],[13])).
% fof(15, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(16, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(17, plain,![X1]:~(distinct_lines(X1,X1)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(18, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(19,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X3)|convergent_lines(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(21, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|(convergent_lines(X4,X6)|convergent_lines(X5,X6))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X1]:![X2]:![X3]:(~(convergent_lines(X1,X2))|((~(apart_point_and_line(X3,X1))&~(apart_point_and_line(X3,X2)))|distinct_points(X3,intersection_point(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(24, plain,![X4]:![X5]:![X6]:(~(convergent_lines(X4,X5))|((~(apart_point_and_line(X6,X4))&~(apart_point_and_line(X6,X5)))|distinct_points(X6,intersection_point(X4,X5)))),inference(variable_rename,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:(((~(apart_point_and_line(X6,X4))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))&((~(apart_point_and_line(X6,X5))|distinct_points(X6,intersection_point(X4,X5)))|~(convergent_lines(X4,X5)))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(distinct_points(X3,intersection_point(X1,X2))|~convergent_lines(X1,X2)|~apart_point_and_line(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|distinct_lines(X1,X2)),inference(fof_nnf,[status(thm)],[4])).
% fof(29, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|distinct_lines(X3,X4)),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(distinct_lines(X1,X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(32,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X2]:~(distinct_lines(X2,X2)),inference(variable_rename,[status(thm)],[17])).
% cnf(34,plain,(~distinct_lines(X1,X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X1]:![X2]:![X3]:(~(distinct_points(X1,X2))|(distinct_points(X1,X3)|distinct_points(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(36, plain,![X4]:![X5]:![X6]:(~(distinct_points(X4,X5))|(distinct_points(X4,X6)|distinct_points(X5,X6))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:![X3]:(~(distinct_lines(X1,X2))|(distinct_lines(X1,X3)|distinct_lines(X2,X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(39, plain,![X4]:![X5]:![X6]:(~(distinct_lines(X4,X5))|(distinct_lines(X4,X6)|distinct_lines(X5,X6))),inference(variable_rename,[status(thm)],[38])).
% cnf(40,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~distinct_lines(X3,X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_points(X1,X3)|apart_point_and_line(X3,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(42, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_points(X4,X6)|apart_point_and_line(X6,X5))),inference(variable_rename,[status(thm)],[41])).
% cnf(43,plain,(apart_point_and_line(X1,X2)|distinct_points(X3,X1)|~apart_point_and_line(X3,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X1]:![X2]:![X3]:(~(apart_point_and_line(X1,X2))|(distinct_lines(X2,X3)|apart_point_and_line(X1,X3))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X4]:![X5]:![X6]:(~(apart_point_and_line(X4,X5))|(distinct_lines(X5,X6)|apart_point_and_line(X4,X6))),inference(variable_rename,[status(thm)],[44])).
% cnf(46,plain,(apart_point_and_line(X1,X2)|distinct_lines(X3,X2)|~apart_point_and_line(X1,X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X1]:![X2]:![X4]:![X5]:((~(distinct_points(X1,X2))|~(distinct_lines(X4,X5)))|(((apart_point_and_line(X1,X4)|apart_point_and_line(X1,X5))|apart_point_and_line(X2,X4))|apart_point_and_line(X2,X5))),inference(fof_nnf,[status(thm)],[11])).
% fof(48, plain,![X6]:![X7]:![X8]:![X9]:((~(distinct_points(X6,X7))|~(distinct_lines(X8,X9)))|(((apart_point_and_line(X6,X8)|apart_point_and_line(X6,X9))|apart_point_and_line(X7,X8))|apart_point_and_line(X7,X9))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(apart_point_and_line(X1,X2)|apart_point_and_line(X1,X3)|apart_point_and_line(X4,X2)|apart_point_and_line(X4,X3)|~distinct_lines(X3,X2)|~distinct_points(X4,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(55, negated_conjecture,?[X1]:?[X2]:?[X4]:?[X5]:(((convergent_lines(X1,X2)&convergent_lines(X4,X5))&(apart_point_and_line(intersection_point(X1,X2),X4)|apart_point_and_line(intersection_point(X1,X2),X5)))&(~(apart_point_and_line(intersection_point(X4,X5),X1))&~(apart_point_and_line(intersection_point(X4,X5),X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(56, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((convergent_lines(X6,X7)&convergent_lines(X8,X9))&(apart_point_and_line(intersection_point(X6,X7),X8)|apart_point_and_line(intersection_point(X6,X7),X9)))&(~(apart_point_and_line(intersection_point(X8,X9),X6))&~(apart_point_and_line(intersection_point(X8,X9),X7)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(((convergent_lines(esk1_0,esk2_0)&convergent_lines(esk3_0,esk4_0))&(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)))&(~(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0))&~(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(~apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(60,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(61,negated_conjecture,(convergent_lines(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(62,negated_conjecture,(convergent_lines(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(64,negated_conjecture,(convergent_lines(esk1_0,X1)|convergent_lines(esk2_0,X1)),inference(spm,[status(thm)],[22,62,theory(equality)])).
% cnf(66,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[32,26,theory(equality)])).
% cnf(67,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[32,27,theory(equality)])).
% cnf(69,negated_conjecture,(distinct_lines(esk4_0,X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[46,60,theory(equality)])).
% cnf(70,plain,(distinct_points(X1,X2)|distinct_points(intersection_point(X3,X4),X2)|~apart_point_and_line(X1,X4)|~convergent_lines(X3,X4)),inference(spm,[status(thm)],[37,26,theory(equality)])).
% cnf(72,plain,(distinct_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(spm,[status(thm)],[40,30,theory(equality)])).
% cnf(77,negated_conjecture,(convergent_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[19,64,theory(equality)])).
% cnf(197,negated_conjecture,(distinct_points(intersection_point(X1,X2),X3)|distinct_points(intersection_point(esk1_0,esk2_0),X3)|distinct_lines(esk4_0,X2)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|~convergent_lines(X1,X2)),inference(spm,[status(thm)],[70,69,theory(equality)])).
% cnf(279,negated_conjecture,(distinct_lines(esk1_0,X1)|distinct_lines(esk2_0,X1)),inference(spm,[status(thm)],[72,77,theory(equality)])).
% cnf(315,negated_conjecture,(distinct_lines(esk2_0,esk1_0)),inference(spm,[status(thm)],[34,279,theory(equality)])).
% cnf(319,negated_conjecture,(apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|apart_point_and_line(X2,esk2_0)|apart_point_and_line(X2,esk1_0)|~distinct_points(X1,X2)),inference(spm,[status(thm)],[49,315,theory(equality)])).
% cnf(1432,negated_conjecture,(distinct_lines(esk4_0,esk4_0)|distinct_points(intersection_point(esk1_0,esk2_0),X1)|distinct_points(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[197,61,theory(equality)])).
% cnf(1534,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),X1)|distinct_points(intersection_point(esk3_0,esk4_0),X1)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(sr,[status(thm)],[1432,34,theory(equality)])).
% cnf(3296,negated_conjecture,(distinct_points(intersection_point(esk3_0,esk4_0),intersection_point(esk1_0,esk2_0))|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[32,1534,theory(equality)])).
% cnf(3840,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(spm,[status(thm)],[319,3296,theory(equality)])).
% cnf(3859,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(sr,[status(thm)],[3840,59,theory(equality)])).
% cnf(3860,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)),inference(sr,[status(thm)],[3859,58,theory(equality)])).
% cnf(3899,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,3860,theory(equality)])).
% cnf(3900,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|$false),inference(rw,[status(thm)],[3899,62,theory(equality)])).
% cnf(3901,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(cn,[status(thm)],[3900,theory(equality)])).
% cnf(3902,negated_conjecture,(distinct_points(intersection_point(esk1_0,esk2_0),X1)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)),inference(spm,[status(thm)],[43,3901,theory(equality)])).
% cnf(3912,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)|apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk3_0)),inference(spm,[status(thm)],[319,3902,theory(equality)])).
% cnf(4758,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[67,3912,theory(equality)])).
% cnf(4759,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)|$false),inference(rw,[status(thm)],[4758,62,theory(equality)])).
% cnf(4760,negated_conjecture,(apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)|apart_point_and_line(X1,esk3_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk1_0)),inference(cn,[status(thm)],[4759,theory(equality)])).
% cnf(4805,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|~convergent_lines(esk1_0,esk2_0)),inference(spm,[status(thm)],[66,4760,theory(equality)])).
% cnf(4806,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)|$false),inference(rw,[status(thm)],[4805,62,theory(equality)])).
% cnf(4807,negated_conjecture,(apart_point_and_line(X1,esk1_0)|apart_point_and_line(X1,esk2_0)|apart_point_and_line(X1,esk3_0)),inference(cn,[status(thm)],[4806,theory(equality)])).
% cnf(4810,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0)|apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)),inference(spm,[status(thm)],[59,4807,theory(equality)])).
% cnf(4815,negated_conjecture,(apart_point_and_line(intersection_point(esk3_0,esk4_0),esk3_0)),inference(sr,[status(thm)],[4810,58,theory(equality)])).
% cnf(4820,negated_conjecture,(~convergent_lines(esk3_0,esk4_0)),inference(spm,[status(thm)],[67,4815,theory(equality)])).
% cnf(4821,negated_conjecture,($false),inference(rw,[status(thm)],[4820,61,theory(equality)])).
% cnf(4822,negated_conjecture,($false),inference(cn,[status(thm)],[4821,theory(equality)])).
% cnf(4823,negated_conjecture,($false),4822,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 799
% # ...of these trivial : 1
% # ...subsumed : 529
% # ...remaining for further processing: 269
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 19
% # Generated clauses : 3943
% # ...of the previous two non-trivial : 3578
% # Contextual simplify-reflections : 180
% # Paramodulations : 3433
% # Factorizations : 510
% # Equation resolutions : 0
% # Current number of processed clauses: 219
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 201
% # Current number of unprocessed clauses: 2466
% # ...number of literals in the above : 16254
% # Clause-clause subsumption calls (NU) : 12576
% # Rec. Clause-clause subsumption calls : 5585
% # Unit Clause-clause subsumption calls : 158
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 73 leaves, 2.05+/-2.214 terms/leaf
% # Paramod-from index: 43 leaves, 1.84+/-1.683 terms/leaf
% # Paramod-into index: 56 leaves, 1.95+/-1.807 terms/leaf
% # -------------------------------------------------
% # User time : 0.246 s
% # System time : 0.009 s
% # Total time : 0.255 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.40 CPU 0.47 WC
% FINAL PrfWatch: 0.40 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP9377/GEO191+2.tptp
%
%------------------------------------------------------------------------------