TSTP Solution File: SWV168+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWV168+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n017.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:56:15 EDT 2023

% Result   : Theorem 0.16s 0.47s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   7 unt;   0 def)
%            Number of atoms       :  182 (  42 equ)
%            Maximal formula atoms :   47 (   9 avg)
%            Number of connectives :  213 (  50   ~;  47   |;  76   &)
%                                         (   1 <=>;  39  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  16 con; 0-3 aty)
%            Number of variables   :   40 (   0 sgn;  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0016,conjecture,
    ( ( a_select2(mu_init,pv40) = init
      & leq(n0,pv40)
      & leq(n0,pv46)
      & leq(pv40,n4)
      & leq(pv46,n135299)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n135299) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(rho_init,X4) = init )
      & ! [X20] :
          ( ( leq(n0,X20)
            & leq(X20,pred(pv40)) )
         => a_select2(mu_init,X20) = init )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,pred(pv40)) )
         => a_select2(sigma_init,X21) = init )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,n4) )
         => a_select3(center_init,X22,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X28] :
            ( ( leq(n0,X28)
              & leq(X28,n4) )
           => a_select2(muold_init,X28) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X29] :
            ( ( leq(n0,X29)
              & leq(X29,n4) )
           => a_select2(rhoold_init,X29) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select2(sigmaold_init,X5) = init ) ) )
   => a_select3(q_init,pv46,pv40) = init ),
    file('/export/starexec/sandbox2/tmp/tmp.Jrle6hzKIe/E---3.1_26808.p',cl5_nebula_init_0016) ).

fof(c_0_1,plain,
    ( epred1_0
  <=> ( a_select2(mu_init,pv40) = init
      & leq(n0,pv40)
      & leq(n0,pv46)
      & leq(pv40,n4)
      & leq(pv46,n135299)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n135299) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(rho_init,X4) = init )
      & ! [X20] :
          ( ( leq(n0,X20)
            & leq(X20,pred(pv40)) )
         => a_select2(mu_init,X20) = init )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,pred(pv40)) )
         => a_select2(sigma_init,X21) = init )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,n4) )
         => a_select3(center_init,X22,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X28] :
            ( ( leq(n0,X28)
              & leq(X28,n4) )
           => a_select2(muold_init,X28) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X29] :
            ( ( leq(n0,X29)
              & leq(X29,n4) )
           => a_select2(rhoold_init,X29) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select2(sigmaold_init,X5) = init ) ) ) ),
    introduced(definition) ).

fof(c_0_2,plain,
    ( epred1_0
   => ( a_select2(mu_init,pv40) = init
      & leq(n0,pv40)
      & leq(n0,pv46)
      & leq(pv40,n4)
      & leq(pv46,n135299)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,n135299) )
         => ! [X18] :
              ( ( leq(n0,X18)
                & leq(X18,n4) )
             => a_select3(q_init,X14,X18) = init ) )
      & ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,n4) )
         => a_select2(rho_init,X4) = init )
      & ! [X20] :
          ( ( leq(n0,X20)
            & leq(X20,pred(pv40)) )
         => a_select2(mu_init,X20) = init )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,pred(pv40)) )
         => a_select2(sigma_init,X21) = init )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,n4) )
         => a_select3(center_init,X22,n0) = init )
      & ( gt(loopcounter,n1)
       => ! [X28] :
            ( ( leq(n0,X28)
              & leq(X28,n4) )
           => a_select2(muold_init,X28) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X29] :
            ( ( leq(n0,X29)
              & leq(X29,n4) )
           => a_select2(rhoold_init,X29) = init ) )
      & ( gt(loopcounter,n1)
       => ! [X5] :
            ( ( leq(n0,X5)
              & leq(X5,n4) )
           => a_select2(sigmaold_init,X5) = init ) ) ) ),
    inference(split_equiv,[status(thm)],[c_0_1]) ).

fof(c_0_3,negated_conjecture,
    ~ ( epred1_0
     => a_select3(q_init,pv46,pv40) = init ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0016]),c_0_1]) ).

fof(c_0_4,plain,
    ! [X171,X172,X173,X174,X175,X176,X177,X178,X179] :
      ( ( a_select2(mu_init,pv40) = init
        | ~ epred1_0 )
      & ( leq(n0,pv40)
        | ~ epred1_0 )
      & ( leq(n0,pv46)
        | ~ epred1_0 )
      & ( leq(pv40,n4)
        | ~ epred1_0 )
      & ( leq(pv46,n135299)
        | ~ epred1_0 )
      & ( ~ leq(n0,X171)
        | ~ leq(X171,n135299)
        | ~ leq(n0,X172)
        | ~ leq(X172,n4)
        | a_select3(q_init,X171,X172) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X173)
        | ~ leq(X173,n4)
        | a_select2(rho_init,X173) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X174)
        | ~ leq(X174,pred(pv40))
        | a_select2(mu_init,X174) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X175)
        | ~ leq(X175,pred(pv40))
        | a_select2(sigma_init,X175) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X176)
        | ~ leq(X176,n4)
        | a_select3(center_init,X176,n0) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X177)
        | ~ leq(X177,n4)
        | a_select2(muold_init,X177) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X178)
        | ~ leq(X178,n4)
        | a_select2(rhoold_init,X178) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X179)
        | ~ leq(X179,n4)
        | a_select2(sigmaold_init,X179) = init
        | ~ epred1_0 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_5,negated_conjecture,
    ( epred1_0
    & a_select3(q_init,pv46,pv40) != init ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( a_select3(q_init,X1,X2) = init
    | ~ leq(n0,X1)
    | ~ leq(X1,n135299)
    | ~ leq(n0,X2)
    | ~ leq(X2,n4)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    epred1_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( leq(pv40,n4)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    ( leq(pv46,n135299)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,plain,
    ( leq(n0,pv40)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,plain,
    ( leq(n0,pv46)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_12,negated_conjecture,
    a_select3(q_init,pv46,pv40) != init,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,plain,
    ( a_select3(q_init,X1,X2) = init
    | ~ leq(X2,n4)
    | ~ leq(X1,n135299)
    | ~ leq(n0,X2)
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

cnf(c_0_14,plain,
    leq(pv40,n4),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).

cnf(c_0_15,plain,
    leq(pv46,n135299),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7])]) ).

cnf(c_0_16,plain,
    leq(n0,pv40),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).

cnf(c_0_17,plain,
    leq(n0,pv46),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWV168+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n017.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Tue Oct  3 02:39:26 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.42  Running first-order model finding
% 0.16/0.42  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Jrle6hzKIe/E---3.1_26808.p
% 0.16/0.47  # Version: 3.1pre001
% 0.16/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47  # Starting sh5l with 300s (1) cores
% 0.16/0.47  # sh5l with pid 26888 completed with status 0
% 0.16/0.47  # Result found by sh5l
% 0.16/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47  # Starting sh5l with 300s (1) cores
% 0.16/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47  # Search class: FGUSM-FSLM33-DFFFFFNN
% 0.16/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 150s (1) cores
% 0.16/0.47  # SAT001_MinMin_p005000_rr_RG with pid 26891 completed with status 0
% 0.16/0.47  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47  # Starting sh5l with 300s (1) cores
% 0.16/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47  # Search class: FGUSM-FSLM33-DFFFFFNN
% 0.16/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 150s (1) cores
% 0.16/0.47  # Preprocessing time       : 0.003 s
% 0.16/0.47  # Presaturation interreduction done
% 0.16/0.47  
% 0.16/0.47  # Proof found!
% 0.16/0.47  # SZS status Theorem
% 0.16/0.47  # SZS output start CNFRefutation
% See solution above
% 0.16/0.47  # Parsed axioms                        : 92
% 0.16/0.47  # Removed by relevancy pruning/SinE    : 8
% 0.16/0.47  # Initial clauses                      : 176
% 0.16/0.47  # Removed in clause preprocessing      : 0
% 0.16/0.47  # Initial clauses in saturation        : 176
% 0.16/0.47  # Processed clauses                    : 534
% 0.16/0.47  # ...of these trivial                  : 5
% 0.16/0.47  # ...subsumed                          : 147
% 0.16/0.47  # ...remaining for further processing  : 382
% 0.16/0.47  # Other redundant clauses eliminated   : 3
% 0.16/0.47  # Clauses deleted for lack of memory   : 0
% 0.16/0.47  # Backward-subsumed                    : 0
% 0.16/0.47  # Backward-rewritten                   : 7
% 0.16/0.47  # Generated clauses                    : 588
% 0.16/0.47  # ...of the previous two non-redundant : 518
% 0.16/0.47  # ...aggressively subsumed             : 0
% 0.16/0.47  # Contextual simplify-reflections      : 0
% 0.16/0.47  # Paramodulations                      : 584
% 0.16/0.47  # Factorizations                       : 2
% 0.16/0.47  # NegExts                              : 0
% 0.16/0.47  # Equation resolutions                 : 3
% 0.16/0.47  # Total rewrite steps                  : 326
% 0.16/0.47  # Propositional unsat checks           : 0
% 0.16/0.47  #    Propositional check models        : 0
% 0.16/0.47  #    Propositional check unsatisfiable : 0
% 0.16/0.47  #    Propositional clauses             : 0
% 0.16/0.47  #    Propositional clauses after purity: 0
% 0.16/0.47  #    Propositional unsat core size     : 0
% 0.16/0.47  #    Propositional preprocessing time  : 0.000
% 0.16/0.47  #    Propositional encoding time       : 0.000
% 0.16/0.47  #    Propositional solver time         : 0.000
% 0.16/0.47  #    Success case prop preproc time    : 0.000
% 0.16/0.47  #    Success case prop encoding time   : 0.000
% 0.16/0.47  #    Success case prop solver time     : 0.000
% 0.16/0.47  # Current number of processed clauses  : 197
% 0.16/0.47  #    Positive orientable unit clauses  : 102
% 0.16/0.47  #    Positive unorientable unit clauses: 3
% 0.16/0.47  #    Negative unit clauses             : 64
% 0.16/0.47  #    Non-unit-clauses                  : 28
% 0.16/0.47  # Current number of unprocessed clauses: 336
% 0.16/0.47  # ...number of literals in the above   : 941
% 0.16/0.47  # Current number of archived formulas  : 0
% 0.16/0.47  # Current number of archived clauses   : 183
% 0.16/0.47  # Clause-clause subsumption calls (NU) : 2901
% 0.16/0.47  # Rec. Clause-clause subsumption calls : 728
% 0.16/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.16/0.47  # Unit Clause-clause subsumption calls : 1171
% 0.16/0.47  # Rewrite failures with RHS unbound    : 0
% 0.16/0.47  # BW rewrite match attempts            : 23
% 0.16/0.47  # BW rewrite match successes           : 17
% 0.16/0.47  # Condensation attempts                : 0
% 0.16/0.47  # Condensation successes               : 0
% 0.16/0.47  # Termbank termtop insertions          : 17619
% 0.16/0.47  
% 0.16/0.47  # -------------------------------------------------
% 0.16/0.47  # User time                : 0.033 s
% 0.16/0.47  # System time              : 0.005 s
% 0.16/0.47  # Total time               : 0.038 s
% 0.16/0.47  # Maximum resident set size: 2384 pages
% 0.16/0.47  
% 0.16/0.47  # -------------------------------------------------
% 0.16/0.47  # User time                : 0.038 s
% 0.16/0.47  # System time              : 0.005 s
% 0.16/0.47  # Total time               : 0.043 s
% 0.16/0.47  # Maximum resident set size: 1804 pages
% 0.16/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------