↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET593^5 : 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 : n026.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:21:59 AM UTC 2026

% Result   : Theorem 0.10s 0.24s
% Output   : CNFRefutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   6 unt;   0 typ;   0 def)
%            Number of atoms       :   48 (   0 equ;   0 cnn)
%            Maximal formula atoms :   21 (   2 avg)
%            Number of connectives :  146 (  34   ~;  24   |;  15   &;  65   @)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

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

thf(decl_23,type,
    epred1_0: a > $o ).

thf(decl_24,type,
    epred2_0: a > $o ).

thf(decl_25,type,
    epred3_0: a > $o ).

thf(decl_26,type,
    esk1_0: a ).

thf(decl_27,type,
    esk2_0: a ).

thf(cBOOL_PROP_52_pme,conjecture,
    ! [X1: a > $o,X2: a > $o,X3: a > $o] :
      ( ! [X4: a] :
          ( ( X1 @ X4 )
         => ( ( X2 @ X4 )
            | ( X3 @ X4 ) ) )
     => ( ! [X4: a] :
            ( ( ( X1 @ X4 )
              & ~ ( X2 @ X4 ) )
           => ( X3 @ X4 ) )
        & ! [X4: a] :
            ( ( ( X1 @ X4 )
              & ~ ( X3 @ X4 ) )
           => ( X2 @ X4 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.bFf5RYO3Mp/E---3.1_602334.p',cBOOL_PROP_52_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o,X3: a > $o] :
        ( ! [X4: a] :
            ( ( X1 @ X4 )
           => ( ( X2 @ X4 )
              | ( X3 @ X4 ) ) )
       => ( ! [X4: a] :
              ( ( ( X1 @ X4 )
                & ~ ( X2 @ X4 ) )
             => ( X3 @ X4 ) )
          & ! [X4: a] :
              ( ( ( X1 @ X4 )
                & ~ ( X3 @ X4 ) )
             => ( X2 @ X4 ) ) ) ),
    inference(assume_negation,[status(cth)],[cBOOL_PROP_52_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X14: a] :
      ( ( ~ ( epred1_0 @ X14 )
        | ( epred2_0 @ X14 )
        | ( epred3_0 @ X14 ) )
      & ( ( epred1_0 @ esk2_0 )
        | ( epred1_0 @ esk1_0 ) )
      & ( ~ ( epred3_0 @ esk2_0 )
        | ( epred1_0 @ esk1_0 ) )
      & ( ~ ( epred2_0 @ esk2_0 )
        | ( epred1_0 @ esk1_0 ) )
      & ( ( epred1_0 @ esk2_0 )
        | ~ ( epred2_0 @ esk1_0 ) )
      & ( ~ ( epred3_0 @ esk2_0 )
        | ~ ( epred2_0 @ esk1_0 ) )
      & ( ~ ( epred2_0 @ esk2_0 )
        | ~ ( epred2_0 @ esk1_0 ) )
      & ( ( epred1_0 @ esk2_0 )
        | ~ ( epred3_0 @ esk1_0 ) )
      & ( ~ ( epred3_0 @ esk2_0 )
        | ~ ( epred3_0 @ esk1_0 ) )
      & ( ~ ( epred2_0 @ esk2_0 )
        | ~ ( epred3_0 @ esk1_0 ) ) ),
    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_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ( ( epred1_0 @ esk1_0 )
    | ~ ( epred3_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X4: a] :
      ( ( epred2_0 @ X4 )
      | ( epred3_0 @ X4 )
      | ~ ( epred1_0 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ( ( epred1_0 @ esk2_0 )
    | ( epred1_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ( epred1_0 @ esk1_0 )
    | ~ ( epred2_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ( ~ ( epred3_0 @ esk2_0 )
    | ~ ( epred2_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

thf(c_0_9,negated_conjecture,
    ( ~ ( epred2_0 @ esk2_0 )
    | ~ ( epred2_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ( ~ ( epred3_0 @ esk2_0 )
    | ~ ( epred3_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    epred1_0 @ esk1_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),c_0_6]) ).

thf(c_0_12,negated_conjecture,
    ~ ( epred2_0 @ esk1_0 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]),c_0_9]) ).

thf(c_0_13,negated_conjecture,
    ( ( epred1_0 @ esk2_0 )
    | ~ ( epred3_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_14,negated_conjecture,
    ( ~ ( epred2_0 @ esk2_0 )
    | ~ ( epred3_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_15,negated_conjecture,
    ~ ( epred3_0 @ esk2_0 ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_4]),c_0_11])]),c_0_12]) ).

thf(c_0_16,negated_conjecture,
    epred1_0 @ esk2_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_4]),c_0_11])]),c_0_12]) ).

thf(c_0_17,negated_conjecture,
    ~ ( epred2_0 @ esk2_0 ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_4]),c_0_11])]),c_0_12]) ).

thf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_4]),c_0_16])]),c_0_17]),
    [proof] ).

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