TSTP Solution File: GRP425-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP425-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n032.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 11:38:32 EDT 2022
% Result : Unsatisfiable 2.73s 2.92s
% Output : Refutation 2.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 2
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 4 RR)
% Number of literals : 57 ( 56 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 184 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(Z),Z))) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(3,plain,
multiply(inverse(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(X),Z)))),multiply(Y,inverse(Z)))),inverse(Z)))),inverse(multiply(inverse(Z),Z))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(4,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),inverse(multiply(inverse(Z),Z))))) = multiply(inverse(multiply(U,inverse(multiply(inverse(Y),Z)))),multiply(U,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(11,plain,
multiply(inverse(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(Z),U)))),multiply(Y,inverse(U)))),inverse(multiply(inverse(X),multiply(inverse(U),U))))),Z)),inverse(multiply(inverse(U),U))))),inverse(multiply(inverse(multiply(inverse(U),U)),multiply(inverse(U),U)))) = multiply(inverse(U),U),
inference('PARAMODULATE',[status(thm)],[3,single_axiom,theory(equality)]) ).
cnf(14,plain,
multiply(inverse(multiply(X,inverse(multiply(inverse(multiply(inverse(Y),inverse(multiply(inverse(Z),Z)))),Z)))),multiply(X,inverse(Z))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,4,theory(equality)]) ).
cnf(15,plain,
multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z))) = multiply(inverse(multiply(U,inverse(multiply(inverse(Y),Z)))),multiply(U,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[4,4,theory(equality)]) ).
cnf(19,plain,
multiply(inverse(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(X),Z)))),multiply(Y,inverse(Z)))),inverse(inverse(multiply(inverse(U),U)))))),inverse(multiply(inverse(inverse(multiply(inverse(U),U))),inverse(multiply(inverse(U),U))))) = multiply(inverse(multiply(V,inverse(multiply(inverse(multiply(inverse(Z),Z)),U)))),multiply(V,inverse(U))),
inference('PARAMODULATE',[status(thm)],[4,single_axiom,theory(equality)]) ).
cnf(45,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(multiply(Z,inverse(U))))) = multiply(inverse(multiply(V,inverse(Y))),multiply(V,inverse(multiply(Z,inverse(U))))),
inference('PARAMODULATE',[status(thm)],[15,14,theory(equality)]) ).
cnf(54,plain,
multiply(inverse(multiply(X,inverse(Y))),multiply(X,inverse(Z))) = multiply(inverse(multiply(U,inverse(Y))),multiply(U,inverse(Z))),
inference('PARAMODULATE',[status(thm)],[45,single_axiom,theory(equality)]) ).
cnf(55,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),multiply(Z,inverse(U)))))),multiply(X,inverse(multiply(Z,inverse(U)))))),inverse(multiply(inverse(multiply(V,inverse(U))),multiply(V,inverse(U))))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,54,theory(equality)]) ).
cnf(59,plain,
multiply(inverse(multiply(X,inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(multiply(inverse(Z),inverse(U))),multiply(inverse(Z),inverse(U)))))),multiply(Y,inverse(U)))))),multiply(X,inverse(multiply(inverse(Z),inverse(U))))) = Z,
inference('PARAMODULATE',[status(thm)],[14,54,theory(equality)]) ).
cnf(69,plain,
multiply(inverse(X),inverse(multiply(inverse(multiply(Y,inverse(Z))),multiply(Y,inverse(Z))))) = multiply(inverse(X),inverse(multiply(inverse(multiply(U,inverse(Z))),multiply(U,inverse(Z))))),
inference('PARAMODULATE',[status(thm)],[55,14,theory(equality)]) ).
cnf(93,plain,
multiply(inverse(X),inverse(multiply(inverse(Y),Y))) = multiply(inverse(X),inverse(multiply(inverse(multiply(Z,inverse(multiply(inverse(U),U)))),multiply(Z,inverse(multiply(inverse(U),U)))))),
inference('PARAMODULATE',[status(thm)],[69,single_axiom,theory(equality)]) ).
cnf(111,plain,
multiply(inverse(X),inverse(multiply(inverse(Y),Y))) = multiply(inverse(X),inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[93,93,theory(equality)]) ).
cnf(112,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),U))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,111,theory(equality)]) ).
cnf(126,plain,
multiply(inverse(multiply(inverse(X),multiply(inverse(multiply(inverse(multiply(Y,inverse(multiply(inverse(X),Z)))),multiply(Y,inverse(Z)))),inverse(U)))),inverse(multiply(inverse(V),V))) = U,
inference('PARAMODULATE',[status(thm)],[112,112,theory(equality)]) ).
cnf(127,plain,
inverse(multiply(inverse(X),X)) = multiply(inverse(multiply(Y,inverse(multiply(inverse(multiply(inverse(Z),Z)),X)))),multiply(Y,inverse(X))),
inference('REWRITE',[status(thm)],[19,126,theory(equality)]) ).
cnf(134,plain,
multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Z)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),multiply(inverse(V),V))))),Y)),inverse(multiply(inverse(W),W))) = U,
inference('PARAMODULATE',[status(thm)],[112,112,theory(equality)]) ).
cnf(135,plain,
multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(multiply(inverse(Y),Y)),multiply(inverse(Y),Y)))) = multiply(inverse(Y),Y),
inference('REWRITE',[status(thm)],[11,134,theory(equality)]) ).
cnf(136,plain,
multiply(inverse(X),X) = multiply(inverse(multiply(inverse(Y),Y)),inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[111,135,theory(equality)]) ).
cnf(137,plain,
multiply(inverse(X),X) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[136,136,theory(equality)]) ).
cnf(138,plain,
multiply(multiply(inverse(multiply(inverse(X),X)),inverse(multiply(inverse(Y),Y))),a2) != a2,
inference('PARAMODULATE',[status(thm)],[prove_these_axioms_2,136,theory(equality)]) ).
cnf(152,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Y)))),multiply(X,inverse(inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(U),U))) = multiply(inverse(V),V),
inference('PARAMODULATE',[status(thm)],[112,136,theory(equality)]) ).
cnf(161,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(multiply(inverse(Y),Y)))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),U))) = Z,
inference('PARAMODULATE',[status(thm)],[112,137,theory(equality)]) ).
cnf(162,plain,
inverse(multiply(inverse(X),X)) = multiply(inverse(Y),Y),
inference('REWRITE',[status(thm)],[152,161,theory(equality)]) ).
cnf(168,plain,
inverse(inverse(multiply(inverse(X),X))) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[162,162,theory(equality)]) ).
cnf(170,plain,
inverse(multiply(inverse(X),X)) = multiply(multiply(inverse(Y),Y),multiply(inverse(Z),Z)),
inference('PARAMODULATE',[status(thm)],[162,162,theory(equality)]) ).
cnf(180,plain,
inverse(multiply(inverse(X),X)) = multiply(inverse(inverse(multiply(inverse(Y),Y))),inverse(multiply(inverse(Z),Z))),
inference('PARAMODULATE',[status(thm)],[111,162,theory(equality)]) ).
cnf(197,plain,
multiply(inverse(multiply(inverse(multiply(X,inverse(inverse(multiply(inverse(Y),Y))))),multiply(X,inverse(Z)))),inverse(multiply(inverse(U),U))) = Z,
inference('PARAMODULATE',[status(thm)],[112,162,theory(equality)]) ).
cnf(224,plain,
inverse(inverse(inverse(multiply(inverse(X),X)))) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[162,168,theory(equality)]) ).
cnf(229,plain,
inverse(inverse(inverse(inverse(multiply(inverse(X),X))))) = multiply(inverse(Y),Y),
inference('PARAMODULATE',[status(thm)],[168,168,theory(equality)]) ).
cnf(233,plain,
inverse(multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),Y)))) = multiply(inverse(Z),Z),
inference('PARAMODULATE',[status(thm)],[162,168,theory(equality)]) ).
cnf(320,plain,
inverse(multiply(inverse(X),X)) = multiply(multiply(inverse(Y),Y),inverse(inverse(multiply(inverse(Z),Z)))),
inference('PARAMODULATE',[status(thm)],[170,168,theory(equality)]) ).
cnf(385,plain,
inverse(inverse(inverse(multiply(inverse(X),X)))) = inverse(inverse(inverse(multiply(inverse(Y),Y)))),
inference('PARAMODULATE',[status(thm)],[224,224,theory(equality)]) ).
cnf(964,plain,
multiply(X,inverse(Y)) = multiply(X,inverse(multiply(inverse(multiply(inverse(Z),Z)),Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[112,127,theory(equality)]),197,theory(equality)]) ).
cnf(983,plain,
multiply(X,inverse(Y)) = multiply(X,inverse(multiply(multiply(inverse(Z),Z),Y))),
inference('PARAMODULATE',[status(thm)],[964,162,theory(equality)]) ).
cnf(986,plain,
multiply(X,inverse(Y)) = multiply(X,inverse(multiply(inverse(inverse(multiply(inverse(Z),Z))),Y))),
inference('PARAMODULATE',[status(thm)],[964,162,theory(equality)]) ).
cnf(1038,plain,
multiply(X,inverse(multiply(inverse(inverse(Y)),inverse(Z)))) = multiply(X,inverse(multiply(inverse(multiply(U,inverse(Y))),multiply(U,inverse(Z))))),
inference('PARAMODULATE',[status(thm)],[964,54,theory(equality)]) ).
cnf(1058,plain,
multiply(inverse(multiply(X,inverse(inverse(Y)))),multiply(X,inverse(multiply(inverse(Z),inverse(Y))))) = Z,
inference('REWRITE',[status(thm)],[59,986,1038,theory(equality)]) ).
cnf(1116,plain,
multiply(inverse(multiply(X,inverse(inverse(Y)))),multiply(X,inverse(multiply(inverse(Z),Z)))) = inverse(Y),
inference('PARAMODULATE',[status(thm)],[1058,137,theory(equality)]) ).
cnf(1118,plain,
multiply(multiply(inverse(X),X),multiply(inverse(inverse(inverse(Y))),inverse(multiply(inverse(Z),inverse(Y))))) = Z,
inference('PARAMODULATE',[status(thm)],[1058,162,theory(equality)]) ).
cnf(1192,plain,
multiply(inverse(inverse(multiply(multiply(inverse(X),X),Y))),inverse(Y)) = multiply(inverse(Z),Z),
inference('PARAMODULATE',[status(thm)],[137,983,theory(equality)]) ).
cnf(2670,plain,
multiply(inverse(multiply(multiply(inverse(X),X),multiply(multiply(inverse(Y),Y),inverse(Z)))),inverse(multiply(inverse(U),U))) = Z,
inference('PARAMODULATE',[status(thm)],[112,233,theory(equality)]) ).
cnf(3575,plain,
multiply(multiply(inverse(multiply(inverse(inverse(inverse(multiply(inverse(X),X)))),inverse(inverse(multiply(inverse(Y),Y))))),inverse(multiply(inverse(Z),Z))),a2) != a2,
inference('PARAMODULATE',[status(thm)],[138,385,theory(equality)]) ).
cnf(3914,plain,
multiply(inverse(multiply(inverse(multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(inverse(Y),multiply(inverse(Z),Z))))),inverse(multiply(inverse(U),U)))),inverse(multiply(inverse(V),V))) = Y,
inference('PARAMODULATE',[status(thm)],[112,180,theory(equality)]) ).
cnf(5533,plain,
multiply(inverse(multiply(inverse(multiply(multiply(inverse(X),X),inverse(multiply(inverse(Y),inverse(multiply(inverse(Z),Z)))))),inverse(multiply(inverse(U),U)))),inverse(multiply(inverse(V),V))) = Y,
inference('PARAMODULATE',[status(thm)],[112,320,theory(equality)]) ).
cnf(6098,plain,
multiply(multiply(inverse(X),X),multiply(inverse(inverse(multiply(inverse(Y),Y))),inverse(multiply(inverse(Z),multiply(inverse(Y),Y))))) = Z,
inference('PARAMODULATE',[status(thm)],[1118,168,theory(equality)]) ).
cnf(6108,plain,
multiply(multiply(inverse(X),X),multiply(multiply(inverse(Y),Y),inverse(multiply(inverse(Z),inverse(inverse(multiply(inverse(U),U))))))) = Z,
inference('PARAMODULATE',[status(thm)],[1118,229,theory(equality)]) ).
cnf(6621,plain,
inverse(X) = inverse(multiply(multiply(inverse(Y),Y),X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1058,1192,theory(equality)]),1116,theory(equality)]) ).
cnf(6623,plain,
multiply(inverse(multiply(inverse(inverse(multiply(inverse(X),inverse(multiply(inverse(Y),Y))))),inverse(multiply(inverse(Z),Z)))),inverse(multiply(inverse(U),U))) = X,
inference('REWRITE',[status(thm)],[5533,6621,theory(equality)]) ).
cnf(6624,plain,
multiply(inverse(inverse(X)),inverse(multiply(inverse(Y),Y))) = X,
inference('REWRITE',[status(thm)],[2670,6621,theory(equality)]) ).
cnf(6625,plain,
multiply(inverse(multiply(inverse(X),inverse(multiply(inverse(Y),Y)))),inverse(multiply(inverse(Z),Z))) = X,
inference('REWRITE',[status(thm)],[6623,6624,theory(equality)]) ).
cnf(6626,plain,
multiply(inverse(inverse(multiply(inverse(X),X))),inverse(multiply(inverse(Y),multiply(inverse(Z),Z)))) = Y,
inference('REWRITE',[status(thm)],[3914,6625,theory(equality)]) ).
cnf(6627,plain,
multiply(multiply(inverse(X),X),Y) = Y,
inference('REWRITE',[status(thm)],[6098,6626,theory(equality)]) ).
cnf(6647,plain,
inverse(multiply(inverse(X),inverse(inverse(multiply(inverse(Y),Y))))) = X,
inference('REWRITE',[status(thm)],[6108,6627,theory(equality)]) ).
cnf(6656,plain,
$false,
inference('REWRITE',[status(thm)],[3575,6627,6624,6647,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP425-1 : TPTP v8.1.0. Released v2.6.0.
% 0.00/0.08 % Command : run-snark %s %d
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Tue Jun 14 04:00:57 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.13/0.36 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37 *
% 0.13/0.37 *
% 0.13/0.37 #<PACKAGE "SNARK-USER">
% 0.13/0.37 *
% 0.13/0.37 SNARK-TPTP-OPTIONS
% 0.13/0.37 *
% 0.13/0.37 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.13/0.37 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.13/0.37 (USE-FACTORING :POS)
% 0.13/0.37 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.13/0.37 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.13/0.37 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.13/0.37 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.13/0.37 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.13/0.37 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.13/0.37 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.13/0.37 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.13/0.37 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.13/0.37 (DECLARE-TPTP-SYMBOLS2))
% 0.13/0.37 *
% 0.13/0.37 "."
% 0.13/0.37 *
% 0.13/0.37 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:00:57
% 0.13/0.38 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-14T04:00:57
% 2.73/2.92
% 2.73/2.92
% 2.73/2.92 #||
% 2.73/2.92 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/2.92 % SZS output start Refutation
% See solution above
% 2.73/2.95 ||#
% 2.73/2.95
% 2.73/2.95 ; Summary of computation:
% 2.73/2.95 ; 24890 formulas have been input or derived (from 94 formulas).
% 2.73/2.95 ; 6656 (27%) were retained. Of these,
% 2.73/2.95 ; 4710 (71%) were simplified or subsumed later,
% 2.73/2.95 ; 1946 (29%) are still being kept.
% 2.73/2.95 ;
% 2.73/2.95 ; Run time in seconds excluding printing time:
% 2.73/2.95 ; 0.001 0% Read assertion file (1 call)
% 2.73/2.95 ; 0.000 0% Assert (2 calls)
% 2.73/2.95 ; 0.785 31% Process new row (19,782 calls)
% 2.73/2.95 ; 0.018 1% Resolution (186 calls)
% 2.73/2.95 ; 0.291 11% Paramodulation (93 calls)
% 2.73/2.95 ; 0.670 26% Forward simplification (19,513 calls)
% 2.73/2.95 ; 0.630 25% Backward simplification (6,656 calls)
% 2.73/2.95 ; 0.052 2% Ordering (32,243 calls)
% 2.73/2.95 ; 0.000 0% Sortal reasoning (32 calls)
% 2.73/2.95 ; 0.000 0% Purity testing (1 call)
% 2.73/2.95 ; 0.086 3% Other
% 2.73/2.95 ; 2.533 Total
% 2.73/2.95 ; 2.574 Real time
% 2.73/2.95 ;
% 2.73/2.95 ; Term-hash-array has 13,923 terms in all.
% 2.73/2.95 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 2.73/2.95 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 2.73/2.95 ; Path-index has 4,462 entries (12,123 at peak, 14,532 added, 10,070 deleted).
% 2.73/2.95 ; Path-index has 14,419 nodes (15,889 at peak, 18,665 added, 4,246 deleted).
% 2.73/2.95 ; Trie-index has 4,462 entries (12,123 at peak, 14,532 added, 10,070 deleted).
% 2.73/2.95 ; Trie-index has 31,335 nodes (84,340 at peak, 107,489 added, 76,154 deleted).
% 2.73/2.95 ; Retrieved 28,981 generalization terms in 203,741 calls.
% 2.73/2.95 ; Retrieved 10,922 instance terms in 6,658 calls.
% 2.73/2.95 ; Retrieved 60,014 unifiable terms in 1,114 calls.
% 2.73/2.95 ;
% 2.73/2.95 ; The agenda of backward simplifiable rows to process has 3973 entries:
% 2.73/2.95 ; 3973 with value 0
% 2.73/2.95 ; The agenda of rows to process has 402 entries:
% 2.73/2.95 ; 11 with value 41 52 with value 46 16 with value 51
% 2.73/2.95 ; 32 with value 42 71 with value 47 10 with value 52
% 2.73/2.95 ; 31 with value 43 32 with value 48 2 with value 53
% 2.73/2.95 ; 52 with value 44 23 with value 49 1 with value 54
% 2.73/2.95 ; 47 with value 45 20 with value 50 2 with value 55
% 2.73/2.95 ; The agenda of rows to give has 1898 entries:
% 2.73/2.95 ; 1 with value (4 24) 205 with value (4 47) 2 with value (4 62)
% 2.73/2.95 ; 1 with value (4 29) 214 with value (4 48) 5 with value (4 63)
% 2.73/2.95 ; 1 with value (4 32) 218 with value (4 49) 1 with value (4 64)
% 2.73/2.95 ; 2 with value (4 35) 182 with value (4 50) 2 with value (4 65)
% 2.73/2.95 ; 11 with value (4 36) 121 with value (4 51) 1 with value (4 66)
% 2.73/2.95 ; 21 with value (4 37) 40 with value (4 52) 1 with value (4 67)
% 2.73/2.95 ; 26 with value (4 38) 15 with value (4 53) 3 with value (4 72)
% 2.73/2.95 ; 40 with value (4 39) 9 with value (4 54) 1 with value (4 74)
% 2.73/2.95 ; 45 with value (4 40) 2 with value (4 55) 1 with value (4 76)
% 2.73/2.95 ; 64 with value (4 41) 6 with value (4 56) 1 with value (4 78)
% 2.73/2.95 ; 85 with value (4 42) 2 with value (4 57) 1 with value (4 79)
% 2.73/2.95 ; 97 with value (4 43) 7 with value (4 58) 1 with value (4 82)
% 2.73/2.95 ; 119 with value (4 44) 7 with value (4 59) 1 with value (4 84)
% 2.73/2.95 ; 158 with value (4 45) 2 with value (4 60) 1 with value (4 91)
% 2.73/2.95 ; 173 with value (4 46) 1 with value (4 61) 1 with value (4 101)
% 2.73/2.95 Evaluation took:
% 2.73/2.95 2.575 seconds of real time
% 2.73/2.95 2.364341 seconds of user run time
% 2.73/2.95 0.198736 seconds of system run time
% 2.73/2.95 [Run times include 0.453 seconds GC run time.]
% 2.73/2.95 0 calls to %EVAL
% 2.73/2.95 0 page faults and
% 2.73/2.95 214,670,288 bytes consed.
% 2.73/2.95 :PROOF-FOUND
% 2.73/2.95 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-14T04:01:00
% 2.73/2.95 :PROOF-FOUND
% 2.73/2.95 *
%------------------------------------------------------------------------------