TSTP Solution File: ALG236-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : ALG236-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n020.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 : Thu Jul 14 18:00:21 EDT 2022
% Result : Unsatisfiable 7.31s 7.58s
% Output : Refutation 7.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 3 RR)
% Number of literals : 62 ( 61 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 258 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(X,mult(Y,mult(X,Y))) = mult(X,Y),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
mult(X,mult(Y,mult(Z,U))) = mult(Z,mult(Y,mult(X,U))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(mult(X,mult(Y,mult(Z,Y))),U) = mult(X,mult(U,mult(mult(Z,Y),U))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c03) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),mult(c,mult(d,e))) != mult(a,mult(c,mult(mult(d,b),e))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(5,plain,
mult(mult(a,b),mult(c,mult(d,e))) != mult(mult(d,b),mult(c,mult(a,e))),
inference('REWRITE',[status(thm)],[goals,c02,theory(equality)]) ).
cnf(6,plain,
mult(X,mult(mult(Y,mult(X,Y)),mult(X,Y))) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[c01,c01,theory(equality)]) ).
cnf(7,plain,
mult(X,mult(Y,Z)) = mult(Z,mult(Y,mult(X,mult(Y,Z)))),
inference('PARAMODULATE',[status(thm)],[c02,c01,theory(equality)]) ).
cnf(8,plain,
mult(X,mult(Y,mult(Z,mult(U,V)))) = mult(Z,mult(U,mult(X,mult(Y,V)))),
inference('PARAMODULATE',[status(thm)],[c02,c02,theory(equality)]) ).
cnf(12,plain,
mult(mult(X,Y),Z) = mult(mult(X,Y),mult(Z,mult(X,Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c03,c01,theory(equality)]),c02,theory(equality)]) ).
cnf(14,plain,
mult(mult(X,mult(Y,mult(Z,Y))),U) = mult(mult(Z,Y),mult(U,mult(X,U))),
inference('PARAMODULATE',[status(thm)],[c02,c03,theory(equality)]) ).
cnf(15,plain,
mult(mult(X,mult(Y,mult(Z,Y))),U) = mult(Z,mult(U,mult(mult(X,Y),U))),
inference('PARAMODULATE',[status(thm)],[c03,c02,theory(equality)]) ).
cnf(51,plain,
mult(X,mult(mult(Y,Z),U)) = mult(U,mult(mult(Y,Z),mult(X,mult(Y,U)))),
inference('PARAMODULATE',[status(thm)],[c02,12,theory(equality)]) ).
cnf(52,plain,
mult(mult(mult(X,Y),Z),U) = mult(mult(X,Y),mult(U,mult(mult(X,Z),U))),
inference('PARAMODULATE',[status(thm)],[c03,12,theory(equality)]) ).
cnf(55,plain,
mult(mult(mult(mult(X,Y),Z),mult(Y,mult(X,Y))),U) = mult(mult(mult(X,Y),Z),U),
inference('PARAMODULATE',[status(thm)],[c03,12,theory(equality)]) ).
cnf(59,plain,
mult(mult(X,mult(Y,mult(Z,U))),V) = mult(mult(X,mult(Y,mult(Z,U))),mult(V,mult(Z,V))),
inference('PARAMODULATE',[status(thm)],[12,c02,theory(equality)]) ).
cnf(62,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,mult(Z,Y))) = mult(X,mult(mult(U,mult(Z,Y)),mult(Z,Y))),
inference('PARAMODULATE',[status(thm)],[c03,12,theory(equality)]) ).
cnf(63,plain,
mult(mult(X,Y),Y) = mult(X,Y),
inference('REWRITE',[status(thm)],[6,12,c01,62,theory(equality)]) ).
cnf(64,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,mult(Z,Y))) = mult(X,mult(U,mult(Z,Y))),
inference('REWRITE',[status(thm)],[62,63,theory(equality)]) ).
cnf(66,plain,
mult(mult(X,mult(Y,mult(Z,Y))),U) = mult(X,mult(mult(U,mult(Z,U)),mult(mult(Z,Y),U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c03,12,theory(equality)]),59,theory(equality)]) ).
cnf(70,plain,
mult(mult(mult(X,Y),Z),mult(U,mult(X,U))) = mult(mult(mult(X,Y),Z),mult(mult(U,mult(X,U)),mult(mult(X,Y),U))),
inference('PARAMODULATE',[status(thm)],[12,12,theory(equality)]) ).
cnf(75,plain,
mult(X,mult(Y,mult(Z,U))) = mult(mult(Z,U),mult(Y,mult(X,U))),
inference('PARAMODULATE',[status(thm)],[c02,63,theory(equality)]) ).
cnf(82,plain,
mult(mult(X,mult(Y,mult(Z,Y))),Y) = mult(X,mult(Y,mult(Z,Y))),
inference('PARAMODULATE',[status(thm)],[c03,63,theory(equality)]) ).
cnf(83,plain,
mult(mult(mult(X,Y),Z),Y) = mult(mult(mult(X,Y),Z),mult(Y,mult(X,Y))),
inference('PARAMODULATE',[status(thm)],[12,63,theory(equality)]) ).
cnf(84,plain,
mult(mult(mult(mult(X,Y),Z),Y),U) = mult(mult(mult(X,Y),Z),U),
inference('REWRITE',[status(thm)],[55,83,theory(equality)]) ).
cnf(85,plain,
mult(X,mult(Y,mult(Z,U))) = mult(Z,mult(mult(Y,mult(Z,U)),mult(X,U))),
inference('PARAMODULATE',[status(thm)],[c02,63,theory(equality)]) ).
cnf(88,plain,
mult(X,mult(Y,mult(Z,U))) = mult(mult(mult(X,mult(Y,mult(Z,U))),U),mult(Y,mult(Z,U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c02,63,theory(equality)]),75,theory(equality)]) ).
cnf(90,plain,
mult(X,mult(mult(Y,mult(Z,Y)),mult(mult(Z,U),Y))) = mult(X,mult(Y,mult(mult(Z,U),Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c03,63,theory(equality)]),64,66,theory(equality)]) ).
cnf(91,plain,
mult(mult(mult(X,Y),Z),mult(U,mult(X,U))) = mult(mult(mult(X,Y),Z),U),
inference('REWRITE',[status(thm)],[70,12,90,theory(equality)]) ).
cnf(92,plain,
mult(mult(X,Y),Z) = mult(mult(mult(X,Z),Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,12,theory(equality)]),52,theory(equality)]) ).
cnf(93,plain,
mult(X,mult(Y,mult(Z,U))) = mult(mult(X,U),mult(Y,mult(Z,U))),
inference('REWRITE',[status(thm)],[88,92,theory(equality)]) ).
cnf(94,plain,
mult(mult(mult(X,Y),Z),U) = mult(mult(mult(X,Z),Y),U),
inference('REWRITE',[status(thm)],[84,92,theory(equality)]) ).
cnf(95,plain,
mult(mult(X,mult(Y,Z)),U) = mult(mult(X,mult(Y,Z)),mult(U,mult(Z,U))),
inference('PARAMODULATE',[status(thm)],[12,7,theory(equality)]) ).
cnf(99,plain,
mult(X,mult(Y,mult(Z,mult(U,V)))) = mult(V,mult(Y,mult(X,mult(U,mult(Z,mult(U,V)))))),
inference('PARAMODULATE',[status(thm)],[c02,7,theory(equality)]) ).
cnf(107,plain,
mult(mult(mult(mult(X,Y),Z),U),Y) = mult(mult(mult(X,Z),U),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[92,92,theory(equality)]),92,theory(equality)]) ).
cnf(161,plain,
mult(mult(X,Y),mult(Z,mult(U,V))) = mult(mult(mult(X,V),Y),mult(Z,mult(U,V))),
inference('PARAMODULATE',[status(thm)],[94,93,theory(equality)]) ).
cnf(167,plain,
mult(X,mult(Y,mult(Z,mult(U,V)))) = mult(mult(X,mult(Y,V)),mult(Y,mult(Z,mult(U,V)))),
inference('PARAMODULATE',[status(thm)],[93,c02,theory(equality)]) ).
cnf(175,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,mult(V,W))) = mult(mult(X,mult(W,mult(mult(Z,Y),W))),mult(U,mult(V,W))),
inference('PARAMODULATE',[status(thm)],[93,c03,theory(equality)]) ).
cnf(183,plain,
mult(mult(X,Y),mult(Z,mult(U,mult(V,mult(W,Y))))) = mult(X,mult(Z,mult(U,mult(V,mult(W,Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[93,93,theory(equality)]),93,theory(equality)]) ).
cnf(187,plain,
mult(X,mult(Y,mult(mult(Z,mult(U,mult(V,U))),W))) = mult(mult(X,mult(U,mult(V,U))),mult(Y,mult(mult(Z,mult(U,mult(V,U))),W))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[93,c03,theory(equality)]),175,theory(equality)]) ).
cnf(189,plain,
mult(X,mult(Y,mult(Z,mult(U,mult(V,U))))) = mult(mult(Z,mult(U,mult(V,U))),mult(Y,mult(X,U))),
inference('PARAMODULATE',[status(thm)],[c02,82,theory(equality)]) ).
cnf(204,plain,
mult(mult(X,mult(Y,mult(Z,mult(U,V)))),mult(U,mult(X,mult(Y,V)))) = mult(X,mult(Y,mult(Z,mult(U,V)))),
inference('PARAMODULATE',[status(thm)],[63,8,theory(equality)]) ).
cnf(234,plain,
mult(mult(X,mult(Y,mult(Z,Y))),U) = mult(mult(X,Y),mult(U,mult(Z,U))),
inference('PARAMODULATE',[status(thm)],[14,c02,theory(equality)]) ).
cnf(238,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,X)) = mult(mult(Z,Y),mult(U,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,12,theory(equality)]),63,theory(equality)]) ).
cnf(302,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,mult(X,Y))) = mult(Z,mult(U,mult(X,Y))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[15,12,theory(equality)]),63,theory(equality)]) ).
cnf(308,plain,
mult(mult(X,Y),mult(Z,mult(U,Z))) = mult(mult(U,Y),mult(Z,mult(X,Z))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[92,15,theory(equality)]),63,234,12,theory(equality)]) ).
cnf(383,plain,
mult(X,mult(Y,mult(X,mult(Z,U)))) = mult(X,mult(Y,mult(U,mult(Z,U)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c01,15,theory(equality)]),64,204,302,189,183,theory(equality)]) ).
cnf(460,plain,
mult(mult(X,mult(Y,Z)),mult(U,mult(V,W))) = mult(mult(X,mult(Y,Z)),mult(U,mult(V,mult(U,mult(Z,W))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[95,c02,theory(equality)]),167,theory(equality)]) ).
cnf(641,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(mult(U,V),W)) = mult(mult(Z,Y),mult(mult(U,V),mult(X,mult(U,W)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[51,14,theory(equality)]),99,93,theory(equality)]) ).
cnf(800,plain,
mult(X,mult(Y,mult(mult(Z,U),V))) = mult(mult(X,mult(U,mult(Z,U))),mult(mult(Y,mult(mult(Z,U),V)),mult(Z,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[85,51,theory(equality)]),641,theory(equality)]) ).
cnf(834,plain,
mult(mult(X,mult(Y,Z)),mult(mult(U,mult(Z,V)),mult(W,V))) = mult(mult(X,mult(Y,Z)),mult(U,mult(W,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[95,85,theory(equality)]),460,167,161,theory(equality)]) ).
cnf(835,plain,
mult(X,mult(Y,mult(mult(Z,U),V))) = mult(mult(X,mult(U,mult(Z,U))),mult(Y,mult(Z,V))),
inference('REWRITE',[status(thm)],[800,834,theory(equality)]) ).
cnf(1308,plain,
mult(mult(X,Y),mult(Z,mult(U,V))) = mult(mult(U,mult(Y,mult(X,Y))),mult(Z,mult(U,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[94,238,theory(equality)]),93,theory(equality)]) ).
cnf(1310,plain,
mult(mult(mult(X,mult(Y,mult(Z,Y))),U),mult(V,mult(Z,Y))) = mult(mult(X,U),mult(V,mult(Z,Y))),
inference('PARAMODULATE',[status(thm)],[238,14,theory(equality)]) ).
cnf(1314,plain,
mult(mult(mult(X,Y),Z),mult(U,mult(mult(X,Y),V))) = mult(mult(X,Z),mult(U,mult(mult(X,Y),V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[238,91,theory(equality)]),161,theory(equality)]) ).
cnf(1336,plain,
mult(mult(X,Y),mult(Z,mult(U,V))) = mult(mult(U,mult(Y,mult(X,Y))),mult(Z,mult(mult(X,Y),V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[238,92,theory(equality)]),1308,c02,187,161,theory(equality)]) ).
cnf(1348,plain,
mult(mult(mult(X,Y),mult(Z,mult(U,Z))),mult(V,mult(mult(mult(X,mult(Z,mult(U,Z))),Y),W))) = mult(mult(mult(X,Y),mult(Z,mult(U,Z))),mult(V,mult(mult(U,Z),W))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[238,107,theory(equality)]),1310,1336,161,theory(equality)]) ).
cnf(1466,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,mult(Z,V))) = mult(mult(X,Y),mult(U,mult(Z,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[238,308,theory(equality)]),161,theory(equality)]) ).
cnf(1468,plain,
mult(X,mult(Y,mult(mult(Z,U),V))) = mult(mult(X,U),mult(Y,mult(Z,V))),
inference('REWRITE',[status(thm)],[835,1466,theory(equality)]) ).
cnf(1476,plain,
mult(mult(X,Y),mult(Z,mult(mult(X,mult(U,mult(V,U))),W))) = mult(mult(mult(X,Y),mult(U,mult(V,U))),mult(Z,mult(mult(V,U),W))),
inference('REWRITE',[status(thm)],[1348,1314,92,1468,theory(equality)]) ).
cnf(1631,plain,
mult(mult(X,mult(Y,mult(Z,Y))),mult(U,mult(mult(Z,Y),V))) = mult(mult(X,Y),mult(U,mult(Z,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[383,234,theory(equality)]),c01,93,1476,theory(equality)]) ).
cnf(1633,plain,
mult(mult(X,Y),mult(Z,mult(U,V))) = mult(mult(U,Y),mult(Z,mult(X,V))),
inference('REWRITE',[status(thm)],[1336,1631,theory(equality)]) ).
cnf(1634,plain,
$false,
inference('REWRITE',[status(thm)],[5,1633,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ALG236-1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 8 15:14:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.46 *
% 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-08T15:14:06
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-08T15:14:06
% 7.31/7.58
% 7.31/7.58
% 7.31/7.58 #||
% 7.31/7.58 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.31/7.58 % SZS output start Refutation
% See solution above
% 7.41/7.58 ||#
% 7.41/7.58
% 7.41/7.58 ; Summary of computation:
% 7.41/7.58 ; 5788 formulas have been input or derived (from 32 formulas).
% 7.41/7.58 ; 1634 (28%) were retained. Of these,
% 7.41/7.58 ; 312 (19%) were simplified or subsumed later,
% 7.41/7.58 ; 1322 (81%) are still being kept.
% 7.41/7.58 ;
% 7.41/7.58 ; Run time in seconds excluding printing time:
% 7.41/7.58 ; 0.002 0% Read assertion file (1 call)
% 7.41/7.58 ; 0.000 0% Assert (4 calls)
% 7.41/7.58 ; 0.200 3% Process new row (5,521 calls)
% 7.41/7.58 ; 0.004 0% Resolution (62 calls)
% 7.41/7.58 ; 0.114 2% Paramodulation (31 calls)
% 7.41/7.58 ; 1.704 24% Forward simplification (5,509 calls)
% 7.41/7.58 ; 0.575 8% Backward simplification (1,633 calls)
% 7.41/7.58 ; 4.456 63% Ordering (428,360 calls)
% 7.41/7.58 ; 0.000 0% Sortal reasoning (32 calls)
% 7.41/7.58 ; 0.000 0% Purity testing (1 call)
% 7.41/7.58 ; 0.057 1% Other
% 7.41/7.58 ; 7.112 Total
% 7.41/7.58 ; 7.119 Real time
% 7.41/7.58 ;
% 7.41/7.58 ; Term-hash-array has 5,942 terms in all.
% 7.41/7.58 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 7.41/7.58 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 7.41/7.58 ; Path-index has 5,029 entries (5,093 at peak, 6,119 added, 1,090 deleted).
% 7.41/7.58 ; Path-index has 778 nodes (809 at peak, 936 added, 158 deleted).
% 7.41/7.58 ; Trie-index has 5,029 entries (5,093 at peak, 6,119 added, 1,090 deleted).
% 7.41/7.58 ; Trie-index has 11,797 nodes (11,982 at peak, 16,039 added, 4,242 deleted).
% 7.41/7.58 ; Retrieved 530,787 generalization terms in 86,330 calls.
% 7.41/7.58 ; Retrieved 162,070 instance terms in 3,649 calls.
% 7.41/7.58 ; Retrieved 63,115 unifiable terms in 273 calls.
% 7.41/7.58 ;
% 7.41/7.58 ; The agenda of backward simplifiable rows to process has 2 entries:
% 7.41/7.58 ; 2 with value 0
% 7.41/7.58 ; The agenda of rows to process has 216 entries:
% 7.41/7.58 ; 14 with value 41 32 with value 48 4 with value 54
% 7.41/7.58 ; 33 with value 42 11 with value 49 2 with value 55
% 7.41/7.58 ; 9 with value 43 3 with value 50 3 with value 56
% 7.41/7.58 ; 8 with value 44 10 with value 51 4 with value 58
% 7.41/7.58 ; 33 with value 45 1 with value 52 2 with value 59
% 7.41/7.58 ; 15 with value 46 8 with value 53 5 with value 61
% 7.41/7.58 ; 19 with value 47
% 7.41/7.58 ; The agenda of rows to give has 1294 entries:
% 7.41/7.58 ; 2 with value (4 26) 52 with value (4 35) 35 with value (4 43)
% 7.41/7.58 ; 16 with value (4 27) 121 with value (4 36) 20 with value (4 44)
% 7.41/7.58 ; 3 with value (4 28) 147 with value (4 37) 21 with value (4 45)
% 7.41/7.58 ; 4 with value (4 29) 40 with value (4 38) 14 with value (4 46)
% 7.41/7.58 ; 12 with value (4 30) 27 with value (4 39) 26 with value (4 47)
% 7.41/7.58 ; 60 with value (4 31) 81 with value (4 40) 54 with value (4 48)
% 7.41/7.58 ; 88 with value (4 32) 254 with value (4 41) 6 with value (4 49)
% 7.41/7.58 ; 32 with value (4 33) 148 with value (4 42) 2 with value (4 50)
% 7.41/7.58 ; 29 with value (4 34)
% 7.41/7.58 Evaluation took:
% 7.41/7.58 7.119 seconds of real time
% 7.41/7.58 6.658798 seconds of user run time
% 7.41/7.58 0.460822 seconds of system run time
% 7.41/7.58 [Run times include 0.234 seconds GC run time.]
% 7.41/7.58 0 calls to %EVAL
% 7.41/7.58 0 page faults and
% 7.41/7.58 487,348,464 bytes consed.
% 7.41/7.58 :PROOF-FOUND
% 7.41/7.58 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-08T15:14:13
% 7.41/7.58 :PROOF-FOUND
% 7.41/7.58 *
%------------------------------------------------------------------------------