%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GRA014+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 : Wed Dec 29 05:41:54 EST 2010
% Result : Theorem 32.00s
% Output : Solution 32.00s
% 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/SystemOnTPTP31973/GRA014+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31973/GRA014+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31973/GRA014+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 32069
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.90 CPU 8.02 WC
% PrfWatch: 9.89 CPU 10.03 WC
% PrfWatch: 11.89 CPU 12.03 WC
% PrfWatch: 13.87 CPU 14.04 WC
% PrfWatch: 15.87 CPU 16.04 WC
% PrfWatch: 17.86 CPU 18.05 WC
% PrfWatch: 19.84 CPU 20.05 WC
% PrfWatch: 21.84 CPU 22.06 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 23.83 CPU 24.06 WC
% PrfWatch: 25.82 CPU 26.07 WC
% PrfWatch: 27.82 CPU 28.07 WC
% PrfWatch: 29.81 CPU 30.07 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(((red(X1,X2)&red(X2,X3))&red(X1,X3))=>goal),file('/tmp/SRASS.s.p', red_clique)).
% fof(2, axiom,![X1]:![X2]:![X3]:(((green(X1,X2)&green(X2,X3))&green(X1,X3))=>goal),file('/tmp/SRASS.s.p', green_clique)).
% fof(3, axiom,![X1]:![X2]:![X3]:((less_than(X1,X2)&less_than(X2,X3))=>less_than(X1,X3)),file('/tmp/SRASS.s.p', less_than_transitive)).
% fof(4, axiom,![X1]:![X2]:(less_than(X1,X2)=>(red(X1,X2)|green(X1,X2))),file('/tmp/SRASS.s.p', partition)).
% fof(5, axiom,((((less_than(n1,n2)&less_than(n2,n3))&less_than(n3,n4))&less_than(n4,n5))&less_than(n5,n6)),file('/tmp/SRASS.s.p', ordering)).
% fof(6, conjecture,goal,file('/tmp/SRASS.s.p', goal_to_be_proved)).
% fof(7, negated_conjecture,~(goal),inference(assume_negation,[status(cth)],[6])).
% fof(8, negated_conjecture,~(goal),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(9, plain,![X1]:![X2]:![X3]:(((~(red(X1,X2))|~(red(X2,X3)))|~(red(X1,X3)))|goal),inference(fof_nnf,[status(thm)],[1])).
% fof(10, plain,![X4]:![X5]:![X6]:(((~(red(X4,X5))|~(red(X5,X6)))|~(red(X4,X6)))|goal),inference(variable_rename,[status(thm)],[9])).
% cnf(11,plain,(goal|~red(X1,X2)|~red(X3,X2)|~red(X1,X3)),inference(split_conjunct,[status(thm)],[10])).
% fof(12, plain,![X1]:![X2]:![X3]:(((~(green(X1,X2))|~(green(X2,X3)))|~(green(X1,X3)))|goal),inference(fof_nnf,[status(thm)],[2])).
% fof(13, plain,![X4]:![X5]:![X6]:(((~(green(X4,X5))|~(green(X5,X6)))|~(green(X4,X6)))|goal),inference(variable_rename,[status(thm)],[12])).
% cnf(14,plain,(goal|~green(X1,X2)|~green(X3,X2)|~green(X1,X3)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X1]:![X2]:![X3]:((~(less_than(X1,X2))|~(less_than(X2,X3)))|less_than(X1,X3)),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X4]:![X5]:![X6]:((~(less_than(X4,X5))|~(less_than(X5,X6)))|less_than(X4,X6)),inference(variable_rename,[status(thm)],[15])).
% cnf(17,plain,(less_than(X1,X2)|~less_than(X3,X2)|~less_than(X1,X3)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X1]:![X2]:(~(less_than(X1,X2))|(red(X1,X2)|green(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(19, plain,![X3]:![X4]:(~(less_than(X3,X4))|(red(X3,X4)|green(X3,X4))),inference(variable_rename,[status(thm)],[18])).
% cnf(20,plain,(green(X1,X2)|red(X1,X2)|~less_than(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(less_than(n5,n6)),inference(split_conjunct,[status(thm)],[5])).
% cnf(22,plain,(less_than(n4,n5)),inference(split_conjunct,[status(thm)],[5])).
% cnf(23,plain,(less_than(n3,n4)),inference(split_conjunct,[status(thm)],[5])).
% cnf(24,plain,(less_than(n2,n3)),inference(split_conjunct,[status(thm)],[5])).
% cnf(25,plain,(less_than(n1,n2)),inference(split_conjunct,[status(thm)],[5])).
% cnf(26,negated_conjecture,(~goal),inference(split_conjunct,[status(thm)],[8])).
% cnf(27,plain,(less_than(X1,n6)|~less_than(X1,n5)),inference(pm,[status(thm)],[17,21,theory(equality)])).
% cnf(28,plain,(less_than(X1,n5)|~less_than(X1,n4)),inference(pm,[status(thm)],[17,22,theory(equality)])).
% cnf(29,plain,(less_than(X1,n4)|~less_than(X1,n3)),inference(pm,[status(thm)],[17,23,theory(equality)])).
% cnf(30,plain,(less_than(X1,n3)|~less_than(X1,n2)),inference(pm,[status(thm)],[17,24,theory(equality)])).
% cnf(32,plain,(~red(X3,X2)|~red(X1,X3)|~red(X1,X2)),inference(sr,[status(thm)],[11,26,theory(equality)])).
% cnf(33,plain,(~green(X3,X2)|~green(X1,X3)|~green(X1,X2)),inference(sr,[status(thm)],[14,26,theory(equality)])).
% cnf(34,plain,(red(X1,X2)|~green(X3,X1)|~green(X3,X2)|~less_than(X1,X2)),inference(pm,[status(thm)],[33,20,theory(equality)])).
% cnf(35,plain,(red(X1,X2)|red(X3,X1)|~less_than(X1,X2)|~green(X3,X2)|~less_than(X3,X1)),inference(pm,[status(thm)],[34,20,theory(equality)])).
% cnf(36,plain,(red(X1,X2)|red(X3,X1)|red(X3,X2)|~less_than(X1,X2)|~less_than(X3,X1)|~less_than(X3,X2)),inference(pm,[status(thm)],[35,20,theory(equality)])).
% cnf(37,plain,(red(n5,n6)|red(X1,n5)|red(X1,n6)|~less_than(X1,n5)|~less_than(X1,n6)),inference(pm,[status(thm)],[36,21,theory(equality)])).
% cnf(38,plain,(red(n4,n5)|red(X1,n4)|red(X1,n5)|~less_than(X1,n4)|~less_than(X1,n5)),inference(pm,[status(thm)],[36,22,theory(equality)])).
% cnf(39,plain,(red(n3,n4)|red(X1,n3)|red(X1,n4)|~less_than(X1,n3)|~less_than(X1,n4)),inference(pm,[status(thm)],[36,23,theory(equality)])).
% cnf(40,plain,(red(n2,n3)|red(X1,n2)|red(X1,n3)|~less_than(X1,n2)|~less_than(X1,n3)),inference(pm,[status(thm)],[36,24,theory(equality)])).
% cnf(42,plain,(red(n5,n6)|red(n4,n5)|red(n4,n6)|~less_than(n4,n6)),inference(pm,[status(thm)],[37,22,theory(equality)])).
% cnf(43,plain,(red(X1,n6)|red(X2,X1)|red(X2,n6)|~less_than(X2,X1)|~less_than(X2,n6)|~less_than(X1,n5)),inference(pm,[status(thm)],[36,27,theory(equality)])).
% cnf(44,plain,(less_than(X1,n6)|~less_than(X1,X2)|~less_than(X2,n5)),inference(pm,[status(thm)],[17,27,theory(equality)])).
% cnf(45,plain,(red(X1,n5)|red(X2,X1)|red(X2,n5)|~less_than(X2,X1)|~less_than(X2,n5)|~less_than(X1,n4)),inference(pm,[status(thm)],[36,28,theory(equality)])).
% cnf(46,plain,(less_than(X1,n5)|~less_than(X1,X2)|~less_than(X2,n4)),inference(pm,[status(thm)],[17,28,theory(equality)])).
% cnf(47,plain,(red(n5,n6)|red(X1,n5)|red(X1,n6)|~less_than(X1,n6)|~less_than(X1,n4)),inference(pm,[status(thm)],[37,28,theory(equality)])).
% cnf(48,plain,(red(X1,n4)|red(X2,X1)|red(X2,n4)|~less_than(X2,X1)|~less_than(X2,n4)|~less_than(X1,n3)),inference(pm,[status(thm)],[36,29,theory(equality)])).
% cnf(49,plain,(less_than(X1,n4)|~less_than(X1,X2)|~less_than(X2,n3)),inference(pm,[status(thm)],[17,29,theory(equality)])).
% cnf(52,plain,(red(n4,n5)|red(n3,n4)|red(n3,n5)|~less_than(n3,n5)),inference(pm,[status(thm)],[38,23,theory(equality)])).
% cnf(53,plain,(red(n4,n5)|red(X1,n4)|red(X1,n5)|~less_than(X1,n5)|~less_than(X1,n3)),inference(pm,[status(thm)],[38,29,theory(equality)])).
% cnf(54,plain,(red(n4,n5)|red(n4,n6)|~red(X1,n5)|~red(X1,n6)|~less_than(n4,n6)),inference(pm,[status(thm)],[32,42,theory(equality)])).
% cnf(56,plain,(red(n3,n4)|red(n3,n5)|~red(X1,n4)|~red(X1,n5)|~less_than(n3,n5)),inference(pm,[status(thm)],[32,52,theory(equality)])).
% cnf(57,plain,(less_than(X1,n6)|~less_than(X1,n4)),inference(pm,[status(thm)],[44,22,theory(equality)])).
% cnf(58,plain,(less_than(X1,n6)|~less_than(X1,X2)|~less_than(X2,n4)),inference(pm,[status(thm)],[44,28,theory(equality)])).
% cnf(59,plain,(red(X1,n6)|red(X2,X1)|red(X2,n6)|~less_than(X2,X1)|~less_than(X2,n6)|~less_than(X1,n4)),inference(pm,[status(thm)],[36,57,theory(equality)])).
% cnf(61,plain,(less_than(X1,n5)|~less_than(X1,n3)),inference(pm,[status(thm)],[46,23,theory(equality)])).
% cnf(62,plain,(less_than(X1,n5)|~less_than(X1,X2)|~less_than(X2,n3)),inference(pm,[status(thm)],[46,29,theory(equality)])).
% cnf(63,plain,(red(X1,n5)|red(X2,X1)|red(X2,n5)|~less_than(X2,X1)|~less_than(X2,n5)|~less_than(X1,n3)),inference(pm,[status(thm)],[36,61,theory(equality)])).
% cnf(66,plain,(less_than(X1,n6)|~less_than(X1,X2)|~less_than(X2,n3)),inference(pm,[status(thm)],[44,61,theory(equality)])).
% cnf(67,plain,(less_than(X1,n4)|~less_than(X1,n2)),inference(pm,[status(thm)],[49,24,theory(equality)])).
% cnf(69,plain,(red(n3,n4)|red(n2,n3)|red(n2,n4)|~less_than(n2,n4)),inference(pm,[status(thm)],[39,24,theory(equality)])).
% cnf(70,plain,(red(n3,n4)|red(X1,n3)|red(X1,n4)|~less_than(X1,n4)|~less_than(X1,n2)),inference(pm,[status(thm)],[39,30,theory(equality)])).
% cnf(72,plain,(red(n2,n3)|red(n2,n4)|~red(X1,n3)|~red(X1,n4)|~less_than(n2,n4)),inference(pm,[status(thm)],[32,69,theory(equality)])).
% cnf(79,plain,(less_than(X1,n6)|~less_than(X1,n3)),inference(pm,[status(thm)],[58,23,theory(equality)])).
% cnf(82,plain,(red(X1,n6)|red(X2,X1)|red(X2,n6)|~less_than(X2,X1)|~less_than(X2,n6)|~less_than(X1,n3)),inference(pm,[status(thm)],[36,79,theory(equality)])).
% cnf(84,plain,(red(n2,n3)|red(n1,n2)|red(n1,n3)|~less_than(n1,n3)),inference(pm,[status(thm)],[40,25,theory(equality)])).
% cnf(86,plain,(less_than(X1,n5)|~less_than(X1,n2)),inference(pm,[status(thm)],[62,24,theory(equality)])).
% cnf(92,plain,(less_than(X1,n6)|~less_than(X1,n2)),inference(pm,[status(thm)],[66,24,theory(equality)])).
% cnf(96,plain,(red(X1,n6)|red(X2,n6)|red(X2,X1)|~less_than(X1,n5)|~less_than(X2,X1)|~less_than(X2,n4)),inference(pm,[status(thm)],[43,57,theory(equality)])).
% cnf(100,plain,(red(n5,n6)|red(X1,n5)|red(X1,n6)|~less_than(X1,n4)),inference(pm,[status(thm)],[47,57,theory(equality)])).
% cnf(106,plain,(red(n5,n6)|red(n3,n5)|red(n3,n6)),inference(pm,[status(thm)],[100,23,theory(equality)])).
% cnf(107,plain,(red(n5,n6)|red(X1,n5)|red(X1,n6)|~less_than(X1,n3)),inference(pm,[status(thm)],[100,29,theory(equality)])).
% cnf(108,plain,(red(n5,n6)|red(X1,n5)|red(X1,n6)|~less_than(X1,n2)),inference(pm,[status(thm)],[100,67,theory(equality)])).
% cnf(117,plain,(red(X1,n5)|red(X2,n5)|red(X2,X1)|~less_than(X1,n4)|~less_than(X2,X1)|~less_than(X2,n3)),inference(pm,[status(thm)],[45,61,theory(equality)])).
% cnf(118,plain,(red(n3,n5)|red(n3,n6)|~red(X1,n5)|~red(X1,n6)),inference(pm,[status(thm)],[32,106,theory(equality)])).
% cnf(124,plain,(red(n5,n6)|red(n2,n5)|red(n2,n6)),inference(pm,[status(thm)],[107,24,theory(equality)])).
% cnf(132,plain,(red(X1,n4)|red(X2,n4)|red(X2,X1)|~less_than(X1,n3)|~less_than(X2,X1)|~less_than(X2,n2)),inference(pm,[status(thm)],[48,67,theory(equality)])).
% cnf(133,plain,(red(n2,n5)|red(n2,n6)|~red(X1,n5)|~red(X1,n6)),inference(pm,[status(thm)],[32,124,theory(equality)])).
% cnf(141,plain,(red(n5,n6)|red(n1,n5)|red(n1,n6)),inference(pm,[status(thm)],[108,25,theory(equality)])).
% cnf(157,plain,(red(n4,n5)|red(X1,n4)|red(X1,n5)|~less_than(X1,n3)),inference(pm,[status(thm)],[53,61,theory(equality)])).
% cnf(160,plain,(red(n4,n5)|red(n2,n4)|red(n2,n5)),inference(pm,[status(thm)],[157,24,theory(equality)])).
% cnf(161,plain,(red(n4,n5)|red(X1,n4)|red(X1,n5)|~less_than(X1,n2)),inference(pm,[status(thm)],[157,30,theory(equality)])).
% cnf(162,plain,(red(n2,n4)|red(n2,n5)|~red(X1,n4)|~red(X1,n5)),inference(pm,[status(thm)],[32,160,theory(equality)])).
% cnf(168,plain,(red(X1,n6)|red(X2,n6)|red(X2,X1)|~less_than(X1,n4)|~less_than(X2,X1)|~less_than(X2,n3)),inference(pm,[status(thm)],[59,79,theory(equality)])).
% cnf(176,plain,(red(n4,n5)|red(n1,n4)|red(n1,n5)),inference(pm,[status(thm)],[161,25,theory(equality)])).
% cnf(183,plain,(red(n3,n4)|red(X1,n3)|red(X1,n4)|~less_than(X1,n2)),inference(pm,[status(thm)],[70,67,theory(equality)])).
% cnf(187,plain,(red(X1,n5)|red(X2,n5)|red(X2,X1)|~less_than(X1,n3)|~less_than(X2,X1)|~less_than(X2,n2)),inference(pm,[status(thm)],[63,86,theory(equality)])).
% cnf(192,plain,(red(n3,n4)|red(n1,n3)|red(n1,n4)),inference(pm,[status(thm)],[183,25,theory(equality)])).
% cnf(235,plain,(red(X1,n6)|red(X2,n6)|red(X2,X1)|~less_than(X1,n3)|~less_than(X2,X1)|~less_than(X2,n2)),inference(pm,[status(thm)],[82,92,theory(equality)])).
% cnf(345,plain,(red(n4,n6)|red(X1,n6)|red(X1,n4)|~less_than(X1,n4)),inference(pm,[status(thm)],[96,22,theory(equality)])).
% cnf(349,plain,(red(n4,n6)|red(n3,n6)|red(n3,n4)),inference(pm,[status(thm)],[345,23,theory(equality)])).
% cnf(350,plain,(red(n4,n6)|red(X1,n6)|red(X1,n4)|~less_than(X1,n3)),inference(pm,[status(thm)],[345,29,theory(equality)])).
% cnf(351,plain,(red(n4,n6)|red(X1,n6)|red(X1,n4)|~less_than(X1,n2)),inference(pm,[status(thm)],[345,67,theory(equality)])).
% cnf(356,plain,(red(n3,n6)|red(n3,n4)|~red(X1,n4)|~red(X1,n6)),inference(pm,[status(thm)],[32,349,theory(equality)])).
% cnf(380,plain,(red(n4,n6)|red(n2,n6)|red(n2,n4)),inference(pm,[status(thm)],[350,24,theory(equality)])).
% cnf(382,plain,(red(n2,n6)|red(n2,n4)|~red(X1,n4)|~red(X1,n6)),inference(pm,[status(thm)],[32,380,theory(equality)])).
% cnf(387,plain,(red(n2,n5)|red(n2,n6)|red(n2,n4)|~red(n4,n5)),inference(pm,[status(thm)],[133,380,theory(equality)])).
% cnf(393,plain,(red(n4,n6)|red(n1,n6)|red(n1,n4)),inference(pm,[status(thm)],[351,25,theory(equality)])).
% cnf(455,plain,(red(n2,n5)|red(n2,n6)|red(n2,n4)),inference(pm,[status(thm)],[387,160,theory(equality)])).
% cnf(457,plain,(red(n2,n5)|red(n2,n4)|~red(X1,n2)|~red(X1,n6)),inference(pm,[status(thm)],[32,455,theory(equality)])).
% cnf(526,plain,(red(n3,n5)|red(X1,n5)|red(X1,n3)|~less_than(X1,n3)),inference(pm,[status(thm)],[117,23,theory(equality)])).
% cnf(559,plain,(red(n3,n5)|red(n2,n5)|red(n2,n3)),inference(pm,[status(thm)],[526,24,theory(equality)])).
% cnf(560,plain,(red(n3,n5)|red(X1,n5)|red(X1,n3)|~less_than(X1,n2)),inference(pm,[status(thm)],[526,30,theory(equality)])).
% cnf(561,plain,(red(n2,n5)|red(n2,n3)|~red(X1,n3)|~red(X1,n5)),inference(pm,[status(thm)],[32,559,theory(equality)])).
% cnf(564,plain,(red(n2,n4)|red(n2,n5)|red(n2,n3)|~red(n3,n4)),inference(pm,[status(thm)],[162,559,theory(equality)])).
% cnf(575,plain,(red(n3,n5)|red(n1,n5)|red(n1,n3)),inference(pm,[status(thm)],[560,25,theory(equality)])).
% cnf(584,plain,(red(n2,n4)|red(n2,n5)|red(n2,n3)|~less_than(n2,n4)),inference(pm,[status(thm)],[564,69,theory(equality)])).
% cnf(588,plain,(red(n2,n4)|red(n2,n3)|~red(X1,n2)|~red(X1,n5)|~less_than(n2,n4)),inference(pm,[status(thm)],[32,584,theory(equality)])).
% cnf(735,plain,(red(n2,n4)|red(X1,n4)|red(X1,n2)|~less_than(X1,n2)),inference(pm,[status(thm)],[132,24,theory(equality)])).
% cnf(737,plain,(red(n2,n4)|red(n1,n4)|red(n1,n2)),inference(pm,[status(thm)],[735,25,theory(equality)])).
% cnf(739,plain,(red(n2,n3)|red(n2,n4)|red(n1,n2)|~less_than(n2,n4)|~red(n1,n3)),inference(pm,[status(thm)],[72,737,theory(equality)])).
% cnf(1047,plain,(red(n3,n6)|red(X1,n6)|red(X1,n3)|~less_than(X1,n3)),inference(pm,[status(thm)],[168,23,theory(equality)])).
% cnf(1082,plain,(red(n3,n6)|red(n2,n6)|red(n2,n3)),inference(pm,[status(thm)],[1047,24,theory(equality)])).
% cnf(1083,plain,(red(n3,n6)|red(X1,n6)|red(X1,n3)|~less_than(X1,n2)),inference(pm,[status(thm)],[1047,30,theory(equality)])).
% cnf(1084,plain,(red(n2,n6)|red(n2,n3)|~red(X1,n3)|~red(X1,n6)),inference(pm,[status(thm)],[32,1082,theory(equality)])).
% cnf(1089,plain,(red(n2,n5)|red(n2,n6)|red(n2,n3)|~red(n3,n5)),inference(pm,[status(thm)],[133,1082,theory(equality)])).
% cnf(1096,plain,(red(n2,n6)|red(n2,n4)|red(n2,n3)|~red(n3,n4)),inference(pm,[status(thm)],[382,1082,theory(equality)])).
% cnf(1106,plain,(red(n3,n6)|red(n1,n6)|red(n1,n3)),inference(pm,[status(thm)],[1083,25,theory(equality)])).
% cnf(1121,plain,(red(n2,n5)|red(n2,n4)|red(n3,n6)|red(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[457,1106,theory(equality)])).
% cnf(1175,plain,(red(n2,n5)|red(n2,n6)|red(n2,n3)),inference(pm,[status(thm)],[1089,559,theory(equality)])).
% cnf(1176,plain,(red(n2,n5)|red(n2,n3)|~red(X1,n2)|~red(X1,n6)),inference(pm,[status(thm)],[32,1175,theory(equality)])).
% cnf(1225,plain,(red(n2,n6)|red(n2,n4)|red(n2,n3)|~less_than(n2,n4)),inference(pm,[status(thm)],[1096,69,theory(equality)])).
% cnf(1231,plain,(red(n2,n5)|red(X1,n5)|red(X1,n2)|~less_than(X1,n2)),inference(pm,[status(thm)],[187,24,theory(equality)])).
% cnf(1252,plain,(red(n2,n5)|red(n2,n3)|red(n5,n6)|red(n1,n5)|~red(n1,n2)),inference(pm,[status(thm)],[1176,141,theory(equality)])).
% cnf(1253,plain,(red(n2,n5)|red(n2,n3)|red(n4,n6)|red(n1,n4)|~red(n1,n2)),inference(pm,[status(thm)],[1176,393,theory(equality)])).
% cnf(1296,plain,(red(n2,n5)|red(n1,n5)|red(n1,n2)),inference(pm,[status(thm)],[1231,25,theory(equality)])).
% cnf(1301,plain,(red(n2,n4)|red(n2,n5)|red(n1,n2)|~red(n1,n4)),inference(pm,[status(thm)],[162,1296,theory(equality)])).
% cnf(1305,plain,(red(n2,n5)|red(n2,n3)|red(n1,n2)|~red(n1,n3)),inference(pm,[status(thm)],[561,1296,theory(equality)])).
% cnf(1320,plain,(red(n2,n4)|red(n2,n5)|red(n1,n2)),inference(pm,[status(thm)],[1301,737,theory(equality)])).
% cnf(1328,plain,(red(n2,n5)|red(n2,n3)|red(n1,n2)|~less_than(n1,n3)),inference(pm,[status(thm)],[1305,84,theory(equality)])).
% cnf(1335,plain,(red(n2,n4)|red(n2,n3)|~red(X1,n2)|~red(X1,n6)|~less_than(n2,n4)),inference(pm,[status(thm)],[32,1225,theory(equality)])).
% cnf(1381,plain,(red(n2,n4)|red(n2,n3)|red(n5,n6)|red(n1,n5)|~less_than(n2,n4)|~red(n1,n2)),inference(pm,[status(thm)],[1335,141,theory(equality)])).
% cnf(1496,plain,(red(n2,n6)|red(X1,n6)|red(X1,n2)|~less_than(X1,n2)),inference(pm,[status(thm)],[235,24,theory(equality)])).
% cnf(1503,plain,(red(n2,n6)|red(n1,n6)|red(n1,n2)),inference(pm,[status(thm)],[1496,25,theory(equality)])).
% cnf(1509,plain,(red(n2,n5)|red(n2,n6)|red(n1,n2)|~red(n1,n5)),inference(pm,[status(thm)],[133,1503,theory(equality)])).
% cnf(1513,plain,(red(n2,n6)|red(n2,n3)|red(n1,n2)|~red(n1,n3)),inference(pm,[status(thm)],[1084,1503,theory(equality)])).
% cnf(1518,plain,(red(n2,n6)|red(n2,n4)|red(n1,n2)|~red(n1,n4)),inference(pm,[status(thm)],[382,1503,theory(equality)])).
% cnf(1555,plain,(red(n2,n5)|red(n2,n6)|red(n1,n2)),inference(pm,[status(thm)],[1509,1296,theory(equality)])).
% cnf(1571,plain,(red(n2,n6)|red(n2,n3)|red(n1,n2)|~less_than(n1,n3)),inference(pm,[status(thm)],[1513,84,theory(equality)])).
% cnf(1579,plain,(red(n2,n6)|red(n2,n4)|red(n1,n2)),inference(pm,[status(thm)],[1518,737,theory(equality)])).
% cnf(2907,plain,(red(n2,n3)|red(n2,n4)|red(n1,n2)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[739,84,theory(equality)])).
% cnf(10705,plain,(red(n2,n4)|red(n2,n3)|red(n5,n6)|~less_than(n2,n4)|~red(n1,n2)),inference(pm,[status(thm)],[588,1381,theory(equality)])).
% cnf(18010,plain,(red(n2,n4)|red(n2,n3)|red(n5,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[10705,2907,theory(equality)])).
% cnf(21276,plain,(red(n2,n4)|red(n2,n3)|~red(X1,n5)|~red(X1,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,18010,theory(equality)])).
% cnf(24834,plain,(red(n2,n4)|red(n2,n3)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)),inference(pm,[status(thm)],[21276,1225,theory(equality)])).
% cnf(24881,plain,(red(n2,n4)|red(n2,n3)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[24834,584,theory(equality)])).
% cnf(24886,plain,(red(n2,n3)|~red(X1,n2)|~red(X1,n4)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,24881,theory(equality)])).
% cnf(24982,plain,(red(n2,n3)|red(n2,n5)|red(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[24886,1253,theory(equality)])).
% cnf(53717,plain,(red(n2,n3)|red(n2,n5)|red(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[24982,1328,theory(equality)])).
% cnf(53764,plain,(red(n2,n3)|red(n2,n5)|~red(X1,n4)|~red(X1,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,53717,theory(equality)])).
% cnf(53867,plain,(red(n2,n3)|red(n2,n5)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)),inference(pm,[status(thm)],[53764,1175,theory(equality)])).
% cnf(53893,plain,(red(n2,n3)|~red(X1,n2)|~red(X1,n5)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)),inference(pm,[status(thm)],[32,53867,theory(equality)])).
% cnf(53935,plain,(red(n2,n3)|~less_than(n2,n4)|~less_than(n1,n3)|~red(X1,n2)|~red(X1,n5)),inference(pm,[status(thm)],[53893,24881,theory(equality)])).
% cnf(53999,plain,(red(n2,n3)|red(n4,n5)|red(n1,n4)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[53935,176,theory(equality)])).
% cnf(54017,plain,(red(n2,n3)|red(n2,n5)|red(n5,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[53935,1252,theory(equality)])).
% cnf(64987,plain,(red(n2,n3)|red(n2,n5)|red(n5,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[54017,1328,theory(equality)])).
% cnf(65035,plain,(red(n2,n3)|red(n2,n5)|~red(X1,n5)|~red(X1,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,64987,theory(equality)])).
% cnf(65109,plain,(red(n2,n3)|red(n2,n5)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n4,n5)),inference(pm,[status(thm)],[65035,53717,theory(equality)])).
% cnf(77056,plain,(red(n2,n3)|red(n4,n5)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[24886,53999,theory(equality)])).
% cnf(77115,plain,(red(n2,n3)|red(n4,n5)|red(n2,n5)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[77056,1328,theory(equality)])).
% cnf(77129,plain,(red(n2,n3)|red(n4,n5)|red(n2,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[77056,1571,theory(equality)])).
% cnf(77227,plain,(red(n2,n3)|red(n2,n5)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[65109,77115,theory(equality)])).
% cnf(77272,plain,(red(n2,n3)|red(n2,n6)|~red(X1,n4)|~red(X1,n5)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,77129,theory(equality)])).
% cnf(77396,plain,(red(n2,n3)|red(n2,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)),inference(pm,[status(thm)],[77272,77227,theory(equality)])).
% cnf(77442,plain,(red(n2,n3)|~red(X1,n2)|~red(X1,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)),inference(pm,[status(thm)],[32,77396,theory(equality)])).
% cnf(77513,plain,(red(n2,n3)|~less_than(n2,n4)|~less_than(n1,n3)|~red(X1,n2)|~red(X1,n6)),inference(pm,[status(thm)],[77442,24881,theory(equality)])).
% cnf(77587,plain,(red(n2,n3)|red(n5,n6)|red(n1,n5)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[77513,141,theory(equality)])).
% cnf(77588,plain,(red(n2,n3)|red(n4,n6)|red(n1,n4)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[77513,393,theory(equality)])).
% cnf(82319,plain,(red(n2,n3)|red(n5,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[53935,77587,theory(equality)])).
% cnf(82398,plain,(red(n2,n3)|red(n5,n6)|red(n2,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[82319,1571,theory(equality)])).
% cnf(82444,plain,(red(n2,n3)|red(n2,n6)|~red(X1,n5)|~red(X1,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,82398,theory(equality)])).
% cnf(83971,plain,(red(n2,n3)|red(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[24886,77588,theory(equality)])).
% cnf(84044,plain,(red(n2,n3)|red(n4,n6)|red(n2,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[83971,1571,theory(equality)])).
% cnf(84139,plain,(red(n2,n3)|red(n2,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n4,n5)),inference(pm,[status(thm)],[82444,84044,theory(equality)])).
% cnf(84173,plain,(red(n2,n3)|red(n2,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[84139,77129,theory(equality)])).
% cnf(84175,plain,(red(n4,n5)|red(n4,n6)|red(n2,n3)|~less_than(n4,n6)|~red(n2,n5)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[54,84173,theory(equality)])).
% cnf(180001,plain,(red(n4,n5)|red(n2,n3)|~red(X1,n4)|~red(X1,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)),inference(pm,[status(thm)],[32,84175,theory(equality)])).
% cnf(180325,plain,(red(n4,n5)|red(n2,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)|~red(n2,n4)),inference(pm,[status(thm)],[180001,84173,theory(equality)])).
% cnf(180386,plain,(red(n2,n3)|~red(X1,n4)|~red(X1,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)|~red(n2,n4)),inference(pm,[status(thm)],[32,180325,theory(equality)])).
% cnf(180464,plain,(red(n2,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(X1,n4)|~red(X1,n5)),inference(pm,[status(thm)],[180386,77227,theory(equality)])).
% cnf(180475,plain,(red(n2,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(X1,n4)|~red(X1,n5)),inference(pm,[status(thm)],[180464,24881,theory(equality)])).
% cnf(180558,plain,(red(n2,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)),inference(pm,[status(thm)],[180475,77227,theory(equality)])).
% cnf(180606,plain,(red(n2,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[180558,24881,theory(equality)])).
% cnf(180609,plain,(~red(X1,n2)|~red(X1,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,180606,theory(equality)])).
% cnf(180650,plain,(red(n2,n5)|red(n2,n4)|red(n3,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[180609,1121,theory(equality)])).
% cnf(180993,plain,(red(n2,n5)|red(n2,n4)|red(n3,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[180650,1320,theory(equality)])).
% cnf(181070,plain,(red(n2,n5)|red(n2,n4)|~red(X1,n3)|~red(X1,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,180993,theory(equality)])).
% cnf(181235,plain,(red(n2,n5)|red(n2,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[181070,455,theory(equality)])).
% cnf(181249,plain,(red(n2,n4)|~red(X1,n2)|~red(X1,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[32,181235,theory(equality)])).
% cnf(181388,plain,(red(n2,n4)|red(n3,n5)|red(n1,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)|~red(n1,n2)),inference(pm,[status(thm)],[181249,575,theory(equality)])).
% cnf(491955,plain,(red(n2,n4)|red(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)|~red(n2,n3)),inference(pm,[status(thm)],[180609,181388,theory(equality)])).
% cnf(492049,plain,(red(n2,n4)|red(n3,n5)|red(n2,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[491955,1579,theory(equality)])).
% cnf(492123,plain,(red(n2,n4)|red(n2,n6)|~red(X1,n3)|~red(X1,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[32,492049,theory(equality)])).
% cnf(492291,plain,(red(n2,n4)|red(n2,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[492123,181235,theory(equality)])).
% cnf(492353,plain,(red(n3,n5)|red(n3,n6)|red(n2,n4)|~red(n2,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[118,492291,theory(equality)])).
% cnf(508088,plain,(red(n3,n5)|red(n2,n4)|~red(X1,n3)|~red(X1,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)|~red(n2,n3)),inference(pm,[status(thm)],[32,492353,theory(equality)])).
% cnf(508840,plain,(red(n3,n5)|red(n2,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)|~red(n2,n3)),inference(pm,[status(thm)],[508088,492291,theory(equality)])).
% cnf(508859,plain,(red(n2,n4)|~red(X1,n3)|~red(X1,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n5)|~red(n2,n3)),inference(pm,[status(thm)],[32,508840,theory(equality)])).
% cnf(508935,plain,(red(n2,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)|~red(X1,n3)|~red(X1,n5)),inference(pm,[status(thm)],[508859,181235,theory(equality)])).
% cnf(509051,plain,(red(n2,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[508935,181235,theory(equality)])).
% cnf(509111,plain,(~red(X1,n2)|~red(X1,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[32,509051,theory(equality)])).
% cnf(509145,plain,(~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(X1,n2)|~red(X1,n4)),inference(pm,[status(thm)],[509111,180606,theory(equality)])).
% cnf(509232,plain,(red(n3,n4)|red(n1,n3)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[509145,192,theory(equality)])).
% cnf(509454,plain,(red(n3,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n1,n2)),inference(pm,[status(thm)],[180609,509232,theory(equality)])).
% cnf(509542,plain,(red(n3,n4)|red(n2,n5)|red(n2,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[509454,1555,theory(equality)])).
% cnf(509860,plain,(red(n2,n5)|red(n2,n6)|~red(X1,n3)|~red(X1,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[32,509542,theory(equality)])).
% cnf(510673,plain,(red(n2,n5)|red(n2,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[509860,509051,theory(equality)])).
% cnf(510818,plain,(red(n3,n6)|red(n3,n4)|red(n2,n5)|~red(n2,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[356,510673,theory(equality)])).
% cnf(517334,plain,(red(n3,n4)|red(n2,n5)|~red(X1,n3)|~red(X1,n6)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[32,510818,theory(equality)])).
% cnf(517651,plain,(red(n3,n4)|red(n2,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[517334,510673,theory(equality)])).
% cnf(517658,plain,(red(n2,n5)|~red(X1,n3)|~red(X1,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[32,517651,theory(equality)])).
% cnf(517764,plain,(red(n2,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[517658,509051,theory(equality)])).
% cnf(517893,plain,(red(n3,n4)|red(n3,n5)|~less_than(n3,n5)|~red(n2,n4)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[56,517764,theory(equality)])).
% cnf(520550,plain,(red(n3,n4)|~red(X1,n3)|~red(X1,n5)|~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[32,517893,theory(equality)])).
% cnf(520731,plain,(red(n3,n4)|~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[520550,517764,theory(equality)])).
% cnf(520793,plain,(~red(X1,n3)|~red(X1,n4)|~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n4)|~red(n2,n3)),inference(pm,[status(thm)],[32,520731,theory(equality)])).
% cnf(520835,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)|~red(X1,n3)|~red(X1,n4)),inference(pm,[status(thm)],[520793,509051,theory(equality)])).
% cnf(520838,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(X1,n3)|~red(X1,n4)),inference(pm,[status(thm)],[520835,180606,theory(equality)])).
% cnf(520912,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)|~red(n2,n3)),inference(pm,[status(thm)],[520838,509051,theory(equality)])).
% cnf(521048,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n3)),inference(pm,[status(thm)],[520912,180606,theory(equality)])).
% cnf(521049,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|~less_than(n1,n2)),inference(pm,[status(thm)],[521048,30,theory(equality)])).
% cnf(521050,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)|$false),inference(rw,[status(thm)],[521049,25,theory(equality)])).
% cnf(521051,plain,(~less_than(n3,n5)|~less_than(n4,n6)|~less_than(n2,n4)),inference(cn,[status(thm)],[521050,theory(equality)])).
% cnf(521052,plain,(~less_than(n3,n5)|~less_than(n2,n4)|~less_than(n4,n5)),inference(pm,[status(thm)],[521051,27,theory(equality)])).
% cnf(521057,plain,(~less_than(n3,n5)|~less_than(n2,n4)|$false),inference(rw,[status(thm)],[521052,22,theory(equality)])).
% cnf(521058,plain,(~less_than(n3,n5)|~less_than(n2,n4)),inference(cn,[status(thm)],[521057,theory(equality)])).
% cnf(521060,plain,(~less_than(n2,n4)|~less_than(n3,n4)),inference(pm,[status(thm)],[521058,28,theory(equality)])).
% cnf(521062,plain,(~less_than(n2,n4)|$false),inference(rw,[status(thm)],[521060,23,theory(equality)])).
% cnf(521063,plain,(~less_than(n2,n4)),inference(cn,[status(thm)],[521062,theory(equality)])).
% cnf(521064,plain,(~less_than(n2,n3)),inference(pm,[status(thm)],[521063,29,theory(equality)])).
% cnf(521066,plain,($false),inference(rw,[status(thm)],[521064,24,theory(equality)])).
% cnf(521067,plain,($false),inference(cn,[status(thm)],[521066,theory(equality)])).
% cnf(521068,plain,($false),521067,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 53739
% # ...of these trivial : 0
% # ...subsumed : 44005
% # ...remaining for further processing: 9734
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7557
% # Backward-rewritten : 0
% # Generated clauses : 521013
% # ...of the previous two non-trivial : 402636
% # Contextual simplify-reflections : 0
% # Paramodulations : 521013
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 2177
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 2168
% # Current number of unprocessed clauses: 33632
% # ...number of literals in the above : 327082
% # Clause-clause subsumption calls (NU) : 636352
% # Rec. Clause-clause subsumption calls : 75127
% # Unit Clause-clause subsumption calls : 2247
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 84 leaves, 1.23+/-0.643 terms/leaf
% # Paramod-from index: 35 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 73 leaves, 1.12+/-0.368 terms/leaf
% # -------------------------------------------------
% # User time : 22.674 s
% # System time : 0.516 s
% # Total time : 23.189 s
% # Maximum resident set size: 0 pages
% PrfWatch: 31.13 CPU 31.42 WC
% FINAL PrfWatch: 31.13 CPU 31.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP31973/GRA014+1.tptp
%
%------------------------------------------------------------------------------