↑ Up

SNARK---20120808r022.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : CSR006+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n012.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 : Fri Jul 15 23:17:58 EDT 2022

% Result   : Theorem 9.64s 9.87s
% Output   : Refutation 9.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   19
%            Number of leaves      :   31
% Syntax   : Number of clauses     :   74 (  39 unt;  16 nHn;  67 RR)
%            Number of literals    :  127 (  34 equ;  49 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   1 prp; 0-4 aty)
%            Number of functors    :   11 (  11 usr;   7 con; 0-3 aty)
%            Number of variables   :   61 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | happens('SKOLEMAAAV1'(X,Z,Y),'SKOLEMAAAV2'(X,Z,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

cnf(2,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | less(X,'SKOLEMAAAV2'(X,Z,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

cnf(3,axiom,
    ( ~ stoppedIn(X,Y,Z)
    | less('SKOLEMAAAV2'(X,Z,Y),Z) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',stoppedin_defn) ).

cnf(11,axiom,
    ( ~ happens(X,Y)
    | ~ initiates(X,Z,Y)
    | ~ less(n0,U)
    | ~ trajectory(Z,Y,V,U)
    | stoppedIn(Y,Z,plus(Y,U))
    | holdsAt(V,plus(Y,U)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',change_holding) ).

cnf(20,axiom,
    ( ~ happens(X,Y)
    | ~ initiates(X,Z,Y)
    | holdsAt(Z,plus(Y,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_holds) ).

cnf(43,axiom,
    ( initiates(X,Y,Z)
    | X != tapOn
    | Y != filling ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',initiates_all_defn) ).

cnf(46,axiom,
    ( initiates(X,Y,Z)
    | ~ holdsAt(waterLevel(U),Z)
    | X != overflow
    | Y != waterLevel(U) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',initiates_all_defn) ).

cnf(55,axiom,
    ( ~ happens(X,Y)
    | X = tapOn
    | holdsAt(waterLevel(n3),Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

cnf(60,axiom,
    ( ~ happens(X,Y)
    | Y = n0
    | X = overflow ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

cnf(61,axiom,
    ( happens(X,Y)
    | X != tapOn
    | Y != n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).

cnf(63,axiom,
    ( ~ holdsAt(waterLevel(X),Y)
    | Z != plus(X,U)
    | trajectory(filling,Y,waterLevel(Z),U) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',change_of_waterLevel) ).

cnf(64,axiom,
    ( ~ holdsAt(waterLevel(X),Y)
    | ~ holdsAt(waterLevel(Z),Y)
    | X = Z ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',same_waterLevel) ).

cnf(67,axiom,
    overflow != tapOn,
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',overflow_not_tapOn) ).

cnf(74,axiom,
    plus(n0,n1) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).

cnf(76,axiom,
    plus(n0,n3) = n3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_3) ).

cnf(78,axiom,
    plus(n1,n2) = n3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).

cnf(83,axiom,
    ( ~ less_or_equal(X,Y)
    | less(X,Y)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

cnf(84,axiom,
    ( less_or_equal(X,Y)
    | ~ less(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

cnf(85,axiom,
    ( less_or_equal(X,Y)
    | X != Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

cnf(86,axiom,
    ~ less(X,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less0) ).

cnf(87,axiom,
    ( ~ less(X,n1)
    | less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

cnf(88,axiom,
    ( less(X,n1)
    | ~ less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

cnf(89,axiom,
    ( ~ less(X,n2)
    | less_or_equal(X,n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).

cnf(90,axiom,
    ( less(X,n2)
    | ~ less_or_equal(X,n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).

cnf(91,axiom,
    ( ~ less(X,n3)
    | less_or_equal(X,n2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).

cnf(92,axiom,
    ( less(X,n3)
    | ~ less_or_equal(X,n2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less3) ).

cnf(105,axiom,
    ( ~ less(X,Y)
    | ~ less(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

cnf(106,axiom,
    ( ~ less(X,Y)
    | X != Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

cnf(107,axiom,
    ( less(X,Y)
    | less(Y,X)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

cnf(108,hypothesis,
    holdsAt(waterLevel(n0),n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_0) ).

cnf(114,negated_conjecture,
    ~ holdsAt(waterLevel(n3),n3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_3) ).

cnf(115,plain,
    less_or_equal(X,X),
    inference('HYPERRESOLVE',[status(thm)],[85,theory(equality)]) ).

cnf(130,plain,
    happens(tapOn,n0),
    inference('HYPERRESOLVE',[status(thm)],[61,theory(equality),theory(equality)]) ).

cnf(131,plain,
    ( less(n0,X)
    | X = n0 ),
    inference('HYPERRESOLVE',[status(thm)],[86,107]) ).

cnf(138,plain,
    ( less(n2,X)
    | X = n2
    | less_or_equal(X,n1) ),
    inference('HYPERRESOLVE',[status(thm)],[89,107]) ).

cnf(144,plain,
    initiates(tapOn,filling,X),
    inference('HYPERRESOLVE',[status(thm)],[43,theory(equality),theory(equality)]) ).

cnf(178,plain,
    trajectory(filling,n0,waterLevel(n1),n1),
    inference('HYPERRESOLVE',[status(thm)],[63,108,74]) ).

cnf(180,plain,
    trajectory(filling,n0,waterLevel(n3),n3),
    inference('HYPERRESOLVE',[status(thm)],[63,108,76]) ).

cnf(216,plain,
    less(n2,n3),
    inference('HYPERRESOLVE',[status(thm)],[92,115]) ).

cnf(219,plain,
    less(n0,n1),
    inference('HYPERRESOLVE',[status(thm)],[88,115]) ).

cnf(250,plain,
    ~ less(n3,n2),
    inference('UR-RESOLVE',[status(thm)],[105,216]) ).

cnf(281,plain,
    ~ less_or_equal(n3,n1),
    inference('UR-RESOLVE',[status(thm)],[90,250]) ).

cnf(322,plain,
    n3 != n1,
    inference('UR-RESOLVE',[status(thm)],[85,281]) ).

cnf(323,plain,
    ~ less(n3,n1),
    inference('UR-RESOLVE',[status(thm)],[84,281]) ).

cnf(339,plain,
    ( stoppedIn(n0,filling,n1)
    | holdsAt(waterLevel(n1),n1) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,178,130,144,219]),74,theory(equality)]) ).

cnf(341,plain,
    ( n3 = n0
    | stoppedIn(n0,filling,n3) ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[11,180,130,144,131]),114,76,theory(equality)]) ).

cnf(359,plain,
    ~ less_or_equal(n3,n0),
    inference('UR-RESOLVE',[status(thm)],[88,323]) ).

cnf(392,plain,
    n3 != n0,
    inference('UR-RESOLVE',[status(thm)],[85,359]) ).

cnf(393,plain,
    stoppedIn(n0,filling,n3),
    inference('REWRITE',[status(thm)],[341,392]) ).

cnf(395,plain,
    less('SKOLEMAAAV2'(n0,n3,filling),n3),
    inference('HYPERRESOLVE',[status(thm)],[3,393]) ).

cnf(396,plain,
    less(n0,'SKOLEMAAAV2'(n0,n3,filling)),
    inference('HYPERRESOLVE',[status(thm)],[2,393]) ).

cnf(397,plain,
    happens('SKOLEMAAAV1'(n0,n3,filling),'SKOLEMAAAV2'(n0,n3,filling)),
    inference('HYPERRESOLVE',[status(thm)],[1,393]) ).

cnf(483,plain,
    less_or_equal('SKOLEMAAAV2'(n0,n3,filling),n2),
    inference('HYPERRESOLVE',[status(thm)],[91,395]) ).

cnf(487,plain,
    n0 != 'SKOLEMAAAV2'(n0,n3,filling),
    inference('UR-RESOLVE',[status(thm)],[106,396]) ).

cnf(521,plain,
    ( less('SKOLEMAAAV2'(n0,n3,filling),n2)
    | 'SKOLEMAAAV2'(n0,n3,filling) = n2 ),
    inference('HYPERRESOLVE',[status(thm)],[83,483]) ).

cnf(525,plain,
    ~ less_or_equal('SKOLEMAAAV2'(n0,n3,filling),n0),
    inference('UR-RESOLVE',[status(thm)],[83,487,86]) ).

cnf(536,plain,
    ( less(n2,X)
    | X = n2
    | less(X,n1)
    | X = n1 ),
    inference('HYPERRESOLVE',[status(thm)],[83,138]) ).

cnf(571,plain,
    ~ less('SKOLEMAAAV2'(n0,n3,filling),n1),
    inference('UR-RESOLVE',[status(thm)],[87,525]) ).

cnf(578,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less('SKOLEMAAAV2'(n0,n1,filling),n1) ),
    inference('HYPERRESOLVE',[status(thm)],[3,339]) ).

cnf(579,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less(n0,'SKOLEMAAAV2'(n0,n1,filling)) ),
    inference('HYPERRESOLVE',[status(thm)],[2,339]) ).

cnf(584,plain,
    'SKOLEMAAAV1'(n0,n3,filling) = overflow,
    inference('UR-RESOLVE',[status(thm)],[60,397,487]) ).

cnf(585,plain,
    happens(overflow,'SKOLEMAAAV2'(n0,n3,filling)),
    inference('REWRITE',[status(thm)],[397,584,theory(equality)]) ).

cnf(590,plain,
    holdsAt(waterLevel(n3),'SKOLEMAAAV2'(n0,n3,filling)),
    inference('UR-RESOLVE',[status(thm)],[55,585,67]) ).

cnf(619,plain,
    initiates(overflow,waterLevel(n3),'SKOLEMAAAV2'(n0,n3,filling)),
    inference('HYPERRESOLVE',[status(thm)],[46,590,theory(equality),theory(equality)]) ).

cnf(622,plain,
    ~ holdsAt(waterLevel(n1),'SKOLEMAAAV2'(n0,n3,filling)),
    inference('UR-RESOLVE',[status(thm)],[64,590,322]) ).

cnf(812,plain,
    holdsAt(waterLevel(n3),plus('SKOLEMAAAV2'(n0,n3,filling),n1)),
    inference('HYPERRESOLVE',[status(thm)],[20,619,585]) ).

cnf(2414,plain,
    ( holdsAt(waterLevel(n1),n1)
    | less_or_equal('SKOLEMAAAV2'(n0,n1,filling),n0) ),
    inference('HYPERRESOLVE',[status(thm)],[87,578]) ).

cnf(4179,plain,
    ( holdsAt(waterLevel(n1),n1)
    | 'SKOLEMAAAV2'(n0,n1,filling) = n0 ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[83,2414]),86]) ).

cnf(5274,plain,
    ( 'SKOLEMAAAV2'(n0,n3,filling) = n2
    | 'SKOLEMAAAV2'(n0,n3,filling) = n1 ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[105,521,536]),571]) ).

cnf(7078,plain,
    'SKOLEMAAAV2'(n0,n3,filling) = n1,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[812,5274,theory(equality)]),114,78,theory(equality)]) ).

cnf(7099,plain,
    ~ holdsAt(waterLevel(n1),n1),
    inference('REWRITE',[status(thm)],[622,7078,theory(equality)]) ).

cnf(7102,plain,
    less(n0,'SKOLEMAAAV2'(n0,n1,filling)),
    inference('REWRITE',[status(thm)],[579,7099]) ).

cnf(7110,plain,
    'SKOLEMAAAV2'(n0,n1,filling) = n0,
    inference('REWRITE',[status(thm)],[4179,7099]) ).

cnf(7111,plain,
    $false,
    inference('REWRITE',[status(thm)],[7102,86,7110,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CSR006+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.06/0.12  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n012.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 : Sat Jun 11 12:19:26 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.45  * 
% 0.20/0.45  * 
% 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.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-11T12:19:26
% 0.20/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n012.cluster.edu at 2022-06-11T12:19:26
% 0.20/0.49  
% 0.20/0.49  ; Recognized commutativity assertion (= (|plus| ?X ?Y) (|plus| ?Y ?X)).
% 0.20/0.49  WARNING:
% 0.20/0.49     |antitrajectory| is a 4-ary relation that occurs only negatively; disabling rows that contain it.
% 9.64/9.87  ; Declaring plus to be commutative.
% 9.64/9.87  
% 9.64/9.87  #||
% 9.64/9.87  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.64/9.87  % SZS output start Refutation
% See solution above
% 9.73/9.89  ||#
% 9.73/9.89  
% 9.73/9.89  ; Summary of computation:
% 9.73/9.89  ;     54820 formulas have been input or derived (from 2235 formulas).
% 9.73/9.89  ;      7111 (13%) were retained.  Of these,
% 9.73/9.89  ;         1040 (15%) were simplified or subsumed later,
% 9.73/9.89  ;         6071 (85%) are still being kept.
% 9.73/9.89  ; 
% 9.73/9.89  ; Run time in seconds excluding printing time:
% 9.73/9.89  ;     0.012   0%   Read assertion file          (1 call)
% 9.73/9.89  ;     0.004   0%   Assert                       (55 calls)
% 9.73/9.89  ;     0.628   7%   Process new row              (51,587 calls)
% 9.73/9.89  ;     1.489  16%   Resolution                   (4,468 calls)
% 9.73/9.89  ;     0.085   1%   Paramodulation               (2,234 calls)
% 9.73/9.89  ;     0.001   0%   Factoring                    (261 calls)
% 9.73/9.89  ;     0.063   1%   Condensing                   (17,577 calls)
% 9.73/9.89  ;     5.275  56%   Forward subsumption          (17,577 calls)
% 9.73/9.89  ;     0.284   3%   Backward subsumption         (4,531 calls)
% 9.73/9.89  ;     0.231   2%   Clause clause subsumption    (51,248 calls)
% 9.73/9.89  ;     0.984  10%   Forward simplification       (46,351 calls)
% 9.73/9.89  ;     0.064   1%   Backward simplification      (7,111 calls)
% 9.73/9.89  ;     0.076   1%   Ordering                     (76,920 calls)
% 9.73/9.89  ;     0.000   0%   Sortal reasoning             (32 calls)
% 9.73/9.89  ;     0.001   0%   Purity testing               (1 call)
% 9.73/9.89  ;     0.207   2%   Other
% 9.73/9.89  ;     9.404        Total
% 9.73/9.89  ;     9.427        Real time
% 9.73/9.89  ; 
% 9.73/9.89  ; Term-hash-array has 4,329 terms in all.
% 9.73/9.89  ; Feature-vector-row-index has 3,743 entries (4,001 at peak, 4,531 added, 788 deleted).
% 9.73/9.89  ; Feature-vector-row-index has 32,700 nodes (34,990 at peak, 41,071 added, 8,371 deleted).
% 9.73/9.89  ;  Retrieved 166,470 possibly forward subsuming rows in 17,577 calls.
% 9.73/9.89  ;  Retrieved 3,838 possibly backward subsumed rows in 4,531 calls.
% 9.73/9.89  ; Path-index has 3,708 entries (4,095 at peak, 4,593 added, 885 deleted).
% 9.73/9.89  ; Path-index has 2,408 nodes (2,517 at peak, 3,186 added, 778 deleted).
% 9.73/9.89  ; Trie-index has 3,708 entries (4,095 at peak, 4,593 added, 885 deleted).
% 9.73/9.89  ; Trie-index has 9,342 nodes (10,401 at peak, 12,673 added, 3,331 deleted).
% 9.73/9.89  ; Retrieved 101,768 generalization terms in 211,080 calls.
% 9.73/9.89  ; Retrieved 2,621 instance terms in 2,579 calls.
% 9.73/9.89  ; Retrieved 1,027,867 unifiable terms in 112,963 calls.
% 9.73/9.89  ; 
% 9.73/9.89  ; The agenda of backward simplifiable rows to process has 371 entries:
% 9.73/9.89  ;   371 with value 0
% 9.73/9.89  ; The agenda of rows to process has 87 entries:
% 9.73/9.89  ;    10 with value 23             16 with value 26               3 with value 31
% 9.73/9.89  ;    15 with value 24             16 with value 27               1 with value 35
% 9.73/9.89  ;    24 with value 25              1 with value 28               1 with value 38
% 9.73/9.89  ; The agenda of rows to give has 4096 entries:
% 9.73/9.89  ;     1 with value (4 7)          69 with value (4 28)         207 with value (4 43)
% 9.73/9.89  ;     3 with value (4 8)         145 with value (4 29)          15 with value (4 44)
% 9.73/9.89  ;     2 with value (4 10)         24 with value (4 30)         416 with value (4 45)
% 9.73/9.89  ;     3 with value (4 11)         98 with value (4 31)          47 with value (4 46)
% 9.73/9.89  ;     4 with value (4 12)         19 with value (4 32)          67 with value (4 47)
% 9.73/9.89  ;     1 with value (4 14)        105 with value (4 33)           3 with value (4 48)
% 9.73/9.89  ;     1 with value (4 15)          4 with value (4 34)         162 with value (4 49)
% 9.73/9.89  ;     4 with value (4 17)        172 with value (4 35)          24 with value (4 51)
% 9.73/9.89  ;     1 with value (4 18)         33 with value (4 36)         320 with value (4 53)
% 9.73/9.89  ;     2 with value (4 19)        336 with value (4 37)          12 with value (4 54)
% 9.73/9.89  ;    98 with value (4 22)         70 with value (4 38)          74 with value (4 55)
% 9.73/9.89  ;   320 with value (4 23)        142 with value (4 39)           4 with value (4 56)
% 9.73/9.89  ;   139 with value (4 24)         10 with value (4 40)         100 with value (4 57)
% 9.73/9.89  ;   260 with value (4 25)        204 with value (4 41)          60 with value (4 63)
% 9.73/9.89  ;   147 with value (4 26)          3 with value (4 42)          30 with value (4 65)
% 9.73/9.89  ;   135 with value (4 27)
% 9.73/9.89  Evaluation took:
% 9.73/9.89    9.429 seconds of real time
% 9.73/9.89    8.932319 seconds of user run time
% 9.73/9.89    0.495115 seconds of system run time
% 9.73/9.89    [Run times include 0.804 seconds GC run time.]
% 9.73/9.89    0 calls to %EVAL
% 9.73/9.89    0 page faults and
% 9.73/9.89    999,704,384 bytes consed.
% 9.73/9.89  :PROOF-FOUND
% 9.73/9.89  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-11T12:19:36
% 9.73/9.89  :PROOF-FOUND
% 9.73/9.89  * 
%------------------------------------------------------------------------------