TSTP Solution File: SWV225+1 by E---3.1

View Problem - Process Solution

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

% Computer : n014.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:43:46 EDT 2023

% Result   : Theorem 0.17s 0.47s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   3 unt;   0 def)
%            Number of atoms       :  342 ( 267 equ)
%            Maximal formula atoms :   98 (  26 avg)
%            Number of connectives :  521 ( 192   ~;  68   |; 248   &)
%                                         (   2 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   39 (  15 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-3 aty)
%            Number of variables   :   26 (   4 sgn;  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0561,conjecture,
    ( ( ! [X14,X18] :
          ( ( leq(n0,X14)
            & leq(n0,X18)
            & leq(X14,n5)
            & leq(X18,n5) )
         => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
      & ! [X4,X20] :
          ( ( leq(n0,X4)
            & leq(n0,X20)
            & leq(X4,n2)
            & leq(X20,n2) )
         => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) ) )
   => ! [X21,X22] :
        ( ( leq(n0,X21)
          & leq(n0,X22)
          & leq(X21,n5)
          & leq(X22,n5) )
       => ( ( ~ ( n0 = X21
                & n2 = X22 )
            & ~ ( n0 = X21
                & n3 = X22 )
            & ~ ( n0 = X21
                & n4 = X22 )
            & ~ ( n0 = X21
                & n5 = X22 )
            & ~ ( n0 = X22
                & n4 = X21 )
            & ~ ( n0 = X22
                & n5 = X21 )
            & ~ ( n1 = X21
                & n2 = X22 )
            & ~ ( n1 = X21
                & n3 = X22 )
            & ~ ( n1 = X21
                & n4 = X22 )
            & ~ ( n1 = X21
                & n5 = X22 )
            & ~ ( n1 = X22
                & n2 = X21 )
            & ~ ( n1 = X22
                & n3 = X21 )
            & ~ ( n1 = X22
                & n4 = X21 )
            & ~ ( n1 = X22
                & n5 = X21 )
            & ~ ( n2 = X21
                & n2 = X22 )
            & ~ ( n2 = X21
                & n3 = X22 )
            & ~ ( n2 = X21
                & n4 = X22 )
            & ~ ( n2 = X21
                & n5 = X22 )
            & ~ ( n2 = X22
                & n3 = X21 )
            & ~ ( n2 = X22
                & n4 = X21 )
            & ~ ( n2 = X22
                & n5 = X21 )
            & ~ ( n3 = X21
                & n3 = X22 )
            & ~ ( n3 = X21
                & n4 = X22 )
            & ~ ( n3 = X21
                & n5 = X22 )
            & ~ ( n3 = X22
                & n4 = X21 )
            & ~ ( n3 = X22
                & n5 = X21 )
            & ~ ( n4 = X21
                & n4 = X22 )
            & ~ ( n4 = X21
                & n5 = X22 )
            & ~ ( n4 = X22
                & n5 = X21 )
            & ~ ( n5 = X21
                & n5 = X22 )
            & n1 = X21
            & n1 = X22
            & n2 = X22
            & n3 = X21 )
         => n0 = a_select2(xinit_noise,n1) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.FNHl1nSqVx/E---3.1_7632.p',quaternion_ds1_symm_0561) ).

fof(c_0_1,plain,
    ! [X22,X21] :
      ( epred2_2(X21,X22)
    <=> ( ~ ( n0 = X21
            & n2 = X22 )
        & ~ ( n0 = X21
            & n3 = X22 )
        & ~ ( n0 = X21
            & n4 = X22 )
        & ~ ( n0 = X21
            & n5 = X22 )
        & ~ ( n0 = X22
            & n4 = X21 )
        & ~ ( n0 = X22
            & n5 = X21 )
        & ~ ( n1 = X21
            & n2 = X22 )
        & ~ ( n1 = X21
            & n3 = X22 )
        & ~ ( n1 = X21
            & n4 = X22 )
        & ~ ( n1 = X21
            & n5 = X22 )
        & ~ ( n1 = X22
            & n2 = X21 )
        & ~ ( n1 = X22
            & n3 = X21 )
        & ~ ( n1 = X22
            & n4 = X21 )
        & ~ ( n1 = X22
            & n5 = X21 )
        & ~ ( n2 = X21
            & n2 = X22 )
        & ~ ( n2 = X21
            & n3 = X22 )
        & ~ ( n2 = X21
            & n4 = X22 )
        & ~ ( n2 = X21
            & n5 = X22 )
        & ~ ( n2 = X22
            & n3 = X21 )
        & ~ ( n2 = X22
            & n4 = X21 )
        & ~ ( n2 = X22
            & n5 = X21 )
        & ~ ( n3 = X21
            & n3 = X22 )
        & ~ ( n3 = X21
            & n4 = X22 )
        & ~ ( n3 = X21
            & n5 = X22 )
        & ~ ( n3 = X22
            & n4 = X21 )
        & ~ ( n3 = X22
            & n5 = X21 )
        & ~ ( n4 = X21
            & n4 = X22 )
        & ~ ( n4 = X21
            & n5 = X22 )
        & ~ ( n4 = X22
            & n5 = X21 )
        & ~ ( n5 = X21
            & n5 = X22 )
        & n1 = X21
        & n1 = X22
        & n2 = X22
        & n3 = X21 ) ),
    introduced(definition) ).

fof(c_0_2,plain,
    ( epred1_0
  <=> ( ! [X14,X18] :
          ( ( leq(n0,X14)
            & leq(n0,X18)
            & leq(X14,n5)
            & leq(X18,n5) )
         => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) )
      & ! [X4,X20] :
          ( ( leq(n0,X4)
            & leq(n0,X20)
            & leq(X4,n2)
            & leq(X20,n2) )
         => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) ) ) ),
    introduced(definition) ).

fof(c_0_3,plain,
    ! [X22,X21] :
      ( epred2_2(X21,X22)
     => ( ~ ( n0 = X21
            & n2 = X22 )
        & ~ ( n0 = X21
            & n3 = X22 )
        & ~ ( n0 = X21
            & n4 = X22 )
        & ~ ( n0 = X21
            & n5 = X22 )
        & ~ ( n0 = X22
            & n4 = X21 )
        & ~ ( n0 = X22
            & n5 = X21 )
        & ~ ( n1 = X21
            & n2 = X22 )
        & ~ ( n1 = X21
            & n3 = X22 )
        & ~ ( n1 = X21
            & n4 = X22 )
        & ~ ( n1 = X21
            & n5 = X22 )
        & ~ ( n1 = X22
            & n2 = X21 )
        & ~ ( n1 = X22
            & n3 = X21 )
        & ~ ( n1 = X22
            & n4 = X21 )
        & ~ ( n1 = X22
            & n5 = X21 )
        & ~ ( n2 = X21
            & n2 = X22 )
        & ~ ( n2 = X21
            & n3 = X22 )
        & ~ ( n2 = X21
            & n4 = X22 )
        & ~ ( n2 = X21
            & n5 = X22 )
        & ~ ( n2 = X22
            & n3 = X21 )
        & ~ ( n2 = X22
            & n4 = X21 )
        & ~ ( n2 = X22
            & n5 = X21 )
        & ~ ( n3 = X21
            & n3 = X22 )
        & ~ ( n3 = X21
            & n4 = X22 )
        & ~ ( n3 = X21
            & n5 = X22 )
        & ~ ( n3 = X22
            & n4 = X21 )
        & ~ ( n3 = X22
            & n5 = X21 )
        & ~ ( n4 = X21
            & n4 = X22 )
        & ~ ( n4 = X21
            & n5 = X22 )
        & ~ ( n4 = X22
            & n5 = X21 )
        & ~ ( n5 = X21
            & n5 = X22 )
        & n1 = X21
        & n1 = X22
        & n2 = X22
        & n3 = X21 ) ),
    inference(split_equiv,[status(thm)],[c_0_1]) ).

fof(c_0_4,negated_conjecture,
    ~ ( epred1_0
     => ! [X21,X22] :
          ( ( leq(n0,X21)
            & leq(n0,X22)
            & leq(X21,n5)
            & leq(X22,n5) )
         => ( epred2_2(X21,X22)
           => n0 = a_select2(xinit_noise,n1) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0561]),c_0_2]),c_0_1]) ).

fof(c_0_5,plain,
    ! [X73,X74] :
      ( ( n0 != X74
        | n2 != X73
        | ~ epred2_2(X74,X73) )
      & ( n0 != X74
        | n3 != X73
        | ~ epred2_2(X74,X73) )
      & ( n0 != X74
        | n4 != X73
        | ~ epred2_2(X74,X73) )
      & ( n0 != X74
        | n5 != X73
        | ~ epred2_2(X74,X73) )
      & ( n0 != X73
        | n4 != X74
        | ~ epred2_2(X74,X73) )
      & ( n0 != X73
        | n5 != X74
        | ~ epred2_2(X74,X73) )
      & ( n1 != X74
        | n2 != X73
        | ~ epred2_2(X74,X73) )
      & ( n1 != X74
        | n3 != X73
        | ~ epred2_2(X74,X73) )
      & ( n1 != X74
        | n4 != X73
        | ~ epred2_2(X74,X73) )
      & ( n1 != X74
        | n5 != X73
        | ~ epred2_2(X74,X73) )
      & ( n1 != X73
        | n2 != X74
        | ~ epred2_2(X74,X73) )
      & ( n1 != X73
        | n3 != X74
        | ~ epred2_2(X74,X73) )
      & ( n1 != X73
        | n4 != X74
        | ~ epred2_2(X74,X73) )
      & ( n1 != X73
        | n5 != X74
        | ~ epred2_2(X74,X73) )
      & ( n2 != X74
        | n2 != X73
        | ~ epred2_2(X74,X73) )
      & ( n2 != X74
        | n3 != X73
        | ~ epred2_2(X74,X73) )
      & ( n2 != X74
        | n4 != X73
        | ~ epred2_2(X74,X73) )
      & ( n2 != X74
        | n5 != X73
        | ~ epred2_2(X74,X73) )
      & ( n2 != X73
        | n3 != X74
        | ~ epred2_2(X74,X73) )
      & ( n2 != X73
        | n4 != X74
        | ~ epred2_2(X74,X73) )
      & ( n2 != X73
        | n5 != X74
        | ~ epred2_2(X74,X73) )
      & ( n3 != X74
        | n3 != X73
        | ~ epred2_2(X74,X73) )
      & ( n3 != X74
        | n4 != X73
        | ~ epred2_2(X74,X73) )
      & ( n3 != X74
        | n5 != X73
        | ~ epred2_2(X74,X73) )
      & ( n3 != X73
        | n4 != X74
        | ~ epred2_2(X74,X73) )
      & ( n3 != X73
        | n5 != X74
        | ~ epred2_2(X74,X73) )
      & ( n4 != X74
        | n4 != X73
        | ~ epred2_2(X74,X73) )
      & ( n4 != X74
        | n5 != X73
        | ~ epred2_2(X74,X73) )
      & ( n4 != X73
        | n5 != X74
        | ~ epred2_2(X74,X73) )
      & ( n5 != X74
        | n5 != X73
        | ~ epred2_2(X74,X73) )
      & ( n1 = X74
        | ~ epred2_2(X74,X73) )
      & ( n1 = X73
        | ~ epred2_2(X74,X73) )
      & ( n2 = X73
        | ~ epred2_2(X74,X73) )
      & ( n3 = X74
        | ~ epred2_2(X74,X73) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,negated_conjecture,
    ( epred1_0
    & leq(n0,esk1_0)
    & leq(n0,esk2_0)
    & leq(esk1_0,n5)
    & leq(esk2_0,n5)
    & epred2_2(esk1_0,esk2_0)
    & n0 != a_select2(xinit_noise,n1) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_7,plain,
    ( n1 != X1
    | n2 != X2
    | ~ epred2_2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( n2 = X1
    | ~ epred2_2(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( n1 = X1
    | ~ epred2_2(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    epred2_2(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ~ epred2_2(X1,X2),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_10,c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWV225+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n014.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 2400
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Tue Oct  3 03:38:49 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.FNHl1nSqVx/E---3.1_7632.p
% 0.17/0.47  # Version: 3.1pre001
% 0.17/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47  # Starting sh5l with 300s (1) cores
% 0.17/0.47  # new_bool_3 with pid 7711 completed with status 0
% 0.17/0.47  # Result found by new_bool_3
% 0.17/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.17/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47  # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.17/0.47  # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 7715 completed with status 0
% 0.17/0.47  # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 0.17/0.47  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FGHSM-FFMM32-MFFFFFNN
% 0.17/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47  # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 127s (1) cores
% 0.17/0.47  # Preprocessing time       : 0.002 s
% 0.17/0.47  
% 0.17/0.47  # Proof found!
% 0.17/0.47  # SZS status Theorem
% 0.17/0.47  # SZS output start CNFRefutation
% See solution above
% 0.17/0.47  # Parsed axioms                        : 85
% 0.17/0.47  # Removed by relevancy pruning/SinE    : 29
% 0.17/0.47  # Initial clauses                      : 100
% 0.17/0.47  # Removed in clause preprocessing      : 0
% 0.17/0.47  # Initial clauses in saturation        : 100
% 0.17/0.47  # Processed clauses                    : 52
% 0.17/0.47  # ...of these trivial                  : 0
% 0.17/0.47  # ...subsumed                          : 3
% 0.17/0.47  # ...remaining for further processing  : 49
% 0.17/0.47  # Other redundant clauses eliminated   : 0
% 0.17/0.47  # Clauses deleted for lack of memory   : 0
% 0.17/0.47  # Backward-subsumed                    : 11
% 0.17/0.47  # Backward-rewritten                   : 0
% 0.17/0.47  # Generated clauses                    : 12
% 0.17/0.47  # ...of the previous two non-redundant : 11
% 0.17/0.47  # ...aggressively subsumed             : 0
% 0.17/0.47  # Contextual simplify-reflections      : 6
% 0.17/0.47  # Paramodulations                      : 11
% 0.17/0.47  # Factorizations                       : 0
% 0.17/0.47  # NegExts                              : 0
% 0.17/0.47  # Equation resolutions                 : 0
% 0.17/0.47  # Total rewrite steps                  : 3
% 0.17/0.47  # Propositional unsat checks           : 0
% 0.17/0.47  #    Propositional check models        : 0
% 0.17/0.47  #    Propositional check unsatisfiable : 0
% 0.17/0.47  #    Propositional clauses             : 0
% 0.17/0.47  #    Propositional clauses after purity: 0
% 0.17/0.47  #    Propositional unsat core size     : 0
% 0.17/0.47  #    Propositional preprocessing time  : 0.000
% 0.17/0.47  #    Propositional encoding time       : 0.000
% 0.17/0.47  #    Propositional solver time         : 0.000
% 0.17/0.47  #    Success case prop preproc time    : 0.000
% 0.17/0.47  #    Success case prop encoding time   : 0.000
% 0.17/0.47  #    Success case prop solver time     : 0.000
% 0.17/0.47  # Current number of processed clauses  : 37
% 0.17/0.47  #    Positive orientable unit clauses  : 33
% 0.17/0.47  #    Positive unorientable unit clauses: 0
% 0.17/0.47  #    Negative unit clauses             : 3
% 0.17/0.47  #    Non-unit-clauses                  : 1
% 0.17/0.47  # Current number of unprocessed clauses: 59
% 0.17/0.47  # ...number of literals in the above   : 150
% 0.17/0.47  # Current number of archived formulas  : 0
% 0.17/0.47  # Current number of archived clauses   : 12
% 0.17/0.47  # Clause-clause subsumption calls (NU) : 51
% 0.17/0.47  # Rec. Clause-clause subsumption calls : 51
% 0.17/0.47  # Non-unit clause-clause subsumptions  : 11
% 0.17/0.47  # Unit Clause-clause subsumption calls : 11
% 0.17/0.47  # Rewrite failures with RHS unbound    : 0
% 0.17/0.47  # BW rewrite match attempts            : 4
% 0.17/0.47  # BW rewrite match successes           : 0
% 0.17/0.47  # Condensation attempts                : 0
% 0.17/0.47  # Condensation successes               : 0
% 0.17/0.47  # Termbank termtop insertions          : 4611
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.006 s
% 0.17/0.47  # System time              : 0.001 s
% 0.17/0.47  # Total time               : 0.007 s
% 0.17/0.47  # Maximum resident set size: 2084 pages
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.008 s
% 0.17/0.47  # System time              : 0.003 s
% 0.17/0.47  # Total time               : 0.012 s
% 0.17/0.47  # Maximum resident set size: 1804 pages
% 0.17/0.47  % E---3.1 exiting
% 0.17/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------