TSTP Solution File: GRP261-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP261-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:42 EDT 2022
% Result : Unsatisfiable 155.88s 156.09s
% Output : Refutation 155.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 16
% Syntax : Number of clauses : 66 ( 20 unt; 39 nHn; 47 RR)
% Number of literals : 143 ( 142 equ; 45 neg)
% Maximal clause size : 11 ( 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 : 47 ( 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_5,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_7,negated_conjecture,
( inverse(sk_c1) = sk_c8
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).
cnf(prove_this_8,negated_conjecture,
( inverse(sk_c1) = sk_c8
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_8) ).
cnf(prove_this_15,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_15) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c2,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c4,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_22,negated_conjecture,
( inverse(sk_c2) = sk_c7
| inverse(sk_c4) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_22) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c3,sk_c8) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_26,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c3) = sk_c8 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_29,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_29) ).
cnf(prove_this_30,negated_conjecture,
( multiply(sk_c6,sk_c8) = sk_c7
| multiply(sk_c5,sk_c8) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_30) ).
cnf(prove_this_31,negated_conjecture,
( multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c7) != sk_c6
| inverse(Y) != sk_c7
| multiply(sk_c6,sk_c8) != sk_c7
| multiply(Z,sk_c8) != sk_c7
| inverse(Z) != sk_c8
| multiply(U,sk_c7) != sk_c6
| inverse(U) != sk_c7
| inverse(V) != sk_c6
| multiply(V,sk_c8) != sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(35,plain,
( multiply(sk_c6,sk_c8) != sk_c7
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c7) != sk_c6
| inverse(Y) != sk_c7
| inverse(Z) != sk_c6
| multiply(Z,sk_c8) != sk_c6 ),
inference('CONDENSE',[status(thm)],[prove_this_31]) ).
cnf(43,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(44,plain,
multiply(multiply(X,inverse(Y)),Y) = multiply(X,identity),
inference('PARAMODULATE',[status(thm)],[associativity,left_inverse,theory(equality)]) ).
cnf(106,plain,
( multiply(sk_c6,sk_c8) != sk_c7
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c7) != sk_c6
| inverse(Y) != sk_c7
| inverse(identity) != sk_c6
| sk_c8 != sk_c6 ),
inference('PARAMODULATE',[status(thm)],[35,left_identity,theory(equality)]) ).
cnf(174,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[43,left_inverse,theory(equality)]) ).
cnf(175,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[43,43,theory(equality)]) ).
cnf(176,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[174,175,theory(equality)]) ).
cnf(177,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[44,176,theory(equality)]) ).
cnf(178,plain,
( inverse(sk_c2) = sk_c7
| sk_c7 = multiply(inverse(sk_c4),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_21,theory(equality)]) ).
cnf(187,plain,
( inverse(sk_c1) = sk_c8
| sk_c8 = multiply(inverse(sk_c3),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_7,theory(equality)]) ).
cnf(193,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,43,theory(equality)]) ).
cnf(205,plain,
( multiply(sk_c1,sk_c8) = sk_c7
| sk_c8 = multiply(inverse(sk_c5),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_6,theory(equality)]) ).
cnf(210,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,176,theory(equality)]) ).
cnf(213,plain,
( multiply(sk_c6,sk_c8) != sk_c7
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c7) != sk_c6
| inverse(Y) != sk_c7
| identity != sk_c6
| sk_c8 != sk_c6 ),
inference('REWRITE',[status(thm)],[106,210,theory(equality)]) ).
cnf(214,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[177,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(227,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,214,theory(equality)]) ).
cnf(228,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[177,214,theory(equality)]) ).
cnf(245,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[43,228,theory(equality)]) ).
cnf(303,plain,
( inverse(sk_c2) = sk_c7
| sk_c7 = multiply(sk_c7,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[178,prove_this_22,theory(equality)]) ).
cnf(308,plain,
( inverse(sk_c2) = sk_c7
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,303,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(312,plain,
( identity = sk_c6
| multiply(sk_c2,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[227,308,theory(equality)]) ).
cnf(326,plain,
( identity = sk_c6
| inverse(sk_c4) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[prove_this_16,312,theory(equality)]) ).
cnf(339,plain,
( identity = sk_c6
| multiply(sk_c4,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[227,326,theory(equality)]) ).
cnf(428,plain,
( inverse(sk_c1) = sk_c8
| sk_c8 = multiply(sk_c8,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[187,prove_this_8,theory(equality)]) ).
cnf(434,plain,
( inverse(sk_c1) = sk_c8
| identity = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,428,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(439,plain,
( identity = sk_c7
| multiply(sk_c1,sk_c8) = identity ),
inference('PARAMODULATE',[status(thm)],[227,434,theory(equality)]) ).
cnf(454,plain,
( identity = sk_c7
| inverse(sk_c5) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_5,439,theory(equality)]) ).
cnf(520,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[177,245,theory(equality)]) ).
cnf(1131,plain,
( identity = sk_c6
| multiply(sk_c2,sk_c7) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_15,339,theory(equality)]) ).
cnf(2805,plain,
identity = sk_c6,
inference('PARAMODULATE',[status(thm)],[312,1131,theory(equality)]) ).
cnf(2815,plain,
( sk_c8 = sk_c7
| multiply(sk_c3,sk_c8) = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_25,left_identity,2805,theory(equality)]) ).
cnf(2816,plain,
( sk_c8 = sk_c7
| inverse(sk_c3) = sk_c8 ),
inference('REWRITE',[status(thm)],[prove_this_26,left_identity,2805,theory(equality)]) ).
cnf(2819,plain,
( sk_c8 = sk_c7
| inverse(sk_c5) = identity ),
inference('REWRITE',[status(thm)],[prove_this_29,left_identity,2805,theory(equality)]) ).
cnf(2820,plain,
( sk_c8 = sk_c7
| multiply(sk_c5,sk_c8) = identity ),
inference('REWRITE',[status(thm)],[prove_this_30,left_identity,2805,theory(equality)]) ).
cnf(2907,plain,
( multiply(sk_c1,sk_c8) = sk_c7
| inverse(sk_c5) = sk_c8 ),
inference('REWRITE',[status(thm)],[205,left_identity,210,520,2805,theory(equality)]) ).
cnf(2910,plain,
( sk_c8 != sk_c7
| multiply(X,sk_c8) != sk_c7
| inverse(X) != sk_c8
| multiply(Y,sk_c7) != identity
| inverse(Y) != sk_c7
| identity != sk_c8 ),
inference('REWRITE',[status(thm)],[213,left_identity,2805,theory(equality)]) ).
cnf(2938,plain,
( identity = sk_c7
| inverse(sk_c5) = identity ),
inference('REWRITE',[status(thm)],[454,2805,theory(equality)]) ).
cnf(3323,plain,
( sk_c8 = sk_c7
| X = multiply(sk_c5,X) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,2819,theory(equality)]),left_identity,theory(equality)]) ).
cnf(3329,plain,
( sk_c8 = sk_c7
| sk_c8 = multiply(inverse(sk_c3),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[43,2815,theory(equality)]) ).
cnf(3338,plain,
( sk_c8 = sk_c7
| X = multiply(sk_c5,multiply(sk_c8,X)) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[associativity,2820,theory(equality)]),left_identity,theory(equality)]) ).
cnf(3497,plain,
( inverse(sk_c5) = sk_c8
| identity = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[439,2907,theory(equality)]) ).
cnf(3574,plain,
( sk_c8 = sk_c7
| sk_c8 = multiply(sk_c8,sk_c7) ),
inference('PARAMODULATE',[status(thm)],[3329,2816,theory(equality)]) ).
cnf(3582,plain,
( sk_c8 = sk_c7
| X = multiply(X,sk_c7) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[193,3574,theory(equality)]),177,theory(equality)]) ).
cnf(3583,plain,
( sk_c8 = sk_c7
| multiply(sk_c8,X) = X ),
inference('PARAMODULATE',[status(thm)],[3323,3338,theory(equality)]) ).
cnf(3715,plain,
sk_c8 = sk_c7,
inference('PARAMODULATE',[status(thm)],[3583,3582,theory(equality)]) ).
cnf(4371,plain,
( multiply(X,sk_c7) != sk_c7
| inverse(X) != sk_c7
| multiply(Y,sk_c7) != identity
| inverse(Y) != sk_c7
| identity != sk_c7 ),
inference('REWRITE',[status(thm)],[2910,3715,theory(equality)]) ).
cnf(4574,plain,
( inverse(sk_c5) = sk_c7
| identity = sk_c7 ),
inference('REWRITE',[status(thm)],[3497,3715,theory(equality)]) ).
cnf(4924,plain,
identity = sk_c7,
inference('PARAMODULATE',[status(thm)],[2938,4574,theory(equality)]) ).
cnf(5279,plain,
( X != identity
| inverse(X) != identity ),
inference('CONDENSE',[status(thm)],[inference('REWRITE',[status(thm)],[4371,176,4924,theory(equality)])]) ).
cnf(5392,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[5279,210,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP261-1 : TPTP v8.1.0. Released v2.5.0.
% 0.14/0.14 % Command : run-snark %s %d
% 0.15/0.35 % Computer : n025.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 19:43:54 EDT 2022
% 0.15/0.36 % 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-06-13T19:43:54
% 0.22/0.49 ; 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-13T19:43:54
% 0.22/0.50
% 0.22/0.50 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.22/0.50 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 155.88/156.09 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 155.88/156.09
% 155.88/156.09 #||
% 155.88/156.09 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 155.88/156.09 % SZS output start Refutation
% See solution above
% 155.88/156.10 ||#
% 155.88/156.10
% 155.88/156.10 ; Summary of computation:
% 155.88/156.10 ; 516059 formulas have been input or derived (from 473 formulas).
% 155.88/156.10 ; 5392 ( 1%) were retained. Of these,
% 155.88/156.10 ; 4847 (90%) were simplified or subsumed later,
% 155.88/156.10 ; 545 (10%) are still being kept.
% 155.88/156.10 ;
% 155.88/156.10 ; Run time in seconds excluding printing time:
% 155.88/156.10 ; 0.006 0% Read assertion file (1 call)
% 155.88/156.10 ; 0.002 0% Assert (34 calls)
% 155.88/156.10 ; 2.133 1% Process new row (408,871 calls)
% 155.88/156.10 ; 29.377 19% Resolution (944 calls)
% 155.88/156.10 ; 0.173 0% Paramodulation (472 calls)
% 155.88/156.10 ; 0.001 0% Factoring (448 calls)
% 155.88/156.10 ; 0.654 0% Condensing (328,809 calls)
% 155.88/156.10 ; 99.448 64% Forward subsumption (328,809 calls)
% 155.88/156.10 ; 0.278 0% Backward subsumption (5,322 calls)
% 155.88/156.10 ; 8.932 6% Clause clause subsumption (1,864,377 calls)
% 155.88/156.10 ; 12.841 8% Forward simplification (331,792 calls)
% 155.88/156.10 ; 0.187 0% Backward simplification (5,391 calls)
% 155.88/156.10 ; 0.133 0% Ordering (66,564 calls)
% 155.88/156.10 ; 0.000 0% Sortal reasoning (32 calls)
% 155.88/156.10 ; 0.000 0% Purity testing (1 call)
% 155.88/156.10 ; 1.420 1% Other
% 155.88/156.10 ; 155.585 Total
% 155.88/156.10 ; 155.608 Real time
% 155.88/156.10 ;
% 155.88/156.10 ; Term-hash-array has 2,096 terms in all.
% 155.88/156.10 ; Feature-vector-row-index has 492 entries (2,531 at peak, 5,322 added, 4,830 deleted).
% 155.88/156.10 ; Feature-vector-row-index has 1,435 nodes (12,712 at peak, 24,775 added, 23,340 deleted).
% 155.88/156.10 ; Retrieved 13,991,314 possibly forward subsuming rows in 328,809 calls.
% 155.88/156.10 ; Retrieved 9,972 possibly backward subsumed rows in 5,322 calls.
% 155.88/156.10 ; Path-index has 491 entries (1,430 at peak, 2,454 added, 1,963 deleted).
% 155.88/156.10 ; Path-index has 427 nodes (679 at peak, 917 added, 490 deleted).
% 155.88/156.10 ; Trie-index has 491 entries (1,430 at peak, 2,454 added, 1,963 deleted).
% 155.88/156.10 ; Trie-index has 1,299 nodes (3,592 at peak, 5,743 added, 4,444 deleted).
% 155.88/156.10 ; Retrieved 22,333 generalization terms in 3,195,924 calls.
% 155.88/156.10 ; Retrieved 338 instance terms in 123 calls.
% 155.88/156.10 ; Retrieved 15,512,913 unifiable terms in 255,824 calls.
% 155.88/156.10 ;
% 155.88/156.10 ; The agenda of rows to process has 43 entries:
% 155.88/156.10 ; 2 with value 8 4 with value 13 6 with value 17
% 155.88/156.10 ; 1 with value 9 6 with value 14 5 with value 18
% 155.88/156.10 ; 1 with value 11 3 with value 15 2 with value 19
% 155.88/156.10 ; 5 with value 12 6 with value 16 2 with value 24
% 155.88/156.10 ; The agenda of rows to give has 505 entries:
% 155.88/156.10 ; 10 with value (4 12) 37 with value (4 18) 43 with value (4 23)
% 155.88/156.10 ; 1 with value (4 13) 23 with value (4 19) 50 with value (4 24)
% 155.88/156.10 ; 11 with value (4 14) 47 with value (4 20) 53 with value (4 25)
% 155.88/156.10 ; 16 with value (4 15) 93 with value (4 21) 19 with value (4 26)
% 155.88/156.10 ; 25 with value (4 16) 50 with value (4 22) 2 with value (4 28)
% 155.88/156.10 ; 25 with value (4 17)
% 155.88/156.10 Evaluation took:
% 155.88/156.10 155.609 seconds of real time
% 155.88/156.10 150.2955 seconds of user run time
% 155.88/156.10 5.29432 seconds of system run time
% 155.88/156.10 [Run times include 8.363 seconds GC run time.]
% 155.88/156.10 0 calls to %EVAL
% 155.88/156.10 0 page faults and
% 155.88/156.10 17,402,203,528 bytes consed.
% 155.88/156.10 :PROOF-FOUND
% 155.88/156.10 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T19:46:30
% 155.88/156.10 :PROOF-FOUND
% 155.88/156.10 *
%------------------------------------------------------------------------------