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

View Problem - Process Solution

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

% Computer : n026.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.17s 0.46s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   57 (  17 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   54 (  15   ~;  13   |;  18   &)
%                                         (   1 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-3 aty)
%            Number of variables   :   20 (   0 sgn;  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0011,conjecture,
    ( ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
      & leq(n0,pv10)
      & leq(pv10,n135299)
      & ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,pred(pv10)) )
         => sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ) )
   => ! [X18] :
        ( ( leq(n0,X18)
          & leq(X18,pv10) )
       => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.nC07PEZOb7/E---3.1_917.p',cl5_nebula_norm_0011) ).

fof(leq_gt_pred,axiom,
    ! [X1,X2] :
      ( leq(X1,pred(X2))
    <=> gt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.nC07PEZOb7/E---3.1_917.p',leq_gt_pred) ).

fof(leq_gt2,axiom,
    ! [X1,X2] :
      ( ( leq(X1,X2)
        & X1 != X2 )
     => gt(X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.nC07PEZOb7/E---3.1_917.p',leq_gt2) ).

fof(c_0_3,negated_conjecture,
    ~ ( ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
        & leq(n0,pv10)
        & leq(pv10,n135299)
        & ! [X14] :
            ( ( leq(n0,X14)
              & leq(X14,pred(pv10)) )
           => sum(n0,n4,a_select3(q,X14,tptp_sum_index)) = n1 ) )
     => ! [X18] :
          ( ( leq(n0,X18)
            & leq(X18,pv10) )
         => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_norm_0011]) ).

fof(c_0_4,negated_conjecture,
    ! [X28] :
      ( sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1
      & leq(n0,pv10)
      & leq(pv10,n135299)
      & ( ~ leq(n0,X28)
        | ~ leq(X28,pred(pv10))
        | sum(n0,n4,a_select3(q,X28,tptp_sum_index)) = n1 )
      & leq(n0,esk1_0)
      & leq(esk1_0,pv10)
      & 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_3])])])]) ).

fof(c_0_5,plain,
    ! [X55,X56] :
      ( ( ~ leq(X55,pred(X56))
        | gt(X56,X55) )
      & ( ~ gt(X56,X55)
        | leq(X55,pred(X56)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt_pred])]) ).

fof(c_0_6,plain,
    ! [X45,X46] :
      ( ~ leq(X45,X46)
      | X45 = X46
      | gt(X46,X45) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_gt2])]) ).

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

cnf(c_0_8,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_4]) ).

cnf(c_0_9,negated_conjecture,
    leq(n0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,plain,
    ( leq(X2,pred(X1))
    | ~ gt(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | gt(X2,X1)
    | ~ leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ~ leq(esk1_0,pred(pv10)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | leq(X1,pred(X2))
    | ~ leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    leq(esk1_0,pv10),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_15,negated_conjecture,
    esk1_0 = pv10,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).

cnf(c_0_16,negated_conjecture,
    sum(n0,n4,a_select3(q,pv10,tptp_sum_index)) = n1,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SWV161+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n026.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Oct  3 04:55:29 EDT 2023
% 0.11/0.32  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.nC07PEZOb7/E---3.1_917.p
% 0.17/0.46  # Version: 3.1pre001
% 0.17/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # Starting sh5l with 300s (1) cores
% 0.17/0.46  # new_bool_3 with pid 1008 completed with status 0
% 0.17/0.46  # Result found by new_bool_3
% 0.17/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.17/0.46  # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.17/0.46  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.17/0.46  # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 1011 completed with status 0
% 0.17/0.46  # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.17/0.46  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGUSM-FFMM32-MFFFFFNN
% 0.17/0.46  # partial match(1): FGHSM-FFMM32-MFFFFFNN
% 0.17/0.46  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.17/0.46  # Preprocessing time       : 0.001 s
% 0.17/0.46  
% 0.17/0.46  # Proof found!
% 0.17/0.46  # SZS status Theorem
% 0.17/0.46  # SZS output start CNFRefutation
% See solution above
% 0.17/0.46  # Parsed axioms                        : 92
% 0.17/0.46  # Removed by relevancy pruning/SinE    : 25
% 0.17/0.46  # Initial clauses                      : 76
% 0.17/0.46  # Removed in clause preprocessing      : 0
% 0.17/0.46  # Initial clauses in saturation        : 76
% 0.17/0.46  # Processed clauses                    : 622
% 0.17/0.46  # ...of these trivial                  : 26
% 0.17/0.46  # ...subsumed                          : 287
% 0.17/0.46  # ...remaining for further processing  : 309
% 0.17/0.46  # Other redundant clauses eliminated   : 0
% 0.17/0.46  # Clauses deleted for lack of memory   : 0
% 0.17/0.46  # Backward-subsumed                    : 0
% 0.17/0.46  # Backward-rewritten                   : 7
% 0.17/0.46  # Generated clauses                    : 1304
% 0.17/0.46  # ...of the previous two non-redundant : 1026
% 0.17/0.46  # ...aggressively subsumed             : 0
% 0.17/0.46  # Contextual simplify-reflections      : 0
% 0.17/0.46  # Paramodulations                      : 1302
% 0.17/0.46  # Factorizations                       : 2
% 0.17/0.46  # NegExts                              : 0
% 0.17/0.46  # Equation resolutions                 : 0
% 0.17/0.46  # Total rewrite steps                  : 852
% 0.17/0.46  # Propositional unsat checks           : 0
% 0.17/0.46  #    Propositional check models        : 0
% 0.17/0.46  #    Propositional check unsatisfiable : 0
% 0.17/0.46  #    Propositional clauses             : 0
% 0.17/0.46  #    Propositional clauses after purity: 0
% 0.17/0.46  #    Propositional unsat core size     : 0
% 0.17/0.46  #    Propositional preprocessing time  : 0.000
% 0.17/0.46  #    Propositional encoding time       : 0.000
% 0.17/0.46  #    Propositional solver time         : 0.000
% 0.17/0.46  #    Success case prop preproc time    : 0.000
% 0.17/0.46  #    Success case prop encoding time   : 0.000
% 0.17/0.46  #    Success case prop solver time     : 0.000
% 0.17/0.46  # Current number of processed clauses  : 302
% 0.17/0.46  #    Positive orientable unit clauses  : 115
% 0.17/0.46  #    Positive unorientable unit clauses: 0
% 0.17/0.46  #    Negative unit clauses             : 108
% 0.17/0.46  #    Non-unit-clauses                  : 79
% 0.17/0.46  # Current number of unprocessed clauses: 477
% 0.17/0.46  # ...number of literals in the above   : 1115
% 0.17/0.46  # Current number of archived formulas  : 0
% 0.17/0.46  # Current number of archived clauses   : 7
% 0.17/0.46  # Clause-clause subsumption calls (NU) : 438
% 0.17/0.46  # Rec. Clause-clause subsumption calls : 353
% 0.17/0.46  # Non-unit clause-clause subsumptions  : 20
% 0.17/0.46  # Unit Clause-clause subsumption calls : 3149
% 0.17/0.46  # Rewrite failures with RHS unbound    : 0
% 0.17/0.46  # BW rewrite match attempts            : 48
% 0.17/0.46  # BW rewrite match successes           : 1
% 0.17/0.46  # Condensation attempts                : 0
% 0.17/0.46  # Condensation successes               : 0
% 0.17/0.46  # Termbank termtop insertions          : 14827
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.023 s
% 0.17/0.46  # System time              : 0.001 s
% 0.17/0.46  # Total time               : 0.024 s
% 0.17/0.46  # Maximum resident set size: 1912 pages
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.024 s
% 0.17/0.46  # System time              : 0.003 s
% 0.17/0.46  # Total time               : 0.028 s
% 0.17/0.46  # Maximum resident set size: 1788 pages
% 0.17/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------