TSTP Solution File: LAT005-4 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : LAT005-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n029.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 06:41:46 EDT 2022

% Result   : Unsatisfiable 179.88s 180.10s
% Output   : Refutation 179.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   65 (  64 unt;   0 nHn;  33 RR)
%            Number of literals    :   66 (  65 equ;   2 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   59 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(idempotence_of_meet,axiom,
    meet(X,X) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).

cnf(2,plain,
    meet(X,meet(X,Y)) = meet(X,Y),
    inference('EMBED',[status(thm)],[idempotence_of_meet]) ).

cnf(absorption1,axiom,
    meet(X,join(X,Y)) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).

cnf(6,plain,
    meet(X,meet(join(X,Y),Z)) = meet(X,Z),
    inference('EMBED',[status(thm)],[absorption1]) ).

cnf(absorption2,axiom,
    join(X,meet(X,Y)) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).

cnf(8,plain,
    join(X,join(meet(X,Y),Z)) = join(X,Z),
    inference('EMBED',[status(thm)],[absorption2]) ).

cnf(x_meet_0,axiom,
    meet(X,n0) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_meet_0) ).

cnf(x_join_0,axiom,
    join(X,n0) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_join_0) ).

cnf(x_meet_1,axiom,
    meet(X,n1) = X,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',x_meet_1) ).

cnf(modular,axiom,
    ( meet(X,Y) != X
    | meet(Y,join(X,Z)) = join(X,meet(Z,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-1.ax',modular) ).

cnf(r2_complement_meet_a_b_1,negated_conjecture,
    join(r2,meet(a,b)) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2_complement_meet_a_b_1) ).

cnf(r2_complement_meet_a_b_2,negated_conjecture,
    meet(r2,meet(a,b)) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',r2_complement_meet_a_b_2) ).

cnf(r1_complement_join_a_b_2,negated_conjecture,
    meet(r1,join(a,b)) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',r1_complement_join_a_b_2) ).

cnf(23,plain,
    meet(r1,meet(join(a,b),X)) = meet(X,n0),
    inference('EMBED',[status(thm)],[r1_complement_join_a_b_2]) ).

cnf(define_b2,negated_conjecture,
    join(r1,meet(a,r2)) = b2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',define_b2) ).

cnf(25,plain,
    join(r1,join(meet(a,r2),X)) = join(b2,X),
    inference('EMBED',[status(thm)],[define_b2]) ).

cnf(define_a2,negated_conjecture,
    join(r1,meet(b,r2)) = a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',define_a2) ).

cnf(27,plain,
    join(r1,join(meet(b,r2),X)) = join(a2,X),
    inference('EMBED',[status(thm)],[define_a2]) ).

cnf(prove_SAMs_lemma,negated_conjecture,
    meet(a2,b2) != r1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_SAMs_lemma) ).

cnf(35,plain,
    join(meet(X,join(Y,Z)),meet(X,Y)) = meet(X,join(Y,Z)),
    inference('PARAMODULATE',[status(thm)],[absorption2,6,theory(equality)]) ).

cnf(69,plain,
    n0 = meet(a,r1),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,23,theory(equality)]),x_meet_0,theory(equality)]) ).

cnf(71,plain,
    n0 = meet(b,r1),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,23,theory(equality)]),x_meet_0,theory(equality)]) ).

cnf(73,plain,
    meet(r1,b2) = r1,
    inference('PARAMODULATE',[status(thm)],[absorption1,define_b2,theory(equality)]) ).

cnf(77,plain,
    join(b2,a) = join(a,r1),
    inference('PARAMODULATE',[status(thm)],[8,25,theory(equality)]) ).

cnf(107,plain,
    meet(r1,a2) = r1,
    inference('PARAMODULATE',[status(thm)],[absorption1,define_a2,theory(equality)]) ).

cnf(109,plain,
    meet(b,meet(r2,a2)) = meet(b,r2),
    inference('PARAMODULATE',[status(thm)],[absorption1,define_a2,theory(equality)]) ).

cnf(111,plain,
    join(a2,b) = join(b,r1),
    inference('PARAMODULATE',[status(thm)],[8,27,theory(equality)]) ).

cnf(143,plain,
    meet(X,join(meet(X,Y),Z)) = join(meet(X,Y),meet(X,Z)),
    inference('HYPERRESOLVE',[status(thm)],[modular,2]) ).

cnf(144,plain,
    meet(X,meet(join(meet(X,Y),Z),U)) = meet(join(meet(X,Y),meet(X,Z)),U),
    inference('EMBED',[status(thm)],[143]) ).

cnf(180,plain,
    meet(join(X,Y),join(meet(X,Z),U)) = join(meet(X,Z),meet(join(X,Y),U)),
    inference('HYPERRESOLVE',[status(thm)],[modular,6]) ).

cnf(237,plain,
    meet(join(X,r1),b2) = join(r1,meet(X,b2)),
    inference('HYPERRESOLVE',[status(thm)],[modular,73]) ).

cnf(238,plain,
    meet(b2,meet(join(X,r1),Y)) = meet(join(r1,meet(X,b2)),Y),
    inference('EMBED',[status(thm)],[237]) ).

cnf(253,plain,
    meet(join(X,r1),a2) = join(r1,meet(X,a2)),
    inference('HYPERRESOLVE',[status(thm)],[modular,107]) ).

cnf(254,plain,
    meet(a2,meet(join(X,r1),Y)) = meet(join(r1,meet(X,a2)),Y),
    inference('EMBED',[status(thm)],[253]) ).

cnf(675,plain,
    b2 = join(r1,meet(b2,a)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[237,77,theory(equality)]),absorption1,theory(equality)]) ).

cnf(765,plain,
    meet(join(b2,a),a2) = join(r1,meet(a,a2)),
    inference('PARAMODULATE',[status(thm)],[253,77,theory(equality)]) ).

cnf(766,plain,
    meet(join(b2,a),meet(a2,X)) = meet(join(r1,meet(a,a2)),X),
    inference('EMBED',[status(thm)],[765]) ).

cnf(767,plain,
    a2 = join(r1,meet(a2,b)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[253,111,theory(equality)]),absorption1,theory(equality)]) ).

cnf(771,plain,
    meet(a2,b2) = join(r1,meet(b2,meet(a,a2))),
    inference('PARAMODULATE',[status(thm)],[253,675,theory(equality)]) ).

cnf(795,plain,
    meet(a2,b2) = join(r1,meet(a2,meet(b,b2))),
    inference('PARAMODULATE',[status(thm)],[237,767,theory(equality)]) ).

cnf(1599,plain,
    join(meet(a2,meet(b,join(r2,X))),meet(b,r2)) = meet(a2,meet(b,join(r2,X))),
    inference('PARAMODULATE',[status(thm)],[35,109,theory(equality)]) ).

cnf(2473,plain,
    a = join(meet(a,b),meet(a,r2)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[143,r2_complement_meet_a_b_1,theory(equality)]),x_meet_1,theory(equality)]) ).

cnf(2475,plain,
    b = join(meet(a,b),meet(b,r2)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[143,r2_complement_meet_a_b_1,theory(equality)]),x_meet_1,theory(equality)]) ).

cnf(2477,plain,
    meet(b,r2) = meet(a2,b),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[143,define_a2,theory(equality)]),x_join_0,71,theory(equality)]) ).

cnf(2690,plain,
    meet(a2,b) = meet(a2,meet(b,join(r2,X))),
    inference('REWRITE',[status(thm)],[1599,absorption2,2477,theory(equality)]) ).

cnf(2691,plain,
    meet(a2,meet(b,meet(join(r2,X),Y))) = meet(Y,meet(b,a2)),
    inference('EMBED',[status(thm)],[2690]) ).

cnf(2713,plain,
    b = join(meet(a,b),meet(a2,b)),
    inference('REWRITE',[status(thm)],[2475,2477,theory(equality)]) ).

cnf(2714,plain,
    join(meet(a,b),join(meet(a2,b),X)) = join(b,X),
    inference('EMBED',[status(thm)],[2713]) ).

cnf(2715,plain,
    meet(a,meet(a2,b)) = n0,
    inference('REWRITE',[status(thm)],[r2_complement_meet_a_b_2,2477,theory(equality)]) ).

cnf(2717,plain,
    meet(a,r2) = meet(b2,a),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[143,define_b2,theory(equality)]),x_join_0,69,theory(equality)]) ).

cnf(2953,plain,
    a = join(meet(a,b),meet(b2,a)),
    inference('REWRITE',[status(thm)],[2473,2717,theory(equality)]) ).

cnf(2954,plain,
    join(meet(a,b),join(meet(b2,a),X)) = join(a,X),
    inference('EMBED',[status(thm)],[2953]) ).

cnf(3287,plain,
    join(a,b) = join(a,meet(a2,b)),
    inference('PARAMODULATE',[status(thm)],[8,2714,theory(equality)]) ).

cnf(3299,plain,
    join(b2,a) = join(b2,meet(a,b)),
    inference('PARAMODULATE',[status(thm)],[8,2954,theory(equality)]) ).

cnf(3365,plain,
    meet(a2,join(a,b)) = join(meet(a2,b),meet(a,a2)),
    inference('PARAMODULATE',[status(thm)],[143,3287,theory(equality)]) ).

cnf(3366,plain,
    meet(a2,meet(join(a,b),X)) = meet(join(meet(a2,b),meet(a,a2)),X),
    inference('EMBED',[status(thm)],[3365]) ).

cnf(3373,plain,
    meet(b,join(b2,a)) = join(meet(a,b),meet(b,b2)),
    inference('PARAMODULATE',[status(thm)],[143,3299,theory(equality)]) ).

cnf(3374,plain,
    meet(b,meet(join(b2,a),X)) = meet(join(meet(a,b),meet(b,b2)),X),
    inference('EMBED',[status(thm)],[3373]) ).

cnf(3413,plain,
    meet(join(r1,meet(X,a2)),b) = meet(join(r1,meet(X,a2)),meet(b,join(r2,Y))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[254,2691,theory(equality)]),253,theory(equality)]) ).

cnf(3415,plain,
    meet(a2,join(meet(a,b),meet(b,b2))) = meet(join(r1,meet(a,a2)),b),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[766,2691,theory(equality)]),3413,3373,theory(equality)]) ).

cnf(4092,plain,
    meet(join(meet(X,Y),meet(X,Z)),join(meet(X,U),meet(U,V))) = meet(join(meet(X,Y),meet(X,Z)),U),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,144,theory(equality)]),143,theory(equality)]) ).

cnf(6662,plain,
    n0 = meet(join(r1,meet(a,a2)),b),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[3366,3374,theory(equality)]),4092,3373,2715,x_join_0,r1_complement_join_a_b_2,180,3415,theory(equality)]) ).

cnf(6663,plain,
    meet(join(r1,meet(a,a2)),meet(b,X)) = meet(X,n0),
    inference('EMBED',[status(thm)],[6662]) ).

cnf(6688,plain,
    n0 = meet(a2,meet(b,b2)),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[238,6663,theory(equality)]),771,x_meet_0,theory(equality)]) ).

cnf(6690,plain,
    $false,
    inference('REWRITE',[status(thm)],[795,prove_SAMs_lemma,x_join_0,6688,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LAT005-4 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n029.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 : Wed Jun 29 14:21:22 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.48  #<PACKAGE "SNARK-USER">
% 0.19/0.48  * 
% 0.19/0.48  SNARK-TPTP-OPTIONS
% 0.19/0.48  * 
% 0.19/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48   (USE-FACTORING :POS)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T14:21:23
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-29T14:21:23
% 0.19/0.49  
% 0.19/0.49  ; Recognized commutativity assertion (= (|meet| ?X ?Y) (|meet| ?Y ?X)).
% 0.19/0.49  ; Recognized commutativity assertion (= (|join| ?X ?Y) (|join| ?Y ?X)).
% 0.19/0.49  ; Recognized associativity assertion (= (|meet| (|meet| ?X ?Y) ?Z) (|meet| ?X (|meet| ?Y ?Z))).
% 0.19/0.49  ; Recognized associativity assertion (= (|join| (|join| ?X ?Y) ?Z) (|join| ?X (|join| ?Y ?Z))).
% 0.19/0.49  ; Recognized right identity assertion (= (|join| ?X |n0|) ?X).
% 0.19/0.50  ; Recognized right identity assertion (= (|meet| ?X |n1|) ?X).
% 0.19/0.50  ; Declaring meet to be commutative.
% 0.19/0.50  ; Declaring meet to be associative-commutative.
% 0.19/0.50  ; Declaring join to be commutative.
% 179.88/180.10  ; Declaring join to be associative-commutative.
% 179.88/180.10  
% 179.88/180.10  #||
% 179.88/180.10  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 179.88/180.10  % SZS output start Refutation
% See solution above
% 179.88/180.10  ||#
% 179.88/180.10  
% 179.88/180.10  ; Summary of computation:
% 179.88/180.10  ;     78833 formulas have been input or derived (from 435 formulas).
% 179.88/180.10  ;      6690 ( 8%) were retained.  Of these,
% 179.88/180.10  ;         1625 (24%) were simplified or subsumed later,
% 179.88/180.10  ;         5065 (76%) are still being kept.
% 179.88/180.10  ; 
% 179.88/180.10  ; Run time in seconds excluding printing time:
% 179.88/180.10  ;     0.003   0%   Read assertion file          (1 call)
% 179.88/180.10  ;     0.000   0%   Assert                       (20 calls)
% 179.88/180.10  ;     1.961   1%   Process new row              (73,064 calls)
% 179.88/180.10  ;     0.095   0%   Resolution                   (868 calls)
% 179.88/180.10  ;     2.532   1%   Paramodulation               (434 calls)
% 179.88/180.10  ;     0.067   0%   Embedding                    (2,989 calls)
% 179.88/180.10  ;     0.051   0%   Condensing                   (984 calls)
% 179.88/180.10  ;     0.125   0%   Forward subsumption          (984 calls)
% 179.88/180.10  ;     0.039   0%   Backward subsumption         (713 calls)
% 179.88/180.10  ;     0.051   0%   Clause clause subsumption    (2,540 calls)
% 179.88/180.10  ;   109.071  61%   Forward simplification       (69,145 calls)
% 179.88/180.10  ;     2.991   2%   Backward simplification      (3,704 calls)
% 179.88/180.10  ;     0.321   0%   Ordering                     (183,424 calls)
% 179.88/180.10  ;    62.003  35%   Ordering ac                  (120,796 calls)
% 179.88/180.10  ;     0.000   0%   Sortal reasoning             (32 calls)
% 179.88/180.10  ;     0.000   0%   Purity testing               (1 call)
% 179.88/180.10  ;     0.310   0%   Other
% 179.88/180.10  ;   179.620        Total
% 179.88/180.10  ;   179.623        Real time
% 179.88/180.11  ; 
% 179.88/180.11  ; Term-hash-array has 19,776 terms in all.
% 179.88/180.11  ; Feature-vector-row-index has 547 entries (547 at peak, 713 added, 166 deleted).
% 179.88/180.11  ; Feature-vector-row-index has 7,159 nodes (7,159 at peak, 9,266 added, 2,107 deleted).
% 179.88/180.11  ;  Retrieved 2,465 possibly forward subsuming rows in 984 calls.
% 179.88/180.11  ;  Retrieved 203 possibly backward subsumed rows in 713 calls.
% 179.88/180.11  ; Path-index has 15,987 entries (16,037 at peak, 20,593 added, 4,606 deleted).
% 179.88/180.11  ; Path-index has 217 nodes (217 at peak, 245 added, 28 deleted).
% 179.88/180.11  ; Trie-index has 15,987 entries (16,037 at peak, 20,593 added, 4,606 deleted).
% 179.88/180.11  ; Trie-index has 54 nodes (54 at peak, 60 added, 6 deleted).
% 179.88/180.11  ; Retrieved 306,710,454 generalization terms in 557,181 calls.
% 179.88/180.11  ; Retrieved 229,179 instance terms in 3,720 calls.
% 179.88/180.11  ; Retrieved 939,509 unifiable terms in 2,746 calls.
% 179.88/180.11  ; 
% 179.88/180.11  ; The agenda of backward simplifiable rows to process has 7 entries:
% 179.88/180.11  ;     7 with value 0
% 179.88/180.11  ; The agenda of rows to process has 267 entries:
% 179.88/180.11  ;     4 with value 23              5 with value 34               2 with value 44
% 179.88/180.11  ;    15 with value 24             14 with value 35               3 with value 45
% 179.88/180.11  ;    24 with value 25             14 with value 36               3 with value 46
% 179.88/180.11  ;     2 with value 26             19 with value 37               1 with value 47
% 179.88/180.11  ;    24 with value 27              9 with value 38               3 with value 49
% 179.88/180.11  ;     5 with value 28              5 with value 39               2 with value 50
% 179.88/180.11  ;    22 with value 29              5 with value 40               2 with value 53
% 179.88/180.11  ;     9 with value 30              4 with value 41               1 with value 56
% 179.88/180.11  ;    25 with value 31              4 with value 42               1 with value 57
% 179.88/180.11  ;     7 with value 32              6 with value 43               1 with value 58
% 179.88/180.11  ;    26 with value 33
% 179.88/180.11  ; The agenda of rows to give has 4726 entries:
% 179.88/180.11  ;     2 with value (4 15)        193 with value (4 34)          28 with value (4 49)
% 179.88/180.11  ;     2 with value (4 19)        221 with value (4 35)          58 with value (4 50)
% 179.88/180.11  ;    36 with value (4 20)        143 with value (4 36)          37 with value (4 51)
% 179.88/180.11  ;   102 with value (4 21)        163 with value (4 37)          18 with value (4 52)
% 179.88/180.11  ;   126 with value (4 22)        151 with value (4 38)          28 with value (4 53)
% 179.88/180.11  ;   115 with value (4 23)        222 with value (4 39)          14 with value (4 54)
% 179.88/180.11  ;   137 with value (4 24)         87 with value (4 40)          30 with value (4 55)
% 179.88/180.11  ;   242 with value (4 25)        127 with value (4 41)           6 with value (4 56)
% 179.88/180.11  ;   193 with value (4 26)        118 with value (4 42)          11 with value (4 57)
% 179.88/180.11  ;   168 with value (4 27)        115 with value (4 43)           1 with value (4 58)
% 179.88/180.11  ;   219 with value (4 28)         67 with value (4 44)           9 with value (4 59)
% 179.88/180.11  ;   274 with value (4 29)         76 with value (4 45)          12 with value (4 61)
% 179.88/180.11  ;   231 with value (4 30)         90 with value (4 46)           2 with value (4 62)
% 179.88/180.11  ;   308 with value (4 31)         65 with value (4 47)           4 with value (4 63)
% 179.88/180.11  ;   202 with value (4 32)         44 with value (4 48)           4 with value (4 67)
% 179.88/180.11  ;   225 with value (4 33)
% 179.88/180.11  Evaluation took:
% 179.88/180.11    179.625 seconds of real time
% 179.88/180.11    178.71094 seconds of user run time
% 179.88/180.11    0.916644 seconds of system run time
% 179.88/180.11    [Run times include 2.657 seconds GC run time.]
% 179.88/180.11    0 calls to %EVAL
% 179.88/180.11    0 page faults and
% 179.88/180.11    4,403,948,448 bytes consed.
% 179.88/180.11  :PROOF-FOUND
% 179.88/180.11  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-29T14:24:22
% 179.88/180.11  :PROOF-FOUND
% 179.88/180.11  * 
%------------------------------------------------------------------------------