↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:12:00 AM UTC 2026

% Result   : Theorem 0.09s 0.25s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   0 typ;   0 def)
%            Number of atoms       :   19 (   4 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (   4   ~;   0   |;   1   &;  28   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   25 (   8   ^;  17   !;   0   ?;  25   :)

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

thf(decl_36,type,
    mall: ( individuals > $i > $o ) > $i > $o ).

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

thf(decl_42,type,
    epred1_0: individuals > $i > $o ).

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

thf(decl_44,type,
    esk2_0: individuals ).

thf(thm,conjecture,
    ! [X19: individuals > $i > $o] :
      ( ! [X20: individuals] : ( mvalid @ ( X19 @ X20 ) )
     => ( mvalid
        @ ( mall
          @ ^ [X21: individuals] : ( X19 @ X21 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.BKgaXfdzPv/E---3.1_105932.p',thm) ).

thf(mall,axiom,
    ( mall
    = ( ^ [X14: individuals > $i > $o,X15: $i] :
        ! [X16: individuals] : ( X14 @ X16 @ X15 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.BKgaXfdzPv/E---3.1_105932.p',mall) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X11: $i > $o] :
        ! [X15: $i] : ( X11 @ X15 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.BKgaXfdzPv/E---3.1_105932.p',mvalid) ).

thf(c_0_3,negated_conjecture,
    ~ ! [X19: individuals > $i > $o] :
        ( ! [X20: individuals] : ( mvalid @ ( X19 @ X20 ) )
       => ( mvalid
          @ ( mall
            @ ^ [X21: individuals] : ( X19 @ X21 ) ) ) ),
    inference(assume_negation,[status(cth)],[thm]) ).

thf(c_0_4,plain,
    ( mall
    = ( ^ [Z0: individuals > $i > $o,Z1: $i] :
        ! [X16: individuals] : ( Z0 @ X16 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mall]) ).

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

thf(c_0_6,negated_conjecture,
    ~ ! [X19: individuals > $i > $o] :
        ( ! [X20: individuals,X24: $i] : ( X19 @ X20 @ X24 )
       => ! [X26: $i,X25: individuals] : ( X19 @ X25 @ X26 ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_3]),c_0_4]),c_0_5]) ).

thf(c_0_7,negated_conjecture,
    ! [X28: individuals,X29: $i] :
      ( ( epred1_0 @ X28 @ X29 )
      & ~ ( epred1_0 @ esk2_0 @ esk1_0 ) ),
    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_6])])])])]) ).

thf(c_0_8,negated_conjecture,
    ~ ( epred1_0 @ esk2_0 @ esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_9,negated_conjecture,
    ! [X16: individuals,X1: $i] : ( epred1_0 @ X16 @ X1 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL609^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.16  % Computer : n016.cluster.edu
% 0.09/0.16  % Model    : x86_64 x86_64
% 0.09/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16  % Memory   : 8046.5625MB
% 0.09/0.16  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 09:32:49 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  Running higher-order theorem proving
% 0.09/0.23  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.BKgaXfdzPv/E---3.1_105932.p
% 0.09/0.25  % Version: 3.5.1-ho
% 0.09/0.25  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25  % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.25  % Starting sh1l with 300s (1) cores
% 0.09/0.25  % Starting post_as_ho10 with 300s (1) cores
% 0.09/0.25  % post_as_ho1 with pid 105946 completed with status 0
% 0.09/0.25  % Result found by post_as_ho1
% 0.09/0.25  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25  % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25  % No SInE strategy applied
% 0.09/0.25  % Search class: HUUNF-FFSF00-SHSSMFNN
% 0.09/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.25  % SubtermCWHack with pid 105949 completed with status 0
% 0.09/0.25  % Result found by SubtermCWHack
% 0.09/0.25  % Preprocessing class: HSSSSMSSMLSNHSN.
% 0.09/0.25  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.25  % Starting new_ho_9 with 1500s (5) cores
% 0.09/0.25  % Starting post_as_ho1 with 300s (1) cores
% 0.09/0.25  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.25  % No SInE strategy applied
% 0.09/0.25  % Search class: HUUNF-FFSF00-SHSSMFNN
% 0.09/0.25  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.25  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.25  % Preprocessing time       : 0.001 s
% 0.09/0.25  
% 0.09/0.25  % Proof found!
% 0.09/0.25  % SZS status Theorem
% 0.09/0.25  % SZS output start CNFRefutation
% See solution above
% 0.09/0.25  % Parsed axioms                        : 36
% 0.09/0.25  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.25  % Initial clauses                      : 22
% 0.09/0.25  % Removed in clause preprocessing      : 20
% 0.09/0.25  % Initial clauses in saturation        : 2
% 0.09/0.25  % Processed clauses                    : 2
% 0.09/0.25  % ...of these trivial                  : 0
% 0.09/0.25  % ...subsumed                          : 0
% 0.09/0.25  % ...remaining for further processing  : 1
% 0.09/0.25  % Other redundant clauses eliminated   : 0
% 0.09/0.25  % Clauses deleted for lack of memory   : 0
% 0.09/0.25  % Backward-subsumed                    : 0
% 0.09/0.25  % Backward-rewritten                   : 0
% 0.09/0.25  % Generated clauses                    : 0
% 0.09/0.25  % ...of the previous two non-redundant : 0
% 0.09/0.25  % ...aggressively subsumed             : 0
% 0.09/0.25  % Contextual simplify-reflections      : 0
% 0.09/0.25  % Paramodulations                      : 0
% 0.09/0.25  % Factorizations                       : 0
% 0.09/0.25  % NegExts                              : 0
% 0.09/0.25  % Equation resolutions                 : 0
% 0.09/0.25  % Disequality decompositions           : 0
% 0.09/0.25  % Total rewrite steps                  : 1
% 0.09/0.25  % ...of those cached                   : 0
% 0.09/0.25  % Propositional unsat checks           : 0
% 0.09/0.25  %    Propositional check models        : 0
% 0.09/0.25  %    Propositional check unsatisfiable : 0
% 0.09/0.25  %    Propositional clauses             : 0
% 0.09/0.25  %    Propositional clauses after purity: 0
% 0.09/0.25  %    Propositional unsat core size     : 0
% 0.09/0.25  %    Propositional preprocessing time  : 0.000
% 0.09/0.25  %    Propositional encoding time       : 0.000
% 0.09/0.25  %    Propositional solver time         : 0.000
% 0.09/0.25  %    Success case prop preproc time    : 0.000
% 0.09/0.25  %    Success case prop encoding time   : 0.000
% 0.09/0.25  %    Success case prop solver time     : 0.000
% 0.09/0.25  % Current number of processed clauses  : 1
% 0.09/0.25  %    Positive orientable unit clauses  : 1
% 0.09/0.25  %    Positive unorientable unit clauses: 0
% 0.09/0.25  %    Negative unit clauses             : 0
% 0.09/0.25  %    Non-unit-clauses                  : 0
% 0.09/0.25  % Current number of unprocessed clauses: 0
% 0.09/0.25  % ...number of literals in the above   : 0
% 0.09/0.25  % Current number of archived formulas  : 0
% 0.09/0.25  % Current number of archived clauses   : 0
% 0.09/0.25  % Clause-clause subsumption calls (NU) : 0
% 0.09/0.25  % Rec. Clause-clause subsumption calls : 0
% 0.09/0.25  % Non-unit clause-clause subsumptions  : 0
% 0.09/0.25  % Unit Clause-clause subsumption calls : 0
% 0.09/0.25  % Rewrite failures with RHS unbound    : 0
% 0.09/0.25  % BW rewrite match attempts            : 0
% 0.09/0.25  % BW rewrite match successes           : 0
% 0.09/0.25  % Condensation attempts                : 0
% 0.09/0.25  % Condensation successes               : 0
% 0.09/0.25  % Termbank termtop insertions          : 898
% 0.09/0.25  % Search garbage collected termcells   : 159
% 0.09/0.25  
% 0.09/0.25  % -------------------------------------------------
% 0.09/0.25  % User time                : 0.003 s
% 0.09/0.25  % System time              : 0.001 s
% 0.09/0.25  % Total time               : 0.004 s
% 0.09/0.25  % Maximum resident set size: 3668 pages
% 0.09/0.25  
% 0.09/0.25  % -------------------------------------------------
% 0.09/0.25  % User time                : 0.007 s
% 0.09/0.25  % System time              : 0.003 s
% 0.09/0.25  % Total time               : 0.010 s
% 0.09/0.25  % Maximum resident set size: 4864 pages
% 0.09/0.25  % E exiting
%------------------------------------------------------------------------------