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

View Problem - Process Solution

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

% Computer : n016.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:42:52 EDT 2024

% Result   : Theorem 0.16s 0.44s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   31 (   5 unt;   9 typ;   0 def)
%            Number of atoms       :  148 (   0 equ;   0 cnn)
%            Maximal formula atoms :   74 (   6 avg)
%            Number of connectives :  336 (  63   ~;  75   |;  35   &; 147   @)
%                                         (   0 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   31 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :   31 (   0   ^  27   !;   4   ?;  31   :)

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

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

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

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

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

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

thf(decl_28,type,
    esk3_0: $i ).

thf(decl_29,type,
    esk4_0: $i ).

thf(decl_30,type,
    esk5_0: $i ).

thf(cPELL29,conjecture,
    ( ( ? [X1: $i] : ( cF @ X1 )
      & ? [X1: $i] : ( cG @ X1 ) )
   => ( ( ( ! [X1: $i] :
              ( ( cF @ X1 )
             => ( cH @ X1 ) )
          & ! [X1: $i] :
              ( ( cG @ X1 )
             => ( cJ @ X1 ) ) )
       => ! [X1: $i,X2: $i] :
            ( ( ( cF @ X1 )
              & ( cG @ X2 ) )
           => ( ( cH @ X1 )
              & ( cJ @ X2 ) ) ) )
      & ( ! [X1: $i,X2: $i] :
            ( ( ( cF @ X1 )
              & ( cG @ X2 ) )
           => ( ( cH @ X1 )
              & ( cJ @ X2 ) ) )
       => ! [X1: $i] :
            ( ( cG @ X1 )
           => ( cJ @ X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPELL29) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( ? [X1: $i] : ( cF @ X1 )
        & ? [X1: $i] : ( cG @ X1 ) )
     => ( ( ( ! [X1: $i] :
                ( ( cF @ X1 )
               => ( cH @ X1 ) )
            & ! [X1: $i] :
                ( ( cG @ X1 )
               => ( cJ @ X1 ) ) )
         => ! [X1: $i,X2: $i] :
              ( ( ( cF @ X1 )
                & ( cG @ X2 ) )
             => ( ( cH @ X1 )
                & ( cJ @ X2 ) ) ) )
        & ( ! [X1: $i,X2: $i] :
              ( ( ( cF @ X1 )
                & ( cG @ X2 ) )
             => ( ( cH @ X1 )
                & ( cJ @ X2 ) ) )
         => ! [X1: $i] :
              ( ( cG @ X1 )
             => ( cJ @ X1 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cPELL29]) ).

thf(c_0_2,negated_conjecture,
    ! [X14: $i,X15: $i,X18: $i,X19: $i] :
      ( ( cF @ esk1_0 )
      & ( cG @ esk2_0 )
      & ( ( cH @ X18 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ~ ( cF @ X14 )
        | ( cH @ X14 ) )
      & ( ( cJ @ X19 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ~ ( cF @ X14 )
        | ( cH @ X14 ) )
      & ( ( cG @ esk5_0 )
        | ~ ( cF @ X14 )
        | ( cH @ X14 ) )
      & ( ~ ( cJ @ esk5_0 )
        | ~ ( cF @ X14 )
        | ( cH @ X14 ) )
      & ( ( cH @ X18 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ~ ( cG @ X15 )
        | ( cJ @ X15 ) )
      & ( ( cJ @ X19 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ~ ( cG @ X15 )
        | ( cJ @ X15 ) )
      & ( ( cG @ esk5_0 )
        | ~ ( cG @ X15 )
        | ( cJ @ X15 ) )
      & ( ~ ( cJ @ esk5_0 )
        | ~ ( cG @ X15 )
        | ( cJ @ X15 ) )
      & ( ( cH @ X18 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ( cF @ esk3_0 ) )
      & ( ( cJ @ X19 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ( cF @ esk3_0 ) )
      & ( ( cG @ esk5_0 )
        | ( cF @ esk3_0 ) )
      & ( ~ ( cJ @ esk5_0 )
        | ( cF @ esk3_0 ) )
      & ( ( cH @ X18 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ( cG @ esk4_0 ) )
      & ( ( cJ @ X19 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ( cG @ esk4_0 ) )
      & ( ( cG @ esk5_0 )
        | ( cG @ esk4_0 ) )
      & ( ~ ( cJ @ esk5_0 )
        | ( cG @ esk4_0 ) )
      & ( ( cH @ X18 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ~ ( cH @ esk3_0 )
        | ~ ( cJ @ esk4_0 ) )
      & ( ( cJ @ X19 )
        | ~ ( cF @ X18 )
        | ~ ( cG @ X19 )
        | ~ ( cH @ esk3_0 )
        | ~ ( cJ @ esk4_0 ) )
      & ( ( cG @ esk5_0 )
        | ~ ( cH @ esk3_0 )
        | ~ ( cJ @ esk4_0 ) )
      & ( ~ ( cJ @ esk5_0 )
        | ~ ( cH @ esk3_0 )
        | ~ ( cJ @ esk4_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,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( cJ @ X1 )
      | ( cJ @ X3 )
      | ~ ( cF @ X2 )
      | ~ ( cG @ X1 )
      | ~ ( cG @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ( cG @ esk5_0 )
    | ~ ( cH @ esk3_0 )
    | ~ ( cJ @ esk4_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ esk5_0 )
      | ( cH @ X1 )
      | ~ ( cF @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ( cG @ esk5_0 )
    | ( cF @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( cJ @ X1 )
      | ~ ( cG @ X1 )
      | ~ ( cF @ X2 ) ),
    inference(condense,[status(thm)],[c_0_3]) ).

thf(c_0_8,negated_conjecture,
    cF @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ( ( cG @ esk5_0 )
    | ~ ( cJ @ esk4_0 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ! [X1: $i] :
      ( ( cG @ esk5_0 )
      | ( cJ @ X1 )
      | ~ ( cG @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ( ( cG @ esk5_0 )
    | ( cG @ esk4_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_12,negated_conjecture,
    ( ~ ( cJ @ esk5_0 )
    | ~ ( cH @ esk3_0 )
    | ~ ( cJ @ esk4_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i] :
      ( ( cH @ X1 )
      | ~ ( cJ @ esk5_0 )
      | ~ ( cF @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_14,negated_conjecture,
    ( ( cF @ esk3_0 )
    | ~ ( cJ @ esk5_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_15,negated_conjecture,
    ( ( cG @ esk4_0 )
    | ~ ( cJ @ esk5_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: $i] :
      ( ( cJ @ X1 )
      | ~ ( cG @ X1 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_17,negated_conjecture,
    cG @ esk5_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

thf(c_0_18,negated_conjecture,
    ( ~ ( cJ @ esk4_0 )
    | ~ ( cJ @ esk5_0 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

thf(c_0_19,negated_conjecture,
    cG @ esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

thf(c_0_20,negated_conjecture,
    ~ ( cJ @ esk5_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_19])]) ).

thf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : SYN059^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n016.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon May 20 13:53:38 EDT 2024
% 0.10/0.32  % CPUTime    : 
% 0.16/0.43  Running higher-order theorem proving
% 0.16/0.43  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/benchmark/theBenchmark.p
% 0.16/0.44  # Version: 3.1.0-ho
% 0.16/0.44  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44  # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.44  # Starting sh4l with 300s (1) cores
% 0.16/0.44  # Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.16/0.44  # ho_unfolding_6 with pid 9673 completed with status 0
% 0.16/0.44  # Result found by ho_unfolding_6
% 0.16/0.44  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44  # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.44  # No SInE strategy applied
% 0.16/0.44  # Search class: HGHNF-FFSS00-SFFFFFNN
% 0.16/0.44  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44  # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44  # new_ho_10 with pid 9676 completed with status 0
% 0.16/0.44  # Result found by new_ho_10
% 0.16/0.44  # Preprocessing class: HSSSSMSSSSSNFFN.
% 0.16/0.44  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.44  # Starting new_ho_10 with 1500s (5) cores
% 0.16/0.44  # Starting ho_unfolding_6 with 300s (1) cores
% 0.16/0.44  # No SInE strategy applied
% 0.16/0.44  # Search class: HGHNF-FFSS00-SFFFFFNN
% 0.16/0.44  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.44  # Starting new_ho_10 with 163s (1) cores
% 0.16/0.44  # Preprocessing time       : 0.001 s
% 0.16/0.44  # Presaturation interreduction done
% 0.16/0.44  
% 0.16/0.44  # Proof found!
% 0.16/0.44  # SZS status Theorem
% 0.16/0.44  # SZS output start CNFRefutation
% See solution above
% 0.16/0.44  # Parsed axioms                        : 5
% 0.16/0.44  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.44  # Initial clauses                      : 26
% 0.16/0.44  # Removed in clause preprocessing      : 4
% 0.16/0.44  # Initial clauses in saturation        : 22
% 0.16/0.44  # Processed clauses                    : 44
% 0.16/0.44  # ...of these trivial                  : 0
% 0.16/0.44  # ...subsumed                          : 2
% 0.16/0.44  # ...remaining for further processing  : 42
% 0.16/0.44  # Other redundant clauses eliminated   : 0
% 0.16/0.44  # Clauses deleted for lack of memory   : 0
% 0.16/0.44  # Backward-subsumed                    : 13
% 0.16/0.44  # Backward-rewritten                   : 7
% 0.16/0.44  # Generated clauses                    : 15
% 0.16/0.44  # ...of the previous two non-redundant : 12
% 0.16/0.44  # ...aggressively subsumed             : 0
% 0.16/0.44  # Contextual simplify-reflections      : 3
% 0.16/0.44  # Paramodulations                      : 15
% 0.16/0.44  # Factorizations                       : 0
% 0.16/0.44  # NegExts                              : 0
% 0.16/0.44  # Equation resolutions                 : 0
% 0.16/0.44  # Disequality decompositions           : 0
% 0.16/0.44  # Total rewrite steps                  : 11
% 0.16/0.44  # ...of those cached                   : 8
% 0.16/0.44  # Propositional unsat checks           : 0
% 0.16/0.44  #    Propositional check models        : 0
% 0.16/0.44  #    Propositional check unsatisfiable : 0
% 0.16/0.44  #    Propositional clauses             : 0
% 0.16/0.44  #    Propositional clauses after purity: 0
% 0.16/0.44  #    Propositional unsat core size     : 0
% 0.16/0.44  #    Propositional preprocessing time  : 0.000
% 0.16/0.44  #    Propositional encoding time       : 0.000
% 0.16/0.44  #    Propositional solver time         : 0.000
% 0.16/0.44  #    Success case prop preproc time    : 0.000
% 0.16/0.44  #    Success case prop encoding time   : 0.000
% 0.16/0.44  #    Success case prop solver time     : 0.000
% 0.16/0.44  # Current number of processed clauses  : 8
% 0.16/0.44  #    Positive orientable unit clauses  : 5
% 0.16/0.44  #    Positive unorientable unit clauses: 0
% 0.16/0.44  #    Negative unit clauses             : 1
% 0.16/0.44  #    Non-unit-clauses                  : 2
% 0.16/0.44  # Current number of unprocessed clauses: 1
% 0.16/0.44  # ...number of literals in the above   : 2
% 0.16/0.44  # Current number of archived formulas  : 0
% 0.16/0.44  # Current number of archived clauses   : 34
% 0.16/0.44  # Clause-clause subsumption calls (NU) : 22
% 0.16/0.44  # Rec. Clause-clause subsumption calls : 21
% 0.16/0.44  # Non-unit clause-clause subsumptions  : 21
% 0.16/0.44  # Unit Clause-clause subsumption calls : 1
% 0.16/0.44  # Rewrite failures with RHS unbound    : 0
% 0.16/0.44  # BW rewrite match attempts            : 3
% 0.16/0.44  # BW rewrite match successes           : 3
% 0.16/0.44  # Condensation attempts                : 44
% 0.16/0.44  # Condensation successes               : 4
% 0.16/0.44  # Termbank termtop insertions          : 1482
% 0.16/0.44  # Search garbage collected termcells   : 296
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.005 s
% 0.16/0.44  # System time              : 0.001 s
% 0.16/0.44  # Total time               : 0.006 s
% 0.16/0.44  # Maximum resident set size: 1772 pages
% 0.16/0.44  
% 0.16/0.44  # -------------------------------------------------
% 0.16/0.44  # User time                : 0.007 s
% 0.16/0.44  # System time              : 0.001 s
% 0.16/0.44  # Total time               : 0.008 s
% 0.16/0.44  # Maximum resident set size: 1696 pages
% 0.16/0.44  % E---3.1 exiting
% 0.16/0.44  % E exiting
%------------------------------------------------------------------------------