TSTP Solution File: LCL655+1.005 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : LCL655+1.005 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n007.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 13:48:32 EDT 2022

% Result   : Timeout 300.06s 300.33s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL655+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.34  % Computer : n007.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 Jul  4 12:48:42 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.82/1.11  ============================== Prover9 ===============================
% 0.82/1.11  Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.11  Process 1595 was started by sandbox2 on n007.cluster.edu,
% 0.82/1.11  Mon Jul  4 12:48:42 2022
% 0.82/1.11  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_1441_n007.cluster.edu".
% 0.82/1.11  ============================== end of head ===========================
% 0.82/1.11  
% 0.82/1.11  ============================== INPUT =================================
% 0.82/1.11  
% 0.82/1.11  % Reading from file /tmp/Prover9_1441_n007.cluster.edu
% 0.82/1.11  
% 0.82/1.11  set(prolog_style_variables).
% 0.82/1.11  set(auto2).
% 0.82/1.11      % set(auto2) -> set(auto).
% 0.82/1.11      % set(auto) -> set(auto_inference).
% 0.82/1.11      % set(auto) -> set(auto_setup).
% 0.82/1.11      % set(auto_setup) -> set(predicate_elim).
% 0.82/1.11      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.11      % set(auto) -> set(auto_limits).
% 0.82/1.11      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.11      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.11      % set(auto) -> set(auto_denials).
% 0.82/1.11      % set(auto) -> set(auto_process).
% 0.82/1.11      % set(auto2) -> assign(new_constants, 1).
% 0.82/1.11      % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.11      % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.11      % set(auto2) -> assign(max_hours, 1).
% 0.82/1.11      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.11      % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.11      % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.11      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.11      % set(auto2) -> set(sort_initial_sos).
% 0.82/1.11      % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.11      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.11      % set(auto2) -> assign(max_megs, 400).
% 0.82/1.11      % set(auto2) -> assign(stats, some).
% 0.82/1.11      % set(auto2) -> clear(echo_input).
% 0.82/1.11      % set(auto2) -> set(quiet).
% 0.82/1.11      % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.11      % set(auto2) -> clear(print_given).
% 0.82/1.11  assign(lrs_ticks,-1).
% 0.82/1.11  assign(sos_limit,10000).
% 0.82/1.11  assign(order,kbo).
% 0.82/1.11  set(lex_order_vars).
% 0.82/1.11  clear(print_given).
% 0.82/1.11  
% 0.82/1.11  % formulas(sos).  % not echoed (2 formulas)
% 0.82/1.11  
% 0.82/1.11  ============================== end of input ==========================
% 0.82/1.11  
% 0.82/1.11  % From the command line: assign(max_seconds, 300).
% 0.82/1.11  
% 0.82/1.11  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.11  
% 0.82/1.11  % Formulas that are not ordinary clauses:
% 0.82/1.11  1 (all X r1(X,X)) # label(reflexivity) # label(axiom) # label(non_clause).  [assumption].
% 0.82/1.11  2 --(exists X -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & -(all X (-r1(Y,X) | -p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | (all Y (-r1(X,Y) | -p1(Y)))))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y)))))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p1(Y))))) & (all X (-r1(Y,X) | p1(X)))))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p1(X) & (all Y (-r1(X,Y) | p1(Y)))))))) & (all Y (-r1(X,Y) | p1(Y) | -(all X (-r1(Y,X) | p1(X)))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p1(X) & -(all Y (-r1(X,Y) | -p1(Y)))))))) & (all Y (-r1(X,Y) | p1(Y) | (all X (-r1(Y,X) | -p1(X)))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p1(X) & (all Y (-r1(X,Y) | p1(Y)))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y))))))) & (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X)))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p1(X))))) & (all Y (-r1(X,Y) | p1(Y)))))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & -(all X (-r1(Y,X) | -p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | (all Y (-r1(X,Y) | -p1(Y)))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y)))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p1(Y))))) & (all X (-r1(Y,X) | p1(X)))))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p1(X) & (all Y (-r1(X,Y) | p1(Y)))))))) & (all Y (-r1(X,Y) | p1(Y) | -(all X (-r1(Y,X) | p1(X)))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p1(X) & -(all Y (-r1(X,Y) | -p1(Y)))))))) & (all Y (-r1(X,Y) | p1(Y) | (all X (-r1(Y,X) | -p1(X)))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-p1(X) & (all Y (-r1(X,Y) | p1(Y)))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y))))))) & (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X)))))))))) | -(all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(-(all Y (-r1(X,Y) | (all X (-r1(Y,X) | p1(X))))) & (all Y (-r1(X,Y) | p1(Y)))))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | -(all Y (-r1(X,Y) | p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(-p1(Y) & -(all X (-r1(Y,X) | -p1(X)))))))) & (all X (-r1(Y,X) | p1(X) | (all Y (-r1(X,Y) | -p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-p1(Y) & (all X (-r1(Y,X) | p1(X)))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | -(all X (-r1(Y,X) | -p1(X))))))) & (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | -p1(Y)))))))) | -(all Y (-r1(X,Y) | -(-(all X (-r1(Y,X) | (all Y (-r1(X,Y) | p1(Y))))) & (all X (-r1(Y,X) | p1(X)))))) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | (all Y (-r1(X,Y) | (all X (-r1(Y,X) | -(all Y (-r1(X,Y) | p1(Y))))) | (all X (-r1(Y,X) | p1(X))))))))))))))) # label(main) # label(negated_conjecture) # label(non_clause).  [assumption].
% 6.23/6.55  
% 6.23/6.55  ============================== end of process non-clausal formulas ===
% 6.23/6.55  
% 6.23/6.55  ============================== PROCESS INITIAL CLAUSES ===============
% 6.23/6.55  
% 6.23/6.55  ============================== PREDICATE ELIMINATION =================
% 6.23/6.55  
% 6.23/6.55  ============================== end predicate elimination =============
% 6.23/6.55  
% 6.23/6.55  Auto_denials:  (non-Horn, no changes).
% 6.23/6.55  
% 6.23/6.55  Term ordering decisions:
% 6.23/6.55  Function symbol KB weights:  c1=1. c2=1. c3=1. c4=1. c5=1. c6=1. c7=1. c8=1. c9=1. c10=1. c11=1. c12=1. c13=1. c14=1. c15=1. c16=1. c17=1. c18=1. c19=1. c20=1. c21=1. c22=1. c23=1. c24=1. c25=1. c26=1. c27=1. c28=1. c29=1. c30=1. c31=1. c32=1. c33=1. c34=1. c35=1. c36=1. f26=1. f27=1. f28=1. f29=1. f31=1. f32=1. f34=1. f35=1. f36=1. f37=1. f39=1. f40=1. f18=1. f19=1. f20=1. f21=1. f23=1. f24=1. f33=1. f38=1. f10=1. f11=1. f12=1. f13=1. f15=1. f16=1. f25=1. f30=1. f2=1. f3=1. f4=1. f5=1. f7=1. f8=1. f17=1. f22=1. f9=1. f14=1. f1=1. f6=1.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10333, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  Low Water (displace): id=10333, wt=17.000
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10334, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10335, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10336, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10337, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10338, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10339, wt=31.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10340, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10341, wt=31.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10342, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10343, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10344, wt=31.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10345, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10346, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10347, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10348, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10349, wt=20.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10350, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10351, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10352, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10353, wt=28.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10354, wt=20.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10355, wt=18.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10356, wt=24.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10357, wt=21.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10358, wt=24.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10359, wt=24.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10360, wt=24.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10361, wt=24.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10362, wt=20.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10363, wt=33.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10364, wt=26.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10365, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10366, wt=26.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10367, wt=26.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10368, wt=26.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10369, wt=26.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10370, wt=17.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10371, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10372, wt=20.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10373, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10374, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10375, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10376, wt=23.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10377, wt=19.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10378, wt=32.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10379, wt=25.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10380, wt=22.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10381, wt=25.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10382, wt=25.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10383, wt=25.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10384, wt=25.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10385, wt=10.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  Low Water (displace): id=10385, wt=10.000
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10386, wt=13.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10387, wt=16.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10388, wt=9.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  Low Water (displace): id=10388, wt=9.000
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10389, wt=12.000) has high priority.
% 6.23/6.56  
% 6.23/6.56  WARNING: worst clause (id=10390, wt=15.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10391, wt=18.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10392, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10393, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10394, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10395, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10396, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10397, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10398, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10399, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10400, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10401, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10402, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10403, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10404, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10405, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10406, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10407, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10408, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10409, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10410, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10411, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10412, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10413, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10414, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10415, wt=24.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10416, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10417, wt=17.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10418, wt=20.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10419, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10420, wt=20.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10421, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10422, wt=20.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10423, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10424, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10425, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10426, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10427, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10428, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10429, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10430, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10431, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10432, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10433, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10434, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10435, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10436, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10437, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10438, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10439, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10440, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10441, wt=23.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10442, wt=20.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10443, wt=17.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10444, wt=15.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10445, wt=18.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10446, wt=18.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10448, wt=18.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10449, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10450, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10451, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10452, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10453, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10454, wt=21.000) has high priority.
% 6.23/6.57  
% 6.23/6.57  WARNING: worst clause (id=10455, wt=16.Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------