%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP276-1 : TPTP v8.1.0. Released v2.5.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:37:44 EDT 2022
% Result : Unsatisfiable 28.83s 29.08s
% Output : Refutation 28.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of clauses : 66 ( 25 unt; 33 nHn; 48 RR)
% Number of literals : 136 ( 135 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 : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 41 ( 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_c7) = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).
cnf(prove_this_6,negated_conjecture,
( multiply(sk_c1,sk_c7) = sk_c6
| inverse(sk_c4) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).
cnf(prove_this_11,negated_conjecture,
( inverse(sk_c1) = sk_c7
| multiply(sk_c4,sk_c5) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).
cnf(prove_this_12,negated_conjecture,
( inverse(sk_c1) = sk_c7
| inverse(sk_c4) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).
cnf(prove_this_16,negated_conjecture,
( multiply(sk_c7,sk_c5) = sk_c6
| inverse(sk_c7) = sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_16) ).
cnf(prove_this_19,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c6,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_19) ).
cnf(prove_this_20,negated_conjecture,
( inverse(sk_c2) = sk_c7
| multiply(sk_c3,sk_c7) = sk_c6 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).
cnf(prove_this_21,negated_conjecture,
( inverse(sk_c2) = sk_c7
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| multiply(sk_c6,sk_c5) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_27,negated_conjecture,
( multiply(sk_c2,sk_c6) = sk_c7
| inverse(sk_c3) = sk_c7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_27) ).
cnf(prove_this_31,negated_conjecture,
( multiply(X,sk_c7) != sk_c6
| inverse(X) != sk_c7
| multiply(sk_c7,sk_c5) != sk_c6
| inverse(Y) != sk_c7
| multiply(Y,sk_c6) != sk_c7
| multiply(sk_c6,sk_c5) != sk_c7
| multiply(Z,sk_c7) != sk_c6
| inverse(Z) != sk_c7
| inverse(sk_c7) != sk_c5
| multiply(U,sk_c5) != sk_c6
| inverse(U) != sk_c5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_31) ).
cnf(35,plain,
( multiply(sk_c7,sk_c5) != sk_c6
| inverse(X) != sk_c7
| multiply(X,sk_c6) != sk_c7
| multiply(sk_c6,sk_c5) != sk_c7
| multiply(Y,sk_c7) != sk_c6
| inverse(Y) != sk_c7
| inverse(sk_c7) != sk_c5 ),
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(92,plain,
( multiply(sk_c2,sk_c6) = sk_c7
| multiply(sk_c7,X) = multiply(sk_c6,multiply(sk_c5,X)) ),
inference('PARAMODULATE',[status(thm)],[associativity,prove_this_25,theory(equality)]) ).
cnf(101,plain,
( multiply(sk_c7,sk_c5) != sk_c6
| inverse(X) != sk_c7
| multiply(X,sk_c6) != sk_c7
| multiply(sk_c6,sk_c5) != sk_c7
| identity != sk_c6
| inverse(inverse(sk_c7)) != sk_c7
| inverse(sk_c7) != sk_c5 ),
inference('PARAMODULATE',[status(thm)],[35,left_inverse,theory(equality)]) ).
cnf(136,plain,
X = multiply(inverse(inverse(X)),identity),
inference('PARAMODULATE',[status(thm)],[43,left_inverse,theory(equality)]) ).
cnf(137,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
inference('PARAMODULATE',[status(thm)],[43,43,theory(equality)]) ).
cnf(138,plain,
X = multiply(X,identity),
inference('REWRITE',[status(thm)],[136,137,theory(equality)]) ).
cnf(139,plain,
multiply(multiply(X,inverse(Y)),Y) = X,
inference('REWRITE',[status(thm)],[44,138,theory(equality)]) ).
cnf(140,plain,
( inverse(sk_c2) = sk_c7
| sk_c5 = multiply(inverse(sk_c6),sk_c7) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_19,theory(equality)]) ).
cnf(143,plain,
( inverse(sk_c1) = sk_c7
| sk_c5 = multiply(inverse(sk_c4),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_11,theory(equality)]) ).
cnf(145,plain,
( inverse(sk_c7) = sk_c5
| sk_c5 = multiply(inverse(sk_c7),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_16,theory(equality)]) ).
cnf(153,plain,
( inverse(sk_c2) = sk_c7
| sk_c7 = multiply(inverse(sk_c3),sk_c6) ),
inference('PARAMODULATE',[status(thm)],[43,prove_this_20,theory(equality)]) ).
cnf(155,plain,
multiply(multiply(X,inverse(Y)),multiply(Y,Z)) = multiply(X,Z),
inference('PARAMODULATE',[status(thm)],[associativity,43,theory(equality)]) ).
cnf(172,plain,
inverse(identity) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,138,theory(equality)]) ).
cnf(175,plain,
X = inverse(inverse(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[139,left_inverse,theory(equality)]),left_identity,theory(equality)]) ).
cnf(176,plain,
( multiply(sk_c7,sk_c5) != sk_c6
| inverse(X) != sk_c7
| multiply(X,sk_c6) != sk_c7
| multiply(sk_c6,sk_c5) != sk_c7
| identity != sk_c6
| inverse(sk_c7) != sk_c5 ),
inference('REWRITE',[status(thm)],[101,175,theory(equality)]) ).
cnf(186,plain,
multiply(X,inverse(X)) = identity,
inference('PARAMODULATE',[status(thm)],[left_inverse,175,theory(equality)]) ).
cnf(187,plain,
multiply(multiply(X,Y),inverse(Y)) = X,
inference('PARAMODULATE',[status(thm)],[139,175,theory(equality)]) ).
cnf(203,plain,
inverse(X) = multiply(inverse(multiply(Y,X)),Y),
inference('PARAMODULATE',[status(thm)],[43,187,theory(equality)]) ).
cnf(390,plain,
( inverse(sk_c1) = sk_c7
| sk_c5 = multiply(sk_c5,sk_c6) ),
inference('PARAMODULATE',[status(thm)],[143,prove_this_12,theory(equality)]) ).
cnf(396,plain,
( inverse(sk_c1) = sk_c7
| identity = sk_c6 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,390,theory(equality)]),left_inverse,theory(equality)]) ).
cnf(402,plain,
( identity = sk_c6
| multiply(sk_c1,sk_c7) = identity ),
inference('PARAMODULATE',[status(thm)],[186,396,theory(equality)]) ).
cnf(422,plain,
( identity = sk_c6
| inverse(sk_c4) = sk_c5 ),
inference('PARAMODULATE',[status(thm)],[prove_this_6,402,theory(equality)]) ).
cnf(425,plain,
( identity = sk_c6
| multiply(sk_c4,sk_c5) = sk_c6 ),
inference('PARAMODULATE',[status(thm)],[prove_this_5,402,theory(equality)]) ).
cnf(428,plain,
( identity = sk_c6
| multiply(sk_c4,sk_c5) = identity ),
inference('PARAMODULATE',[status(thm)],[186,422,theory(equality)]) ).
cnf(540,plain,
( inverse(sk_c2) = sk_c7
| multiply(sk_c7,sk_c6) = sk_c7 ),
inference('PARAMODULATE',[status(thm)],[153,prove_this_21,theory(equality)]) ).
cnf(569,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference('PARAMODULATE',[status(thm)],[139,203,theory(equality)]) ).
cnf(571,plain,
( inverse(sk_c7) = sk_c5
| sk_c5 = inverse(multiply(inverse(sk_c6),sk_c7)) ),
inference('REWRITE',[status(thm)],[145,569,theory(equality)]) ).
cnf(724,plain,
( inverse(sk_c2) = sk_c7
| X = multiply(X,sk_c6) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[155,540,theory(equality)]),139,theory(equality)]) ).
cnf(760,plain,
( inverse(sk_c2) = sk_c7
| inverse(sk_c6) = identity ),
inference('PARAMODULATE',[status(thm)],[left_inverse,724,theory(equality)]) ).
cnf(782,plain,
( inverse(sk_c2) = sk_c7
| sk_c5 = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[140,760,theory(equality)]),left_identity,theory(equality)]) ).
cnf(1160,plain,
identity = sk_c6,
inference('PARAMODULATE',[status(thm)],[425,428,theory(equality)]) ).
cnf(1172,plain,
( sk_c2 = sk_c7
| sk_c5 = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_25,left_identity,138,1160,theory(equality)]) ).
cnf(1174,plain,
( sk_c2 = sk_c7
| inverse(sk_c3) = sk_c7 ),
inference('REWRITE',[status(thm)],[prove_this_27,138,1160,theory(equality)]) ).
cnf(1211,plain,
( sk_c2 = sk_c7
| multiply(sk_c7,X) = multiply(sk_c5,X) ),
inference('REWRITE',[status(thm)],[92,left_identity,138,1160,theory(equality)]) ).
cnf(1249,plain,
( multiply(sk_c7,sk_c5) != identity
| inverse(X) != sk_c7
| X != sk_c7
| sk_c5 != sk_c7
| inverse(sk_c7) != sk_c5 ),
inference('REWRITE',[status(thm)],[176,left_identity,138,1160,theory(equality)]) ).
cnf(1325,plain,
inverse(sk_c7) = sk_c5,
inference('REWRITE',[status(thm)],[571,left_identity,172,1160,theory(equality)]) ).
cnf(1347,plain,
( multiply(sk_c7,sk_c5) != identity
| inverse(X) != sk_c7
| X != sk_c7
| sk_c5 != sk_c7 ),
inference('REWRITE',[status(thm)],[1249,1325,theory(equality)]) ).
cnf(1494,plain,
( sk_c2 = sk_c7
| multiply(sk_c7,sk_c3) = identity ),
inference('PARAMODULATE',[status(thm)],[left_inverse,1174,theory(equality)]) ).
cnf(1511,plain,
sk_c7 = inverse(sk_c5),
inference('PARAMODULATE',[status(thm)],[175,1325,theory(equality)]) ).
cnf(1523,plain,
multiply(sk_c7,sk_c5) = identity,
inference('PARAMODULATE',[status(thm)],[186,1325,theory(equality)]) ).
cnf(1531,plain,
( inverse(X) != sk_c7
| X != sk_c7
| sk_c5 != sk_c7 ),
inference('REWRITE',[status(thm)],[1347,1523,theory(equality)]) ).
cnf(1607,plain,
( sk_c2 = sk_c7
| multiply(sk_c5,sk_c3) = identity ),
inference('PARAMODULATE',[status(thm)],[1494,1211,theory(equality)]) ).
cnf(1616,plain,
( sk_c2 = sk_c7
| sk_c3 = sk_c7 ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,1607,theory(equality)]),138,1511,theory(equality)]) ).
cnf(1857,plain,
sk_c2 = sk_c7,
inference('HYPERRESOLVE',[status(thm)],[1531,1174,1616,1172]) ).
cnf(1938,plain,
( inverse(sk_c2) = sk_c2
| sk_c2 = sk_c5 ),
inference('REWRITE',[status(thm)],[782,1857,theory(equality)]) ).
cnf(2009,plain,
inverse(sk_c2) = sk_c5,
inference('REWRITE',[status(thm)],[1325,1857,theory(equality)]) ).
cnf(2024,plain,
sk_c2 = sk_c5,
inference('REWRITE',[status(thm)],[1938,2009,theory(equality)]) ).
cnf(2090,plain,
inverse(sk_c2) = sk_c2,
inference('REWRITE',[status(thm)],[2009,2024,theory(equality)]) ).
cnf(2121,plain,
( inverse(X) != sk_c2
| X != sk_c2 ),
inference('REWRITE',[status(thm)],[1531,2024,1857,theory(equality)]) ).
cnf(2135,plain,
$false,
inference('HYPERRESOLVE',[status(thm)],[2121,2090,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP276-1 : TPTP v8.1.0. Released v2.5.0.
% 0.05/0.10 % Command : run-snark %s %d
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 13 14:43:27 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.12/0.37 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37 *
% 0.12/0.37 *
% 0.12/0.38 #<PACKAGE "SNARK-USER">
% 0.12/0.38 *
% 0.12/0.38 SNARK-TPTP-OPTIONS
% 0.12/0.38 *
% 0.12/0.38 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.12/0.38 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.12/0.38 (USE-FACTORING :POS)
% 0.12/0.38 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.12/0.38 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.12/0.38 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.12/0.38 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.12/0.38 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.12/0.38 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.12/0.38 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.12/0.38 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.12/0.38 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.12/0.38 (DECLARE-TPTP-SYMBOLS2))
% 0.12/0.38 *
% 0.12/0.38 "."
% 0.12/0.38 *
% 0.12/0.38 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T14:43:27
% 0.12/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-13T14:43:27
% 0.12/0.39
% 0.12/0.39 ; Recognized left identity assertion (= (|multiply| |identity| ?X) ?X).
% 0.12/0.39 ; Recognized possible left inverse assertion (= (|multiply| (|inverse| ?X) ?X) |identity|).
% 28.83/29.08 ; Recognized associativity assertion (= (|multiply| (|multiply| ?X ?Y) ?Z) (|multiply| ?X (|multiply| ?Y ?Z))).
% 28.83/29.08
% 28.83/29.08 #||
% 28.83/29.08 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.83/29.09 % SZS output start Refutation
% See solution above
% 28.83/29.09 ||#
% 28.83/29.09
% 28.83/29.09 ; Summary of computation:
% 28.83/29.09 ; 98584 formulas have been input or derived (from 242 formulas).
% 28.83/29.09 ; 2135 ( 2%) were retained. Of these,
% 28.83/29.09 ; 1964 (92%) were simplified or subsumed later,
% 28.83/29.09 ; 171 ( 8%) are still being kept.
% 28.83/29.09 ;
% 28.83/29.09 ; Run time in seconds excluding printing time:
% 28.83/29.09 ; 0.004 0% Read assertion file (1 call)
% 28.83/29.09 ; 0.001 0% Assert (34 calls)
% 28.83/29.09 ; 0.457 2% Process new row (73,497 calls)
% 28.83/29.09 ; 3.666 13% Resolution (482 calls)
% 28.83/29.09 ; 0.067 0% Paramodulation (241 calls)
% 28.83/29.09 ; 0.001 0% Factoring (210 calls)
% 28.83/29.09 ; 0.117 0% Condensing (71,440 calls)
% 28.83/29.09 ; 18.015 63% Forward subsumption (71,440 calls)
% 28.83/29.09 ; 0.067 0% Backward subsumption (2,072 calls)
% 28.83/29.09 ; 3.195 11% Clause clause subsumption (639,768 calls)
% 28.83/29.09 ; 2.714 9% Forward simplification (73,035 calls)
% 28.83/29.09 ; 0.075 0% Backward simplification (2,134 calls)
% 28.83/29.09 ; 0.042 0% Ordering (22,563 calls)
% 28.83/29.09 ; 0.000 0% Sortal reasoning (32 calls)
% 28.83/29.09 ; 0.000 0% Purity testing (1 call)
% 28.83/29.09 ; 0.282 1% Other
% 28.83/29.09 ; 28.703 Total
% 28.83/29.09 ; 28.713 Real time
% 28.83/29.09 ;
% 28.83/29.09 ; Term-hash-array has 851 terms in all.
% 28.83/29.09 ; Feature-vector-row-index has 134 entries (1,000 at peak, 2,072 added, 1,938 deleted).
% 28.83/29.09 ; Feature-vector-row-index has 585 nodes (6,428 at peak, 12,143 added, 11,558 deleted).
% 28.83/29.09 ; Retrieved 2,358,710 possibly forward subsuming rows in 71,440 calls.
% 28.83/29.09 ; Retrieved 1,696 possibly backward subsumed rows in 2,072 calls.
% 28.83/29.09 ; Path-index has 250 entries (595 at peak, 998 added, 748 deleted).
% 28.83/29.09 ; Path-index has 245 nodes (333 at peak, 423 added, 178 deleted).
% 28.83/29.09 ; Trie-index has 250 entries (595 at peak, 998 added, 748 deleted).
% 28.83/29.09 ; Trie-index has 637 nodes (1,335 at peak, 2,160 added, 1,523 deleted).
% 28.83/29.09 ; Retrieved 5,591 generalization terms in 677,435 calls.
% 28.83/29.09 ; Retrieved 139 instance terms in 80 calls.
% 28.83/29.09 ; Retrieved 1,789,762 unifiable terms in 50,315 calls.
% 28.83/29.09 ;
% 28.83/29.09 ; The agenda of rows to process has 18 entries:
% 28.83/29.09 ; 1 with value 7 2 with value 12 3 with value 16
% 28.83/29.09 ; 1 with value 8 3 with value 13 1 with value 17
% 28.83/29.09 ; 1 with value 9 1 with value 15 1 with value 18
% 28.83/29.09 ; 4 with value 11
% 28.83/29.09 ; The agenda of rows to give has 146 entries:
% 28.83/29.09 ; 2 with value (4 13) 17 with value (4 19) 11 with value (4 24)
% 28.83/29.09 ; 6 with value (4 14) 22 with value (4 20) 2 with value (4 25)
% 28.83/29.09 ; 3 with value (4 16) 17 with value (4 21) 4 with value (4 26)
% 28.83/29.09 ; 14 with value (4 17) 10 with value (4 22) 5 with value (4 27)
% 28.83/29.09 ; 18 with value (4 18) 13 with value (4 23) 2 with value (4 30)
% 28.83/29.09 Evaluation took:
% 28.83/29.09 28.713 seconds of real time
% 28.83/29.09 27.490639 seconds of user run time
% 28.83/29.09 1.216763 seconds of system run time
% 28.83/29.09 [Run times include 1.07 seconds GC run time.]
% 28.83/29.09 0 calls to %EVAL
% 28.83/29.09 0 page faults and
% 28.83/29.09 3,374,995,128 bytes consed.
% 28.83/29.09 :PROOF-FOUND
% 28.83/29.09 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T14:43:55
% 28.83/29.09 :PROOF-FOUND
% 28.83/29.09 *
%------------------------------------------------------------------------------