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

View Problem - Process Solution

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

% Computer : n015.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:17 EDT 2023

% Result   : Timeout 507.00s 300.08s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :  168 (  38 equ)
%            Maximal formula atoms :   43 (  11 avg)
%            Number of connectives :  195 (  42   ~;  39   |;  72   &)
%                                         (   1 <=>;  41  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   25 (   7 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;  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_init_0066,conjecture,
    ( ( leq(n0,pv40)
      & leq(pv40,n4)
      & gt(loopcounter,n1)
      & ! [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 ) ) )
   => ! [X11] :
        ( ( leq(n0,X11)
          & leq(X11,n4) )
       => a_select2(sigmaold_init,X11) = init ) ),
    file('/export/starexec/sandbox2/tmp/tmp.KkAvwEbHum/E---3.1_28501.p',cl5_nebula_init_0066) ).

fof(c_0_1,plain,
    ( epred1_0
  <=> ( leq(n0,pv40)
      & leq(pv40,n4)
      & gt(loopcounter,n1)
      & ! [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
   => ( leq(n0,pv40)
      & leq(pv40,n4)
      & gt(loopcounter,n1)
      & ! [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
     => ! [X11] :
          ( ( leq(n0,X11)
            & leq(X11,n4) )
         => a_select2(sigmaold_init,X11) = init ) ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cl5_nebula_init_0066]),c_0_1]) ).

fof(c_0_4,plain,
    ! [X74,X75,X76,X77,X78,X79,X80,X81,X82] :
      ( ( leq(n0,pv40)
        | ~ epred1_0 )
      & ( leq(pv40,n4)
        | ~ epred1_0 )
      & ( gt(loopcounter,n1)
        | ~ epred1_0 )
      & ( ~ leq(n0,X74)
        | ~ leq(X74,n135299)
        | ~ leq(n0,X75)
        | ~ leq(X75,n4)
        | a_select3(q_init,X74,X75) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X76)
        | ~ leq(X76,n4)
        | a_select2(rho_init,X76) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X77)
        | ~ leq(X77,pred(pv40))
        | a_select2(mu_init,X77) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X78)
        | ~ leq(X78,pred(pv40))
        | a_select2(sigma_init,X78) = init
        | ~ epred1_0 )
      & ( ~ leq(n0,X79)
        | ~ leq(X79,n4)
        | a_select3(center_init,X79,n0) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X80)
        | ~ leq(X80,n4)
        | a_select2(muold_init,X80) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X81)
        | ~ leq(X81,n4)
        | a_select2(rhoold_init,X81) = init
        | ~ epred1_0 )
      & ( ~ gt(loopcounter,n1)
        | ~ leq(n0,X82)
        | ~ leq(X82,n4)
        | a_select2(sigmaold_init,X82) = 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
    & leq(n0,esk1_0)
    & leq(esk1_0,n4)
    & a_select2(sigmaold_init,esk1_0) != init ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_6,plain,
    ( gt(loopcounter,n1)
    | ~ 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,
    ( a_select2(sigmaold_init,X1) = init
    | ~ gt(loopcounter,n1)
    | ~ leq(n0,X1)
    | ~ leq(X1,n4)
    | ~ epred1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    gt(loopcounter,n1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

cnf(c_0_10,plain,
    ( a_select2(sigmaold_init,X1) = init
    | ~ leq(X1,n4)
    | ~ leq(n0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9])]) ).

cnf(c_0_11,negated_conjecture,
    leq(esk1_0,n4),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    a_select2(sigmaold_init,esk1_0) != init,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]),c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SWV178+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n015.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Tue Oct  3 04:17:46 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  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.KkAvwEbHum/E---3.1_28501.p
% 507.00/300.08  # Version: 3.1pre001
% 507.00/300.08  # Preprocessing class: FSLSSMSMSSSNFFN.
% 507.00/300.08  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 507.00/300.08  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 507.00/300.08  # Starting new_bool_3 with 300s (1) cores
% 507.00/300.08  # Starting new_bool_1 with 300s (1) cores
% 507.00/300.08  # Starting sh5l with 300s (1) cores
% 507.00/300.08  # new_bool_3 with pid 28612 completed with status 0
% 507.00/300.08  # Result found by new_bool_3
% 507.00/300.08  # Preprocessing class: FSLSSMSMSSSNFFN.
% 507.00/300.08  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 507.00/300.08  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 507.00/300.08  # Starting new_bool_3 with 300s (1) cores
% 507.00/300.08  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 507.00/300.08  # Search class: FGUSM-FFMM31-MFFFFFNN
% 507.00/300.08  # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 507.00/300.08  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 507.00/300.08  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 507.00/300.08  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 28615 completed with status 0
% 507.00/300.08  # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 507.00/300.08  # Preprocessing class: FSLSSMSMSSSNFFN.
% 507.00/300.08  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 507.00/300.08  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 507.00/300.08  # Starting new_bool_3 with 300s (1) cores
% 507.00/300.08  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 507.00/300.08  # Search class: FGUSM-FFMM31-MFFFFFNN
% 507.00/300.08  # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 507.00/300.08  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 507.00/300.08  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 507.00/300.08  # Preprocessing time       : 0.003 s
% 507.00/300.08  # Presaturation interreduction done
% 507.00/300.08  
% 507.00/300.08  # Proof found!
% 507.00/300.08  # SZS status Theorem
% 507.00/300.08  # SZS output start CNFRefutation
% See solution above
% 507.00/300.08  # Parsed axioms                        : 92
% 507.00/300.08  # Removed by relevancy pruning/SinE    : 26
% 507.00/300.08  # Initial clauses                      : 83
% 507.00/300.08  # Removed in clause preprocessing      : 0
% 507.00/300.08  # Initial clauses in saturation        : 83
% 507.00/300.08  # Processed clauses                    : 133
% 507.00/300.08  # ...of these trivial                  : 0
% 507.00/300.08  # ...subsumed                          : 0
% 507.00/300.08  # ...remaining for further processing  : 133
% 507.00/300.08  # Other redundant clauses eliminated   : 0
% 507.00/300.08  # Clauses deleted for lack of memory   : 0
% 507.00/300.08  # Backward-subsumed                    : 0
% 507.00/300.08  # Backward-rewritten                   : 0
% 507.00/300.08  # Generated clauses                    : 46
% 507.00/300.08  # ...of the previous two non-redundant : 37
% 507.00/300.08  # ...aggressively subsumed             : 0
% 507.00/300.08  # Contextual simplify-reflections      : 0
% 507.00/300.08  # Paramodulations                      : 46
% 507.00/300.08  # Factorizations                       : 0
% 507.00/300.08  # NegExts                              : 0
% 507.00/300.08  # Equation resolutions                 : 0
% 507.00/300.08  # Total rewrite steps                  : 32
% 507.00/300.08  # Propositional unsat checks           : 0
% 507.00/300.08  #    Propositional check models        : 0
% 507.00/300.08  #    Propositional check unsatisfiable : 0
% 507.00/300.08  #    Propositional clauses             : 0
% 507.00/300.08  #    Propositional clauses after purity: 0
% 507.00/300.08  #    Propositional unsat core size     : 0
% 507.00/300.08  #    Propositional preprocessing time  : 0.000
% 507.00/300.08  #    Propositional encoding time       : 0.000
% 507.00/300.08  #    Propositional solver time         : 0.000
% 507.00/300.08  #    Success case prop preproc time    : 0.000
% 507.00/300.08  #    Success case prop encoding time   : 0.000
% 507.00/300.08  #    Success case prop solver time     : 0.000
% 507.00/300.08  # Current number of processed clauses  : 50
% 507.00/300.08  #    Positive orientable unit clauses  : 45
% 507.00/300.08  #    Positive unorientable unit clauses: 0
% 507.00/300.08  #    Negative unit clauses             : 2
% 507.00/300.08  #    Non-unit-clauses                  : 3
% 507.00/300.08  # Current number of unprocessed clauses: 70
% 507.00/300.08  # ...number of literals in the above   : 127
% 507.00/300.08  # Current number of archived formulas  : 0
% 507.00/300.08  # Current number of archived clauses   : 83
% 507.00/300.08  # Clause-clause subsumption calls (NU) : 85
% 507.00/300.08  # Rec. Clause-clause subsumption calls : 18
% 507.00/300.08  # Non-unit clause-clause subsumptions  : 0
% 507.00/300.08  # Unit Clause-clause subsumption calls : 0
% 507.00/300.08  # Rewrite failures with RHS unbound    : 0
% 507.00/300.08  # BW rewrite match attempts            : 11
% 507.00/300.08  # BW rewrite match successes           : 1
% 507.00/300.08  # Condensation attempts                : 0
% 507.00/300.08  # Condensation successes               : 0
% 507.00/300.08  # Termbank termtop insertions          : 4660
% 507.00/300.08  
% 507.00/300.08  # -------------------------------------------------
% 507.00/300.08  # User time                : 0.008 s
% 507.00/300.08  # System time              : 0.003 s
% 507.00/300.08  # Total time               : 0.011 s
% 507.00/300.08  # Maximum resident set size: 2092 pages
% 507.00/300.08  
% 507.00/300.08  # -------------------------------------------------
% 507.00/300.08  # User time                : 0.009 s
% 507.00/300.08  # System time              : 0.006 s
% 507.00/300.08  # Total time               : 0.016 s
% 507.00/300.08  # Maximum resident set size: 1808 pages
% 507.00/300.08  % E---3.1 exiting
%------------------------------------------------------------------------------