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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : HAL006+1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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 17:50:43 EDT 2023

% Result   : Theorem 0.21s 0.72s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   34 (   7 unt;   0 def)
%            Number of atoms       :  104 (  24 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  120 (  50   ~;  43   |;  19   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   8 con; 0-3 aty)
%            Number of variables   :   64 (   0 sgn;  30   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(subtract_distribution,axiom,
    ! [X1,X2,X3] :
      ( morphism(X1,X2,X3)
     => ! [X5,X6] :
          ( ( element(X5,X2)
            & element(X6,X2) )
         => apply(X1,subtract(X2,X5,X6)) = subtract(X3,apply(X1,X5),apply(X1,X6)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',subtract_distribution) ).

fof(lemma12,conjecture,
    ! [X19] :
      ( element(X19,e)
     => ? [X21,X24] :
          ( element(X21,b)
          & element(X24,b)
          & apply(g,subtract(b,X21,X24)) = X19 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',lemma12) ).

fof(g_morphism,axiom,
    morphism(g,b,e),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',g_morphism) ).

fof(lemma8,axiom,
    ! [X19] :
      ( element(X19,e)
     => ? [X21,X22,X23] :
          ( element(X21,b)
          & element(X22,e)
          & subtract(e,apply(g,X21),X19) = X22
          & element(X23,a)
          & apply(gamma,apply(f,X23)) = X22
          & apply(g,apply(alpha,X23)) = X22 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',lemma8) ).

fof(subtract_cancellation,axiom,
    ! [X2,X5,X6] :
      ( ( element(X5,X2)
        & element(X6,X2) )
     => subtract(X2,X5,subtract(X2,X5,X6)) = X6 ),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',subtract_cancellation) ).

fof(morphism,axiom,
    ! [X1,X2,X3] :
      ( morphism(X1,X2,X3)
     => ( ! [X4] :
            ( element(X4,X2)
           => element(apply(X1,X4),X3) )
        & apply(X1,zero(X2)) = zero(X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',morphism) ).

fof(alpha_morphism,axiom,
    morphism(alpha,a,b),
    file('/export/starexec/sandbox2/tmp/tmp.e3yGlhJaV7/E---3.1_30315.p',alpha_morphism) ).

fof(c_0_7,plain,
    ! [X92,X93,X94,X95,X96] :
      ( ~ morphism(X92,X93,X94)
      | ~ element(X95,X93)
      | ~ element(X96,X93)
      | apply(X92,subtract(X93,X95,X96)) = subtract(X94,apply(X92,X95),apply(X92,X96)) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subtract_distribution])])]) ).

fof(c_0_8,negated_conjecture,
    ~ ! [X19] :
        ( element(X19,e)
       => ? [X21,X24] :
            ( element(X21,b)
            & element(X24,b)
            & apply(g,subtract(b,X21,X24)) = X19 ) ),
    inference(assume_negation,[status(cth)],[lemma12]) ).

cnf(c_0_9,plain,
    ( apply(X1,subtract(X2,X4,X5)) = subtract(X3,apply(X1,X4),apply(X1,X5))
    | ~ morphism(X1,X2,X3)
    | ~ element(X4,X2)
    | ~ element(X5,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_10,plain,
    morphism(g,b,e),
    inference(split_conjunct,[status(thm)],[g_morphism]) ).

fof(c_0_11,plain,
    ! [X100] :
      ( ( element(esk11_1(X100),b)
        | ~ element(X100,e) )
      & ( element(esk12_1(X100),e)
        | ~ element(X100,e) )
      & ( subtract(e,apply(g,esk11_1(X100)),X100) = esk12_1(X100)
        | ~ element(X100,e) )
      & ( element(esk13_1(X100),a)
        | ~ element(X100,e) )
      & ( apply(gamma,apply(f,esk13_1(X100))) = esk12_1(X100)
        | ~ element(X100,e) )
      & ( apply(g,apply(alpha,esk13_1(X100))) = esk12_1(X100)
        | ~ element(X100,e) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[lemma8])])])]) ).

fof(c_0_12,negated_conjecture,
    ! [X105,X106] :
      ( element(esk14_0,e)
      & ( ~ element(X105,b)
        | ~ element(X106,b)
        | apply(g,subtract(b,X105,X106)) != esk14_0 ) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

cnf(c_0_13,plain,
    ( subtract(e,apply(g,X1),apply(g,X2)) = apply(g,subtract(b,X1,X2))
    | ~ element(X2,b)
    | ~ element(X1,b) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    ( apply(g,apply(alpha,esk13_1(X1))) = esk12_1(X1)
    | ~ element(X1,e) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_15,plain,
    ! [X89,X90,X91] :
      ( ~ element(X90,X89)
      | ~ element(X91,X89)
      | subtract(X89,X90,subtract(X89,X90,X91)) = X91 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subtract_cancellation])]) ).

fof(c_0_16,plain,
    ! [X25,X26,X27,X28] :
      ( ( ~ element(X28,X26)
        | element(apply(X25,X28),X27)
        | ~ morphism(X25,X26,X27) )
      & ( apply(X25,zero(X26)) = zero(X27)
        | ~ morphism(X25,X26,X27) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[morphism])])])]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ element(X1,b)
    | ~ element(X2,b)
    | apply(g,subtract(b,X1,X2)) != esk14_0 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( apply(g,subtract(b,X1,apply(alpha,esk13_1(X2)))) = subtract(e,apply(g,X1),esk12_1(X2))
    | ~ element(apply(alpha,esk13_1(X2)),b)
    | ~ element(X1,b)
    | ~ element(X2,e) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    ( subtract(X2,X1,subtract(X2,X1,X3)) = X3
    | ~ element(X1,X2)
    | ~ element(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    ( subtract(e,apply(g,esk11_1(X1)),X1) = esk12_1(X1)
    | ~ element(X1,e) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_21,plain,
    ( element(apply(X3,X1),X4)
    | ~ element(X1,X2)
    | ~ morphism(X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    ( subtract(e,apply(g,X1),esk12_1(X2)) != esk14_0
    | ~ element(apply(alpha,esk13_1(X2)),b)
    | ~ element(X1,b)
    | ~ element(X2,e) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    ( subtract(e,apply(g,esk11_1(X1)),esk12_1(X1)) = X1
    | ~ element(apply(g,esk11_1(X1)),e)
    | ~ element(X1,e) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    element(esk14_0,e),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_25,plain,
    ( element(apply(g,X1),e)
    | ~ element(X1,b) ),
    inference(spm,[status(thm)],[c_0_21,c_0_10]) ).

cnf(c_0_26,plain,
    morphism(alpha,a,b),
    inference(split_conjunct,[status(thm)],[alpha_morphism]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ element(apply(alpha,esk13_1(esk14_0)),b)
    | ~ element(esk11_1(esk14_0),b) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])]),c_0_24])]),c_0_25]) ).

cnf(c_0_28,plain,
    ( element(apply(alpha,X1),b)
    | ~ element(X1,a) ),
    inference(spm,[status(thm)],[c_0_21,c_0_26]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ element(esk11_1(esk14_0),b)
    | ~ element(esk13_1(esk14_0),a) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,plain,
    ( element(esk11_1(X1),b)
    | ~ element(X1,e) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_31,negated_conjecture,
    ~ element(esk13_1(esk14_0),a),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_24])]) ).

cnf(c_0_32,plain,
    ( element(esk13_1(X1),a)
    | ~ element(X1,e) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem    : HAL006+1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.15  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n013.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Mon Oct  2 23:38:29 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.21/0.50  Running first-order theorem proving
% 0.21/0.50  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.e3yGlhJaV7/E---3.1_30315.p
% 0.21/0.72  # Version: 3.1pre001
% 0.21/0.72  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.72  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.72  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.72  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.72  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.72  # Starting sh5l with 300s (1) cores
% 0.21/0.72  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 30394 completed with status 0
% 0.21/0.72  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.72  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.72  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.72  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.72  # No SInE strategy applied
% 0.21/0.72  # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.21/0.72  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.72  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 811s (1) cores
% 0.21/0.72  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.72  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.72  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.72  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.21/0.72  # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with pid 30404 completed with status 0
% 0.21/0.72  # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
% 0.21/0.72  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.72  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.72  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.72  # No SInE strategy applied
% 0.21/0.72  # Search class: FGHSF-FFMM32-MFFFFFNN
% 0.21/0.72  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.72  # Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 811s (1) cores
% 0.21/0.72  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.72  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.72  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.72  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 0.21/0.72  # Preprocessing time       : 0.003 s
% 0.21/0.72  # Presaturation interreduction done
% 0.21/0.72  
% 0.21/0.72  # Proof found!
% 0.21/0.72  # SZS status Theorem
% 0.21/0.72  # SZS output start CNFRefutation
% See solution above
% 0.21/0.72  # Parsed axioms                        : 33
% 0.21/0.72  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.72  # Initial clauses                      : 57
% 0.21/0.72  # Removed in clause preprocessing      : 0
% 0.21/0.72  # Initial clauses in saturation        : 57
% 0.21/0.72  # Processed clauses                    : 1532
% 0.21/0.72  # ...of these trivial                  : 5
% 0.21/0.72  # ...subsumed                          : 816
% 0.21/0.72  # ...remaining for further processing  : 711
% 0.21/0.72  # Other redundant clauses eliminated   : 32
% 0.21/0.72  # Clauses deleted for lack of memory   : 0
% 0.21/0.72  # Backward-subsumed                    : 92
% 0.21/0.72  # Backward-rewritten                   : 21
% 0.21/0.72  # Generated clauses                    : 5803
% 0.21/0.72  # ...of the previous two non-redundant : 5141
% 0.21/0.72  # ...aggressively subsumed             : 0
% 0.21/0.72  # Contextual simplify-reflections      : 120
% 0.21/0.72  # Paramodulations                      : 5769
% 0.21/0.72  # Factorizations                       : 0
% 0.21/0.72  # NegExts                              : 0
% 0.21/0.72  # Equation resolutions                 : 34
% 0.21/0.72  # Total rewrite steps                  : 2074
% 0.21/0.72  # Propositional unsat checks           : 0
% 0.21/0.72  #    Propositional check models        : 0
% 0.21/0.72  #    Propositional check unsatisfiable : 0
% 0.21/0.72  #    Propositional clauses             : 0
% 0.21/0.72  #    Propositional clauses after purity: 0
% 0.21/0.72  #    Propositional unsat core size     : 0
% 0.21/0.72  #    Propositional preprocessing time  : 0.000
% 0.21/0.72  #    Propositional encoding time       : 0.000
% 0.21/0.72  #    Propositional solver time         : 0.000
% 0.21/0.72  #    Success case prop preproc time    : 0.000
% 0.21/0.72  #    Success case prop encoding time   : 0.000
% 0.21/0.72  #    Success case prop solver time     : 0.000
% 0.21/0.72  # Current number of processed clauses  : 540
% 0.21/0.72  #    Positive orientable unit clauses  : 38
% 0.21/0.72  #    Positive unorientable unit clauses: 0
% 0.21/0.72  #    Negative unit clauses             : 3
% 0.21/0.72  #    Non-unit-clauses                  : 499
% 0.21/0.72  # Current number of unprocessed clauses: 3616
% 0.21/0.72  # ...number of literals in the above   : 20258
% 0.21/0.72  # Current number of archived formulas  : 0
% 0.21/0.72  # Current number of archived clauses   : 169
% 0.21/0.72  # Clause-clause subsumption calls (NU) : 28563
% 0.21/0.72  # Rec. Clause-clause subsumption calls : 8844
% 0.21/0.72  # Non-unit clause-clause subsumptions  : 808
% 0.21/0.72  # Unit Clause-clause subsumption calls : 300
% 0.21/0.72  # Rewrite failures with RHS unbound    : 0
% 0.21/0.72  # BW rewrite match attempts            : 19
% 0.21/0.72  # BW rewrite match successes           : 12
% 0.21/0.72  # Condensation attempts                : 0
% 0.21/0.72  # Condensation successes               : 0
% 0.21/0.72  # Termbank termtop insertions          : 156595
% 0.21/0.72  
% 0.21/0.72  # -------------------------------------------------
% 0.21/0.72  # User time                : 0.177 s
% 0.21/0.72  # System time              : 0.011 s
% 0.21/0.72  # Total time               : 0.187 s
% 0.21/0.72  # Maximum resident set size: 1880 pages
% 0.21/0.72  
% 0.21/0.72  # -------------------------------------------------
% 0.21/0.72  # User time                : 0.881 s
% 0.21/0.72  # System time              : 0.040 s
% 0.21/0.72  # Total time               : 0.921 s
% 0.21/0.72  # Maximum resident set size: 1728 pages
% 0.21/0.72  % E---3.1 exiting
% 0.21/0.72  % E---3.1 exiting
%------------------------------------------------------------------------------