%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO202+3 : TPTP v5.0.0. Released v4.0.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 : Wed Dec 29 05:08:45 EST 2010
% Result : Theorem 124.63s
% Output : Solution 131.48s
% 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/SystemOnTPTP1714/GEO202+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~con:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... apart1:
% CSA axiom apart1 found
% Looking for CSA axiom ... apart3: CSA axiom apart3 found
% Looking for CSA axiom ... apart4:
% CSA axiom apart4 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ax6:
% CSA axiom ax6 found
% Looking for CSA axiom ... ax1:
% CSA axiom ax1 found
% Looking for CSA axiom ... ci1:
% CSA axiom ci1 found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ci2:
% CSA axiom ci2 found
% Looking for CSA axiom ... ci3:
% CSA axiom ci3 found
% Looking for CSA axiom ... ci4:
% CSA axiom ci4 found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ceq1: CSA axiom ceq1 found
% Looking for CSA axiom ... con1:
% CSA axiom con1 found
% Looking for CSA axiom ... int1:
% CSA axiom int1 found
% ---- Iteration 5 (12 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ceq3:
% CSA axiom ceq3 found
% Looking for CSA axiom ... p1:
% CSA axiom p1 found
% Looking for CSA axiom ... occu1:
% CSA axiom occu1 found
% ---- Iteration 6 (15 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... oac1:
% CSA axiom oac1 found
% Looking for CSA axiom ... coipo1:
% cotno1: CSA axiom cotno1 found
% Looking for CSA axiom ... couo1:
% CSA axiom couo1 found
% ---- Iteration 7 (18 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... coipo1:
% cp1:
% CSA axiom cp1 found
% Looking for CSA axiom ... a3:
% CSA axiom a3 found
% Looking for CSA axiom ... apart2:
% apart5:
% cu1:
% CSA axiom cu1 found
% ---- Iteration 8 (21 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :cu1:a3:cp1:couo1:cotno1:oac1:occu1:p1:ceq3:int1:con1:ceq1:ci4:ci3:ci2:ci1:ax1:ax6:apart4:apart3:apart1 (21)
% Unselected axioms are ... :coipo1:apart2:apart5:ceq2:par1:orth1:cup1:ooc1:ax2:a5:cp2:ooc2:ouo1:a4 (14)
% SZS status THM for /tmp/SystemOnTPTP1714/GEO202+3.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP1714/GEO202+3.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 5801
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.93 CPU 4.03 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.91 CPU 6.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:![X4]:((distinct_points(X1,X2)&distinct_lines(X3,X4))=>(((apart_point_and_line(X1,X3)|apart_point_and_line(X1,X4))|apart_point_and_line(X2,X3))|apart_point_and_line(X2,X4))),file('/tmp/SRASS.s.p', cu1)).
% fof(3, axiom,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),file('/tmp/SRASS.s.p', cp1)).
% fof(9, axiom,![X1]:![X2]:![X8]:(convergent_lines(X1,X2)=>(distinct_lines(X2,X8)|convergent_lines(X1,X8))),file('/tmp/SRASS.s.p', ceq3)).
% fof(13, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),file('/tmp/SRASS.s.p', ci4)).
% fof(14, axiom,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),file('/tmp/SRASS.s.p', ci3)).
% fof(16, axiom,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),file('/tmp/SRASS.s.p', ci1)).
% fof(17, axiom,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),file('/tmp/SRASS.s.p', ax1)).
% fof(18, axiom,![X1]:![X2]:![X8]:(convergent_lines(X1,X2)=>(convergent_lines(X1,X8)|convergent_lines(X2,X8))),file('/tmp/SRASS.s.p', ax6)).
% fof(19, axiom,![X1]:![X2]:![X8]:(distinct_points(X1,X2)=>(distinct_points(X1,X8)|distinct_points(X2,X8))),file('/tmp/SRASS.s.p', apart4)).
% fof(20, axiom,![X1]:~(convergent_lines(X1,X1)),file('/tmp/SRASS.s.p', apart3)).
% fof(21, axiom,![X1]:~(distinct_points(X1,X1)),file('/tmp/SRASS.s.p', apart1)).
% fof(22, conjecture,![X1]:![X2]:![X8]:(((distinct_points(X1,X2)&distinct_points(X1,X8))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X8)))=>equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X8)),X1)),file('/tmp/SRASS.s.p', con)).
% fof(23, negated_conjecture,~(![X1]:![X2]:![X8]:(((distinct_points(X1,X2)&distinct_points(X1,X8))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X8)))=>equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X8)),X1))),inference(assume_negation,[status(cth)],[22])).
% fof(25, plain,![X1]:![X2]:~(convergent_lines(parallel_through_point(X2,X1),X2)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(28, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(29, plain,![X1]:![X2]:(convergent_lines(X1,X2)=>~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(31, plain,![X1]:![X2]:(distinct_points(X1,X2)=>~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_simplification,[status(thm)],[16,theory(equality)])).
% fof(32, plain,![X1]:![X2]:(equal_points(X1,X2)<=>~(distinct_points(X1,X2))),inference(fof_simplification,[status(thm)],[17,theory(equality)])).
% fof(33, plain,![X1]:~(convergent_lines(X1,X1)),inference(fof_simplification,[status(thm)],[20,theory(equality)])).
% fof(34, plain,![X1]:~(distinct_points(X1,X1)),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(35, plain,![X1]:![X2]:![X3]:![X4]:((~(distinct_points(X1,X2))|~(distinct_lines(X3,X4)))|(((apart_point_and_line(X1,X3)|apart_point_and_line(X1,X4))|apart_point_and_line(X2,X3))|apart_point_and_line(X2,X4))),inference(fof_nnf,[status(thm)],[1])).
% fof(36, plain,![X5]:![X6]:![X7]:![X8]:((~(distinct_points(X5,X6))|~(distinct_lines(X7,X8)))|(((apart_point_and_line(X5,X7)|apart_point_and_line(X5,X8))|apart_point_and_line(X6,X7))|apart_point_and_line(X6,X8))),inference(variable_rename,[status(thm)],[35])).
% cnf(37,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)],[36])).
% fof(42, plain,![X3]:![X4]:~(convergent_lines(parallel_through_point(X4,X3),X4)),inference(variable_rename,[status(thm)],[25])).
% cnf(43,plain,(~convergent_lines(parallel_through_point(X1,X2),X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(66, plain,![X1]:![X2]:![X8]:(~(convergent_lines(X1,X2))|(distinct_lines(X2,X8)|convergent_lines(X1,X8))),inference(fof_nnf,[status(thm)],[9])).
% fof(67, plain,![X9]:![X10]:![X11]:(~(convergent_lines(X9,X10))|(distinct_lines(X10,X11)|convergent_lines(X9,X11))),inference(variable_rename,[status(thm)],[66])).
% cnf(68,plain,(convergent_lines(X1,X2)|distinct_lines(X3,X2)|~convergent_lines(X1,X3)),inference(split_conjunct,[status(thm)],[67])).
% fof(78, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X2))),inference(fof_nnf,[status(thm)],[28])).
% fof(79, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X4))),inference(variable_rename,[status(thm)],[78])).
% cnf(80,plain,(~apart_point_and_line(intersection_point(X1,X2),X2)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(81, plain,![X1]:![X2]:(~(convergent_lines(X1,X2))|~(apart_point_and_line(intersection_point(X1,X2),X1))),inference(fof_nnf,[status(thm)],[29])).
% fof(82, plain,![X3]:![X4]:(~(convergent_lines(X3,X4))|~(apart_point_and_line(intersection_point(X3,X4),X3))),inference(variable_rename,[status(thm)],[81])).
% cnf(83,plain,(~apart_point_and_line(intersection_point(X1,X2),X1)|~convergent_lines(X1,X2)),inference(split_conjunct,[status(thm)],[82])).
% fof(87, plain,![X1]:![X2]:(~(distinct_points(X1,X2))|~(apart_point_and_line(X1,line_connecting(X1,X2)))),inference(fof_nnf,[status(thm)],[31])).
% fof(88, plain,![X3]:![X4]:(~(distinct_points(X3,X4))|~(apart_point_and_line(X3,line_connecting(X3,X4)))),inference(variable_rename,[status(thm)],[87])).
% cnf(89,plain,(~apart_point_and_line(X1,line_connecting(X1,X2))|~distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[88])).
% fof(90, plain,![X1]:![X2]:((~(equal_points(X1,X2))|~(distinct_points(X1,X2)))&(distinct_points(X1,X2)|equal_points(X1,X2))),inference(fof_nnf,[status(thm)],[32])).
% fof(91, plain,![X3]:![X4]:((~(equal_points(X3,X4))|~(distinct_points(X3,X4)))&(distinct_points(X3,X4)|equal_points(X3,X4))),inference(variable_rename,[status(thm)],[90])).
% cnf(92,plain,(equal_points(X1,X2)|distinct_points(X1,X2)),inference(split_conjunct,[status(thm)],[91])).
% fof(94, plain,![X1]:![X2]:![X8]:(~(convergent_lines(X1,X2))|(convergent_lines(X1,X8)|convergent_lines(X2,X8))),inference(fof_nnf,[status(thm)],[18])).
% fof(95, plain,![X9]:![X10]:![X11]:(~(convergent_lines(X9,X10))|(convergent_lines(X9,X11)|convergent_lines(X10,X11))),inference(variable_rename,[status(thm)],[94])).
% cnf(96,plain,(convergent_lines(X1,X2)|convergent_lines(X3,X2)|~convergent_lines(X3,X1)),inference(split_conjunct,[status(thm)],[95])).
% fof(97, plain,![X1]:![X2]:![X8]:(~(distinct_points(X1,X2))|(distinct_points(X1,X8)|distinct_points(X2,X8))),inference(fof_nnf,[status(thm)],[19])).
% fof(98, plain,![X9]:![X10]:![X11]:(~(distinct_points(X9,X10))|(distinct_points(X9,X11)|distinct_points(X10,X11))),inference(variable_rename,[status(thm)],[97])).
% cnf(99,plain,(distinct_points(X1,X2)|distinct_points(X3,X2)|~distinct_points(X3,X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(100, plain,![X2]:~(convergent_lines(X2,X2)),inference(variable_rename,[status(thm)],[33])).
% cnf(101,plain,(~convergent_lines(X1,X1)),inference(split_conjunct,[status(thm)],[100])).
% fof(102, plain,![X2]:~(distinct_points(X2,X2)),inference(variable_rename,[status(thm)],[34])).
% cnf(103,plain,(~distinct_points(X1,X1)),inference(split_conjunct,[status(thm)],[102])).
% fof(104, negated_conjecture,?[X1]:?[X2]:?[X8]:(((distinct_points(X1,X2)&distinct_points(X1,X8))&convergent_lines(line_connecting(X1,X2),line_connecting(X1,X8)))&~(equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X8)),X1))),inference(fof_nnf,[status(thm)],[23])).
% fof(105, negated_conjecture,?[X9]:?[X10]:?[X11]:(((distinct_points(X9,X10)&distinct_points(X9,X11))&convergent_lines(line_connecting(X9,X10),line_connecting(X9,X11)))&~(equal_points(intersection_point(line_connecting(X9,X10),line_connecting(X9,X11)),X9))),inference(variable_rename,[status(thm)],[104])).
% fof(106, negated_conjecture,(((distinct_points(esk1_0,esk2_0)&distinct_points(esk1_0,esk3_0))&convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)))&~(equal_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0))),inference(skolemize,[status(esa)],[105])).
% cnf(107,negated_conjecture,(~equal_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)),inference(split_conjunct,[status(thm)],[106])).
% cnf(108,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[106])).
% cnf(109,negated_conjecture,(distinct_points(esk1_0,esk3_0)),inference(split_conjunct,[status(thm)],[106])).
% cnf(110,negated_conjecture,(distinct_points(esk1_0,esk2_0)),inference(split_conjunct,[status(thm)],[106])).
% cnf(113,negated_conjecture,(distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)),inference(spm,[status(thm)],[107,92,theory(equality)])).
% cnf(118,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk3_0),X1)|convergent_lines(line_connecting(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[96,108,theory(equality)])).
% cnf(136,negated_conjecture,(distinct_points(esk1_0,X1)|distinct_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),X1)),inference(spm,[status(thm)],[99,113,theory(equality)])).
% cnf(137,negated_conjecture,(distinct_points(esk1_0,intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)))),inference(spm,[status(thm)],[103,136,theory(equality)])).
% cnf(156,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(line_connecting(esk1_0,esk3_0),X2)|convergent_lines(line_connecting(esk1_0,esk2_0),X1)),inference(spm,[status(thm)],[96,118,theory(equality)])).
% cnf(769,negated_conjecture,(convergent_lines(line_connecting(esk1_0,esk2_0),X1)|convergent_lines(X1,line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[101,156,theory(equality)])).
% cnf(904,negated_conjecture,(convergent_lines(X1,X2)|convergent_lines(line_connecting(esk1_0,esk2_0),X2)|convergent_lines(X1,line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[96,769,theory(equality)])).
% cnf(982,negated_conjecture,(convergent_lines(X1,line_connecting(esk1_0,esk3_0))|convergent_lines(X1,line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[101,904,theory(equality)])).
% cnf(1093,negated_conjecture,(convergent_lines(parallel_through_point(line_connecting(esk1_0,esk3_0),X1),line_connecting(esk1_0,esk2_0))),inference(spm,[status(thm)],[43,982,theory(equality)])).
% cnf(1108,negated_conjecture,(convergent_lines(parallel_through_point(line_connecting(esk1_0,esk3_0),X1),X2)|distinct_lines(line_connecting(esk1_0,esk2_0),X2)),inference(spm,[status(thm)],[68,1093,theory(equality)])).
% cnf(1206,negated_conjecture,(distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[43,1108,theory(equality)])).
% cnf(1208,negated_conjecture,(apart_point_and_line(X1,line_connecting(esk1_0,esk3_0))|apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))|apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))|~distinct_points(X2,X1)),inference(spm,[status(thm)],[37,1206,theory(equality)])).
% cnf(75164,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[1208,137,theory(equality)])).
% cnf(76775,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|~convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[80,75164,theory(equality)])).
% cnf(76776,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[76775,108,theory(equality)])).
% cnf(76777,negated_conjecture,(apart_point_and_line(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[76776,theory(equality)])).
% cnf(76923,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|~convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))),inference(spm,[status(thm)],[83,76777,theory(equality)])).
% cnf(76924,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))|$false),inference(rw,[status(thm)],[76923,108,theory(equality)])).
% cnf(76925,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0))),inference(cn,[status(thm)],[76924,theory(equality)])).
% cnf(76927,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|~distinct_points(esk1_0,esk3_0)),inference(spm,[status(thm)],[89,76925,theory(equality)])).
% cnf(76928,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))|$false),inference(rw,[status(thm)],[76927,109,theory(equality)])).
% cnf(76929,negated_conjecture,(apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))),inference(cn,[status(thm)],[76928,theory(equality)])).
% cnf(76931,negated_conjecture,(~distinct_points(esk1_0,esk2_0)),inference(spm,[status(thm)],[89,76929,theory(equality)])).
% cnf(76934,negated_conjecture,($false),inference(rw,[status(thm)],[76931,110,theory(equality)])).
% cnf(76935,negated_conjecture,($false),inference(cn,[status(thm)],[76934,theory(equality)])).
% cnf(76936,negated_conjecture,($false),76935,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3769
% # ...of these trivial : 18
% # ...subsumed : 2435
% # ...remaining for further processing: 1316
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 72
% # Backward-rewritten : 6
% # Generated clauses : 66133
% # ...of the previous two non-trivial : 59642
% # Contextual simplify-reflections : 992
% # Paramodulations : 63425
% # Factorizations : 2708
% # Equation resolutions : 0
% # Current number of processed clauses: 1238
% # Positive orientable unit clauses: 66
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 1168
% # Current number of unprocessed clauses: 53626
% # ...number of literals in the above : 363555
% # Clause-clause subsumption calls (NU) : 283513
% # Rec. Clause-clause subsumption calls : 64919
% # Unit Clause-clause subsumption calls : 13926
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 71
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 171 leaves, 4.13+/-5.030 terms/leaf
% # Paramod-from index: 136 leaves, 4.21+/-5.211 terms/leaf
% # Paramod-into index: 162 leaves, 4.12+/-5.077 terms/leaf
% # -------------------------------------------------
% # User time : 5.158 s
% # System time : 0.080 s
% # Total time : 5.238 s
% # Maximum resident set size: 0 pages
% PrfWatch: 6.27 CPU 6.40 WC
% FINAL PrfWatch: 6.27 CPU 6.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP1714/GEO202+3.tptp
%
%------------------------------------------------------------------------------