TSTP Solution File: GRP686-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP686-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n022.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:20 EDT 2022
% Result : Unsatisfiable 1.64s 1.80s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 8
% Syntax : Number of clauses : 73 ( 73 unt; 0 nHn; 6 RR)
% Number of literals : 73 ( 72 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 147 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(X,ld(X,Y)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).
cnf(c02,axiom,
ld(X,mult(X,Y)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).
cnf(c03,axiom,
mult(rd(X,Y),Y) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).
cnf(c04,axiom,
rd(mult(X,Y),Y) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c04) ).
cnf(c05,axiom,
mult(X,unit) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c05) ).
cnf(c06,axiom,
mult(unit,X) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c06) ).
cnf(c07,axiom,
mult(X,mult(Y,mult(Y,Z))) = mult(mult(X,mult(Y,Y)),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(goals,negated_conjecture,
mult(mult(a,a),mult(b,c)) != mult(mult(a,mult(a,b)),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(11,plain,
X = rd(X,unit),
inference('PARAMODULATE',[status(thm)],[c05,c03,theory(equality)]) ).
cnf(12,plain,
ld(rd(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[c02,c03,theory(equality)]) ).
cnf(14,plain,
rd(X,ld(Y,X)) = Y,
inference('PARAMODULATE',[status(thm)],[c04,c01,theory(equality)]) ).
cnf(15,plain,
mult(mult(X,X),Y) = mult(X,mult(X,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c06,c07,theory(equality)]),c06,theory(equality)]) ).
cnf(16,plain,
mult(mult(a,a),mult(b,c)) != mult(mult(mult(a,a),b),c),
inference('REWRITE',[status(thm)],[goals,15,theory(equality)]) ).
cnf(17,plain,
mult(X,mult(Y,Z)) = mult(mult(X,mult(Y,Y)),ld(Y,Z)),
inference('PARAMODULATE',[status(thm)],[c07,c01,theory(equality)]) ).
cnf(20,plain,
ld(X,mult(mult(X,mult(Y,Y)),Z)) = mult(Y,mult(Y,Z)),
inference('PARAMODULATE',[status(thm)],[c02,c07,theory(equality)]) ).
cnf(29,plain,
mult(mult(X,X),ld(X,Y)) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[15,c01,theory(equality)]) ).
cnf(33,plain,
ld(X,mult(mult(X,X),Y)) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[c02,15,theory(equality)]) ).
cnf(36,plain,
mult(X,mult(mult(Y,Y),Z)) = mult(mult(X,mult(Y,Y)),Z),
inference('PARAMODULATE',[status(thm)],[c07,15,theory(equality)]) ).
cnf(48,plain,
ld(mult(X,X),mult(X,Y)) = ld(X,Y),
inference('PARAMODULATE',[status(thm)],[c02,29,theory(equality)]) ).
cnf(65,plain,
ld(X,Y) = mult(X,ld(mult(X,X),Y)),
inference('PARAMODULATE',[status(thm)],[33,c01,theory(equality)]) ).
cnf(78,plain,
ld(mult(X,X),Y) = ld(X,ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[48,c01,theory(equality)]) ).
cnf(84,plain,
rd(ld(X,Y),ld(mult(X,X),Y)) = X,
inference('PARAMODULATE',[status(thm)],[c04,65,theory(equality)]) ).
cnf(102,plain,
rd(mult(X,mult(Y,Z)),ld(Y,Z)) = mult(X,mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[c04,17,theory(equality)]) ).
cnf(136,plain,
ld(rd(X,mult(Y,Y)),mult(X,Z)) = mult(Y,mult(Y,Z)),
inference('PARAMODULATE',[status(thm)],[20,c03,theory(equality)]) ).
cnf(153,plain,
mult(rd(X,mult(Y,Y)),mult(mult(Y,Y),Z)) = mult(X,Z),
inference('PARAMODULATE',[status(thm)],[36,c03,theory(equality)]) ).
cnf(337,plain,
rd(mult(X,Y),ld(Y,unit)) = mult(X,mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[102,c05,theory(equality)]) ).
cnf(339,plain,
rd(X,ld(Y,Z)) = mult(rd(X,mult(Y,Z)),mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[102,c03,theory(equality)]) ).
cnf(360,plain,
rd(X,ld(Y,unit)) = mult(rd(X,Y),mult(Y,Y)),
inference('PARAMODULATE',[status(thm)],[337,c03,theory(equality)]) ).
cnf(361,plain,
mult(rd(unit,X),mult(X,X)) = X,
inference('PARAMODULATE',[status(thm)],[14,360,theory(equality)]) ).
cnf(365,plain,
mult(ld(X,unit),mult(X,X)) = X,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[84,360,theory(equality)]),153,theory(equality)]) ).
cnf(368,plain,
rd(X,ld(Y,ld(Y,unit))) = mult(X,mult(Y,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[360,78,theory(equality)]),153,theory(equality)]) ).
cnf(370,plain,
rd(X,mult(X,X)) = rd(unit,X),
inference('PARAMODULATE',[status(thm)],[c04,361,theory(equality)]) ).
cnf(371,plain,
ld(rd(unit,X),X) = mult(X,X),
inference('PARAMODULATE',[status(thm)],[c02,361,theory(equality)]) ).
cnf(372,plain,
mult(rd(unit,X),mult(X,Y)) = Y,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[17,361,theory(equality)]),c01,theory(equality)]) ).
cnf(373,plain,
rd(unit,X) = ld(X,unit),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c04,365,theory(equality)]),370,theory(equality)]) ).
cnf(378,plain,
ld(ld(X,unit),X) = mult(X,X),
inference('REWRITE',[status(thm)],[371,373,theory(equality)]) ).
cnf(404,plain,
mult(ld(ld(X,unit),X),Y) = mult(X,mult(X,Y)),
inference('REWRITE',[status(thm)],[15,378,theory(equality)]) ).
cnf(406,plain,
mult(ld(ld(X,unit),X),ld(X,Y)) = mult(X,Y),
inference('REWRITE',[status(thm)],[29,378,theory(equality)]) ).
cnf(428,plain,
ld(ld(ld(X,unit),X),Y) = ld(X,ld(X,Y)),
inference('REWRITE',[status(thm)],[78,378,theory(equality)]) ).
cnf(511,plain,
mult(X,mult(ld(ld(Y,unit),Y),Z)) = mult(mult(X,ld(ld(Y,unit),Y)),Z),
inference('REWRITE',[status(thm)],[c07,404,378,theory(equality)]) ).
cnf(547,plain,
ld(rd(X,ld(ld(Y,unit),Y)),mult(X,Z)) = mult(ld(ld(Y,unit),Y),Z),
inference('REWRITE',[status(thm)],[136,404,378,theory(equality)]) ).
cnf(583,plain,
rd(X,ld(Y,Z)) = mult(rd(X,mult(Y,Z)),ld(ld(Y,unit),Y)),
inference('REWRITE',[status(thm)],[339,378,theory(equality)]) ).
cnf(597,plain,
rd(X,ld(Y,ld(Y,unit))) = mult(X,ld(ld(Y,unit),Y)),
inference('REWRITE',[status(thm)],[368,378,theory(equality)]) ).
cnf(600,plain,
mult(ld(ld(a,unit),a),mult(b,c)) != mult(mult(ld(ld(a,unit),a),b),c),
inference('REWRITE',[status(thm)],[16,378,theory(equality)]) ).
cnf(601,plain,
mult(ld(X,unit),mult(X,Y)) = Y,
inference('REWRITE',[status(thm)],[372,373,theory(equality)]) ).
cnf(604,plain,
ld(ld(X,unit),unit) = X,
inference('PARAMODULATE',[status(thm)],[12,373,theory(equality)]) ).
cnf(613,plain,
ld(ld(X,unit),Y) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[c02,601,theory(equality)]) ).
cnf(618,plain,
rd(X,ld(Y,ld(Y,unit))) = ld(ld(X,unit),ld(ld(Y,unit),Y)),
inference('REWRITE',[status(thm)],[597,613,theory(equality)]) ).
cnf(623,plain,
ld(ld(X,unit),ld(X,Y)) = Y,
inference('REWRITE',[status(thm)],[c01,613,theory(equality)]) ).
cnf(661,plain,
rd(X,ld(Y,Z)) = ld(ld(rd(X,ld(ld(Y,unit),Z)),unit),ld(ld(Y,unit),Y)),
inference('REWRITE',[status(thm)],[583,613,theory(equality)]) ).
cnf(666,plain,
ld(ld(X,unit),ld(ld(Y,ld(Y,unit)),Z)) = ld(ld(ld(ld(X,unit),ld(ld(Y,unit),Y)),unit),Z),
inference('REWRITE',[status(thm)],[511,428,613,theory(equality)]) ).
cnf(682,plain,
ld(rd(X,ld(ld(Y,unit),Y)),ld(ld(X,unit),Z)) = ld(ld(Y,ld(Y,unit)),Z),
inference('REWRITE',[status(thm)],[547,428,613,theory(equality)]) ).
cnf(780,plain,
ld(ld(rd(X,Y),unit),Y) = X,
inference('REWRITE',[status(thm)],[c03,613,theory(equality)]) ).
cnf(781,plain,
ld(X,ld(ld(X,unit),Y)) = Y,
inference('REWRITE',[status(thm)],[c02,613,theory(equality)]) ).
cnf(789,plain,
ld(ld(X,ld(X,unit)),Y) = ld(ld(X,unit),ld(ld(X,unit),Y)),
inference('REWRITE',[status(thm)],[404,428,613,theory(equality)]) ).
cnf(792,plain,
ld(ld(X,ld(X,unit)),ld(X,Y)) = ld(ld(X,unit),Y),
inference('REWRITE',[status(thm)],[406,428,613,theory(equality)]) ).
cnf(811,plain,
ld(ld(a,ld(a,unit)),ld(ld(b,unit),c)) != ld(ld(ld(ld(a,ld(a,unit)),b),unit),c),
inference('REWRITE',[status(thm)],[600,428,613,theory(equality)]) ).
cnf(814,plain,
rd(X,Y) = ld(rd(Y,X),unit),
inference('PARAMODULATE',[status(thm)],[14,780,theory(equality)]) ).
cnf(815,plain,
rd(X,ld(Y,Z)) = ld(rd(ld(ld(Y,unit),Z),X),ld(ld(Y,unit),Y)),
inference('REWRITE',[status(thm)],[661,814,theory(equality)]) ).
cnf(827,plain,
ld(X,ld(ld(Y,ld(Y,unit)),Z)) = ld(ld(ld(X,ld(ld(Y,unit),Y)),unit),Z),
inference('PARAMODULATE',[status(thm)],[666,12,theory(equality)]) ).
cnf(920,plain,
rd(X,ld(ld(Y,unit),Y)) = ld(ld(X,unit),ld(Y,ld(Y,unit))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[618,12,theory(equality)]),373,theory(equality)]) ).
cnf(922,plain,
ld(ld(ld(X,unit),ld(Y,ld(Y,unit))),ld(ld(X,unit),Z)) = ld(ld(Y,ld(Y,unit)),Z),
inference('REWRITE',[status(thm)],[682,920,theory(equality)]) ).
cnf(1050,plain,
rd(X,ld(Y,ld(Y,Z))) = ld(rd(Z,X),ld(ld(Y,unit),Y)),
inference('PARAMODULATE',[status(thm)],[815,623,theory(equality)]) ).
cnf(1093,plain,
ld(X,ld(ld(Y,unit),Y)) = ld(ld(Y,ld(Y,X)),unit),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[373,1050,theory(equality)]),11,theory(equality)]) ).
cnf(1142,plain,
ld(ld(X,ld(ld(Y,unit),Y)),unit) = ld(Y,ld(Y,X)),
inference('PARAMODULATE',[status(thm)],[604,1093,theory(equality)]) ).
cnf(1153,plain,
ld(X,ld(ld(Y,ld(Y,unit)),Z)) = ld(ld(Y,ld(Y,X)),Z),
inference('REWRITE',[status(thm)],[827,1142,theory(equality)]) ).
cnf(1216,plain,
ld(X,ld(Y,ld(Y,unit))) = ld(ld(ld(Y,ld(Y,unit)),X),unit),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1093,789,theory(equality)]),604,theory(equality)]) ).
cnf(1222,plain,
ld(ld(a,ld(a,unit)),ld(ld(b,unit),c)) != ld(ld(b,ld(a,ld(a,unit))),c),
inference('REWRITE',[status(thm)],[811,1216,theory(equality)]) ).
cnf(1339,plain,
ld(X,ld(ld(Y,unit),Z)) = ld(ld(Y,ld(Y,X)),ld(Y,Z)),
inference('PARAMODULATE',[status(thm)],[1153,792,theory(equality)]) ).
cnf(1446,plain,
ld(ld(ld(X,unit),Y),ld(ld(X,unit),Z)) = ld(ld(X,Y),ld(X,Z)),
inference('PARAMODULATE',[status(thm)],[1339,781,theory(equality)]) ).
cnf(1447,plain,
ld(ld(X,ld(Y,ld(Y,unit))),ld(X,Z)) = ld(ld(Y,ld(Y,unit)),Z),
inference('REWRITE',[status(thm)],[922,1446,theory(equality)]) ).
cnf(1627,plain,
ld(ld(X,ld(Y,ld(Y,unit))),Z) = ld(ld(Y,ld(Y,unit)),ld(ld(X,unit),Z)),
inference('PARAMODULATE',[status(thm)],[1447,781,theory(equality)]) ).
cnf(1628,plain,
$false,
inference('REWRITE',[status(thm)],[1222,1627,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP686-1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14 % Command : run-snark %s %d
% 0.15/0.35 % Computer : n022.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.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 18:42:18 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.48 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.49 *
% 0.22/0.49 *
% 0.22/0.50 #<PACKAGE "SNARK-USER">
% 0.22/0.50 *
% 0.22/0.50 SNARK-TPTP-OPTIONS
% 0.22/0.50 *
% 0.22/0.50 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.22/0.50 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.22/0.50 (USE-FACTORING :POS)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.22/0.50 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.22/0.50 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.22/0.50 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.22/0.50 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.22/0.50 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.22/0.50 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.22/0.50 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.22/0.50 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.22/0.50 (DECLARE-TPTP-SYMBOLS2))
% 0.22/0.50 *
% 0.22/0.50 "."
% 0.22/0.50 *
% 0.22/0.50 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T18:42:18
% 0.22/0.50 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-06-13T18:42:18
% 0.22/0.51
% 0.22/0.51 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 1.64/1.80 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 1.64/1.80
% 1.64/1.80 #||
% 1.64/1.80 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.64/1.80 % SZS output start Refutation
% See solution above
% 1.64/1.81 ||#
% 1.64/1.81
% 1.64/1.81 ; Summary of computation:
% 1.64/1.81 ; 4875 formulas have been input or derived (from 103 formulas).
% 1.64/1.81 ; 1628 (33%) were retained. Of these,
% 1.64/1.81 ; 1185 (73%) were simplified or subsumed later,
% 1.64/1.81 ; 443 (27%) are still being kept.
% 1.64/1.81 ;
% 1.64/1.81 ; Run time in seconds excluding printing time:
% 1.64/1.81 ; 0.001 0% Read assertion file (1 call)
% 1.64/1.81 ; 0.001 0% Assert (8 calls)
% 1.64/1.81 ; 0.227 18% Process new row (4,716 calls)
% 1.64/1.81 ; 0.006 0% Resolution (204 calls)
% 1.64/1.81 ; 0.069 5% Paramodulation (102 calls)
% 1.64/1.81 ; 0.332 26% Forward simplification (4,395 calls)
% 1.64/1.81 ; 0.148 11% Backward simplification (1,628 calls)
% 1.64/1.81 ; 0.475 37% Ordering (56,073 calls)
% 1.64/1.81 ; 0.000 0% Sortal reasoning (32 calls)
% 1.64/1.81 ; 0.000 0% Purity testing (1 call)
% 1.64/1.81 ; 0.037 3% Other
% 1.64/1.81 ; 1.296 Total
% 1.64/1.81 ; 1.311 Real time
% 1.64/1.81 ;
% 1.64/1.81 ; Term-hash-array has 4,765 terms in all.
% 1.64/1.81 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.64/1.81 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.64/1.81 ; Path-index has 1,662 entries (1,682 at peak, 5,161 added, 3,499 deleted).
% 1.64/1.81 ; Path-index has 8,262 nodes (8,287 at peak, 13,101 added, 4,839 deleted).
% 1.64/1.81 ; Trie-index has 1,662 entries (1,682 at peak, 5,161 added, 3,499 deleted).
% 1.64/1.81 ; Trie-index has 13,600 nodes (13,766 at peak, 49,641 added, 36,041 deleted).
% 1.64/1.81 ; Retrieved 126,651 generalization terms in 62,709 calls.
% 1.64/1.81 ; Retrieved 14,147 instance terms in 2,463 calls.
% 1.64/1.81 ; Retrieved 15,493 unifiable terms in 754 calls.
% 1.64/1.81 ;
% 1.64/1.81 ; The agenda of backward simplifiable rows to process has 1 entry:
% 1.64/1.81 ; 1 with value 0
% 1.64/1.81 ; The agenda of rows to process has 71 entries:
% 1.64/1.81 ; 1 with value 30 7 with value 38 3 with value 49
% 1.64/1.81 ; 3 with value 31 2 with value 39 4 with value 50
% 1.64/1.81 ; 5 with value 32 4 with value 40 3 with value 51
% 1.64/1.81 ; 2 with value 34 2 with value 41 4 with value 52
% 1.64/1.81 ; 5 with value 35 5 with value 42 2 with value 53
% 1.64/1.81 ; 6 with value 36 2 with value 43 2 with value 54
% 1.64/1.81 ; 6 with value 37 3 with value 44
% 1.64/1.81 ; The agenda of rows to give has 409 entries:
% 1.64/1.81 ; 2 with value (4 26) 22 with value (4 42) 3 with value (4 58)
% 1.64/1.81 ; 16 with value (4 27) 10 with value (4 43) 2 with value (4 59)
% 1.64/1.81 ; 19 with value (4 28) 19 with value (4 44) 1 with value (4 60)
% 1.64/1.81 ; 18 with value (4 29) 34 with value (4 45) 2 with value (4 61)
% 1.64/1.81 ; 4 with value (4 30) 28 with value (4 46) 4 with value (4 62)
% 1.64/1.81 ; 11 with value (4 31) 29 with value (4 47) 6 with value (4 63)
% 1.64/1.81 ; 6 with value (4 32) 11 with value (4 48) 4 with value (4 64)
% 1.64/1.81 ; 8 with value (4 33) 8 with value (4 49) 1 with value (4 65)
% 1.64/1.81 ; 8 with value (4 34) 6 with value (4 50) 2 with value (4 66)
% 1.64/1.81 ; 14 with value (4 35) 8 with value (4 51) 1 with value (4 67)
% 1.64/1.81 ; 10 with value (4 36) 4 with value (4 52) 2 with value (4 69)
% 1.64/1.81 ; 13 with value (4 37) 1 with value (4 53) 1 with value (4 72)
% 1.64/1.81 ; 15 with value (4 38) 2 with value (4 54) 1 with value (4 85)
% 1.64/1.81 ; 7 with value (4 39) 5 with value (4 56) 1 with value (4 95)
% 1.64/1.81 ; 23 with value (4 40) 4 with value (4 57) 1 with value (4 144)
% 1.64/1.81 ; 12 with value (4 41)
% 1.64/1.81 Evaluation took:
% 1.64/1.81 1.312 seconds of real time
% 1.64/1.81 1.217968 seconds of user run time
% 1.64/1.81 0.093805 seconds of system run time
% 1.64/1.81 [Run times include 0.074 seconds GC run time.]
% 1.64/1.81 0 calls to %EVAL
% 1.64/1.81 0 page faults and
% 1.64/1.81 94,622,480 bytes consed.
% 1.64/1.81 :PROOF-FOUND
% 1.64/1.81 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T18:42:19
% 1.64/1.81 :PROOF-FOUND
% 1.64/1.81 *
%------------------------------------------------------------------------------