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

View Problem - Process Solution

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

% Computer : n019.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 07:44:34 EDT 2024

% Result   : Theorem 0.20s 0.49s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   24 (   7 unt;  10 typ;   0 def)
%            Number of atoms       :   48 (   0 equ;   0 cnn)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  197 (  15   ~;  11   |;  11   &; 148   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (  10 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   15 (  15   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (  10 usr;   2 con; 0-3 aty)
%            Number of variables   :   68 (   0   ^  56   !;  12   ?;  68   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    cD: $i > $i > $i > $o ).

thf(decl_23,type,
    cF: $i > $i > $o ).

thf(decl_24,type,
    cS: $i > $i > $o ).

thf(decl_25,type,
    esk1_1: $i > $i ).

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

thf(decl_27,type,
    esk3_1: $i > $i ).

thf(decl_28,type,
    esk4_1: $i > $i ).

thf(decl_29,type,
    esk5_1: $i > $i ).

thf(decl_30,type,
    esk6_2: $i > $i > $i ).

thf(decl_31,type,
    esk7_2: $i > $i > $i ).

thf(cX2138,conjecture,
    ( ( ! [X1: $i] :
        ? [X2: $i] : ( cF @ X1 @ X2 )
      & ? [X1: $i] :
        ! [X3: $i] :
        ? [X4: $i] :
        ! [X5: $i] :
          ( ( cS @ X4 @ X5 )
         => ( cD @ X5 @ X1 @ X3 ) )
      & ! [X3: $i] :
        ? [X6: $i] :
        ! [X7: $i,X8: $i] :
          ( ( cD @ X7 @ X8 @ X6 )
         => ! [X2: $i,X9: $i] :
              ( ( ( cF @ X7 @ X2 )
                & ( cF @ X8 @ X9 ) )
             => ( cD @ X2 @ X9 @ X3 ) ) ) )
   => ? [X2: $i] :
      ! [X3: $i] :
      ? [X10: $i] :
      ! [X5: $i] :
        ( ( cS @ X10 @ X5 )
       => ! [X9: $i] :
            ( ( cF @ X5 @ X9 )
           => ( cD @ X9 @ X2 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2138) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( ! [X1: $i] :
          ? [X2: $i] : ( cF @ X1 @ X2 )
        & ? [X1: $i] :
          ! [X3: $i] :
          ? [X4: $i] :
          ! [X5: $i] :
            ( ( cS @ X4 @ X5 )
           => ( cD @ X5 @ X1 @ X3 ) )
        & ! [X3: $i] :
          ? [X6: $i] :
          ! [X7: $i,X8: $i] :
            ( ( cD @ X7 @ X8 @ X6 )
           => ! [X2: $i,X9: $i] :
                ( ( ( cF @ X7 @ X2 )
                  & ( cF @ X8 @ X9 ) )
               => ( cD @ X2 @ X9 @ X3 ) ) ) )
     => ? [X2: $i] :
        ! [X3: $i] :
        ? [X10: $i] :
        ! [X5: $i] :
          ( ( cS @ X10 @ X5 )
         => ! [X9: $i] :
              ( ( cF @ X5 @ X9 )
             => ( cD @ X9 @ X2 @ X3 ) ) ) ),
    inference(assume_negation,[status(cth)],[cX2138]) ).

thf(c_0_2,negated_conjecture,
    ! [X28: $i,X31: $i,X33: $i,X34: $i,X36: $i,X37: $i,X38: $i,X39: $i,X40: $i,X42: $i] :
      ( ( cF @ X28 @ ( esk1_1 @ X28 ) )
      & ( ~ ( cS @ ( esk3_1 @ X31 ) @ X33 )
        | ( cD @ X33 @ esk2_0 @ X31 ) )
      & ( ~ ( cD @ X36 @ X37 @ ( esk4_1 @ X34 ) )
        | ~ ( cF @ X36 @ X38 )
        | ~ ( cF @ X37 @ X39 )
        | ( cD @ X38 @ X39 @ X34 ) )
      & ( cS @ X42 @ ( esk6_2 @ X40 @ X42 ) )
      & ( cF @ ( esk6_2 @ X40 @ X42 ) @ ( esk7_2 @ X40 @ X42 ) )
      & ~ ( cD @ ( esk7_2 @ X40 @ X42 ) @ X40 @ ( esk5_1 @ X40 ) ) ),
    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: $i,X2: $i] :
      ( ( cD @ X2 @ esk2_0 @ X1 )
      | ~ ( cS @ ( esk3_1 @ X1 ) @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X2: $i,X1: $i] : ( cS @ X1 @ ( esk6_2 @ X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i,X3: $i,X2: $i,X4: $i,X5: $i] :
      ( ( cD @ X4 @ X5 @ X3 )
      | ~ ( cD @ X1 @ X2 @ ( esk4_1 @ X3 ) )
      | ~ ( cF @ X1 @ X4 )
      | ~ ( cF @ X2 @ X5 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: $i,X2: $i] : ( cD @ ( esk6_2 @ X1 @ ( esk3_1 @ X2 ) ) @ esk2_0 @ X2 ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: $i,X4: $i,X3: $i,X2: $i] :
      ( ( cD @ X1 @ X2 @ X3 )
      | ~ ( cF @ ( esk6_2 @ X4 @ ( esk3_1 @ ( esk4_1 @ X3 ) ) ) @ X1 )
      | ~ ( cF @ esk2_0 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: $i,X2: $i] : ( cF @ ( esk6_2 @ X1 @ X2 ) @ ( esk7_2 @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ! [X2: $i,X1: $i] :
      ~ ( cD @ ( esk7_2 @ X1 @ X2 ) @ X1 @ ( esk5_1 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_10,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( cD @ ( esk7_2 @ X1 @ ( esk3_1 @ ( esk4_1 @ X2 ) ) ) @ X3 @ X2 )
      | ~ ( cF @ esk2_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_11,negated_conjecture,
    ! [X1: $i] :
      ~ ( cF @ esk2_0 @ X1 ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: $i] : ( cF @ X1 @ ( esk1_1 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_13,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_11,c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN386^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n019.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon May 20 13:40:23 EDT 2024
% 0.12/0.34  % CPUTime    : 
% 0.20/0.48  Running higher-order theorem proving
% 0.20/0.48  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.20/0.49  # Version: 3.1.0-ho
% 0.20/0.49  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49  # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49  # Starting sh4l with 300s (1) cores
% 0.20/0.49  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.20/0.49  # ho_unfolding_6 with pid 10421 completed with status 0
% 0.20/0.49  # Result found by ho_unfolding_6
% 0.20/0.49  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49  # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: HHUNS-FFSF21-SFFFFFNN
% 0.20/0.49  # partial match(1): FHUNS-FFSF21-SFFFFFNN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.49  # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 10425 completed with status 0
% 0.20/0.49  # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 0.20/0.49  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting new_ho_10 with 1500s (5) cores
% 0.20/0.49  # Starting ho_unfolding_6 with 300s (1) cores
% 0.20/0.49  # No SInE strategy applied
% 0.20/0.49  # Search class: HHUNS-FFSF21-SFFFFFNN
% 0.20/0.49  # partial match(1): FHUNS-FFSF21-SFFFFFNN
% 0.20/0.49  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.20/0.49  # Preprocessing time       : 0.001 s
% 0.20/0.49  # Presaturation interreduction done
% 0.20/0.49  
% 0.20/0.49  # Proof found!
% 0.20/0.49  # SZS status Theorem
% 0.20/0.49  # SZS output start CNFRefutation
% See solution above
% 0.20/0.49  # Parsed axioms                        : 4
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.49  # Initial clauses                      : 9
% 0.20/0.49  # Removed in clause preprocessing      : 3
% 0.20/0.49  # Initial clauses in saturation        : 6
% 0.20/0.49  # Processed clauses                    : 16
% 0.20/0.49  # ...of these trivial                  : 0
% 0.20/0.49  # ...subsumed                          : 0
% 0.20/0.49  # ...remaining for further processing  : 16
% 0.20/0.49  # Other redundant clauses eliminated   : 0
% 0.20/0.49  # Clauses deleted for lack of memory   : 0
% 0.20/0.49  # Backward-subsumed                    : 2
% 0.20/0.49  # Backward-rewritten                   : 0
% 0.20/0.49  # Generated clauses                    : 7
% 0.20/0.49  # ...of the previous two non-redundant : 6
% 0.20/0.49  # ...aggressively subsumed             : 0
% 0.20/0.49  # Contextual simplify-reflections      : 0
% 0.20/0.49  # Paramodulations                      : 7
% 0.20/0.49  # Factorizations                       : 0
% 0.20/0.49  # NegExts                              : 0
% 0.20/0.49  # Equation resolutions                 : 0
% 0.20/0.49  # Disequality decompositions           : 0
% 0.20/0.49  # Total rewrite steps                  : 0
% 0.20/0.49  # ...of those cached                   : 0
% 0.20/0.49  # Propositional unsat checks           : 0
% 0.20/0.49  #    Propositional check models        : 0
% 0.20/0.49  #    Propositional check unsatisfiable : 0
% 0.20/0.49  #    Propositional clauses             : 0
% 0.20/0.49  #    Propositional clauses after purity: 0
% 0.20/0.49  #    Propositional unsat core size     : 0
% 0.20/0.49  #    Propositional preprocessing time  : 0.000
% 0.20/0.49  #    Propositional encoding time       : 0.000
% 0.20/0.49  #    Propositional solver time         : 0.000
% 0.20/0.49  #    Success case prop preproc time    : 0.000
% 0.20/0.49  #    Success case prop encoding time   : 0.000
% 0.20/0.49  #    Success case prop solver time     : 0.000
% 0.20/0.49  # Current number of processed clauses  : 8
% 0.20/0.49  #    Positive orientable unit clauses  : 4
% 0.20/0.49  #    Positive unorientable unit clauses: 0
% 0.20/0.49  #    Negative unit clauses             : 2
% 0.20/0.49  #    Non-unit-clauses                  : 2
% 0.20/0.49  # Current number of unprocessed clauses: 2
% 0.20/0.49  # ...number of literals in the above   : 6
% 0.20/0.49  # Current number of archived formulas  : 0
% 0.20/0.49  # Current number of archived clauses   : 8
% 0.20/0.49  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.49  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.49  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.49  # Unit Clause-clause subsumption calls : 3
% 0.20/0.49  # Rewrite failures with RHS unbound    : 0
% 0.20/0.49  # BW rewrite match attempts            : 0
% 0.20/0.49  # BW rewrite match successes           : 0
% 0.20/0.49  # Condensation attempts                : 0
% 0.20/0.49  # Condensation successes               : 0
% 0.20/0.49  # Termbank termtop insertions          : 872
% 0.20/0.49  # Search garbage collected termcells   : 303
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.004 s
% 0.20/0.49  # System time              : 0.002 s
% 0.20/0.49  # Total time               : 0.006 s
% 0.20/0.49  # Maximum resident set size: 1756 pages
% 0.20/0.49  
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.004 s
% 0.20/0.49  # System time              : 0.005 s
% 0.20/0.49  # Total time               : 0.010 s
% 0.20/0.49  # Maximum resident set size: 1700 pages
% 0.20/0.49  % E---3.1 exiting
% 0.20/0.49  % E exiting
%------------------------------------------------------------------------------