TSTP Solution File: KLE142+1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : KLE142+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n018.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 : Sun Jul 17 02:26:49 EDT 2022
% Result : Theorem 51.53s 51.74s
% Output : Refutation 51.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 16
% Syntax : Number of clauses : 75 ( 70 unt; 0 nHn; 7 RR)
% Number of literals : 80 ( 61 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 120 ( 26 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
addition(X,zero) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
cnf(2,axiom,
addition(X,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).
cnf(3,plain,
addition(X,addition(X,Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[2]) ).
cnf(4,axiom,
multiplication(X,multiplication(Y,Z)) = multiplication(multiplication(X,Y),Z),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
cnf(5,axiom,
multiplication(X,one) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
cnf(6,axiom,
multiplication(one,X) = X,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
cnf(7,axiom,
multiplication(X,addition(Y,Z)) = addition(multiplication(X,Y),multiplication(X,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity1) ).
cnf(8,axiom,
multiplication(addition(X,Y),Z) = addition(multiplication(X,Z),multiplication(Y,Z)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
cnf(9,axiom,
multiplication(zero,X) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
cnf(10,axiom,
addition(one,multiplication(X,star(X))) = star(X),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
cnf(11,plain,
addition(one,addition(multiplication(X,star(X)),Y)) = addition(star(X),Y),
inference('EMBED',[status(thm)],[10]) ).
cnf(12,axiom,
addition(one,multiplication(star(X),X)) = star(X),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
cnf(13,plain,
addition(one,addition(multiplication(star(X),X),Y)) = addition(star(X),Y),
inference('EMBED',[status(thm)],[12]) ).
cnf(16,axiom,
strong_iteration(X) = addition(multiplication(X,strong_iteration(X)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
cnf(17,plain,
addition(multiplication(X,strong_iteration(X)),addition(one,Y)) = addition(strong_iteration(X),Y),
inference('EMBED',[status(thm)],[16]) ).
cnf(18,axiom,
( ~ leq(X,addition(multiplication(Y,X),Z))
| leq(X,multiplication(strong_iteration(Y),Z)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
cnf(19,axiom,
strong_iteration(X) = addition(star(X),multiplication(strong_iteration(X),zero)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',isolation) ).
cnf(20,plain,
addition(star(X),addition(multiplication(strong_iteration(X),zero),Y)) = addition(strong_iteration(X),Y),
inference('EMBED',[status(thm)],[19]) ).
cnf(21,axiom,
( ~ leq(X,Y)
| addition(X,Y) = Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
cnf(22,axiom,
( leq(X,Y)
| addition(X,Y) != Y ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
cnf(23,negated_conjecture,
strong_iteration(strong_iteration('SKOLEMAAAV1')) != strong_iteration(one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(26,plain,
leq(X,addition(X,Y)),
inference('HYPERRESOLVE',[status(thm)],[22,3]) ).
cnf(35,plain,
addition(star(X),one) = star(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,11,theory(equality)]),10,theory(equality)]) ).
cnf(66,plain,
addition(strong_iteration(X),one) = strong_iteration(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,17,theory(equality)]),16,theory(equality)]) ).
cnf(82,plain,
multiplication(X,zero) = multiplication(multiplication(X,zero),Y),
inference('PARAMODULATE',[status(thm)],[4,9,theory(equality)]) ).
cnf(90,plain,
addition(strong_iteration(X),star(X)) = strong_iteration(X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3,20,theory(equality)]),19,theory(equality)]) ).
cnf(91,plain,
addition(strong_iteration(X),addition(star(X),Y)) = addition(strong_iteration(X),Y),
inference('EMBED',[status(thm)],[90]) ).
cnf(108,plain,
multiplication(X,Y) = addition(multiplication(X,Y),multiplication(X,zero)),
inference('PARAMODULATE',[status(thm)],[7,1,theory(equality)]) ).
cnf(109,plain,
addition(multiplication(X,Y),addition(multiplication(X,zero),Z)) = addition(multiplication(X,Y),Z),
inference('EMBED',[status(thm)],[108]) ).
cnf(179,plain,
leq(X,multiplication(strong_iteration(one),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,6,theory(equality)]),26]) ).
cnf(180,plain,
( ~ leq(X,multiplication(Y,X))
| leq(X,multiplication(strong_iteration(Y),zero)) ),
inference('PARAMODULATE',[status(thm)],[18,1,theory(equality)]) ).
cnf(181,plain,
( ~ leq(X,star(X))
| leq(X,strong_iteration(star(X))) ),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[18,12,theory(equality)]),5,theory(equality)]) ).
cnf(223,plain,
leq(X,strong_iteration(one)),
inference('PARAMODULATE',[status(thm)],[179,5,theory(equality)]) ).
cnf(227,plain,
addition(strong_iteration(one),X) = strong_iteration(one),
inference('HYPERRESOLVE',[status(thm)],[21,223]) ).
cnf(230,plain,
multiplication(star(X),Y) = addition(Y,multiplication(star(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,35,theory(equality)]),6,theory(equality)]) ).
cnf(231,plain,
addition(X,addition(multiplication(star(Y),X),Z)) = addition(multiplication(star(Y),X),Z),
inference('EMBED',[status(thm)],[230]) ).
cnf(244,plain,
multiplication(strong_iteration(X),Y) = addition(Y,multiplication(strong_iteration(X),Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[8,66,theory(equality)]),6,theory(equality)]) ).
cnf(245,plain,
addition(X,addition(multiplication(strong_iteration(Y),X),Z)) = addition(multiplication(strong_iteration(Y),X),Z),
inference('EMBED',[status(thm)],[244]) ).
cnf(276,plain,
addition(one,multiplication(X,zero)) = star(multiplication(X,zero)),
inference('PARAMODULATE',[status(thm)],[10,82,theory(equality)]) ).
cnf(278,plain,
strong_iteration(multiplication(X,zero)) = star(multiplication(X,zero)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,82,theory(equality)]),276,theory(equality)]) ).
cnf(362,plain,
X = addition(X,multiplication(X,zero)),
inference('PARAMODULATE',[status(thm)],[108,5,theory(equality)]) ).
cnf(363,plain,
addition(X,addition(multiplication(X,zero),Y)) = addition(X,Y),
inference('EMBED',[status(thm)],[362]) ).
cnf(444,plain,
star(X) = addition(star(X),multiplication(X,zero)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[11,109,theory(equality)]),10,theory(equality)]) ).
cnf(445,plain,
addition(star(X),addition(multiplication(X,zero),Y)) = addition(star(X),Y),
inference('EMBED',[status(thm)],[444]) ).
cnf(500,plain,
addition(star(strong_iteration(X)),star(X)) = addition(strong_iteration(X),star(strong_iteration(X))),
inference('PARAMODULATE',[status(thm)],[20,445,theory(equality)]) ).
cnf(1162,plain,
leq(X,multiplication(star(Y),X)),
inference('HYPERRESOLVE',[status(thm)],[22,230]) ).
cnf(1168,plain,
multiplication(star(X),strong_iteration(one)) = strong_iteration(one),
inference('PARAMODULATE',[status(thm)],[227,230,theory(equality)]) ).
cnf(1260,plain,
leq(X,multiplication(strong_iteration(star(Y)),zero)),
inference('HYPERRESOLVE',[status(thm)],[180,1162]) ).
cnf(1282,plain,
addition(X,multiplication(strong_iteration(star(Y)),zero)) = multiplication(strong_iteration(star(Y)),zero),
inference('HYPERRESOLVE',[status(thm)],[21,1260]) ).
cnf(1314,plain,
star(X) = addition(star(X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[13,231,theory(equality)]),12,theory(equality)]) ).
cnf(1315,plain,
addition(star(X),addition(X,Y)) = addition(star(X),Y),
inference('EMBED',[status(thm)],[1314]) ).
cnf(1316,plain,
addition(star(strong_iteration(X)),star(X)) = star(strong_iteration(X)),
inference('REWRITE',[status(thm)],[500,1314,theory(equality)]) ).
cnf(1317,plain,
addition(star(strong_iteration(X)),addition(star(X),Y)) = addition(star(strong_iteration(X)),Y),
inference('EMBED',[status(thm)],[1316]) ).
cnf(1455,plain,
leq(X,star(X)),
inference('HYPERRESOLVE',[status(thm)],[22,1314]) ).
cnf(1456,plain,
leq(X,strong_iteration(star(X))),
inference('REWRITE',[status(thm)],[181,1455]) ).
cnf(1534,plain,
addition(X,strong_iteration(star(X))) = strong_iteration(star(X)),
inference('HYPERRESOLVE',[status(thm)],[21,1456]) ).
cnf(1535,plain,
addition(X,addition(strong_iteration(star(X)),Y)) = addition(strong_iteration(star(X)),Y),
inference('EMBED',[status(thm)],[1534]) ).
cnf(1551,plain,
strong_iteration(X) = addition(strong_iteration(X),X),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[91,1315,theory(equality)]),90,theory(equality)]) ).
cnf(2392,plain,
multiplication(strong_iteration(star(X)),zero) = strong_iteration(star(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[363,1535,theory(equality)]),1534,1282,theory(equality)]) ).
cnf(2393,plain,
addition(X,strong_iteration(star(Y))) = strong_iteration(star(Y)),
inference('REWRITE',[status(thm)],[1282,2392,theory(equality)]) ).
cnf(2809,plain,
strong_iteration(strong_iteration(star(X))) = star(strong_iteration(star(X))),
inference('PARAMODULATE',[status(thm)],[278,2392,theory(equality)]) ).
cnf(2810,plain,
strong_iteration(star(X)) = multiplication(strong_iteration(star(X)),Y),
inference('PARAMODULATE',[status(thm)],[82,2392,theory(equality)]) ).
cnf(3187,plain,
leq(X,addition(multiplication(strong_iteration(Y),X),Z)),
inference('HYPERRESOLVE',[status(thm)],[22,245]) ).
cnf(3324,plain,
leq(X,multiplication(strong_iteration(strong_iteration(Y)),Z)),
inference('HYPERRESOLVE',[status(thm)],[18,3187]) ).
cnf(3338,plain,
leq(X,strong_iteration(strong_iteration(Y))),
inference('PARAMODULATE',[status(thm)],[3324,5,theory(equality)]) ).
cnf(3340,plain,
addition(X,multiplication(strong_iteration(strong_iteration(Y)),Z)) = multiplication(strong_iteration(strong_iteration(Y)),Z),
inference('HYPERRESOLVE',[status(thm)],[21,3324]) ).
cnf(3342,plain,
addition(X,strong_iteration(strong_iteration(Y))) = strong_iteration(strong_iteration(Y)),
inference('HYPERRESOLVE',[status(thm)],[21,3338]) ).
cnf(4592,plain,
multiplication(strong_iteration(strong_iteration(X)),zero) = strong_iteration(strong_iteration(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[20,1317,theory(equality)]),3342,3340,theory(equality)]) ).
cnf(5540,plain,
star(strong_iteration(star(X))) = strong_iteration(star(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[16,2809,theory(equality)]),2393,2810,theory(equality)]) ).
cnf(5805,plain,
strong_iteration(strong_iteration(strong_iteration(X))) = star(strong_iteration(strong_iteration(X))),
inference('PARAMODULATE',[status(thm)],[278,4592,theory(equality)]) ).
cnf(5872,plain,
strong_iteration(star(X)) = strong_iteration(one),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1168,5540,theory(equality)]),2810,theory(equality)]) ).
cnf(8945,plain,
strong_iteration(one) = star(star(strong_iteration(strong_iteration(X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5805,5805,theory(equality)]),5872,theory(equality)]) ).
cnf(8946,plain,
star(strong_iteration(strong_iteration(X))) = strong_iteration(strong_iteration(X)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1551,5805,theory(equality)]),3342,theory(equality)]) ).
cnf(8949,plain,
strong_iteration(one) = strong_iteration(strong_iteration(X)),
inference('REWRITE',[status(thm)],[8945,8946,theory(equality)]) ).
cnf(8950,plain,
$false,
inference('REWRITE',[status(thm)],[23,8949,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KLE142+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run-snark %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 15:31:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 *
% 0.19/0.45 *
% 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/sandbox/benchmark/theBenchmark.p 2022-06-16T15:31:46
% 0.19/0.46 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n018.cluster.edu at 2022-06-16T15:31:46
% 0.19/0.48
% 0.19/0.48 ; Recognized commutativity assertion (= (|addition| ?X ?Y) (|addition| ?Y ?X)).
% 0.19/0.48 ; Recognized associativity assertion (= (|addition| ?X (|addition| ?Y ?Z)) (|addition| (|addition| ?X ?Y) ?Z)).
% 0.19/0.48 ; Recognized right identity assertion (= (|addition| ?X |zero|) ?X).
% 0.19/0.48 ; Recognized associativity assertion (= (|multiplication| ?X (|multiplication| ?Y ?Z)) (|multiplication| (|multiplication| ?X ?Y) ?Z)).
% 0.19/0.48 ; Recognized right identity assertion (= (|multiplication| ?X |one|) ?X).
% 0.19/0.48 ; Recognized left identity assertion (= (|multiplication| |one| ?X) ?X).
% 0.19/0.48 ; Declaring addition to be commutative.
% 51.53/51.74 ; Declaring addition to be associative-commutative.
% 51.53/51.74
% 51.53/51.74 #||
% 51.53/51.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 51.53/51.74 % SZS output start Refutation
% See solution above
% 51.53/51.75 ||#
% 51.53/51.75
% 51.53/51.75 ; Summary of computation:
% 51.53/51.75 ; 71313 formulas have been input or derived (from 537 formulas).
% 51.53/51.75 ; 8950 (13%) were retained. Of these,
% 51.53/51.75 ; 1748 (20%) were simplified or subsumed later,
% 51.53/51.75 ; 7202 (80%) are still being kept.
% 51.53/51.75 ;
% 51.53/51.75 ; Run time in seconds excluding printing time:
% 51.53/51.75 ; 0.004 0% Read assertion file (1 call)
% 51.53/51.75 ; 0.001 0% Assert (19 calls)
% 51.53/51.75 ; 1.209 2% Process new row (69,296 calls)
% 51.53/51.75 ; 0.211 0% Resolution (1,072 calls)
% 51.53/51.75 ; 0.941 2% Paramodulation (536 calls)
% 51.53/51.75 ; 0.003 0% Embedding (422 calls)
% 51.53/51.75 ; 0.084 0% Condensing (3,159 calls)
% 51.53/51.75 ; 0.292 1% Forward subsumption (3,159 calls)
% 51.53/51.75 ; 0.070 0% Backward subsumption (1,446 calls)
% 51.53/51.75 ; 0.149 0% Clause clause subsumption (16,924 calls)
% 51.53/51.75 ; 46.903 91% Forward simplification (67,859 calls)
% 51.53/51.75 ; 0.816 2% Backward simplification (8,533 calls)
% 51.53/51.75 ; 0.201 0% Ordering (58,820 calls)
% 51.53/51.75 ; 0.082 0% Ordering ac (8,230 calls)
% 51.53/51.75 ; 0.000 0% Sortal reasoning (32 calls)
% 51.53/51.75 ; 0.000 0% Purity testing (1 call)
% 51.53/51.75 ; 0.299 1% Other
% 51.53/51.75 ; 51.265 Total
% 51.53/51.75 ; 51.285 Real time
% 51.53/51.75 ;
% 51.53/51.75 ; Term-hash-array has 16,778 terms in all.
% 51.53/51.75 ; Feature-vector-row-index has 1,286 entries (1,288 at peak, 1,446 added, 160 deleted).
% 51.53/51.75 ; Feature-vector-row-index has 8,514 nodes (8,526 at peak, 9,908 added, 1,394 deleted).
% 51.53/51.75 ; Retrieved 21,554 possibly forward subsuming rows in 3,159 calls.
% 51.53/51.75 ; Retrieved 2,025 possibly backward subsumed rows in 1,446 calls.
% 51.53/51.75 ; Path-index has 13,768 entries (13,853 at peak, 17,407 added, 3,639 deleted).
% 51.53/51.75 ; Path-index has 4,645 nodes (4,681 at peak, 5,217 added, 572 deleted).
% 51.53/51.75 ; Trie-index has 13,768 entries (13,853 at peak, 17,407 added, 3,639 deleted).
% 51.53/51.75 ; Trie-index has 4,297 nodes (4,431 at peak, 5,490 added, 1,193 deleted).
% 51.53/51.75 ; Retrieved 65,131,480 generalization terms in 502,365 calls.
% 51.53/51.75 ; Retrieved 55,655 instance terms in 7,119 calls.
% 51.53/51.75 ; Retrieved 208,708 unifiable terms in 4,659 calls.
% 51.53/51.75 ;
% 51.53/51.75 ; The agenda of rows to process has 132 entries:
% 51.53/51.75 ; 28 with value 24 15 with value 28 4 with value 31
% 51.53/51.75 ; 40 with value 25 1 with value 29 2 with value 32
% 51.53/51.75 ; 21 with value 26 1 with value 30 1 with value 35
% 51.53/51.75 ; 19 with value 27
% 51.53/51.75 ; The agenda of rows to give has 6724 entries:
% 51.53/51.75 ; 1 with value (4 15) 106 with value (4 35) 16 with value (4 52)
% 51.53/51.75 ; 4 with value (4 18) 116 with value (4 36) 7 with value (4 53)
% 51.53/51.75 ; 223 with value (4 19) 84 with value (4 37) 14 with value (4 54)
% 51.53/51.75 ; 329 with value (4 20) 81 with value (4 38) 17 with value (4 55)
% 51.53/51.75 ; 451 with value (4 21) 62 with value (4 39) 12 with value (4 56)
% 51.53/51.75 ; 442 with value (4 22) 69 with value (4 40) 2 with value (4 57)
% 51.53/51.75 ; 632 with value (4 23) 50 with value (4 41) 4 with value (4 58)
% 51.53/51.75 ; 603 with value (4 24) 39 with value (4 42) 1 with value (4 59)
% 51.53/51.75 ; 483 with value (4 25) 48 with value (4 43) 3 with value (4 60)
% 51.53/51.75 ; 574 with value (4 26) 40 with value (4 44) 1 with value (4 61)
% 51.53/51.75 ; 367 with value (4 27) 30 with value (4 45) 7 with value (4 62)
% 51.53/51.75 ; 477 with value (4 28) 27 with value (4 46) 4 with value (4 63)
% 51.53/51.75 ; 302 with value (4 29) 30 with value (4 47) 5 with value (4 64)
% 51.53/51.75 ; 285 with value (4 30) 12 with value (4 48) 2 with value (4 65)
% 51.53/51.75 ; 242 with value (4 31) 7 with value (4 49) 1 with value (4 69)
% 51.53/51.75 ; 185 with value (4 32) 13 with value (4 50) 1 with value (4 70)
% 51.53/51.75 ; 107 with value (4 33) 13 with value (4 51) 1 with value (4 77)
% 51.53/51.75 ; 92 with value (4 34)
% 51.53/51.75 Evaluation took:
% 51.53/51.75 51.287 seconds of real time
% 51.53/51.75 50.637497 seconds of user run time
% 51.53/51.75 0.634055 seconds of system run time
% 51.53/51.75 [Run times include 2.257 seconds GC run time.]
% 51.53/51.75 0 calls to %EVAL
% 51.53/51.75 0 page faults and
% 51.53/51.75 3,261,284,064 bytes consed.
% 51.53/51.75 :PROOF-FOUND
% 51.53/51.75 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T15:32:37
% 51.53/51.75 :PROOF-FOUND
% 51.53/51.75 *
%------------------------------------------------------------------------------