↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO460^3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:43:06 AM UTC 2026

% Result   : Theorem 0.07s 0.26s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  22 unt;   0 typ;   0 def)
%            Number of atoms       :  116 (  17 equ;   0 cnn)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  204 (  41   ~;  32   |;   9   &; 122   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   25 (  25   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  14 usr;   4 con; 0-3 aty)
%            Number of variables   :   49 (  37   ^;  12   !;   0   ?;  49   :)

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

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

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

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

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

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

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

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

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

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

thf(decl_59,type,
    r: $i > $o ).

thf(decl_60,type,
    esk1_0: $i ).

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

thf(decl_62,type,
    esk3_0: $i ).

thf(mand,axiom,
    ( mand
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mand) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X6: $i > $o,X3: $i] :
          ~ ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
          ( ( X6 @ X3 )
          | ( X7 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mor) ).

thf(mimplies,axiom,
    ( mimplies
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mimplies) ).

thf(mdia_m,axiom,
    ( mdia_m
    = ( ^ [X6: $i > $o] : ( mnot @ ( mbox_m @ ( mnot @ X6 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mdia_m) ).

thf(mbox_m,axiom,
    ( mbox_m
    = ( ^ [X6: $i > $o,X3: $i] :
        ! [X14: $i] :
          ( ~ ( rel_m @ X3 @ X14 )
          | ( X6 @ X14 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mbox_m) ).

thf(prove,conjecture,
    mvalid @ ( mimplies @ ( mor @ ( mdia_m @ ( mand @ p @ q ) ) @ ( mdia_m @ ( mand @ p @ r ) ) ) @ ( mdia_m @ p ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',prove) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X6: $i > $o] :
        ! [X3: $i] : ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p',mvalid) ).

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

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

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

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

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

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

thf(c_0_14,negated_conjecture,
    ~ ( mvalid @ ( mimplies @ ( mor @ ( mdia_m @ ( mand @ p @ q ) ) @ ( mdia_m @ ( mand @ p @ r ) ) ) @ ( mdia_m @ p ) ) ),
    inference(assume_negation,[status(cth)],[prove]) ).

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

thf(c_0_16,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_11,c_0_9]),c_0_10]) ).

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

thf(c_0_18,plain,
    ( mdia_m
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ! [X21: $i] :
              ( ~ ( rel_m @ Z1 @ X21 )
              | ~ ( Z0 @ X21 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_9]),c_0_13]) ).

thf(c_0_19,negated_conjecture,
    ~ ! [X26: $i] :
        ( ~ ( ~ ! [X23: $i] :
                  ( ~ ( rel_m @ X26 @ X23 )
                  | ~ ~ ( ~ ( p @ X23 )
                        | ~ ( q @ X23 ) ) )
            | ~ ! [X24: $i] :
                  ( ~ ( rel_m @ X26 @ X24 )
                  | ~ ~ ( ~ ( p @ X24 )
                        | ~ ( r @ X24 ) ) ) )
        | ~ ! [X25: $i] :
              ( ~ ( rel_m @ X26 @ X25 )
              | ~ ( p @ X25 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_10]),c_0_15]),c_0_16]),c_0_17]),c_0_18])]) ).

thf(c_0_20,negated_conjecture,
    ! [X31: $i] :
      ( ( ( rel_m @ esk1_0 @ esk3_0 )
        | ( rel_m @ esk1_0 @ esk2_0 ) )
      & ( ( p @ esk3_0 )
        | ( rel_m @ esk1_0 @ esk2_0 ) )
      & ( ( r @ esk3_0 )
        | ( rel_m @ esk1_0 @ esk2_0 ) )
      & ( ( rel_m @ esk1_0 @ esk3_0 )
        | ( p @ esk2_0 ) )
      & ( ( p @ esk3_0 )
        | ( p @ esk2_0 ) )
      & ( ( r @ esk3_0 )
        | ( p @ esk2_0 ) )
      & ( ( rel_m @ esk1_0 @ esk3_0 )
        | ( q @ esk2_0 ) )
      & ( ( p @ esk3_0 )
        | ( q @ esk2_0 ) )
      & ( ( r @ esk3_0 )
        | ( q @ esk2_0 ) )
      & ( ~ ( rel_m @ esk1_0 @ X31 )
        | ~ ( p @ X31 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])]) ).

thf(c_0_21,negated_conjecture,
    ! [X3: $i] :
      ( ~ ( rel_m @ esk1_0 @ X3 )
      | ~ ( p @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_22,negated_conjecture,
    ( ( p @ esk3_0 )
    | ( p @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_23,negated_conjecture,
    ( ( rel_m @ esk1_0 @ esk3_0 )
    | ( p @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_24,negated_conjecture,
    p @ esk2_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

thf(c_0_25,negated_conjecture,
    ( ( p @ esk3_0 )
    | ( rel_m @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_26,negated_conjecture,
    ~ ( rel_m @ esk1_0 @ esk2_0 ),
    inference(spm,[status(thm)],[c_0_21,c_0_24]) ).

thf(c_0_27,negated_conjecture,
    ( ( rel_m @ esk1_0 @ esk3_0 )
    | ( rel_m @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_28,negated_conjecture,
    p @ esk3_0,
    inference(sr,[status(thm)],[c_0_25,c_0_26]) ).

thf(c_0_29,negated_conjecture,
    rel_m @ esk1_0 @ esk3_0,
    inference(sr,[status(thm)],[c_0_27,c_0_26]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYO460^3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n008.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 16:58:54 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running higher-order theorem proving
% 0.07/0.24  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.xSxRdT9OMG/E---3.1_3428718.p
% 0.07/0.26  % Version: 3.5.1-ho
% 0.07/0.26  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26  % Starting almost_fo_3_lam with 300s (1) cores
% 0.07/0.26  % Starting post_as_ho1 with 300s (1) cores
% 0.07/0.26  % ehoh_best2_full_lfho with pid 3428747 completed with status 0
% 0.07/0.26  % Result found by ehoh_best2_full_lfho
% 0.07/0.26  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26  % No SInE strategy applied
% 0.07/0.26  % Search class: HGHNF-FFSM00-SHSSMFNN
% 0.07/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26  % SubtermCWHack with pid 3428750 completed with status 0
% 0.07/0.26  % Result found by SubtermCWHack
% 0.07/0.26  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.07/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.07/0.26  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.07/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.26  % No SInE strategy applied
% 0.07/0.26  % Search class: HGHNF-FFSM00-SHSSMFNN
% 0.07/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26  % Preprocessing time       : 0.001 s
% 0.07/0.26  
% 0.07/0.26  % Proof found!
% 0.07/0.26  % SZS status Theorem
% 0.07/0.26  % SZS output start CNFRefutation
% See solution above
% 0.07/0.26  % Parsed axioms                        : 73
% 0.07/0.26  % Removed by relevancy pruning/SinE    : 0
% 0.07/0.26  % Initial clauses                      : 49
% 0.07/0.26  % Removed in clause preprocessing      : 38
% 0.07/0.26  % Initial clauses in saturation        : 11
% 0.07/0.26  % Processed clauses                    : 17
% 0.07/0.26  % ...of these trivial                  : 0
% 0.07/0.26  % ...subsumed                          : 0
% 0.07/0.26  % ...remaining for further processing  : 16
% 0.07/0.26  % Other redundant clauses eliminated   : 0
% 0.07/0.26  % Clauses deleted for lack of memory   : 0
% 0.07/0.26  % Backward-subsumed                    : 1
% 0.07/0.26  % Backward-rewritten                   : 5
% 0.07/0.26  % Generated clauses                    : 8
% 0.07/0.26  % ...of the previous two non-redundant : 8
% 0.07/0.26  % ...aggressively subsumed             : 0
% 0.07/0.26  % Contextual simplify-reflections      : 1
% 0.07/0.26  % Paramodulations                      : 5
% 0.07/0.26  % Factorizations                       : 0
% 0.07/0.26  % NegExts                              : 0
% 0.07/0.26  % Equation resolutions                 : 0
% 0.07/0.26  % Disequality decompositions           : 0
% 0.07/0.26  % Total rewrite steps                  : 6
% 0.07/0.26  % ...of those cached                   : 2
% 0.07/0.26  % Propositional unsat checks           : 0
% 0.07/0.26  %    Propositional check models        : 0
% 0.07/0.26  %    Propositional check unsatisfiable : 0
% 0.07/0.26  %    Propositional clauses             : 0
% 0.07/0.26  %    Propositional clauses after purity: 0
% 0.07/0.26  %    Propositional unsat core size     : 0
% 0.07/0.26  %    Propositional preprocessing time  : 0.000
% 0.07/0.26  %    Propositional encoding time       : 0.000
% 0.07/0.26  %    Propositional solver time         : 0.000
% 0.07/0.26  %    Success case prop preproc time    : 0.000
% 0.07/0.26  %    Success case prop encoding time   : 0.000
% 0.07/0.26  %    Success case prop solver time     : 0.000
% 0.07/0.26  % Current number of processed clauses  : 7
% 0.07/0.26  %    Positive orientable unit clauses  : 5
% 0.07/0.26  %    Positive unorientable unit clauses: 0
% 0.07/0.26  %    Negative unit clauses             : 1
% 0.07/0.26  %    Non-unit-clauses                  : 1
% 0.07/0.26  % Current number of unprocessed clauses: 2
% 0.07/0.26  % ...number of literals in the above   : 4
% 0.07/0.26  % Current number of archived formulas  : 0
% 0.07/0.26  % Current number of archived clauses   : 9
% 0.07/0.26  % Clause-clause subsumption calls (NU) : 4
% 0.07/0.26  % Rec. Clause-clause subsumption calls : 4
% 0.07/0.26  % Non-unit clause-clause subsumptions  : 1
% 0.07/0.26  % Unit Clause-clause subsumption calls : 4
% 0.07/0.26  % Rewrite failures with RHS unbound    : 0
% 0.07/0.26  % BW rewrite match attempts            : 4
% 0.07/0.26  % BW rewrite match successes           : 4
% 0.07/0.26  % Condensation attempts                : 0
% 0.07/0.26  % Condensation successes               : 0
% 0.07/0.26  % Termbank termtop insertions          : 2613
% 0.07/0.26  % Search garbage collected termcells   : 547
% 0.07/0.26  
% 0.07/0.26  % -------------------------------------------------
% 0.07/0.26  % User time                : 0.003 s
% 0.07/0.26  % System time              : 0.004 s
% 0.07/0.26  % Total time               : 0.007 s
% 0.07/0.26  % Maximum resident set size: 3700 pages
% 0.07/0.26  
% 0.07/0.26  % -------------------------------------------------
% 0.07/0.26  % User time                : 0.007 s
% 0.07/0.26  % System time              : 0.007 s
% 0.07/0.26  % Total time               : 0.014 s
% 0.07/0.26  % Maximum resident set size: 4864 pages
% 0.07/0.26  % E exiting
%------------------------------------------------------------------------------