TSTP Solution File: GRP298-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP298-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n025.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:37:48 EDT 2022
% Result : Unsatisfiable 17.59s 17.81s
% Output : Refutation 17.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 14
% Syntax : Number of clauses : 68 ( 26 unt; 25 nHn; 54 RR)
% Number of literals : 154 ( 153 equ; 70 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
multiply(identity,X) = X,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(left_inverse,axiom,
multiply(inverse(X),X) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(associativity,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(prove_this_3,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).
cnf(prove_this_4,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).
cnf(prove_this_5,negated_conjecture,
( multiply(sk_c8,sk_c7) = sk_c6
| multiply(sk_c3,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_14,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c4,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c4) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c4,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_23,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c4) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_23) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c2) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c8,sk_c6) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c3,sk_c7) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
cnf(prove_this_33,negated_conjecture,
( multiply(sk_c8,sk_c7) != sk_c6
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(sk_c6,sk_c8) != sk_c7
| multiply(Y,sk_c8) != sk_c7
| inverse(Y) != sk_c8
| multiply(sk_c8,sk_c6) != sk_c7
| inverse(Z) != sk_c8
| multiply(Z,sk_c7) != sk_c8
| multiply(U,V) != sk_c7
| inverse(U) != V
| multiply(V,sk_c6) != sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_33) ).
cnf(37,plain,
( multiply(sk_c8,sk_c7) != sk_c6
| multiply(sk_c6,sk_c8) != sk_c7
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(sk_c8,sk_c6) != sk_c7
| inverse(Y) != sk_c8
| multiply(Y,sk_c7) != sk_c8 ),
inference('CONDENSE',[status(thm)],[prove_this_33]) ).
cnf(42,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(43,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(111,plain,
( inverse(sk_c2) = sk_c8
| multiply(sk_c8,sk_c7) != sk_c6
| inverse(sk_c6) != sk_c8
| multiply(sk_c8,sk_c6) != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,prove_this_26,theory(equality)]),theory(equality)]) ).
cnf(114,plain,
( multiply(sk_c3,sk_c7) = sk_c8
| multiply(sk_c8,sk_c7) != sk_c6
| inverse(sk_c6) != sk_c8
| multiply(sk_c8,sk_c6) != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[37,prove_this_29,theory(equality)]),theory(equality)]) ).
cnf(118,plain,
( multiply(sk_c8,sk_c7) != sk_c6
| multiply(sk_c6,sk_c8) != sk_c7
| identity != sk_c7
| inverse(inverse(sk_c8)) != sk_c8
| multiply(sk_c8,sk_c6) != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8 ),
inference('PARAMODULATE',[status(thm)],[37,left_inverse,theory(equality)]) ).
cnf(161,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[42,left_inverse,theory(equality)]) ).
cnf(162,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[42,42,theory(equality)]) ).
cnf(163,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[161,162,theory(equality)]) ).
cnf(164,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[43,163,theory(equality)]) ).
cnf(165,plain,
( inverse(sk_c1) = sk_c8
| sk_c5 = multiply(inverse(sk_c4),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[42,prove_this_22,theory(equality)]) ).
cnf(197,plain,
( multiply(sk_c8,sk_c6) = sk_c7
| sk_c8 = multiply(inverse(sk_c6),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[42,prove_this_27,theory(equality)]) ).
cnf(200,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,163,theory(equality)]) ).
cnf(203,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[164,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(204,plain,
( multiply(sk_c8,sk_c7) != sk_c6
| multiply(sk_c6,sk_c8) != sk_c7
| identity != sk_c7
| multiply(sk_c8,sk_c6) != sk_c7
| inverse(X) != sk_c8
| multiply(X,sk_c7) != sk_c8 ),
inference('REWRITE',[status(thm)],[118,203,theory(equality)]) ).
cnf(211,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,203,theory(equality)]) ).
cnf(212,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[164,203,theory(equality)]) ).
cnf(222,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[42,212,theory(equality)]) ).
cnf(286,plain,
( inverse(sk_c1) = sk_c8
| sk_c5 = multiply(sk_c5,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[165,prove_this_23,theory(equality)]) ).
cnf(292,plain,
( inverse(sk_c1) = sk_c8
| identity = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42,286,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(297,plain,
( identity = sk_c7
| multiply(sk_c1,sk_c8) = identity ),
inference('PARAMODULATE',[status(thm)],[211,292,theory(equality)]) ).
cnf(307,plain,
( identity = sk_c7
| inverse(sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_15,297,theory(equality)]) ).
cnf(311,plain,
( identity = sk_c7
| multiply(sk_c4,sk_c5) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_14,297,theory(equality)]) ).
cnf(314,plain,
( identity = sk_c7
| multiply(sk_c4,sk_c5) = identity ),
inference('PARAMODULATE',[status(thm)],[211,307,theory(equality)]) ).
cnf(410,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[164,222,theory(equality)]) ).
cnf(852,plain,
identity = sk_c7,
inference('PARAMODULATE',[status(thm)],[311,314,theory(equality)]) ).
cnf(855,plain,
( sk_c6 = sk_c8
| multiply(sk_c8,sk_c6) = identity ),
inference('REWRITE',[status(thm)],[prove_this_3,163,852,theory(equality)]) ).
cnf(856,plain,
( sk_c6 = sk_c8
| inverse(sk_c3) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_4,163,852,theory(equality)]) ).
cnf(857,plain,
( sk_c6 = sk_c8
| sk_c3 = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_5,163,852,theory(equality)]) ).
cnf(932,plain,
( inverse(sk_c2) = sk_c8
| sk_c6 != sk_c8
| inverse(sk_c6) != sk_c8
| multiply(sk_c8,sk_c6) != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[111,163,852,theory(equality)])]) ).
cnf(935,plain,
( sk_c3 = sk_c8
| sk_c6 != sk_c8
| inverse(sk_c6) != sk_c8
| multiply(sk_c8,sk_c6) != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[114,163,852,theory(equality)])]) ).
cnf(983,plain,
( multiply(sk_c8,sk_c6) = identity
| inverse(sk_c6) = sk_c8 ),
inference('REWRITE',[status(thm)],[197,left_identity,200,410,852,theory(equality)]) ).
cnf(987,plain,
( sk_c6 != sk_c8
| multiply(sk_c6,sk_c8) != identity
| multiply(sk_c8,sk_c6) != identity
| inverse(X) != sk_c8
| X != sk_c8 ),
inference('REWRITE',[status(thm)],[204,163,852,theory(equality)]) ).
cnf(1152,plain,
( sk_c6 = sk_c8
| sk_c3 = inverse(sk_c8) ),
inference('PARAMODULATE',[status(thm)],[203,856,theory(equality)]) ).
cnf(1167,plain,
( sk_c6 = sk_c8
| sk_c6 = inverse(sk_c8) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[42,855,theory(equality)]),left_identity,200,410,theory(equality)]) ).
cnf(1230,plain,
( sk_c6 = sk_c8
| sk_c6 = sk_c3 ),
inference('PARAMODULATE',[status(thm)],[1167,1152,theory(equality)]) ).
cnf(1357,plain,
inverse(sk_c6) = sk_c8,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[212,983,theory(equality)]),left_identity,theory(equality)]) ).
cnf(1361,plain,
( inverse(sk_c2) = sk_c8
| sk_c6 != sk_c8
| multiply(sk_c8,sk_c6) != identity ),
inference('REWRITE',[status(thm)],[932,1357,theory(equality)]) ).
cnf(1364,plain,
( sk_c3 = sk_c8
| sk_c6 != sk_c8
| multiply(sk_c8,sk_c6) != identity ),
inference('REWRITE',[status(thm)],[935,1357,theory(equality)]) ).
cnf(1423,plain,
multiply(sk_c6,sk_c8) = identity,
inference('PARAMODULATE',[status(thm)],[211,1357,theory(equality)]) ).
cnf(1434,plain,
( sk_c6 != sk_c8
| multiply(sk_c8,sk_c6) != identity
| inverse(X) != sk_c8
| X != sk_c8 ),
inference('REWRITE',[status(thm)],[987,1423,theory(equality)]) ).
cnf(1442,plain,
multiply(sk_c8,sk_c6) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,1357,theory(equality)]) ).
cnf(1445,plain,
( inverse(sk_c2) = sk_c8
| sk_c6 != sk_c8 ),
inference('REWRITE',[status(thm)],[1361,1442,theory(equality)]) ).
cnf(1448,plain,
( sk_c3 = sk_c8
| sk_c6 != sk_c8 ),
inference('REWRITE',[status(thm)],[1364,1442,theory(equality)]) ).
cnf(1458,plain,
( sk_c6 != sk_c8
| inverse(X) != sk_c8
| X != sk_c8 ),
inference('REWRITE',[status(thm)],[1434,1442,theory(equality)]) ).
cnf(1471,plain,
sk_c3 = sk_c8,
inference('HYPERRESOLVE',[status(thm)],[1448,857]) ).
cnf(1662,plain,
sk_c6 = sk_c3,
inference('REWRITE',[status(thm)],[1230,1471,theory(equality)]) ).
cnf(1708,plain,
sk_c3 = inverse(sk_c3),
inference('REWRITE',[status(thm)],[1357,1662,1471,theory(equality)]) ).
cnf(1723,plain,
sk_c3 = inverse(sk_c2),
inference('REWRITE',[status(thm)],[1445,1662,1471,theory(equality)]) ).
cnf(1728,plain,
( inverse(X) != sk_c3
| X != sk_c3 ),
inference('REWRITE',[status(thm)],[1458,1662,1471,theory(equality)]) ).
cnf(1743,plain,
sk_c3 = sk_c2,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[203,1723,theory(equality)]),1708,theory(equality)]) ).
cnf(1775,plain,
sk_c2 = inverse(sk_c2),
inference('REWRITE',[status(thm)],[1708,1743,theory(equality)]) ).
cnf(1781,plain,
( inverse(X) != sk_c2
| X != sk_c2 ),
inference('REWRITE',[status(thm)],[1728,1743,theory(equality)]) ).
cnf(1790,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[1781,1775,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP298-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 05:09:39 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 0.19/0.46 #<PACKAGE "SNARK-USER">
% 0.19/0.46 *
% 0.19/0.46 SNARK-TPTP-OPTIONS
% 0.19/0.46 *
% 0.19/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46 (USE-FACTORING :POS)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46 *
% 0.19/0.46 "."
% 0.19/0.46 *
% 0.19/0.46 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T05:09:39
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-14T05:09:39
% 0.19/0.48
% 0.19/0.48 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.19/0.48 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 17.59/17.81 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 17.59/17.81
% 17.59/17.81 #||
% 17.59/17.81 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.59/17.81 % SZS output start Refutation
% See solution above
% 17.59/17.81 ||#
% 17.59/17.81
% 17.59/17.81 ; Summary of computation:
% 17.59/17.81 ; 44965 formulas have been input or derived (from 220 formulas).
% 17.59/17.81 ; 1790 ( 4%) were retained. Of these,
% 17.59/17.81 ; 1746 (98%) were simplified or subsumed later,
% 17.59/17.81 ; 44 ( 2%) are still being kept.
% 17.59/17.81 ;
% 17.59/17.81 ; Run time in seconds excluding printing time:
% 17.59/17.81 ; 0.007 0% Read assertion file (1 call)
% 17.59/17.81 ; 0.002 0% Assert (36 calls)
% 17.59/17.81 ; 0.238 1% Process new row (32,301 calls)
% 17.59/17.81 ; 9.018 52% Resolution (438 calls)
% 17.59/17.81 ; 0.050 0% Paramodulation (219 calls)
% 17.59/17.81 ; 0.000 0% Factoring (188 calls)
% 17.59/17.81 ; 0.067 0% Condensing (30,459 calls)
% 17.59/17.81 ; 6.144 35% Forward subsumption (30,459 calls)
% 17.59/17.81 ; 0.045 0% Backward subsumption (1,706 calls)
% 17.59/17.81 ; 0.414 2% Clause clause subsumption (87,401 calls)
% 17.59/17.81 ; 1.139 7% Forward simplification (31,941 calls)
% 17.59/17.81 ; 0.053 0% Backward simplification (1,789 calls)
% 17.59/17.81 ; 0.056 0% Ordering (35,612 calls)
% 17.59/17.81 ; 0.000 0% Sortal reasoning (32 calls)
% 17.59/17.81 ; 0.000 0% Purity testing (1 call)
% 17.59/17.81 ; 0.116 1% Other
% 17.59/17.81 ; 17.349 Total
% 17.59/17.81 ; 17.354 Real time
% 17.59/17.82 ;
% 17.59/17.82 ; Term-hash-array has 896 terms in all.
% 17.59/17.82 ; Feature-vector-row-index has 4 entries (736 at peak, 1,706 added, 1,702 deleted).
% 17.59/17.82 ; Feature-vector-row-index has 38 nodes (4,824 at peak, 10,131 added, 10,093 deleted).
% 17.59/17.82 ; Retrieved 597,884 possibly forward subsuming rows in 30,459 calls.
% 17.59/17.82 ; Retrieved 1,169 possibly backward subsumed rows in 1,706 calls.
% 17.59/17.82 ; Path-index has 124 entries (556 at peak, 1,123 added, 999 deleted).
% 17.59/17.82 ; Path-index has 198 nodes (357 at peak, 545 added, 347 deleted).
% 17.59/17.82 ; Trie-index has 124 entries (556 at peak, 1,123 added, 999 deleted).
% 17.59/17.82 ; Trie-index has 359 nodes (1,338 at peak, 2,584 added, 2,225 deleted).
% 17.59/17.82 ; Retrieved 4,674 generalization terms in 291,811 calls.
% 17.59/17.82 ; Retrieved 164 instance terms in 101 calls.
% 17.59/17.82 ; Retrieved 10,645,941 unifiable terms in 361,943 calls.
% 17.59/17.82 ;
% 17.59/17.82 ; The agenda of rows to process has 19 entries:
% 17.59/17.82 ; 2 with value 8 2 with value 12 1 with value 16
% 17.59/17.82 ; 4 with value 9 4 with value 13 1 with value 17
% 17.59/17.82 ; 1 with value 10 1 with value 15 1 with value 18
% 17.59/17.82 ; 2 with value 11
% 17.59/17.82 ; The agenda of rows to give has 23 entries:
% 17.59/17.82 ; 1 with value (4 12) 6 with value (4 20) 2 with value (4 23)
% 17.59/17.82 ; 2 with value (4 15) 2 with value (4 21) 2 with value (4 24)
% 17.59/17.82 ; 2 with value (4 18) 2 with value (4 22) 1 with value (4 26)
% 17.59/17.82 ; 3 with value (4 19)
% 17.59/17.82 Evaluation took:
% 17.59/17.82 17.354 seconds of real time
% 17.59/17.82 16.94906 seconds of user run time
% 17.59/17.82 0.40377 seconds of system run time
% 17.59/17.82 [Run times include 0.511 seconds GC run time.]
% 17.59/17.82 0 calls to %EVAL
% 17.59/17.82 0 page faults and
% 17.59/17.82 1,736,683,504 bytes consed.
% 17.59/17.82 :PROOF-FOUND
% 17.59/17.82 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T05:09:57
% 17.59/17.82 :PROOF-FOUND
% 17.59/17.82 *
%------------------------------------------------------------------------------