↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PUZ150^18 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n006.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:20:38 AM UTC 2026

% Result   : Theorem 0.24s 0.34s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   21 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   8 equ;   0 cnn)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  109 (  11   ~;   2   |;   7   &;  85   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   8 con; 0-3 aty)
%            Number of variables   :   35 (  18   ^;  13   !;   4   ?;  35   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    mindex: $tType ).

thf(decl_sort2,type,
    mworld: $tType ).

thf(decl_23,type,
    mrel: mindex > mworld > mworld > $o ).

thf(decl_24,type,
    '#c': mindex ).

thf(decl_25,type,
    '#b': mindex ).

thf(decl_26,type,
    '#a': mindex ).

thf(decl_27,type,
    mactual: mworld ).

thf(decl_28,type,
    mlocal: ( mworld > $o ) > $o ).

thf(decl_29,type,
    mnot: ( mworld > $o ) > mworld > $o ).

thf(decl_34,type,
    mbox: mindex > ( mworld > $o ) > mworld > $o ).

thf(decl_35,type,
    mdia: mindex > ( mworld > $o ) > mworld > $o ).

thf(decl_41,type,
    a0: mworld > $o ).

thf(decl_46,type,
    esk1_0: mworld ).

thf(decl_47,type,
    esk2_0: mworld ).

thf(decl_48,type,
    esk3_0: mworld ).

thf(con,conjecture,
    mlocal @ ( mbox @ '#b' @ ( mnot @ ( mdia @ '#a' @ ( mdia @ '#b' @ ( mbox @ '#c' @ ( mnot @ a0 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p',con) ).

thf(mlocal_def,axiom,
    ( mlocal
    = ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p',mlocal_def) ).

thf(mnot_def,axiom,
    ( mnot
    = ( ^ [X2: mworld > $o,X3: mworld] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p',mnot_def) ).

thf(mbox_def,axiom,
    ( mbox
    = ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
        ! [X6: mworld] :
          ( ( mrel @ X5 @ X3 @ X6 )
         => ( X1 @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p',mbox_def) ).

thf(mdia_def,axiom,
    ( mdia
    = ( ^ [X5: mindex,X1: mworld > $o,X3: mworld] :
        ? [X6: mworld] :
          ( ( mrel @ X5 @ X3 @ X6 )
          & ( X1 @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p',mdia_def) ).

thf('mrel_#c_universal',axiom,
    ! [X3: mworld,X6: mworld] : ( mrel @ '#c' @ X3 @ X6 ),
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p','mrel_#c_universal') ).

thf(axiom_a0,axiom,
    mlocal @ a0,
    file('/export/starexec/sandbox2/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p',axiom_a0) ).

thf(c_0_7,negated_conjecture,
    ~ ( mlocal @ ( mbox @ '#b' @ ( mnot @ ( mdia @ '#a' @ ( mdia @ '#b' @ ( mbox @ '#c' @ ( mnot @ a0 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_8,plain,
    ( mlocal
    = ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
    inference(fof_simplification,[status(thm)],[mlocal_def]) ).

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

thf(c_0_10,plain,
    ( mbox
    = ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
        ! [X6: mworld] :
          ( ( mrel @ Z0 @ Z2 @ X6 )
         => ( Z1 @ X6 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_def]) ).

thf(c_0_11,plain,
    ( mdia
    = ( ^ [Z0: mindex,Z1: mworld > $o,Z2: mworld] :
        ? [X6: mworld] :
          ( ( mrel @ Z0 @ Z2 @ X6 )
          & ( Z1 @ X6 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mdia_def]) ).

thf(c_0_12,negated_conjecture,
    ~ ! [X51: mworld] :
        ( ( mrel @ '#b' @ mactual @ X51 )
       => ~ ? [X50: mworld] :
              ( ( mrel @ '#a' @ X51 @ X50 )
              & ? [X49: mworld] :
                  ( ( mrel @ '#b' @ X50 @ X49 )
                  & ! [X48: mworld] :
                      ( ( mrel @ '#c' @ X49 @ X48 )
                     => ~ ( a0 @ X48 ) ) ) ) ),
    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)],[c_0_7,c_0_8]),c_0_9]),c_0_10]),c_0_11])]) ).

thf(c_0_13,negated_conjecture,
    ! [X96: mworld] :
      ( ( mrel @ '#b' @ mactual @ esk1_0 )
      & ( mrel @ '#a' @ esk1_0 @ esk2_0 )
      & ( mrel @ '#b' @ esk2_0 @ esk3_0 )
      & ( ~ ( mrel @ '#c' @ esk3_0 @ X96 )
        | ~ ( a0 @ X96 ) ) ),
    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_12])])])])]) ).

thf(c_0_14,plain,
    ! [X52: mworld,X53: mworld] : ( mrel @ '#c' @ X52 @ X53 ),
    inference(variable_rename,[status(thm)],['mrel_#c_universal']) ).

thf(c_0_15,plain,
    a0 @ mactual,
    inference(apply_def,[status(thm)],[axiom_a0,c_0_8]) ).

thf(c_0_16,negated_conjecture,
    ! [X3: mworld] :
      ( ~ ( mrel @ '#c' @ esk3_0 @ X3 )
      | ~ ( a0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_17,plain,
    ! [X3: mworld,X6: mworld] : ( mrel @ '#c' @ X3 @ X6 ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_18,plain,
    a0 @ mactual,
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_19,negated_conjecture,
    ! [X3: mworld] :
      ~ ( a0 @ X3 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

thf(c_0_20,plain,
    $false,
    inference(sr,[status(thm)],[c_0_18,c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ150^18 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  % Computer : n006.cluster.edu
% 0.10/0.23  % Model    : x86_64 x86_64
% 0.10/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.23  % Memory   : 8046.5625MB
% 0.10/0.23  % OS       : Linux 6.8.0-71-generic
% 0.10/0.23  % CPULimit : 300
% 0.10/0.23  % WCLimit  : 300
% 0.10/0.23  % DateTime : Tue Sep 29 13:27:24 UTC 2026
% 0.10/0.24  % CPUTime  : 
% 0.10/0.24  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.30  Running higher-order theorem proving
% 0.24/0.32  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/tmp/tmp.9a3PUMuyhL/E---3.1_704241.p
% 0.24/0.34  % Version: 3.5.1-ho
% 0.24/0.34  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.24/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.34  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.34  % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.34  % Starting post_as_ho11 with 300s (1) cores
% 0.24/0.34  % Starting full_lambda_8 with 300s (1) cores
% 0.24/0.34  % post_as_ho3 with pid 704255 completed with status 0
% 0.24/0.34  % Result found by post_as_ho3
% 0.24/0.34  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.24/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.34  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.34  % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.34  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.34  % No SInE strategy applied
% 0.24/0.34  % Search class: HGHNS-FFMS00-SHSSMFNN
% 0.24/0.34  % partial match(2): HGHNF-FFSS00-SHSSMFNN
% 0.24/0.34  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.34  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.34  % SubtermCWHack with pid 704263 completed with status 0
% 0.24/0.34  % Result found by SubtermCWHack
% 0.24/0.34  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.24/0.34  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.34  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.24/0.34  % Starting post_as_ho3 with 300s (1) cores
% 0.24/0.34  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.34  % No SInE strategy applied
% 0.24/0.34  % Search class: HGHNS-FFMS00-SHSSMFNN
% 0.24/0.34  % partial match(2): HGHNF-FFSS00-SHSSMFNN
% 0.24/0.34  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.34  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.34  % Preprocessing time       : 0.002 s
% 0.24/0.34  
% 0.24/0.34  % Proof found!
% 0.24/0.34  % SZS status Theorem
% 0.24/0.34  % SZS output start CNFRefutation
% See solution above
% 0.24/0.34  % Parsed axioms                        : 45
% 0.24/0.34  % Removed by relevancy pruning/SinE    : 0
% 0.24/0.34  % Initial clauses                      : 40
% 0.24/0.34  % Removed in clause preprocessing      : 25
% 0.24/0.34  % Initial clauses in saturation        : 15
% 0.24/0.34  % Processed clauses                    : 8
% 0.24/0.34  % ...of these trivial                  : 0
% 0.24/0.34  % ...subsumed                          : 0
% 0.24/0.34  % ...remaining for further processing  : 8
% 0.24/0.34  % Other redundant clauses eliminated   : 0
% 0.24/0.34  % Clauses deleted for lack of memory   : 0
% 0.24/0.34  % Backward-subsumed                    : 0
% 0.24/0.34  % Backward-rewritten                   : 3
% 0.24/0.34  % Generated clauses                    : 1
% 0.24/0.34  % ...of the previous two non-redundant : 0
% 0.24/0.34  % ...aggressively subsumed             : 0
% 0.24/0.34  % Contextual simplify-reflections      : 0
% 0.24/0.34  % Paramodulations                      : 0
% 0.24/0.34  % Factorizations                       : 0
% 0.24/0.34  % NegExts                              : 0
% 0.24/0.34  % Equation resolutions                 : 0
% 0.24/0.34  % Disequality decompositions           : 0
% 0.24/0.34  % Total rewrite steps                  : 4
% 0.24/0.34  % ...of those cached                   : 0
% 0.24/0.34  % Propositional unsat checks           : 0
% 0.24/0.34  %    Propositional check models        : 0
% 0.24/0.34  %    Propositional check unsatisfiable : 0
% 0.24/0.34  %    Propositional clauses             : 0
% 0.24/0.34  %    Propositional clauses after purity: 0
% 0.24/0.34  %    Propositional unsat core size     : 0
% 0.24/0.34  %    Propositional preprocessing time  : 0.000
% 0.24/0.34  %    Propositional encoding time       : 0.000
% 0.24/0.34  %    Propositional solver time         : 0.000
% 0.24/0.34  %    Success case prop preproc time    : 0.000
% 0.24/0.34  %    Success case prop encoding time   : 0.000
% 0.24/0.34  %    Success case prop solver time     : 0.000
% 0.24/0.34  % Current number of processed clauses  : 4
% 0.24/0.34  %    Positive orientable unit clauses  : 3
% 0.24/0.34  %    Positive unorientable unit clauses: 0
% 0.24/0.34  %    Negative unit clauses             : 1
% 0.24/0.34  %    Non-unit-clauses                  : 0
% 0.24/0.34  % Current number of unprocessed clauses: 7
% 0.24/0.34  % ...number of literals in the above   : 56
% 0.24/0.34  % Current number of archived formulas  : 0
% 0.24/0.34  % Current number of archived clauses   : 4
% 0.24/0.34  % Clause-clause subsumption calls (NU) : 0
% 0.24/0.34  % Rec. Clause-clause subsumption calls : 0
% 0.24/0.34  % Non-unit clause-clause subsumptions  : 0
% 0.24/0.34  % Unit Clause-clause subsumption calls : 0
% 0.24/0.34  % Rewrite failures with RHS unbound    : 0
% 0.24/0.34  % BW rewrite match attempts            : 3
% 0.24/0.34  % BW rewrite match successes           : 3
% 0.24/0.34  % Condensation attempts                : 0
% 0.24/0.34  % Condensation successes               : 0
% 0.24/0.34  % Termbank termtop insertions          : 4113
% 0.24/0.34  % Search garbage collected termcells   : 1536
% 0.24/0.34  
% 0.24/0.34  % -------------------------------------------------
% 0.24/0.34  % User time                : 0.006 s
% 0.24/0.34  % System time              : 0.004 s
% 0.24/0.34  % Total time               : 0.010 s
% 0.24/0.34  % Maximum resident set size: 3920 pages
% 0.24/0.34  
% 0.24/0.34  % -------------------------------------------------
% 0.24/0.34  % User time                : 0.008 s
% 0.24/0.34  % System time              : 0.008 s
% 0.24/0.34  % Total time               : 0.017 s
% 0.24/0.34  % Maximum resident set size: 4864 pages
% 0.24/0.34  % E exiting
%------------------------------------------------------------------------------