TSTP Solution File: GRP708-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP708-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n010.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:27 EDT 2022
% Result : Unsatisfiable 3.49s 3.70s
% Output : Refutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 69 ( 69 unt; 0 nHn; 4 RR)
% Number of literals : 69 ( 68 equ; 3 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 : 119 ( 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(X,Z))) = mult(mult(X,mult(Y,X)),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c07) ).
cnf(c08,axiom,
mult(op_c,X) = mult(X,op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c08) ).
cnf(c09,axiom,
mult(mult(op_c,op_c),mult(X,Y)) = mult(mult(mult(op_c,op_c),X),Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c09) ).
cnf(goals,negated_conjecture,
mult(a,mult(b,op_c)) != mult(mult(a,b),op_c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(12,plain,
X = mult(ld(op_c,X),op_c),
inference('PARAMODULATE',[status(thm)],[c08,c01,theory(equality)]) ).
cnf(13,plain,
ld(X,X) = unit,
inference('PARAMODULATE',[status(thm)],[c02,c05,theory(equality)]) ).
cnf(17,plain,
ld(rd(X,Y),X) = Y,
inference('PARAMODULATE',[status(thm)],[c02,c03,theory(equality)]) ).
cnf(23,plain,
mult(a,mult(op_c,b)) != mult(mult(a,b),op_c),
inference('PARAMODULATE',[status(thm)],[goals,c08,theory(equality)]) ).
cnf(25,plain,
mult(X,mult(X,Y)) = mult(mult(X,X),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c07,c06,theory(equality)]),c06,theory(equality)]) ).
cnf(26,plain,
mult(mult(op_c,mult(X,op_c)),Y) = mult(mult(X,mult(op_c,Y)),op_c),
inference('PARAMODULATE',[status(thm)],[c08,c07,theory(equality)]) ).
cnf(28,plain,
mult(X,mult(Y,mult(op_c,X))) = mult(mult(X,mult(Y,X)),op_c),
inference('PARAMODULATE',[status(thm)],[c07,c08,theory(equality)]) ).
cnf(30,plain,
mult(X,mult(Y,Z)) = mult(mult(X,mult(Y,X)),ld(X,Z)),
inference('PARAMODULATE',[status(thm)],[c07,c01,theory(equality)]) ).
cnf(32,plain,
mult(op_c,mult(X,mult(op_c,Y))) = mult(mult(op_c,mult(op_c,X)),Y),
inference('PARAMODULATE',[status(thm)],[c07,c08,theory(equality)]) ).
cnf(37,plain,
ld(X,mult(mult(X,mult(Y,X)),Z)) = mult(Y,mult(X,Z)),
inference('PARAMODULATE',[status(thm)],[c02,c07,theory(equality)]) ).
cnf(49,plain,
rd(mult(mult(op_c,op_c),mult(X,Y)),Y) = mult(mult(op_c,op_c),X),
inference('PARAMODULATE',[status(thm)],[c04,c09,theory(equality)]) ).
cnf(85,plain,
mult(mult(op_c,op_c),X) = mult(mult(op_c,X),op_c),
inference('PARAMODULATE',[status(thm)],[c08,25,theory(equality)]) ).
cnf(88,plain,
mult(op_c,mult(X,op_c)) = mult(mult(op_c,op_c),X),
inference('PARAMODULATE',[status(thm)],[25,c08,theory(equality)]) ).
cnf(89,plain,
mult(X,Y) = mult(mult(X,X),ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[25,c01,theory(equality)]) ).
cnf(91,plain,
ld(X,mult(mult(X,X),Y)) = mult(X,Y),
inference('PARAMODULATE',[status(thm)],[c02,25,theory(equality)]) ).
cnf(102,plain,
mult(mult(op_c,op_c),mult(X,Y)) = mult(mult(op_c,mult(op_c,X)),Y),
inference('PARAMODULATE',[status(thm)],[c09,25,theory(equality)]) ).
cnf(174,plain,
mult(op_c,mult(X,op_c)) = mult(mult(op_c,X),op_c),
inference('PARAMODULATE',[status(thm)],[85,88,theory(equality)]) ).
cnf(177,plain,
rd(mult(mult(op_c,op_c),X),mult(X,op_c)) = op_c,
inference('PARAMODULATE',[status(thm)],[c04,88,theory(equality)]) ).
cnf(194,plain,
ld(mult(X,X),mult(X,Y)) = ld(X,Y),
inference('PARAMODULATE',[status(thm)],[c02,89,theory(equality)]) ).
cnf(224,plain,
ld(op_c,mult(mult(mult(op_c,op_c),X),Y)) = mult(op_c,mult(X,Y)),
inference('PARAMODULATE',[status(thm)],[91,c09,theory(equality)]) ).
cnf(331,plain,
mult(op_c,mult(X,mult(op_c,Y))) = mult(mult(mult(op_c,X),op_c),Y),
inference('PARAMODULATE',[status(thm)],[c07,174,theory(equality)]) ).
cnf(388,plain,
ld(mult(X,X),Y) = ld(X,ld(X,Y)),
inference('PARAMODULATE',[status(thm)],[194,c01,theory(equality)]) ).
cnf(588,plain,
mult(mult(op_c,X),Y) = mult(mult(ld(op_c,X),mult(op_c,Y)),op_c),
inference('PARAMODULATE',[status(thm)],[26,12,theory(equality)]) ).
cnf(595,plain,
mult(mult(mult(op_c,X),op_c),Y) = mult(mult(X,mult(op_c,Y)),op_c),
inference('PARAMODULATE',[status(thm)],[26,174,theory(equality)]) ).
cnf(756,plain,
mult(X,mult(Y,op_c)) = mult(X,mult(op_c,Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c02,28,theory(equality)]),37,theory(equality)]) ).
cnf(842,plain,
mult(rd(X,mult(Y,op_c)),mult(op_c,Y)) = X,
inference('PARAMODULATE',[status(thm)],[c03,756,theory(equality)]) ).
cnf(857,plain,
ld(X,mult(op_c,Y)) = ld(X,mult(Y,op_c)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[194,756,theory(equality)]),194,theory(equality)]) ).
cnf(966,plain,
mult(op_c,X) = mult(mult(mult(op_c,op_c),rd(X,mult(Y,op_c))),Y),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c07,842,theory(equality)]),88,theory(equality)]) ).
cnf(1236,plain,
mult(op_c,mult(X,Y)) = mult(mult(op_c,mult(op_c,X)),ld(op_c,Y)),
inference('PARAMODULATE',[status(thm)],[30,c08,theory(equality)]) ).
cnf(1547,plain,
ld(op_c,mult(mult(op_c,mult(op_c,X)),Y)) = mult(X,mult(op_c,Y)),
inference('PARAMODULATE',[status(thm)],[c02,32,theory(equality)]) ).
cnf(2185,plain,
rd(mult(mult(op_c,op_c),X),Y) = mult(mult(op_c,op_c),rd(X,Y)),
inference('PARAMODULATE',[status(thm)],[49,c03,theory(equality)]) ).
cnf(2215,plain,
mult(mult(op_c,op_c),rd(X,mult(X,op_c))) = op_c,
inference('REWRITE',[status(thm)],[177,2185,theory(equality)]) ).
cnf(2217,plain,
ld(op_c,unit) = rd(X,mult(X,op_c)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[c02,2215,theory(equality)]),13,388,theory(equality)]) ).
cnf(2220,plain,
ld(ld(op_c,unit),X) = mult(X,op_c),
inference('PARAMODULATE',[status(thm)],[17,2217,theory(equality)]) ).
cnf(2321,plain,
mult(mult(op_c,X),Y) = ld(ld(op_c,unit),mult(ld(op_c,X),mult(op_c,Y))),
inference('REWRITE',[status(thm)],[588,2220,theory(equality)]) ).
cnf(2362,plain,
mult(op_c,mult(X,mult(op_c,Y))) = mult(ld(ld(op_c,unit),mult(op_c,X)),Y),
inference('REWRITE',[status(thm)],[331,2220,theory(equality)]) ).
cnf(2367,plain,
mult(ld(ld(op_c,unit),mult(op_c,X)),Y) = mult(mult(op_c,mult(op_c,X)),Y),
inference('REWRITE',[status(thm)],[32,2362,theory(equality)]) ).
cnf(2382,plain,
mult(op_c,mult(X,Y)) = mult(ld(ld(op_c,unit),mult(op_c,X)),ld(op_c,Y)),
inference('REWRITE',[status(thm)],[1236,2367,theory(equality)]) ).
cnf(2399,plain,
ld(op_c,mult(ld(ld(op_c,unit),mult(op_c,X)),Y)) = mult(X,mult(op_c,Y)),
inference('REWRITE',[status(thm)],[1547,2367,theory(equality)]) ).
cnf(2441,plain,
mult(X,ld(ld(op_c,unit),Y)) = mult(X,mult(op_c,Y)),
inference('REWRITE',[status(thm)],[756,2220,theory(equality)]) ).
cnf(2443,plain,
mult(mult(op_c,X),Y) = ld(ld(op_c,unit),mult(ld(op_c,X),ld(ld(op_c,unit),Y))),
inference('REWRITE',[status(thm)],[2321,2441,theory(equality)]) ).
cnf(2481,plain,
ld(op_c,mult(ld(ld(op_c,unit),mult(op_c,X)),Y)) = mult(X,ld(ld(op_c,unit),Y)),
inference('REWRITE',[status(thm)],[2399,2441,theory(equality)]) ).
cnf(2497,plain,
ld(X,mult(op_c,Y)) = ld(X,ld(ld(op_c,unit),Y)),
inference('REWRITE',[status(thm)],[857,2220,theory(equality)]) ).
cnf(2511,plain,
mult(op_c,mult(X,Y)) = mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),ld(op_c,Y)),
inference('REWRITE',[status(thm)],[2382,2497,theory(equality)]) ).
cnf(2534,plain,
ld(op_c,mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),Y)) = mult(X,ld(ld(op_c,unit),Y)),
inference('REWRITE',[status(thm)],[2481,2497,theory(equality)]) ).
cnf(2614,plain,
mult(ld(ld(op_c,unit),mult(ld(op_c,X),ld(ld(op_c,unit),op_c))),Y) = ld(ld(op_c,unit),mult(X,ld(ld(op_c,unit),Y))),
inference('REWRITE',[status(thm)],[595,2441,2443,2220,theory(equality)]) ).
cnf(2631,plain,
mult(a,ld(ld(op_c,unit),b)) != ld(ld(op_c,unit),mult(a,b)),
inference('REWRITE',[status(thm)],[23,2441,2220,theory(equality)]) ).
cnf(2632,plain,
mult(ld(ld(op_c,unit),op_c),mult(X,Y)) = mult(mult(ld(ld(op_c,unit),op_c),X),Y),
inference('REWRITE',[status(thm)],[c09,2220,theory(equality)]) ).
cnf(2651,plain,
mult(ld(ld(op_c,unit),op_c),X) = ld(ld(op_c,unit),mult(ld(op_c,X),ld(ld(op_c,unit),op_c))),
inference('REWRITE',[status(thm)],[85,2443,2220,theory(equality)]) ).
cnf(2652,plain,
mult(mult(ld(ld(op_c,unit),op_c),X),Y) = ld(ld(op_c,unit),mult(X,ld(ld(op_c,unit),Y))),
inference('REWRITE',[status(thm)],[2614,2651,theory(equality)]) ).
cnf(2668,plain,
mult(ld(ld(op_c,unit),op_c),mult(X,Y)) = mult(mult(ld(ld(op_c,unit),ld(ld(op_c,unit),op_c)),ld(op_c,X)),Y),
inference('REWRITE',[status(thm)],[102,2511,2220,theory(equality)]) ).
cnf(2684,plain,
ld(op_c,mult(mult(ld(ld(op_c,unit),op_c),X),Y)) = mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),ld(op_c,Y)),
inference('REWRITE',[status(thm)],[224,2511,2220,theory(equality)]) ).
cnf(2766,plain,
mult(op_c,X) = ld(ld(op_c,unit),X),
inference('REWRITE',[status(thm)],[966,c03,2652,2220,theory(equality)]) ).
cnf(2767,plain,
ld(ld(op_c,unit),mult(X,Y)) = mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),ld(op_c,Y)),
inference('REWRITE',[status(thm)],[2511,2766,theory(equality)]) ).
cnf(2782,plain,
mult(ld(ld(op_c,unit),op_c),mult(X,Y)) = mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),Y),
inference('REWRITE',[status(thm)],[2668,2766,2767,theory(equality)]) ).
cnf(2794,plain,
mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),Y) = mult(mult(ld(ld(op_c,unit),op_c),X),Y),
inference('REWRITE',[status(thm)],[2632,2782,theory(equality)]) ).
cnf(2846,plain,
ld(op_c,mult(ld(ld(op_c,unit),ld(ld(op_c,unit),X)),Y)) = ld(ld(op_c,unit),mult(X,Y)),
inference('REWRITE',[status(thm)],[2684,2794,2767,theory(equality)]) ).
cnf(2862,plain,
ld(ld(op_c,unit),mult(X,Y)) = mult(X,ld(ld(op_c,unit),Y)),
inference('REWRITE',[status(thm)],[2534,2846,theory(equality)]) ).
cnf(2946,plain,
$false,
inference('REWRITE',[status(thm)],[2631,2862,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP708-1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n010.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 : Mon Jun 13 12:17:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T12:17:55
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n010.cluster.edu at 2022-06-13T12:17:55
% 0.21/0.49
% 0.21/0.49 ; Recognized right identity assertion (= (|mult| ?X |unit|) ?X).
% 3.49/3.70 ; Recognized left identity assertion (= (|mult| |unit| ?X) ?X).
% 3.49/3.70
% 3.49/3.70 #||
% 3.49/3.70 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.49/3.70 % SZS output start Refutation
% See solution above
% 3.56/3.73 ||#
% 3.56/3.73
% 3.56/3.73 ; Summary of computation:
% 3.56/3.73 ; 9483 formulas have been input or derived (from 109 formulas).
% 3.56/3.73 ; 2946 (31%) were retained. Of these,
% 3.56/3.73 ; 2701 (92%) were simplified or subsumed later,
% 3.56/3.73 ; 245 ( 8%) are still being kept.
% 3.56/3.73 ;
% 3.56/3.73 ; Run time in seconds excluding printing time:
% 3.56/3.73 ; 0.002 0% Read assertion file (1 call)
% 3.56/3.73 ; 0.001 0% Assert (10 calls)
% 3.56/3.73 ; 0.370 12% Process new row (7,938 calls)
% 3.56/3.73 ; 0.005 0% Resolution (216 calls)
% 3.56/3.73 ; 0.094 3% Paramodulation (108 calls)
% 3.56/3.73 ; 0.848 26% Forward simplification (7,770 calls)
% 3.56/3.73 ; 0.352 11% Backward simplification (2,946 calls)
% 3.56/3.73 ; 1.495 46% Ordering (293,901 calls)
% 3.56/3.73 ; 0.000 0% Sortal reasoning (32 calls)
% 3.56/3.73 ; 0.000 0% Purity testing (1 call)
% 3.56/3.73 ; 0.050 2% Other
% 3.56/3.73 ; 3.217 Total
% 3.56/3.73 ; 3.249 Real time
% 3.56/3.73 ;
% 3.56/3.73 ; Term-hash-array has 7,190 terms in all.
% 3.56/3.73 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 3.56/3.73 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 3.56/3.73 ; Path-index has 816 entries (4,765 at peak, 7,757 added, 6,941 deleted).
% 3.56/3.73 ; Path-index has 6,238 nodes (6,362 at peak, 10,272 added, 4,034 deleted).
% 3.56/3.73 ; Trie-index has 816 entries (4,765 at peak, 7,757 added, 6,941 deleted).
% 3.56/3.73 ; Trie-index has 6,029 nodes (31,680 at peak, 58,251 added, 52,222 deleted).
% 3.56/3.73 ; Retrieved 336,491 generalization terms in 76,968 calls.
% 3.56/3.73 ; Retrieved 36,188 instance terms in 5,255 calls.
% 3.56/3.73 ; Retrieved 20,062 unifiable terms in 802 calls.
% 3.56/3.73 ;
% 3.56/3.73 ; The agenda of backward simplifiable rows to process has 1288 entries:
% 3.56/3.73 ; 1288 with value 0
% 3.56/3.73 ; The agenda of rows to process has 24 entries:
% 3.56/3.73 ; 4 with value 17 1 with value 26 9 with value 27
% 3.56/3.73 ; 10 with value 22
% 3.56/3.73 ; The agenda of rows to give has 216 entries:
% 3.56/3.73 ; 1 with value (4 13) 7 with value (4 29) 5 with value (4 43)
% 3.56/3.73 ; 1 with value (4 14) 14 with value (4 30) 8 with value (4 44)
% 3.56/3.73 ; 1 with value (4 16) 6 with value (4 31) 2 with value (4 45)
% 3.56/3.73 ; 1 with value (4 17) 6 with value (4 32) 2 with value (4 46)
% 3.56/3.73 ; 2 with value (4 20) 5 with value (4 33) 6 with value (4 47)
% 3.56/3.73 ; 15 with value (4 21) 13 with value (4 34) 3 with value (4 48)
% 3.56/3.73 ; 7 with value (4 22) 5 with value (4 35) 2 with value (4 49)
% 3.56/3.73 ; 6 with value (4 23) 11 with value (4 36) 2 with value (4 50)
% 3.56/3.73 ; 5 with value (4 24) 1 with value (4 37) 1 with value (4 51)
% 3.56/3.73 ; 5 with value (4 25) 5 with value (4 38) 1 with value (4 53)
% 3.56/3.73 ; 12 with value (4 26) 13 with value (4 39) 1 with value (4 54)
% 3.56/3.73 ; 16 with value (4 27) 2 with value (4 41) 1 with value (4 58)
% 3.56/3.73 ; 16 with value (4 28) 5 with value (4 42) 1 with value (4 60)
% 3.56/3.73 Evaluation took:
% 3.56/3.73 3.25 seconds of real time
% 3.56/3.73 2.884033 seconds of user run time
% 3.56/3.73 0.365807 seconds of system run time
% 3.56/3.73 [Run times include 0.225 seconds GC run time.]
% 3.56/3.73 0 calls to %EVAL
% 3.56/3.73 0 page faults and
% 3.56/3.73 215,026,712 bytes consed.
% 3.56/3.73 :PROOF-FOUND
% 3.56/3.73 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T12:17:58
% 3.56/3.73 :PROOF-FOUND
% 3.56/3.73 *
%------------------------------------------------------------------------------