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

View Problem - Process Solution

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

% Computer : n009.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:14 EDT 2023

% Result   : Theorem 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   4 unt;   0 def)
%            Number of atoms       :   52 (  17 equ)
%            Maximal formula atoms :   15 (   6 avg)
%            Number of connectives :   56 (  12   ~;   6   |;  28   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   6 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   26 (  26 usr;  17 con; 0-3 aty)
%            Number of variables   :    9 (   0 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0009,conjecture,
    ( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
      & leq(n0,pv10)
      & leq(n0,pv47)
      & leq(pv10,n135299)
      & leq(pv47,n4)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,pred(pv47)) )
         => a_select3(q,pv10,X14) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X14)),minus(a_select2(x,pv10),a_select2(mu,X14))),tptp_minus_2),times(a_select2(sigma,X14),a_select2(sigma,X14)))),a_select2(rho,X14)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X14))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
      & ! [X18] :
          ( ( leq(n0,X18)
            & leq(X18,pred(pv10)) )
         => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
   => ! [X4] :
        ( ( leq(n0,X4)
          & leq(X4,pred(pv10)) )
       => ( pv10 != X4
         => sum(n0,n4,a_select3(q,X4,tptp_sum_index)) = n1 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ibFdVlyc1E/E---3.1_15001.p',cl5_nebula_norm_0009) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
        & leq(n0,pv10)
        & leq(n0,pv47)
        & leq(pv10,n135299)
        & leq(pv47,n4)
        & ! [X14] :
            ( ( leq(n0,X14)
              & leq(X14,pred(pv47)) )
           => a_select3(q,pv10,X14) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X14)),minus(a_select2(x,pv10),a_select2(mu,X14))),tptp_minus_2),times(a_select2(sigma,X14),a_select2(sigma,X14)))),a_select2(rho,X14)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X14))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
        & ! [X18] :
            ( ( leq(n0,X18)
              & leq(X18,pred(pv10)) )
           => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) )
     => ! [X4] :
          ( ( leq(n0,X4)
            & leq(X4,pred(pv10)) )
         => ( pv10 != X4
           => sum(n0,n4,a_select3(q,X4,tptp_sum_index)) = n1 ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_norm_0009]) ).

fof(c_0_2,negated_conjecture,
    ! [X28,X29] :
      ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
      & leq(n0,pv10)
      & leq(n0,pv47)
      & leq(pv10,n135299)
      & leq(pv47,n4)
      & ( ~ leq(n0,X28)
        | ~ leq(X28,pred(pv47))
        | a_select3(q,pv10,X28) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X28)),minus(a_select2(x,pv10),a_select2(mu,X28))),tptp_minus_2),times(a_select2(sigma,X28),a_select2(sigma,X28)))),a_select2(rho,X28)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X28))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
      & ( ~ leq(n0,X29)
        | ~ leq(X29,pred(pv10))
        | sum(n0,n4,a_select3(q,X29,tptp_sum_index)) = n1 )
      & leq(n0,esk1_0)
      & leq(esk1_0,pred(pv10))
      & pv10 != esk1_0
      & sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1 ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    sum(n0,n4,a_select3(q,esk1_0,tptp_sum_index)) != n1,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
    | ~ leq(n0,X1)
    | ~ leq(X1,pred(pv10)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    leq(esk1_0,pred(pv10)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : SWV159+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n009.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Tue Oct  3 04:29:29 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.15/0.40  Running first-order model finding
% 0.15/0.40  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.ibFdVlyc1E/E---3.1_15001.p
% 0.15/0.43  # Version: 3.1pre001
% 0.15/0.43  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # new_bool_3 with pid 15080 completed with status 0
% 0.15/0.43  # Result found by new_bool_3
% 0.15/0.43  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.15/0.43  # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.15/0.43  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 15083 completed with status 0
% 0.15/0.43  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.43  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43  # Search class: FGUSM-FFMM31-DFFFFFNN
% 0.15/0.43  # partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 100s (1) cores
% 0.15/0.43  # Preprocessing time       : 0.002 s
% 0.15/0.43  # Presaturation interreduction done
% 0.15/0.43  
% 0.15/0.43  # Proof found!
% 0.15/0.43  # SZS status Theorem
% 0.15/0.43  # SZS output start CNFRefutation
% See solution above
% 0.15/0.43  # Parsed axioms                        : 100
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 23
% 0.15/0.43  # Initial clauses                      : 90
% 0.15/0.43  # Removed in clause preprocessing      : 0
% 0.15/0.43  # Initial clauses in saturation        : 90
% 0.15/0.43  # Processed clauses                    : 204
% 0.15/0.43  # ...of these trivial                  : 0
% 0.15/0.43  # ...subsumed                          : 0
% 0.15/0.43  # ...remaining for further processing  : 204
% 0.15/0.43  # Other redundant clauses eliminated   : 0
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 0
% 0.15/0.43  # Backward-rewritten                   : 1
% 0.15/0.43  # Generated clauses                    : 258
% 0.15/0.43  # ...of the previous two non-redundant : 197
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 0
% 0.15/0.43  # Paramodulations                      : 256
% 0.15/0.43  # Factorizations                       : 2
% 0.15/0.43  # NegExts                              : 0
% 0.15/0.43  # Equation resolutions                 : 0
% 0.15/0.43  # Total rewrite steps                  : 126
% 0.15/0.43  # Propositional unsat checks           : 0
% 0.15/0.43  #    Propositional check models        : 0
% 0.15/0.43  #    Propositional check unsatisfiable : 0
% 0.15/0.43  #    Propositional clauses             : 0
% 0.15/0.43  #    Propositional clauses after purity: 0
% 0.15/0.43  #    Propositional unsat core size     : 0
% 0.15/0.43  #    Propositional preprocessing time  : 0.000
% 0.15/0.43  #    Propositional encoding time       : 0.000
% 0.15/0.43  #    Propositional solver time         : 0.000
% 0.15/0.43  #    Success case prop preproc time    : 0.000
% 0.15/0.43  #    Success case prop encoding time   : 0.000
% 0.15/0.43  #    Success case prop solver time     : 0.000
% 0.15/0.43  # Current number of processed clauses  : 113
% 0.15/0.43  #    Positive orientable unit clauses  : 80
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 3
% 0.15/0.43  #    Non-unit-clauses                  : 30
% 0.15/0.43  # Current number of unprocessed clauses: 168
% 0.15/0.43  # ...number of literals in the above   : 378
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 91
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 264
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 147
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.43  # Unit Clause-clause subsumption calls : 6
% 0.15/0.43  # Rewrite failures with RHS unbound    : 0
% 0.15/0.43  # BW rewrite match attempts            : 13
% 0.15/0.43  # BW rewrite match successes           : 1
% 0.15/0.43  # Condensation attempts                : 0
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 6966
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.008 s
% 0.15/0.43  # System time              : 0.005 s
% 0.15/0.43  # Total time               : 0.013 s
% 0.15/0.43  # Maximum resident set size: 2088 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.011 s
% 0.15/0.43  # System time              : 0.006 s
% 0.15/0.43  # Total time               : 0.017 s
% 0.15/0.43  # Maximum resident set size: 1808 pages
% 0.15/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------