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

View Problem - Process Solution

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

% Computer : n025.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:55:57 EDT 2023

% Result   : Timeout 0.35s 300.28s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (  17 unt;   0 def)
%            Number of atoms       :   35 (  34 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   22 (   8   ~;   4   |;   8   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   23 (  23 usr;  15 con; 0-3 aty)
%            Number of variables   :   10 (   1 sgn;   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0022,conjecture,
    ( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
      & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) )
   => ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
      & pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
      & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.nfBH8cFCHN/E---3.1_1125.p',cl5_nebula_norm_0022) ).

fof(pred_succ,axiom,
    ! [X1] : pred(succ(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.nfBH8cFCHN/E---3.1_1125.p',pred_succ) ).

fof(pred_minus_1,axiom,
    ! [X1] : minus(X1,n1) = pred(X1),
    file('/export/starexec/sandbox2/tmp/tmp.nfBH8cFCHN/E---3.1_1125.p',pred_minus_1) ).

fof(succ_tptp_minus_1,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox2/tmp/tmp.nfBH8cFCHN/E---3.1_1125.p',succ_tptp_minus_1) ).

fof(sum_plus_base,axiom,
    ! [X23] : sum(n0,tptp_minus_1,X23) = n0,
    file('/export/starexec/sandbox2/tmp/tmp.nfBH8cFCHN/E---3.1_1125.p',sum_plus_base) ).

fof(c_0_5,negated_conjecture,
    ~ ( ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
        & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) )
     => ( n0 = sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
        & pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
        & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_norm_0022]) ).

fof(c_0_6,plain,
    ! [X59] : pred(succ(X59)) = X59,
    inference(variable_rename,[status(thm)],[pred_succ]) ).

fof(c_0_7,plain,
    ! [X39] : minus(X39,n1) = pred(X39),
    inference(variable_rename,[status(thm)],[pred_minus_1]) ).

fof(c_0_8,negated_conjecture,
    ( pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
    & pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89)))))
    & ( n0 != sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
      | pv86 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
      | pv88 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ) ),
    inference(fof_nnf,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    pred(succ(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    minus(X1,n1) = pred(X1),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( n0 != sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91)))))
    | pv86 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87)))))
    | pv88 != sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    pv86 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(mu,pv87),a_select2(muold,pv87))),plus(abs(a_select2(mu,pv87)),abs(a_select2(muold,pv87))))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    pv88 = sum(n0,minus(n5,n1),divide(abs(minus(a_select2(rho,pv89),a_select2(rhoold,pv89))),plus(abs(a_select2(rho,pv89)),abs(a_select2(rhoold,pv89))))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    minus(succ(X1),n1) = X1,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    succ(tptp_minus_1) = n0,
    inference(split_conjunct,[status(thm)],[succ_tptp_minus_1]) ).

fof(c_0_16,plain,
    ! [X28] : sum(n0,tptp_minus_1,X28) = n0,
    inference(variable_rename,[status(thm)],[sum_plus_base]) ).

cnf(c_0_17,negated_conjecture,
    sum(n0,minus(n0,n1),divide(abs(minus(a_select2(sigma,pv91),a_select2(sigmaold,pv91))),plus(abs(a_select2(sigma,pv91)),abs(a_select2(sigmaold,pv91))))) != n0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).

cnf(c_0_18,plain,
    minus(n0,n1) = tptp_minus_1,
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    sum(n0,tptp_minus_1,X1) = n0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV050+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Oct  3 03:26:36 EDT 2023
% 0.13/0.33  % CPUTime    : 
% 0.18/0.46  Running first-order model finding
% 0.18/0.46  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.nfBH8cFCHN/E---3.1_1125.p
% 0.35/300.28  # Version: 3.1pre001
% 0.35/300.28  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/300.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.28  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/300.28  # Starting new_bool_3 with 300s (1) cores
% 0.35/300.28  # Starting new_bool_1 with 300s (1) cores
% 0.35/300.28  # Starting sh5l with 300s (1) cores
% 0.35/300.28  # new_bool_3 with pid 1220 completed with status 0
% 0.35/300.28  # Result found by new_bool_3
% 0.35/300.28  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/300.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.28  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/300.28  # Starting new_bool_3 with 300s (1) cores
% 0.35/300.28  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/300.28  # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.35/300.28  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.35/300.28  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.35/300.28  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 1227 completed with status 0
% 0.35/300.28  # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.35/300.28  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.35/300.28  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/300.28  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.35/300.28  # Starting new_bool_3 with 300s (1) cores
% 0.35/300.28  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.35/300.28  # Search class: FGHSM-FFMM31-MFFFFFNN
% 0.35/300.28  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.35/300.28  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.35/300.28  # Preprocessing time       : 0.002 s
% 0.35/300.28  # Presaturation interreduction done
% 0.35/300.28  
% 0.35/300.28  # Proof found!
% 0.35/300.28  # SZS status Theorem
% 0.35/300.28  # SZS output start CNFRefutation
% See solution above
% 0.35/300.28  # Parsed axioms                        : 85
% 0.35/300.28  # Removed by relevancy pruning/SinE    : 23
% 0.35/300.28  # Initial clauses                      : 67
% 0.35/300.28  # Removed in clause preprocessing      : 0
% 0.35/300.28  # Initial clauses in saturation        : 67
% 0.35/300.28  # Processed clauses                    : 138
% 0.35/300.28  # ...of these trivial                  : 0
% 0.35/300.28  # ...subsumed                          : 0
% 0.35/300.28  # ...remaining for further processing  : 138
% 0.35/300.28  # Other redundant clauses eliminated   : 0
% 0.35/300.28  # Clauses deleted for lack of memory   : 0
% 0.35/300.28  # Backward-subsumed                    : 0
% 0.35/300.28  # Backward-rewritten                   : 3
% 0.35/300.28  # Generated clauses                    : 169
% 0.35/300.28  # ...of the previous two non-redundant : 130
% 0.35/300.28  # ...aggressively subsumed             : 0
% 0.35/300.28  # Contextual simplify-reflections      : 0
% 0.35/300.28  # Paramodulations                      : 167
% 0.35/300.28  # Factorizations                       : 2
% 0.35/300.28  # NegExts                              : 0
% 0.35/300.28  # Equation resolutions                 : 0
% 0.35/300.28  # Total rewrite steps                  : 106
% 0.35/300.28  # Propositional unsat checks           : 0
% 0.35/300.28  #    Propositional check models        : 0
% 0.35/300.28  #    Propositional check unsatisfiable : 0
% 0.35/300.28  #    Propositional clauses             : 0
% 0.35/300.28  #    Propositional clauses after purity: 0
% 0.35/300.28  #    Propositional unsat core size     : 0
% 0.35/300.28  #    Propositional preprocessing time  : 0.000
% 0.35/300.28  #    Propositional encoding time       : 0.000
% 0.35/300.28  #    Propositional solver time         : 0.000
% 0.35/300.28  #    Success case prop preproc time    : 0.000
% 0.35/300.28  #    Success case prop encoding time   : 0.000
% 0.35/300.28  #    Success case prop solver time     : 0.000
% 0.35/300.28  # Current number of processed clauses  : 68
% 0.35/300.28  #    Positive orientable unit clauses  : 46
% 0.35/300.28  #    Positive unorientable unit clauses: 1
% 0.35/300.28  #    Negative unit clauses             : 1
% 0.35/300.28  #    Non-unit-clauses                  : 20
% 0.35/300.28  # Current number of unprocessed clauses: 126
% 0.35/300.28  # ...number of literals in the above   : 203
% 0.35/300.28  # Current number of archived formulas  : 0
% 0.35/300.28  # Current number of archived clauses   : 70
% 0.35/300.28  # Clause-clause subsumption calls (NU) : 171
% 0.35/300.28  # Rec. Clause-clause subsumption calls : 46
% 0.35/300.28  # Non-unit clause-clause subsumptions  : 0
% 0.35/300.28  # Unit Clause-clause subsumption calls : 6
% 0.35/300.28  # Rewrite failures with RHS unbound    : 0
% 0.35/300.28  # BW rewrite match attempts            : 9
% 0.35/300.28  # BW rewrite match successes           : 3
% 0.35/300.28  # Condensation attempts                : 0
% 0.35/300.28  # Condensation successes               : 0
% 0.35/300.28  # Termbank termtop insertions          : 5417
% 0.35/300.28  
% 0.35/300.28  # -------------------------------------------------
% 0.35/300.28  # User time                : 0.009 s
% 0.35/300.28  # System time              : 0.003 s
% 0.35/300.28  # Total time               : 0.013 s
% 0.35/300.28  # Maximum resident set size: 1912 pages
% 0.35/300.28  
% 0.35/300.28  # -------------------------------------------------
% 0.35/300.28  # User time                : 0.013 s
% 0.35/300.28  # System time              : 0.005 s
% 0.35/300.28  # Total time               : 0.018 s
% 0.35/300.28  # Maximum resident set size: 1788 pages
% 0.35/300.28  % E---3.1 exiting
%------------------------------------------------------------------------------