TSTP Solution File: SEV230^5 by E---3.1.00

View Problem - Process Solution

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

% Computer : n015.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 04:08:02 EDT 2024

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

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

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

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

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

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

thf(decl_26,type,
    esk1_0: a ).

thf(cTHM88_pme,conjecture,
    ! [X1: a > $o,X2: a > $o] :
      ( ! [X3: a] :
          ( ( X1 @ X3 )
         => ( X2 @ X3 ) )
     => ! [X4: ( a > $o ) > $o] :
          ( ! [X5: a > $o] :
              ( ( X4 @ X5 )
             => ! [X6: a] :
                  ( ( X5 @ X6 )
                 => ( X1 @ X6 ) ) )
         => ! [X5: a > $o] :
              ( ( X4 @ X5 )
             => ! [X6: a] :
                  ( ( X5 @ X6 )
                 => ( X2 @ X6 ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM88_pme) ).

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

thf(c_0_2,negated_conjecture,
    ! [X17: a,X19: a > $o,X20: a] :
      ( ( ~ ( epred1_0 @ X17 )
        | ( epred2_0 @ X17 ) )
      & ( ~ ( epred3_0 @ X19 )
        | ~ ( X19 @ X20 )
        | ( epred1_0 @ X20 ) )
      & ( epred3_0 @ epred4_0 )
      & ( epred4_0 @ esk1_0 )
      & ~ ( epred2_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_1])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: a > $o,X3: a] :
      ( ( epred1_0 @ X3 )
      | ~ ( epred3_0 @ X1 )
      | ~ ( X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    epred3_0 @ epred4_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

thf(c_0_6,negated_conjecture,
    ! [X3: a] :
      ( ( epred1_0 @ X3 )
      | ~ ( epred4_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

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

thf(c_0_8,negated_conjecture,
    ! [X3: a] :
      ( ( epred2_0 @ X3 )
      | ~ ( epred4_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_9,negated_conjecture,
    epred4_0 @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SEV230^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n015.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Sun May 19 18:46:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.21/0.52  Running higher-order theorem proving
% 0.21/0.52  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/benchmark/theBenchmark.p
% 0.36/0.53  # Version: 3.1.0-ho
% 0.36/0.53  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.36/0.53  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53  # Starting sh2lt with 1200s (4) cores
% 0.36/0.53  # Starting new_ho_10_unif with 300s (1) cores
% 0.36/0.53  # Starting full_lambda_6 with 300s (1) cores
% 0.36/0.53  # Starting post_as_ho1 with 300s (1) cores
% 0.36/0.53  # Starting ehoh_best3_rw with 300s (1) cores
% 0.36/0.53  # full_lambda_6 with pid 27428 completed with status 0
% 0.36/0.53  # Result found by full_lambda_6
% 0.36/0.53  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.36/0.53  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53  # Starting sh2lt with 1200s (4) cores
% 0.36/0.53  # Starting new_ho_10_unif with 300s (1) cores
% 0.36/0.53  # Starting full_lambda_6 with 300s (1) cores
% 0.36/0.53  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.36/0.53  # Search class: HHUNF-FFSF00-SHHFFSBN
% 0.36/0.53  # partial match(1): HGUNF-FFSF00-SHHFFSBN
% 0.36/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.53  # Starting ho_unfolding_3 with 135s (1) cores
% 0.36/0.53  # ho_unfolding_3 with pid 27433 completed with status 0
% 0.36/0.53  # Result found by ho_unfolding_3
% 0.36/0.53  # Preprocessing class: HSSSSMSSSSSNHHA.
% 0.36/0.53  # Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.53  # Starting sh2lt with 1200s (4) cores
% 0.36/0.53  # Starting new_ho_10_unif with 300s (1) cores
% 0.36/0.53  # Starting full_lambda_6 with 300s (1) cores
% 0.36/0.53  # SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
% 0.36/0.53  # Search class: HHUNF-FFSF00-SHHFFSBN
% 0.36/0.53  # partial match(1): HGUNF-FFSF00-SHHFFSBN
% 0.36/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.53  # Starting ho_unfolding_3 with 135s (1) cores
% 0.36/0.53  # Preprocessing time       : 0.001 s
% 0.36/0.53  # Presaturation interreduction done
% 0.36/0.53  
% 0.36/0.53  # Proof found!
% 0.36/0.53  # SZS status Theorem
% 0.36/0.53  # SZS output start CNFRefutation
% See solution above
% 0.36/0.53  # Parsed axioms                        : 2
% 0.36/0.53  # Removed by relevancy pruning/SinE    : 1
% 0.36/0.53  # Initial clauses                      : 5
% 0.36/0.53  # Removed in clause preprocessing      : 0
% 0.36/0.53  # Initial clauses in saturation        : 5
% 0.36/0.53  # Processed clauses                    : 12
% 0.36/0.53  # ...of these trivial                  : 0
% 0.36/0.53  # ...subsumed                          : 0
% 0.36/0.53  # ...remaining for further processing  : 12
% 0.36/0.53  # Other redundant clauses eliminated   : 0
% 0.36/0.53  # Clauses deleted for lack of memory   : 0
% 0.36/0.53  # Backward-subsumed                    : 0
% 0.36/0.53  # Backward-rewritten                   : 0
% 0.36/0.53  # Generated clauses                    : 3
% 0.36/0.53  # ...of the previous two non-redundant : 2
% 0.36/0.53  # ...aggressively subsumed             : 0
% 0.36/0.53  # Contextual simplify-reflections      : 0
% 0.36/0.53  # Paramodulations                      : 3
% 0.36/0.53  # Factorizations                       : 0
% 0.36/0.53  # NegExts                              : 0
% 0.36/0.53  # Equation resolutions                 : 0
% 0.36/0.53  # Disequality decompositions           : 0
% 0.36/0.53  # Total rewrite steps                  : 1
% 0.36/0.53  # ...of those cached                   : 0
% 0.36/0.53  # Propositional unsat checks           : 0
% 0.36/0.53  #    Propositional check models        : 0
% 0.36/0.53  #    Propositional check unsatisfiable : 0
% 0.36/0.53  #    Propositional clauses             : 0
% 0.36/0.53  #    Propositional clauses after purity: 0
% 0.36/0.53  #    Propositional unsat core size     : 0
% 0.36/0.53  #    Propositional preprocessing time  : 0.000
% 0.36/0.53  #    Propositional encoding time       : 0.000
% 0.36/0.53  #    Propositional solver time         : 0.000
% 0.36/0.53  #    Success case prop preproc time    : 0.000
% 0.36/0.53  #    Success case prop encoding time   : 0.000
% 0.36/0.53  #    Success case prop solver time     : 0.000
% 0.36/0.53  # Current number of processed clauses  : 7
% 0.36/0.53  #    Positive orientable unit clauses  : 2
% 0.36/0.53  #    Positive unorientable unit clauses: 0
% 0.36/0.53  #    Negative unit clauses             : 1
% 0.36/0.53  #    Non-unit-clauses                  : 4
% 0.36/0.53  # Current number of unprocessed clauses: 0
% 0.36/0.53  # ...number of literals in the above   : 0
% 0.36/0.53  # Current number of archived formulas  : 0
% 0.36/0.53  # Current number of archived clauses   : 5
% 0.36/0.53  # Clause-clause subsumption calls (NU) : 2
% 0.36/0.53  # Rec. Clause-clause subsumption calls : 2
% 0.36/0.53  # Non-unit clause-clause subsumptions  : 0
% 0.36/0.53  # Unit Clause-clause subsumption calls : 0
% 0.36/0.53  # Rewrite failures with RHS unbound    : 0
% 0.36/0.53  # BW rewrite match attempts            : 0
% 0.36/0.53  # BW rewrite match successes           : 0
% 0.36/0.53  # Condensation attempts                : 12
% 0.36/0.53  # Condensation successes               : 0
% 0.36/0.53  # Termbank termtop insertions          : 516
% 0.36/0.53  # Search garbage collected termcells   : 201
% 0.36/0.53  
% 0.36/0.53  # -------------------------------------------------
% 0.36/0.53  # User time                : 0.003 s
% 0.36/0.53  # System time              : 0.001 s
% 0.36/0.53  # Total time               : 0.004 s
% 0.36/0.53  # Maximum resident set size: 1744 pages
% 0.36/0.53  
% 0.36/0.53  # -------------------------------------------------
% 0.36/0.53  # User time                : 0.004 s
% 0.36/0.53  # System time              : 0.002 s
% 0.36/0.53  # Total time               : 0.007 s
% 0.36/0.53  # Maximum resident set size: 1712 pages
% 0.36/0.53  % E---3.1 exiting
% 0.36/0.53  % E exiting
%------------------------------------------------------------------------------