TSTP Solution File: SYO422^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYO422^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 : Tue May 21 08:45:57 EDT 2024

% Result   : Theorem 0.22s 0.50s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   40 (  21 unt;  12 typ;   0 def)
%            Number of atoms       :   77 (  16 equ;   0 cnn)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  132 (  29   ~;  21   |;   2   &;  80   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   52 (  52   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   14 (  12 usr;   2 con; 0-3 aty)
%            Number of variables   :   52 (  31   ^  18   !;   3   ?;  52   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_24,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(decl_25,type,
    mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_27,type,
    mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_41,type,
    mserial: ( $i > $i > $o ) > $o ).

thf(decl_49,type,
    mvalid: ( $i > $o ) > $o ).

thf(decl_53,type,
    rel_d: $i > $i > $o ).

thf(decl_54,type,
    mbox_d: ( $i > $o ) > $i > $o ).

thf(decl_55,type,
    mdia_d: ( $i > $o ) > $i > $o ).

thf(decl_56,type,
    p: $i > $o ).

thf(decl_57,type,
    q: $i > $o ).

thf(decl_58,type,
    esk1_1: $i > $i ).

thf(decl_59,type,
    esk2_0: $i ).

thf(mimplies,axiom,
    ( mimplies
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X6: $i > $o,X3: $i] :
          ~ ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
          ( ( X6 @ X3 )
          | ( X7 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).

thf(mdia_d,axiom,
    ( mdia_d
    = ( ^ [X6: $i > $o] : ( mnot @ ( mbox_d @ ( mnot @ X6 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax',mdia_d) ).

thf(mbox_d,axiom,
    ( mbox_d
    = ( ^ [X6: $i > $o,X3: $i] :
        ! [X14: $i] :
          ( ~ ( rel_d @ X3 @ X14 )
          | ( X6 @ X14 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax',mbox_d) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X6: $i > $o] :
        ! [X3: $i] : ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).

thf(prove,conjecture,
    mvalid @ ( mdia_d @ ( mimplies @ ( mimplies @ ( mimplies @ p @ q ) @ p ) @ p ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).

thf(mserial,axiom,
    ( mserial
    = ( ^ [X13: $i > $i > $o] :
        ! [X15: $i] :
        ? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mserial) ).

thf(a1,axiom,
    mserial @ rel_d,
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax',a1) ).

thf(c_0_9,plain,
    ( mimplies
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ~ ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mimplies]) ).

thf(c_0_10,plain,
    ( mnot
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot]) ).

thf(c_0_11,plain,
    ( mor
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mor]) ).

thf(c_0_12,plain,
    ( mdia_d
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ! [X21: $i] :
              ( ~ ( rel_d @ Z1 @ X21 )
              | ~ ( Z0 @ X21 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mdia_d]) ).

thf(c_0_13,plain,
    ( mbox_d
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X14: $i] :
          ( ~ ( rel_d @ Z1 @ X14 )
          | ( Z0 @ X14 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_d]) ).

thf(c_0_14,plain,
    ( mimplies
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ~ ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

thf(c_0_15,plain,
    ( mvalid
    = ( ^ [Z0: $i > $o] :
        ! [X3: $i] : ( Z0 @ X3 ) ) ),
    inference(fof_simplification,[status(thm)],[mvalid]) ).

thf(c_0_16,plain,
    ( mdia_d
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ! [X21: $i] :
              ( ~ ( rel_d @ Z1 @ X21 )
              | ~ ( Z0 @ X21 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).

thf(c_0_17,negated_conjecture,
    ~ ! [X25: $i] :
        ~ ! [X24: $i] :
            ( ~ ( rel_d @ X25 @ X24 )
            | ~ ( ~ ( ~ ( ~ ( p @ X24 )
                        | ( q @ X24 ) )
                    | ( p @ X24 ) )
                | ( p @ X24 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]),c_0_14]),c_0_15]),c_0_16])]) ).

thf(c_0_18,negated_conjecture,
    ! [X29: $i] :
      ( ( ( p @ X29 )
        | ( p @ X29 )
        | ~ ( rel_d @ esk2_0 @ X29 ) )
      & ( ~ ( q @ X29 )
        | ( p @ X29 )
        | ~ ( rel_d @ esk2_0 @ X29 ) )
      & ( ~ ( p @ X29 )
        | ~ ( rel_d @ esk2_0 @ X29 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])]) ).

thf(c_0_19,plain,
    ( mserial
    = ( ^ [Z0: $i > $i > $o] :
        ! [X15: $i] :
        ? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
    inference(fof_simplification,[status(thm)],[mserial]) ).

thf(c_0_20,negated_conjecture,
    ! [X3: $i] :
      ( ( p @ X3 )
      | ( p @ X3 )
      | ~ ( rel_d @ esk2_0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_21,plain,
    ! [X22: $i] :
    ? [X23: $i] : ( rel_d @ X22 @ X23 ),
    inference(apply_def,[status(thm)],[a1,c_0_19]) ).

thf(c_0_22,negated_conjecture,
    ! [X3: $i] :
      ( ~ ( p @ X3 )
      | ~ ( rel_d @ esk2_0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

thf(c_0_23,negated_conjecture,
    ! [X3: $i] :
      ( ( p @ X3 )
      | ~ ( rel_d @ esk2_0 @ X3 ) ),
    inference(cn,[status(thm)],[c_0_20]) ).

thf(c_0_24,plain,
    ! [X26: $i] : ( rel_d @ X26 @ ( esk1_1 @ X26 ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_21])]) ).

thf(c_0_25,negated_conjecture,
    ! [X3: $i] :
      ~ ( rel_d @ esk2_0 @ X3 ),
    inference(csr,[status(thm)],[c_0_22,c_0_23]) ).

thf(c_0_26,plain,
    ! [X3: $i] : ( rel_d @ X3 @ ( esk1_1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

thf(c_0_27,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_25,c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SYO422^1 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.37  % Computer : n010.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8042.1875MB
% 0.13/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37  % CPULimit   : 300
% 0.13/0.37  % WCLimit    : 300
% 0.13/0.37  % DateTime   : Mon May 20 08:30:53 EDT 2024
% 0.13/0.37  % CPUTime    : 
% 0.22/0.49  Running higher-order theorem proving
% 0.22/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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
% 0.22/0.50  # Version: 3.1.0-ho
% 0.22/0.50  # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.50  # Starting almost_fo_3_lam with 300s (1) cores
% 0.22/0.50  # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.50  # ehoh_best2_full_lfho with pid 26690 completed with status 0
% 0.22/0.50  # Result found by ehoh_best2_full_lfho
% 0.22/0.50  # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.50  # No SInE strategy applied
% 0.22/0.50  # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.22/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50  # Starting sh7 with 163s (1) cores
% 0.22/0.50  # sh7 with pid 26694 completed with status 0
% 0.22/0.50  # Result found by sh7
% 0.22/0.50  # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.50  # No SInE strategy applied
% 0.22/0.50  # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.22/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50  # Starting sh7 with 163s (1) cores
% 0.22/0.50  # Preprocessing time       : 0.001 s
% 0.22/0.50  # Presaturation interreduction done
% 0.22/0.50  
% 0.22/0.50  # Proof found!
% 0.22/0.50  # SZS status Theorem
% 0.22/0.50  # SZS output start CNFRefutation
% See solution above
% 0.22/0.50  # Parsed axioms                        : 72
% 0.22/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.50  # Initial clauses                      : 41
% 0.22/0.50  # Removed in clause preprocessing      : 37
% 0.22/0.50  # Initial clauses in saturation        : 4
% 0.22/0.50  # Processed clauses                    : 6
% 0.22/0.50  # ...of these trivial                  : 0
% 0.22/0.50  # ...subsumed                          : 1
% 0.22/0.50  # ...remaining for further processing  : 5
% 0.22/0.50  # Other redundant clauses eliminated   : 0
% 0.22/0.50  # Clauses deleted for lack of memory   : 0
% 0.22/0.50  # Backward-subsumed                    : 1
% 0.22/0.50  # Backward-rewritten                   : 0
% 0.22/0.50  # Generated clauses                    : 1
% 0.22/0.50  # ...of the previous two non-redundant : 0
% 0.22/0.50  # ...aggressively subsumed             : 0
% 0.22/0.50  # Contextual simplify-reflections      : 1
% 0.22/0.50  # Paramodulations                      : 1
% 0.22/0.50  # Factorizations                       : 0
% 0.22/0.50  # NegExts                              : 0
% 0.22/0.50  # Equation resolutions                 : 0
% 0.22/0.50  # Disequality decompositions           : 0
% 0.22/0.50  # Total rewrite steps                  : 0
% 0.22/0.50  # ...of those cached                   : 0
% 0.22/0.50  # Propositional unsat checks           : 0
% 0.22/0.50  #    Propositional check models        : 0
% 0.22/0.50  #    Propositional check unsatisfiable : 0
% 0.22/0.50  #    Propositional clauses             : 0
% 0.22/0.50  #    Propositional clauses after purity: 0
% 0.22/0.50  #    Propositional unsat core size     : 0
% 0.22/0.50  #    Propositional preprocessing time  : 0.000
% 0.22/0.50  #    Propositional encoding time       : 0.000
% 0.22/0.50  #    Propositional solver time         : 0.000
% 0.22/0.50  #    Success case prop preproc time    : 0.000
% 0.22/0.50  #    Success case prop encoding time   : 0.000
% 0.22/0.50  #    Success case prop solver time     : 0.000
% 0.22/0.50  # Current number of processed clauses  : 2
% 0.22/0.50  #    Positive orientable unit clauses  : 1
% 0.22/0.50  #    Positive unorientable unit clauses: 0
% 0.22/0.50  #    Negative unit clauses             : 1
% 0.22/0.50  #    Non-unit-clauses                  : 0
% 0.22/0.50  # Current number of unprocessed clauses: 0
% 0.22/0.50  # ...number of literals in the above   : 0
% 0.22/0.50  # Current number of archived formulas  : 0
% 0.22/0.50  # Current number of archived clauses   : 3
% 0.22/0.50  # Clause-clause subsumption calls (NU) : 1
% 0.22/0.50  # Rec. Clause-clause subsumption calls : 1
% 0.22/0.50  # Non-unit clause-clause subsumptions  : 1
% 0.22/0.50  # Unit Clause-clause subsumption calls : 1
% 0.22/0.50  # Rewrite failures with RHS unbound    : 0
% 0.22/0.50  # BW rewrite match attempts            : 0
% 0.22/0.50  # BW rewrite match successes           : 0
% 0.22/0.50  # Condensation attempts                : 0
% 0.22/0.50  # Condensation successes               : 0
% 0.22/0.50  # Termbank termtop insertions          : 2218
% 0.22/0.50  # Search garbage collected termcells   : 399
% 0.22/0.50  
% 0.22/0.50  # -------------------------------------------------
% 0.22/0.50  # User time                : 0.004 s
% 0.22/0.50  # System time              : 0.002 s
% 0.22/0.50  # Total time               : 0.006 s
% 0.22/0.50  # Maximum resident set size: 1912 pages
% 0.22/0.50  
% 0.22/0.50  # -------------------------------------------------
% 0.22/0.50  # User time                : 0.007 s
% 0.22/0.50  # System time              : 0.003 s
% 0.22/0.50  # Total time               : 0.011 s
% 0.22/0.50  # Maximum resident set size: 1800 pages
% 0.22/0.50  % E---3.1 exiting
% 0.22/0.50  % E exiting
%------------------------------------------------------------------------------