%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRA014+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sat Jul 16 07:21:54 EDT 2022
% Result : Theorem 0.52s 0.71s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 30
% Number of leaves : 10
% Syntax : Number of clauses : 105 ( 25 unt; 75 nHn; 105 RR)
% Number of literals : 250 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ red(X,Y)
| ~ red(Y,Z)
| ~ red(X,Z)
| goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',red_clique) ).
cnf(2,axiom,
( ~ green(X,Y)
| ~ green(Y,Z)
| ~ green(X,Z)
| goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',green_clique) ).
cnf(3,axiom,
less_than(n1,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordering) ).
cnf(4,axiom,
less_than(n2,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordering) ).
cnf(5,axiom,
less_than(n3,n4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordering) ).
cnf(6,axiom,
less_than(n4,n5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordering) ).
cnf(7,axiom,
less_than(n5,n6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordering) ).
cnf(8,axiom,
( ~ less_than(X,Y)
| ~ less_than(Y,Z)
| less_than(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_than_transitive) ).
cnf(9,axiom,
( ~ less_than(X,Y)
| red(X,Y)
| green(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition) ).
cnf(10,negated_conjecture,
~ goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
cnf(11,plain,
( ~ red(X,Y)
| ~ red(Y,Z)
| ~ red(X,Z) ),
inference('REWRITE',[status(thm)],[1,10]) ).
cnf(12,plain,
( ~ green(X,Y)
| ~ green(Y,Z)
| ~ green(X,Z) ),
inference('REWRITE',[status(thm)],[2,10]) ).
cnf(13,plain,
less_than(n4,n6),
inference('HYPERRESOLVE',[status(thm)],[8,6,7]) ).
cnf(14,plain,
less_than(n3,n5),
inference('HYPERRESOLVE',[status(thm)],[8,5,6]) ).
cnf(15,plain,
less_than(n2,n4),
inference('HYPERRESOLVE',[status(thm)],[8,4,5]) ).
cnf(16,plain,
less_than(n1,n3),
inference('HYPERRESOLVE',[status(thm)],[8,3,4]) ).
cnf(17,plain,
( red(n5,n6)
| green(n5,n6) ),
inference('HYPERRESOLVE',[status(thm)],[9,7]) ).
cnf(18,plain,
( red(n4,n5)
| green(n4,n5) ),
inference('HYPERRESOLVE',[status(thm)],[9,6]) ).
cnf(19,plain,
( red(n3,n4)
| green(n3,n4) ),
inference('HYPERRESOLVE',[status(thm)],[9,5]) ).
cnf(20,plain,
( red(n2,n3)
| green(n2,n3) ),
inference('HYPERRESOLVE',[status(thm)],[9,4]) ).
cnf(21,plain,
( red(n1,n2)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[9,3]) ).
cnf(22,plain,
less_than(n3,n6),
inference('HYPERRESOLVE',[status(thm)],[8,13,5]) ).
cnf(23,plain,
( red(n4,n6)
| green(n4,n6) ),
inference('HYPERRESOLVE',[status(thm)],[9,13]) ).
cnf(24,plain,
less_than(n2,n5),
inference('HYPERRESOLVE',[status(thm)],[8,14,4]) ).
cnf(25,plain,
( red(n3,n5)
| green(n3,n5) ),
inference('HYPERRESOLVE',[status(thm)],[9,14]) ).
cnf(26,plain,
less_than(n2,n6),
inference('HYPERRESOLVE',[status(thm)],[8,15,13]) ).
cnf(27,plain,
less_than(n1,n4),
inference('HYPERRESOLVE',[status(thm)],[8,15,3]) ).
cnf(28,plain,
( red(n2,n4)
| green(n2,n4) ),
inference('HYPERRESOLVE',[status(thm)],[9,15]) ).
cnf(29,plain,
less_than(n1,n5),
inference('HYPERRESOLVE',[status(thm)],[8,16,14]) ).
cnf(30,plain,
( red(n1,n3)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[9,16]) ).
cnf(31,plain,
less_than(n1,n6),
inference('HYPERRESOLVE',[status(thm)],[8,22,16]) ).
cnf(32,plain,
( red(n3,n6)
| green(n3,n6) ),
inference('HYPERRESOLVE',[status(thm)],[9,22]) ).
cnf(33,plain,
( red(n2,n5)
| green(n2,n5) ),
inference('HYPERRESOLVE',[status(thm)],[9,24]) ).
cnf(34,plain,
( red(n2,n6)
| green(n2,n6) ),
inference('HYPERRESOLVE',[status(thm)],[9,26]) ).
cnf(35,plain,
( red(n1,n4)
| green(n1,n4) ),
inference('HYPERRESOLVE',[status(thm)],[9,27]) ).
cnf(36,plain,
( red(n1,n5)
| green(n1,n5) ),
inference('HYPERRESOLVE',[status(thm)],[9,29]) ).
cnf(37,plain,
( red(n1,n6)
| green(n1,n6) ),
inference('HYPERRESOLVE',[status(thm)],[9,31]) ).
cnf(38,plain,
( green(n4,n6)
| green(n4,n5)
| green(n5,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,23,18,17]) ).
cnf(39,plain,
( green(n3,n5)
| green(n3,n4)
| green(n4,n5) ),
inference('HYPERRESOLVE',[status(thm)],[11,25,19,18]) ).
cnf(40,plain,
( green(n2,n4)
| green(n2,n3)
| green(n3,n4) ),
inference('HYPERRESOLVE',[status(thm)],[11,28,20,19]) ).
cnf(41,plain,
( green(n1,n3)
| green(n1,n2)
| green(n2,n3) ),
inference('HYPERRESOLVE',[status(thm)],[11,30,21,20]) ).
cnf(42,plain,
( green(n3,n6)
| green(n3,n4)
| green(n4,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,32,19,23]) ).
cnf(43,plain,
( green(n3,n6)
| green(n3,n5)
| green(n5,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,32,25,17]) ).
cnf(44,plain,
( green(n2,n5)
| green(n2,n3)
| green(n3,n5) ),
inference('HYPERRESOLVE',[status(thm)],[11,33,20,25]) ).
cnf(45,plain,
( green(n2,n5)
| green(n2,n4)
| green(n4,n5) ),
inference('HYPERRESOLVE',[status(thm)],[11,33,28,18]) ).
cnf(46,plain,
( green(n2,n6)
| green(n2,n3)
| green(n3,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,34,20,32]) ).
cnf(47,plain,
( green(n2,n6)
| green(n2,n4)
| green(n4,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,34,28,23]) ).
cnf(48,plain,
( green(n2,n6)
| green(n2,n5)
| green(n5,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,34,33,17]) ).
cnf(49,plain,
( green(n1,n4)
| green(n1,n2)
| green(n2,n4) ),
inference('HYPERRESOLVE',[status(thm)],[11,35,21,28]) ).
cnf(50,plain,
( green(n1,n4)
| green(n1,n3)
| green(n3,n4) ),
inference('HYPERRESOLVE',[status(thm)],[11,35,30,19]) ).
cnf(51,plain,
( green(n1,n5)
| green(n1,n2)
| green(n2,n5) ),
inference('HYPERRESOLVE',[status(thm)],[11,36,21,33]) ).
cnf(52,plain,
( green(n1,n5)
| green(n1,n3)
| green(n3,n5) ),
inference('HYPERRESOLVE',[status(thm)],[11,36,30,25]) ).
cnf(53,plain,
( green(n1,n5)
| green(n1,n4)
| green(n4,n5) ),
inference('HYPERRESOLVE',[status(thm)],[11,36,35,18]) ).
cnf(54,plain,
( green(n1,n6)
| green(n1,n2)
| green(n2,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,37,21,34]) ).
cnf(55,plain,
( green(n1,n6)
| green(n1,n3)
| green(n3,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,37,30,32]) ).
cnf(56,plain,
( green(n1,n6)
| green(n1,n4)
| green(n4,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,37,35,23]) ).
cnf(57,plain,
( green(n1,n6)
| green(n1,n5)
| green(n5,n6) ),
inference('HYPERRESOLVE',[status(thm)],[11,37,36,17]) ).
cnf(59,plain,
( green(n2,n5)
| green(n2,n4)
| green(n2,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,45,40,44]) ).
cnf(61,plain,
( green(n2,n6)
| green(n2,n4)
| green(n2,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,47,40,46]) ).
cnf(63,plain,
( green(n2,n6)
| green(n2,n5)
| green(n2,n4) ),
inference('HYPERRESOLVE',[status(thm)],[12,48,45,47]) ).
cnf(64,plain,
( green(n2,n6)
| green(n2,n5)
| green(n2,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,48,44,46]) ).
cnf(65,plain,
( green(n1,n4)
| green(n1,n3)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,50,41,49]) ).
cnf(67,plain,
( green(n1,n5)
| green(n1,n3)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,52,41,51]) ).
cnf(70,plain,
( green(n1,n5)
| green(n1,n4)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,53,50,52]) ).
cnf(71,plain,
( green(n1,n5)
| green(n1,n4)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,53,49,51]) ).
cnf(77,plain,
( green(n1,n6)
| green(n1,n3)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,55,41,54]) ).
cnf(82,plain,
( green(n1,n6)
| green(n1,n4)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,56,50,55]) ).
cnf(83,plain,
( green(n1,n6)
| green(n1,n4)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,56,49,54]) ).
cnf(88,plain,
( green(n1,n6)
| green(n1,n5)
| green(n1,n4) ),
inference('HYPERRESOLVE',[status(thm)],[12,57,53,56]) ).
cnf(89,plain,
( green(n1,n6)
| green(n1,n5)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,57,52,55]) ).
cnf(90,plain,
( green(n1,n6)
| green(n1,n5)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,57,51,54]) ).
cnf(95,plain,
( green(n2,n4)
| green(n2,n3)
| green(n1,n6)
| green(n1,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,61,59,57]) ).
cnf(106,plain,
( green(n1,n3)
| green(n1,n2)
| green(n4,n6)
| green(n4,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,77,67,38]) ).
cnf(107,plain,
( green(n1,n4)
| green(n1,n3)
| green(n2,n6)
| green(n2,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,82,70,48]) ).
cnf(111,plain,
( green(n1,n4)
| green(n1,n2)
| green(n3,n6)
| green(n3,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,83,71,43]) ).
cnf(120,plain,
( green(n1,n3)
| green(n1,n2)
| green(n4,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,106,65,77]) ).
cnf(121,plain,
( green(n1,n3)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,120,65,67]) ).
cnf(132,plain,
( green(n1,n4)
| green(n1,n2)
| green(n3,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,111,121,83]) ).
cnf(133,plain,
( green(n1,n4)
| green(n1,n2) ),
inference('HYPERRESOLVE',[status(thm)],[12,132,121,71]) ).
cnf(136,plain,
( green(n1,n2)
| green(n3,n6)
| green(n3,n4)
| green(n1,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,133,42,90]) ).
cnf(143,plain,
( green(n1,n2)
| green(n3,n4)
| green(n1,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,136,121,90]) ).
cnf(144,plain,
( green(n1,n2)
| green(n3,n4)
| green(n3,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,143,133,39]) ).
cnf(147,plain,
( green(n1,n2)
| green(n3,n4) ),
inference('HYPERRESOLVE',[status(thm)],[12,144,121,143]) ).
cnf(148,plain,
green(n1,n2),
inference('HYPERRESOLVE',[status(thm)],[12,147,121,133]) ).
cnf(151,plain,
( green(n1,n4)
| green(n1,n3)
| green(n2,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,148,107,82]) ).
cnf(152,plain,
( green(n2,n4)
| green(n2,n3)
| green(n1,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,148,61,95]) ).
cnf(157,plain,
( green(n2,n5)
| green(n2,n3)
| green(n1,n5)
| green(n1,n4) ),
inference('HYPERRESOLVE',[status(thm)],[12,148,64,88]) ).
cnf(158,plain,
( green(n2,n5)
| green(n2,n4)
| green(n1,n5)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,148,63,89]) ).
cnf(162,plain,
( green(n1,n4)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,151,148,70]) ).
cnf(166,plain,
( green(n2,n4)
| green(n2,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,152,148,59]) ).
cnf(167,plain,
( green(n2,n3)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,166,148,162]) ).
cnf(172,plain,
( green(n2,n3)
| green(n1,n5)
| green(n1,n4) ),
inference('HYPERRESOLVE',[status(thm)],[12,157,166,53]) ).
cnf(173,plain,
( green(n2,n4)
| green(n1,n5)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,158,167,52]) ).
cnf(174,plain,
( green(n2,n4)
| green(n1,n3)
| green(n2,n5) ),
inference('HYPERRESOLVE',[status(thm)],[12,173,162,45]) ).
cnf(176,plain,
( green(n2,n4)
| green(n1,n3) ),
inference('HYPERRESOLVE',[status(thm)],[12,174,148,173]) ).
cnf(177,plain,
green(n1,n3),
inference('HYPERRESOLVE',[status(thm)],[12,176,148,162]) ).
cnf(180,plain,
~ green(n2,n3),
inference('UR-RESOLVE',[status(thm)],[12,177,148]) ).
cnf(182,plain,
( green(n2,n5)
| green(n3,n5) ),
inference('REWRITE',[status(thm)],[44,180]) ).
cnf(185,plain,
green(n2,n4),
inference('REWRITE',[status(thm)],[166,180]) ).
cnf(188,plain,
( green(n1,n5)
| green(n1,n4) ),
inference('REWRITE',[status(thm)],[172,180]) ).
cnf(193,plain,
~ green(n1,n4),
inference('UR-RESOLVE',[status(thm)],[12,185,148]) ).
cnf(197,plain,
green(n1,n5),
inference('REWRITE',[status(thm)],[188,193]) ).
cnf(213,plain,
~ green(n2,n5),
inference('UR-RESOLVE',[status(thm)],[12,197,148]) ).
cnf(215,plain,
green(n3,n5),
inference('REWRITE',[status(thm)],[182,213]) ).
cnf(220,plain,
$false,
inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[12,197,177]),215]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRA014+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14 % Command : run-snark %s %d
% 0.15/0.35 % Computer : n024.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue May 31 03:55:06 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 *
% 0.22/0.48 *
% 0.22/0.49 #<PACKAGE "SNARK-USER">
% 0.22/0.49 *
% 0.22/0.49 SNARK-TPTP-OPTIONS
% 0.22/0.49 *
% 0.22/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.49 (USE-FACTORING :POS)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.49 *
% 0.22/0.49 "."
% 0.22/0.49 *
% 0.22/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T03:55:06
% 0.22/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-05-31T03:55:06
% 0.52/0.71
% 0.52/0.71
% 0.52/0.71 #||
% 0.52/0.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.71 % SZS output start Refutation
% See solution above
% 0.52/0.72 ||#
% 0.52/0.72
% 0.52/0.72 ; Summary of computation:
% 0.52/0.72 ; 1540 formulas have been input or derived (from 143 formulas).
% 0.52/0.72 ; 220 (14%) were retained. Of these,
% 0.52/0.72 ; 155 (70%) were simplified or subsumed later,
% 0.52/0.72 ; 65 (30%) are still being kept.
% 0.52/0.72 ;
% 0.52/0.72 ; Run time in seconds excluding printing time:
% 0.52/0.72 ; 0.002 1% Read assertion file (1 call)
% 0.52/0.72 ; 0.000 0% Assert (6 calls)
% 0.52/0.72 ; 0.017 8% Process new row (1,487 calls)
% 0.52/0.72 ; 0.031 14% Resolution (284 calls)
% 0.52/0.72 ; 0.001 0% Paramodulation (142 calls)
% 0.52/0.72 ; 0.000 0% Factoring (106 calls)
% 0.52/0.72 ; 0.003 1% Condensing (1,064 calls)
% 0.52/0.72 ; 0.090 41% Forward subsumption (1,064 calls)
% 0.52/0.72 ; 0.005 2% Backward subsumption (166 calls)
% 0.52/0.72 ; 0.010 5% Clause clause subsumption (4,534 calls)
% 0.52/0.72 ; 0.027 12% Forward simplification (1,159 calls)
% 0.52/0.72 ; 0.003 1% Backward simplification (220 calls)
% 0.52/0.72 ; 0.001 0% Ordering (560 calls)
% 0.52/0.72 ; 0.000 0% Sortal reasoning (32 calls)
% 0.52/0.72 ; 0.000 0% Purity testing (1 call)
% 0.52/0.72 ; 0.031 14% Other
% 0.52/0.72 ; 0.221 Total
% 0.52/0.72 ; 0.229 Real time
% 0.52/0.72 ;
% 0.52/0.72 ; Term-hash-array has 78 terms in all.
% 0.52/0.72 ; Feature-vector-row-index has 11 entries (86 at peak, 166 added, 155 deleted).
% 0.52/0.72 ; Feature-vector-row-index has 40 nodes (314 at peak, 715 added, 675 deleted).
% 0.52/0.72 ; Retrieved 14,260 possibly forward subsuming rows in 1,064 calls.
% 0.52/0.72 ; Retrieved 663 possibly backward subsumed rows in 166 calls.
% 0.52/0.72 ; Path-index has 78 entries (80 at peak, 92 added, 14 deleted).
% 0.52/0.72 ; Path-index has 57 nodes (57 at peak, 59 added, 2 deleted).
% 0.52/0.72 ; Trie-index has 78 entries (80 at peak, 92 added, 14 deleted).
% 0.52/0.72 ; Trie-index has 95 nodes (97 at peak, 105 added, 10 deleted).
% 0.52/0.72 ; Retrieved 42 generalization terms in 1,430 calls.
% 0.52/0.72 ; Retrieved 53 instance terms in 53 calls.
% 0.52/0.72 ; Retrieved 4,171 unifiable terms in 2,195 calls.
% 0.52/0.72 ;
% 0.52/0.72 ; The agenda of rows to give has 22 entries:
% 0.52/0.72 ; 1 with value (4 7) 10 with value (4 23) 1 with value (4 27)
% 0.52/0.72 ; 1 with value (4 8) 4 with value (4 24) 4 with value (4 28)
% 0.52/0.72 ; 1 with value (4 9)
% 0.52/0.72 Evaluation took:
% 0.52/0.72 0.229 seconds of real time
% 0.52/0.72 0.200705 seconds of user run time
% 0.52/0.72 0.028095 seconds of system run time
% 0.52/0.72 [Run times include 0.004 seconds GC run time.]
% 0.52/0.72 0 calls to %EVAL
% 0.52/0.72 0 page faults and
% 0.52/0.72 24,532,368 bytes consed.
% 0.52/0.72 :PROOF-FOUND
% 0.52/0.72 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T03:55:06
% 0.52/0.72 :PROOF-FOUND
% 0.52/0.72 *
%------------------------------------------------------------------------------