TSTP Solution File: ALG226+2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ALG226+2 : TPTP v8.2.0. Released v3.4.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 : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 18:05:45 EDT 2024

% Result   : Theorem 251.75s 32.62s
% Output   : CNFRefutation 251.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   31 (  19 unt;   0 def)
%            Number of atoms       :   81 (  26 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   76 (  26   ~;  19   |;  17   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t6_closure3,axiom,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_relat_1(X2)
            & m1_pboole(X2,X1) )
         => X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_closure3) ).

fof(t7_closure3,conjecture,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_relat_1(X2)
            & m1_pboole(X2,X1) )
         => ! [X3] :
              ( ( v2_relat_1(X3)
                & m1_pboole(X3,X1) )
             => ( ( k1_closure3(X1,X2) = k1_closure3(X1,X3)
                  & k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3)) )
               => r6_pboole(X1,X2,X3) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_closure3) ).

fof(d6_pboole,axiom,
    ! [X1] : k1_pboole(X1) = k2_funcop_1(X1,k1_xboole_0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+80.ax',d6_pboole) ).

fof(d2_funcop_1,axiom,
    ! [X1,X2] : k2_funcop_1(X1,X2) = k2_zfmisc_1(X1,k1_tarski(X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+24.ax',d2_funcop_1) ).

fof(redefinition_r6_pboole,axiom,
    ! [X1,X2,X3] :
      ( ( m1_pboole(X2,X1)
        & m1_pboole(X3,X1) )
     => ( r6_pboole(X1,X2,X3)
      <=> X2 = X3 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+80.ax',redefinition_r6_pboole) ).

fof(c_0_5,plain,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2] :
          ( ( v2_relat_1(X2)
            & m1_pboole(X2,X1) )
         => X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2))) ) ),
    inference(fof_simplification,[status(thm)],[t6_closure3]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( ~ v1_xboole_0(X1)
       => ! [X2] :
            ( ( v2_relat_1(X2)
              & m1_pboole(X2,X1) )
           => ! [X3] :
                ( ( v2_relat_1(X3)
                  & m1_pboole(X3,X1) )
               => ( ( k1_closure3(X1,X2) = k1_closure3(X1,X3)
                    & k7_relat_1(X2,k1_closure3(X1,X2)) = k7_relat_1(X3,k1_closure3(X1,X3)) )
                 => r6_pboole(X1,X2,X3) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t7_closure3])]) ).

fof(c_0_7,plain,
    ! [X136,X137] :
      ( v1_xboole_0(X136)
      | ~ v2_relat_1(X137)
      | ~ m1_pboole(X137,X136)
      | X137 = k1_funct_4(k1_pboole(X136),k7_relat_1(X137,k1_closure3(X136,X137))) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_8,plain,
    ! [X1254] : k1_pboole(X1254) = k2_funcop_1(X1254,k1_xboole_0),
    inference(variable_rename,[status(thm)],[d6_pboole]) ).

fof(c_0_9,plain,
    ! [X1315,X1316] : k2_funcop_1(X1315,X1316) = k2_zfmisc_1(X1315,k1_tarski(X1316)),
    inference(variable_rename,[status(thm)],[d2_funcop_1]) ).

fof(c_0_10,negated_conjecture,
    ( ~ v1_xboole_0(esk1_0)
    & v2_relat_1(esk2_0)
    & m1_pboole(esk2_0,esk1_0)
    & v2_relat_1(esk3_0)
    & m1_pboole(esk3_0,esk1_0)
    & k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0)
    & k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0))
    & ~ r6_pboole(esk1_0,esk2_0,esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

cnf(c_0_11,plain,
    ( v1_xboole_0(X1)
    | X2 = k1_funct_4(k1_pboole(X1),k7_relat_1(X2,k1_closure3(X1,X2)))
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    k1_pboole(X1) = k2_funcop_1(X1,k1_xboole_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    k2_funcop_1(X1,X2) = k2_zfmisc_1(X1,k1_tarski(X2)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk3_0,k1_closure3(esk1_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    k1_closure3(esk1_0,esk2_0) = k1_closure3(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    ( X2 = k1_funct_4(k2_zfmisc_1(X1,k1_tarski(k1_xboole_0)),k7_relat_1(X2,k1_closure3(X1,X2)))
    | v1_xboole_0(X1)
    | ~ v2_relat_1(X2)
    | ~ m1_pboole(X2,X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    k7_relat_1(esk3_0,k1_closure3(esk1_0,esk2_0)) = k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0)),
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    m1_pboole(esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_19,negated_conjecture,
    v2_relat_1(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_21,negated_conjecture,
    k1_funct_4(k2_zfmisc_1(esk1_0,k1_tarski(k1_xboole_0)),k7_relat_1(esk2_0,k1_closure3(esk1_0,esk2_0))) = esk3_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_17]),c_0_18]),c_0_19])]),c_0_20]) ).

cnf(c_0_22,negated_conjecture,
    m1_pboole(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_23,negated_conjecture,
    v2_relat_1(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_24,plain,
    ! [X22,X23,X24] :
      ( ( ~ r6_pboole(X22,X23,X24)
        | X23 = X24
        | ~ m1_pboole(X23,X22)
        | ~ m1_pboole(X24,X22) )
      & ( X23 != X24
        | r6_pboole(X22,X23,X24)
        | ~ m1_pboole(X23,X22)
        | ~ m1_pboole(X24,X22) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r6_pboole])])])]) ).

cnf(c_0_25,negated_conjecture,
    ~ r6_pboole(esk1_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,negated_conjecture,
    esk3_0 = esk2_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_21]),c_0_22]),c_0_23])]),c_0_20]) ).

cnf(c_0_27,plain,
    ( r6_pboole(X3,X1,X2)
    | X1 != X2
    | ~ m1_pboole(X1,X3)
    | ~ m1_pboole(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ~ r6_pboole(esk1_0,esk2_0,esk2_0),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    ( r6_pboole(X1,X2,X2)
    | ~ m1_pboole(X2,X1) ),
    inference(er,[status(thm)],[c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_22])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ALG226+2 : TPTP v8.2.0. Released v3.4.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat May 18 23:20:38 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  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/benchmark/theBenchmark.p
% 251.75/32.62  # Version: 3.1.0
% 251.75/32.62  # Preprocessing class: FMLLSMLLSSSNFFN.
% 251.75/32.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 251.75/32.62  # Starting new_bool_3 with 900s (3) cores
% 251.75/32.62  # Starting new_bool_1 with 900s (3) cores
% 251.75/32.62  # Starting sh5l with 300s (1) cores
% 251.75/32.62  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 251.75/32.62  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 13970 completed with status 0
% 251.75/32.62  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 251.75/32.62  # Preprocessing class: FMLLSMLLSSSNFFN.
% 251.75/32.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 251.75/32.62  # Starting new_bool_3 with 900s (3) cores
% 251.75/32.62  # Starting new_bool_1 with 900s (3) cores
% 251.75/32.62  # Starting sh5l with 300s (1) cores
% 251.75/32.62  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 251.75/32.62  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 251.75/32.62  # Search class: FGHSM-FSLM32-MFFFFFNN
% 251.75/32.62  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 251.75/32.62  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 251.75/32.62  # G-E--_303_C18_F1_URBAN_S0Y with pid 13971 completed with status 7
% 251.75/32.62  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 31s (1) cores
% 251.75/32.62  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 14303 completed with status 0
% 251.75/32.62  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 251.75/32.62  # Preprocessing class: FMLLSMLLSSSNFFN.
% 251.75/32.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 251.75/32.62  # Starting new_bool_3 with 900s (3) cores
% 251.75/32.62  # Starting new_bool_1 with 900s (3) cores
% 251.75/32.62  # Starting sh5l with 300s (1) cores
% 251.75/32.62  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 251.75/32.62  # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 251.75/32.62  # Search class: FGHSM-FSLM32-MFFFFFNN
% 251.75/32.62  # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 251.75/32.62  # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 251.75/32.62  # G-E--_303_C18_F1_URBAN_S0Y with pid 13971 completed with status 7
% 251.75/32.62  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 31s (1) cores
% 251.75/32.62  # Preprocessing time       : 0.032 s
% 251.75/32.62  
% 251.75/32.62  # Proof found!
% 251.75/32.62  # SZS status Theorem
% 251.75/32.62  # SZS output start CNFRefutation
% See solution above
% 251.75/32.62  # Parsed axioms                        : 4731
% 251.75/32.62  # Removed by relevancy pruning/SinE    : 4230
% 251.75/32.62  # Initial clauses                      : 865
% 251.75/32.62  # Removed in clause preprocessing      : 24
% 251.75/32.62  # Initial clauses in saturation        : 841
% 251.75/32.62  # Processed clauses                    : 6956
% 251.75/32.62  # ...of these trivial                  : 149
% 251.75/32.62  # ...subsumed                          : 4186
% 251.75/32.62  # ...remaining for further processing  : 2621
% 251.75/32.62  # Other redundant clauses eliminated   : 552
% 251.75/32.62  # Clauses deleted for lack of memory   : 0
% 251.75/32.62  # Backward-subsumed                    : 77
% 251.75/32.62  # Backward-rewritten                   : 220
% 251.75/32.62  # Generated clauses                    : 134759
% 251.75/32.62  # ...of the previous two non-redundant : 124121
% 251.75/32.62  # ...aggressively subsumed             : 0
% 251.75/32.62  # Contextual simplify-reflections      : 229
% 251.75/32.62  # Paramodulations                      : 134075
% 251.75/32.62  # Factorizations                       : 23
% 251.75/32.62  # NegExts                              : 0
% 251.75/32.62  # Equation resolutions                 : 662
% 251.75/32.62  # Disequality decompositions           : 0
% 251.75/32.62  # Total rewrite steps                  : 55671
% 251.75/32.62  # ...of those cached                   : 52625
% 251.75/32.62  # Propositional unsat checks           : 0
% 251.75/32.62  #    Propositional check models        : 0
% 251.75/32.62  #    Propositional check unsatisfiable : 0
% 251.75/32.62  #    Propositional clauses             : 0
% 251.75/32.62  #    Propositional clauses after purity: 0
% 251.75/32.62  #    Propositional unsat core size     : 0
% 251.75/32.62  #    Propositional preprocessing time  : 0.000
% 251.75/32.62  #    Propositional encoding time       : 0.000
% 251.75/32.62  #    Propositional solver time         : 0.000
% 251.75/32.62  #    Success case prop preproc time    : 0.000
% 251.75/32.62  #    Success case prop encoding time   : 0.000
% 251.75/32.62  #    Success case prop solver time     : 0.000
% 251.75/32.62  # Current number of processed clauses  : 2315
% 251.75/32.62  #    Positive orientable unit clauses  : 172
% 251.75/32.62  #    Positive unorientable unit clauses: 5
% 251.75/32.62  #    Negative unit clauses             : 88
% 251.75/32.62  #    Non-unit-clauses                  : 2050
% 251.75/32.62  # Current number of unprocessed clauses: 117247
% 251.75/32.62  # ...number of literals in the above   : 578495
% 251.75/32.62  # Current number of archived formulas  : 0
% 251.75/32.62  # Current number of archived clauses   : 300
% 251.75/32.62  # Clause-clause subsumption calls (NU) : 750476
% 251.75/32.62  # Rec. Clause-clause subsumption calls : 196610
% 251.75/32.62  # Non-unit clause-clause subsumptions  : 2635
% 251.75/32.62  # Unit Clause-clause subsumption calls : 20098
% 251.75/32.62  # Rewrite failures with RHS unbound    : 0
% 251.75/32.62  # BW rewrite match attempts            : 161
% 251.75/32.62  # BW rewrite match successes           : 56
% 251.75/32.62  # Condensation attempts                : 0
% 251.75/32.62  # Condensation successes               : 0
% 251.75/32.62  # Termbank termtop insertions          : 2221041
% 251.75/32.62  # Search garbage collected termcells   : 48434
% 251.75/32.62  
% 251.75/32.62  # -------------------------------------------------
% 251.75/32.62  # User time                : 30.457 s
% 251.75/32.62  # System time              : 0.855 s
% 251.75/32.62  # Total time               : 31.312 s
% 251.75/32.62  # Maximum resident set size: 10804 pages
% 251.75/32.62  
% 251.75/32.62  # -------------------------------------------------
% 251.75/32.62  # User time                : 30.591 s
% 251.75/32.62  # System time              : 0.864 s
% 251.75/32.62  # Total time               : 31.455 s
% 251.75/32.62  # Maximum resident set size: 7684 pages
% 251.75/32.62  % E---3.1 exiting
% 251.75/32.62  % E exiting
%------------------------------------------------------------------------------