TSTP Solution File: GRP756-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n014.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:40:38 EDT 2022
% Result : Unsatisfiable 1.12s 1.34s
% Output : Refutation 1.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 5
% Syntax : Number of clauses : 73 ( 73 unt; 0 nHn; 5 RR)
% Number of literals : 73 ( 72 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 184 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(f01,axiom,
mult(X,ld(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
cnf(f02,axiom,
ld(X,mult(X,Y)) = Y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
cnf(f03,axiom,
mult(rd(X,Y),Y) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
cnf(f05,axiom,
mult(X,mult(mult(Y,Y),Z)) = mult(mult(X,Y),mult(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
cnf(goals,negated_conjecture,
mult(mult(a,b),c) != mult(a,mult(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
cnf(10,plain,
ld(X,mult(mult(X,Y),mult(Y,Z))) = mult(mult(Y,Y),Z),
inference('PARAMODULATE',[status(thm)],[f02,f05,theory(equality)]) ).
cnf(11,plain,
mult(rd(X,Y),mult(mult(Y,Y),Z)) = mult(X,mult(Y,Z)),
inference('PARAMODULATE',[status(thm)],[f05,f03,theory(equality)]) ).
cnf(12,plain,
mult(X,mult(mult(Y,Y),ld(Y,Z))) = mult(mult(X,Y),Z),
inference('PARAMODULATE',[status(thm)],[f05,f01,theory(equality)]) ).
cnf(14,plain,
ld(mult(X,Y),mult(X,mult(mult(Y,Y),Z))) = mult(Y,Z),
inference('PARAMODULATE',[status(thm)],[f02,f05,theory(equality)]) ).
cnf(24,plain,
ld(rd(X,Y),mult(X,mult(Y,Z))) = mult(mult(Y,Y),Z),
inference('PARAMODULATE',[status(thm)],[10,f03,theory(equality)]) ).
cnf(25,plain,
ld(X,mult(mult(X,Y),Z)) = mult(mult(Y,Y),ld(Y,Z)),
inference('PARAMODULATE',[status(thm)],[10,f01,theory(equality)]) ).
cnf(42,plain,
mult(rd(X,Y),Z) = mult(X,mult(Y,ld(mult(Y,Y),Z))),
inference('PARAMODULATE',[status(thm)],[11,f01,theory(equality)]) ).
cnf(43,plain,
mult(X,mult(Y,ld(mult(Y,Y),Y))) = X,
inference('REWRITE',[status(thm)],[f03,42,theory(equality)]) ).
cnf(50,plain,
ld(X,X) = mult(Y,ld(mult(Y,Y),Y)),
inference('PARAMODULATE',[status(thm)],[f02,43,theory(equality)]) ).
cnf(52,plain,
X = mult(mult(X,Y),mult(Y,ld(mult(mult(Y,Y),mult(Y,Y)),mult(Y,Y)))),
inference('PARAMODULATE',[status(thm)],[f05,43,theory(equality)]) ).
cnf(54,plain,
ld(X,mult(mult(X,Y),Y)) = mult(Y,Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,43,theory(equality)]),43,theory(equality)]) ).
cnf(55,plain,
rd(X,Y) = mult(X,mult(Y,ld(mult(mult(Y,Y),mult(Y,Y)),mult(Y,Y)))),
inference('PARAMODULATE',[status(thm)],[11,43,theory(equality)]) ).
cnf(66,plain,
ld(mult(X,mult(Y,ld(mult(mult(Y,Y),mult(Y,Y)),mult(Y,Y)))),mult(X,mult(Y,Z))) = mult(mult(Y,Y),Z),
inference('REWRITE',[status(thm)],[24,55,theory(equality)]) ).
cnf(72,plain,
mult(X,ld(Y,Y)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[43,10,theory(equality)]),52,theory(equality)]) ).
cnf(73,plain,
ld(X,X) = ld(Y,Y),
inference('PARAMODULATE',[status(thm)],[f02,72,theory(equality)]) ).
cnf(94,plain,
ld(X,ld(Y,Y)) = ld(mult(X,X),X),
inference('PARAMODULATE',[status(thm)],[f02,50,theory(equality)]) ).
cnf(95,plain,
mult(X,ld(mult(X,X),X)) = mult(Y,ld(mult(Y,Y),Y)),
inference('PARAMODULATE',[status(thm)],[50,50,theory(equality)]) ).
cnf(100,plain,
mult(mult(X,X),ld(X,ld(Y,Y))) = X,
inference('PARAMODULATE',[status(thm)],[f01,94,theory(equality)]) ).
cnf(101,plain,
ld(X,mult(Y,ld(mult(Y,Y),Y))) = ld(mult(X,X),X),
inference('PARAMODULATE',[status(thm)],[94,50,theory(equality)]) ).
cnf(103,plain,
ld(X,mult(Y,ld(X,Y))) = mult(ld(X,Y),ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[54,f01,theory(equality)]) ).
cnf(108,plain,
ld(X,mult(ld(Y,Y),ld(mult(X,X),X))) = ld(mult(mult(X,X),mult(X,X)),mult(X,X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,50,theory(equality)]),101,103,theory(equality)]) ).
cnf(164,plain,
mult(X,mult(ld(mult(mult(X,X),mult(X,X)),mult(X,X)),ld(ld(mult(X,X),X),Y))) = mult(ld(Z,Z),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,50,theory(equality)]),101,103,theory(equality)]) ).
cnf(172,plain,
ld(mult(X,Y),mult(X,Z)) = mult(Y,ld(mult(Y,Y),Z)),
inference('PARAMODULATE',[status(thm)],[14,f01,theory(equality)]) ).
cnf(218,plain,
ld(X,Y) = mult(mult(Z,Z),ld(Z,ld(mult(X,Z),Y))),
inference('PARAMODULATE',[status(thm)],[25,f01,theory(equality)]) ).
cnf(220,plain,
ld(X,mult(Y,Z)) = mult(ld(X,mult(Y,ld(X,Y))),ld(ld(X,Y),Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,f01,theory(equality)]),103,theory(equality)]) ).
cnf(238,plain,
ld(X,mult(ld(Y,Y),Z)) = mult(ld(mult(mult(X,X),mult(X,X)),mult(X,X)),ld(ld(mult(X,X),X),Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,50,theory(equality)]),101,103,theory(equality)]) ).
cnf(336,plain,
ld(X,mult(mult(Y,ld(mult(Y,Y),Y)),mult(ld(mult(X,X),X),Z))) = mult(ld(mult(mult(X,X),mult(X,X)),mult(X,X)),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[10,95,theory(equality)]),101,103,theory(equality)]) ).
cnf(337,plain,
mult(X,mult(ld(mult(mult(X,X),mult(X,X)),mult(X,X)),Y)) = mult(mult(Z,ld(mult(Z,Z),Z)),mult(ld(mult(X,X),X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[f05,95,theory(equality)]),101,103,theory(equality)]) ).
cnf(338,plain,
ld(mult(X,ld(mult(X,X),X)),mult(Y,mult(ld(mult(mult(Y,Y),mult(Y,Y)),mult(Y,Y)),Z))) = mult(ld(mult(Y,Y),Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[14,95,theory(equality)]),101,103,theory(equality)]) ).
cnf(345,plain,
ld(mult(X,Y),Z) = mult(Y,ld(mult(Y,Y),ld(X,Z))),
inference('PARAMODULATE',[status(thm)],[172,f01,theory(equality)]) ).
cnf(347,plain,
ld(mult(X,Y),X) = ld(mult(Z,Y),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[172,72,theory(equality)]),345,theory(equality)]) ).
cnf(365,plain,
ld(mult(X,Y),mult(Z,ld(mult(Z,Z),Z))) = ld(mult(mult(X,X),Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[172,95,theory(equality)]),345,theory(equality)]) ).
cnf(381,plain,
ld(ld(X,X),mult(Y,Z)) = mult(ld(mult(Y,Y),Y),ld(ld(mult(mult(Y,Y),Y),Y),Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[172,50,theory(equality)]),365,103,theory(equality)]) ).
cnf(385,plain,
mult(X,ld(mult(X,X),mult(Y,Z))) = mult(ld(mult(U,X),mult(U,Y)),Z),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[12,172,theory(equality)]),220,103,theory(equality)]) ).
cnf(387,plain,
ld(mult(X,ld(mult(X,X),X)),mult(Y,Z)) = mult(ld(mult(Y,Y),Y),ld(ld(mult(mult(Y,Y),Y),Y),Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[172,95,theory(equality)]),365,103,theory(equality)]) ).
cnf(399,plain,
ld(X,Y) = ld(mult(Z,ld(Y,X)),Z),
inference('PARAMODULATE',[status(thm)],[347,f01,theory(equality)]) ).
cnf(404,plain,
X = ld(ld(Y,Y),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[347,100,theory(equality)]),399,f02,theory(equality)]) ).
cnf(405,plain,
mult(X,Y) = mult(ld(mult(X,X),X),ld(ld(mult(mult(X,X),X),X),Y)),
inference('REWRITE',[status(thm)],[381,404,theory(equality)]) ).
cnf(406,plain,
ld(mult(X,ld(mult(X,X),X)),mult(Y,Z)) = mult(Y,Z),
inference('REWRITE',[status(thm)],[387,405,theory(equality)]) ).
cnf(407,plain,
mult(X,mult(ld(mult(mult(X,X),mult(X,X)),mult(X,X)),Y)) = mult(ld(mult(X,X),X),Y),
inference('REWRITE',[status(thm)],[338,406,theory(equality)]) ).
cnf(408,plain,
mult(ld(mult(X,X),X),Y) = mult(mult(Z,ld(mult(Z,Z),Z)),mult(ld(mult(X,X),X),Y)),
inference('REWRITE',[status(thm)],[337,407,theory(equality)]) ).
cnf(411,plain,
ld(X,mult(ld(mult(X,X),X),Y)) = mult(ld(mult(mult(X,X),mult(X,X)),mult(X,X)),Y),
inference('REWRITE',[status(thm)],[336,408,theory(equality)]) ).
cnf(412,plain,
ld(X,mult(ld(Y,Y),Z)) = ld(X,Z),
inference('REWRITE',[status(thm)],[238,f01,411,theory(equality)]) ).
cnf(414,plain,
ld(X,ld(mult(X,X),X)) = ld(mult(mult(X,X),mult(X,X)),mult(X,X)),
inference('REWRITE',[status(thm)],[108,412,theory(equality)]) ).
cnf(430,plain,
ld(mult(X,ld(mult(Y,Y),Y)),mult(X,mult(Y,Z))) = mult(mult(Y,Y),Z),
inference('REWRITE',[status(thm)],[66,f01,414,theory(equality)]) ).
cnf(437,plain,
X = mult(ld(Y,Y),X),
inference('REWRITE',[status(thm)],[164,f01,407,theory(equality)]) ).
cnf(454,plain,
mult(X,Y) = mult(mult(X,X),ld(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[25,437,theory(equality)]),404,theory(equality)]) ).
cnf(466,plain,
ld(X,Y) = mult(Z,ld(mult(X,Z),Y)),
inference('REWRITE',[status(thm)],[218,454,theory(equality)]) ).
cnf(486,plain,
ld(X,mult(Y,Z)) = mult(ld(mult(U,X),mult(U,Y)),Z),
inference('REWRITE',[status(thm)],[385,466,theory(equality)]) ).
cnf(504,plain,
ld(mult(X,Y),Z) = ld(Y,ld(X,Z)),
inference('REWRITE',[status(thm)],[345,466,theory(equality)]) ).
cnf(514,plain,
ld(X,Y) = ld(ld(Y,X),ld(Z,Z)),
inference('REWRITE',[status(thm)],[399,504,theory(equality)]) ).
cnf(534,plain,
ld(mult(X,ld(Y,ld(Y,Y))),mult(X,mult(Y,Z))) = mult(mult(Y,Y),Z),
inference('REWRITE',[status(thm)],[430,504,theory(equality)]) ).
cnf(545,plain,
ld(mult(X,Y),mult(X,Z)) = ld(Y,Z),
inference('REWRITE',[status(thm)],[172,466,theory(equality)]) ).
cnf(552,plain,
ld(ld(X,ld(X,X)),mult(X,Y)) = mult(mult(X,X),Y),
inference('REWRITE',[status(thm)],[534,545,theory(equality)]) ).
cnf(617,plain,
mult(X,Y) = ld(ld(X,ld(X,X)),Y),
inference('REWRITE',[status(thm)],[454,f01,552,theory(equality)]) ).
cnf(632,plain,
ld(ld(X,ld(X,X)),ld(X,Y)) = Y,
inference('REWRITE',[status(thm)],[f01,617,theory(equality)]) ).
cnf(670,plain,
ld(ld(ld(X,ld(X,X)),Y),Z) = ld(Y,ld(X,Z)),
inference('REWRITE',[status(thm)],[504,617,theory(equality)]) ).
cnf(683,plain,
ld(ld(ld(X,ld(X,X)),Y),ld(ld(X,ld(X,X)),Z)) = ld(Y,Z),
inference('REWRITE',[status(thm)],[545,617,theory(equality)]) ).
cnf(700,plain,
ld(ld(b,ld(a,ld(b,b))),c) != ld(ld(a,ld(a,a)),ld(ld(b,ld(b,b)),c)),
inference('REWRITE',[status(thm)],[goals,670,683,617,theory(equality)]) ).
cnf(795,plain,
ld(X,ld(ld(Y,ld(Y,Y)),Z)) = ld(ld(Y,X),Z),
inference('REWRITE',[status(thm)],[486,514,617,545,theory(equality)]) ).
cnf(803,plain,
ld(ld(b,ld(a,ld(b,b))),c) != ld(ld(b,ld(a,ld(a,a))),c),
inference('REWRITE',[status(thm)],[700,795,theory(equality)]) ).
cnf(893,plain,
ld(ld(X,ld(Y,Y)),ld(X,Z)) = Z,
inference('PARAMODULATE',[status(thm)],[632,73,theory(equality)]) ).
cnf(894,plain,
ld(ld(b,ld(a,ld(X,X))),c) != ld(ld(b,ld(a,ld(a,a))),c),
inference('PARAMODULATE',[status(thm)],[803,73,theory(equality)]) ).
cnf(896,plain,
ld(X,ld(ld(X,ld(Y,Y)),Z)) = Z,
inference('PARAMODULATE',[status(thm)],[893,893,theory(equality)]) ).
cnf(903,plain,
ld(ld(X,ld(Y,Y)),Z) = ld(ld(X,ld(U,U)),Z),
inference('PARAMODULATE',[status(thm)],[893,896,theory(equality)]) ).
cnf(913,plain,
ld(ld(ld(X,ld(Y,Y)),Z),U) = ld(Z,ld(X,U)),
inference('PARAMODULATE',[status(thm)],[670,73,theory(equality)]) ).
cnf(971,plain,
ld(ld(X,ld(Y,ld(Z,Z))),U) = ld(ld(X,ld(Y,ld(V,V))),U),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[903,913,theory(equality)]),514,theory(equality)]) ).
cnf(972,plain,
$false,
inference('REWRITE',[status(thm)],[894,971,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : run-snark %s %d
% 0.13/0.33 % Computer : n014.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 08:59:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.45 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 *
% 0.20/0.46 *
% 0.20/0.46 #<PACKAGE "SNARK-USER">
% 0.20/0.46 *
% 0.20/0.46 SNARK-TPTP-OPTIONS
% 0.20/0.46 *
% 0.20/0.46 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46 (USE-FACTORING :POS)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46 *
% 0.20/0.46 "."
% 0.20/0.46 *
% 0.20/0.47 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T08:59:36
% 0.20/0.47 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-14T08:59:36
% 1.12/1.34
% 1.12/1.34
% 1.12/1.34 #||
% 1.12/1.34 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.12/1.34 % SZS output start Refutation
% See solution above
% 1.18/1.36 ||#
% 1.18/1.36
% 1.18/1.36 ; Summary of computation:
% 1.18/1.36 ; 2618 formulas have been input or derived (from 50 formulas).
% 1.18/1.36 ; 972 (37%) were retained. Of these,
% 1.18/1.36 ; 859 (88%) were simplified or subsumed later,
% 1.18/1.36 ; 113 (12%) are still being kept.
% 1.18/1.36 ;
% 1.18/1.36 ; Run time in seconds excluding printing time:
% 1.18/1.36 ; 0.001 0% Read assertion file (1 call)
% 1.18/1.36 ; 0.000 0% Assert (6 calls)
% 1.18/1.36 ; 0.132 15% Process new row (2,594 calls)
% 1.18/1.36 ; 0.004 0% Resolution (98 calls)
% 1.18/1.36 ; 0.044 5% Paramodulation (49 calls)
% 1.18/1.36 ; 0.191 22% Forward simplification (2,369 calls)
% 1.18/1.36 ; 0.140 16% Backward simplification (972 calls)
% 1.18/1.36 ; 0.326 37% Ordering (28,736 calls)
% 1.18/1.36 ; 0.000 0% Sortal reasoning (32 calls)
% 1.18/1.36 ; 0.001 0% Purity testing (1 call)
% 1.18/1.36 ; 0.036 4% Other
% 1.18/1.36 ; 0.875 Total
% 1.18/1.36 ; 0.896 Real time
% 1.18/1.36 ;
% 1.18/1.36 ; Term-hash-array has 3,195 terms in all.
% 1.18/1.36 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.18/1.36 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.18/1.36 ; Path-index has 540 entries (1,125 at peak, 3,574 added, 3,034 deleted).
% 1.18/1.36 ; Path-index has 5,767 nodes (6,404 at peak, 9,948 added, 4,181 deleted).
% 1.18/1.36 ; Trie-index has 540 entries (1,125 at peak, 3,574 added, 3,034 deleted).
% 1.18/1.36 ; Trie-index has 2,950 nodes (7,605 at peak, 29,668 added, 26,718 deleted).
% 1.18/1.36 ; Retrieved 64,927 generalization terms in 30,101 calls.
% 1.18/1.36 ; Retrieved 21,992 instance terms in 1,677 calls.
% 1.18/1.36 ; Retrieved 13,103 unifiable terms in 352 calls.
% 1.18/1.36 ;
% 1.18/1.36 ; The agenda of rows to process has 11 entries:
% 1.18/1.36 ; 1 with value 36 8 with value 37 2 with value 38
% 1.18/1.36 ; The agenda of rows to give has 102 entries:
% 1.18/1.36 ; 3 with value (4 25) 5 with value (4 39) 1 with value (4 57)
% 1.18/1.36 ; 1 with value (4 26) 1 with value (4 41) 1 with value (4 59)
% 1.18/1.36 ; 1 with value (4 29) 3 with value (4 43) 2 with value (4 60)
% 1.18/1.36 ; 6 with value (4 30) 2 with value (4 44) 1 with value (4 61)
% 1.18/1.36 ; 4 with value (4 31) 5 with value (4 45) 1 with value (4 62)
% 1.18/1.36 ; 3 with value (4 32) 4 with value (4 47) 2 with value (4 63)
% 1.18/1.36 ; 1 with value (4 33) 2 with value (4 48) 1 with value (4 64)
% 1.18/1.36 ; 9 with value (4 34) 2 with value (4 49) 5 with value (4 65)
% 1.18/1.36 ; 8 with value (4 35) 1 with value (4 51) 2 with value (4 69)
% 1.18/1.36 ; 11 with value (4 36) 6 with value (4 52) 1 with value (4 77)
% 1.18/1.36 ; 1 with value (4 37) 1 with value (4 55) 1 with value (4 81)
% 1.18/1.36 ; 1 with value (4 38) 2 with value (4 56) 1 with value (4 86)
% 1.18/1.36 Evaluation took:
% 1.18/1.36 0.897 seconds of real time
% 1.18/1.36 0.812828 seconds of user run time
% 1.18/1.36 0.083718 seconds of system run time
% 1.18/1.36 [Run times include 0.051 seconds GC run time.]
% 1.18/1.36 0 calls to %EVAL
% 1.18/1.36 0 page faults and
% 1.18/1.36 63,598,080 bytes consed.
% 1.18/1.36 :PROOF-FOUND
% 1.18/1.36 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T08:59:37
% 1.18/1.36 :PROOF-FOUND
% 1.18/1.36 *
%------------------------------------------------------------------------------