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

View Problem - Process Solution

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

% Computer : n018.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 08:45:43 EDT 2024

% Result   : Theorem 0.20s 0.48s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   18 (   3 unt;   6 typ;   0 def)
%            Number of atoms       :   57 (   5 equ;   0 cnn)
%            Maximal formula atoms :   13 (   4 avg)
%            Number of connectives :  103 (  19   ~;  19   |;   4   &;  49   @)
%                                         (   4 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   18 (  18   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^  14   !;   0   ?;  14   :)

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

thf(decl_sort2,type,
    gtype: $tType ).

thf(decl_22,type,
    g: b > $o ).

thf(decl_23,type,
    h: ( b > $o ) > gtype ).

thf(decl_24,type,
    f: b > $o ).

thf(decl_25,type,
    esk1_0: b ).

thf(cEXT1,conjecture,
    ( ( ! [X1: b] :
          ( ( f @ X1 )
        <=> ( g @ X1 ) )
     => ! [X2: ( b > $o ) > $o] :
          ( ( X2 @ f )
         => ( X2 @ g ) ) )
   => ( ! [X1: b] :
          ( ( f @ X1 )
        <=> ( g @ X1 ) )
     => ( ( h @ f )
        = ( h @ g ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEXT1) ).

thf(c_0_1,negated_conjecture,
    ~ ( ( ! [X1: b] :
            ( ( f @ X1 )
          <=> ( g @ X1 ) )
       => ! [X2: ( b > $o ) > $o] :
            ( ( X2 @ f )
           => ( X2 @ g ) ) )
     => ( ! [X1: b] :
            ( ( f @ X1 )
          <=> ( g @ X1 ) )
       => ( ( h @ f )
          = ( h @ g ) ) ) ),
    inference(assume_negation,[status(cth)],[cEXT1]) ).

thf(c_0_2,negated_conjecture,
    ! [X7: ( b > $o ) > $o,X8: b] :
      ( ( ~ ( f @ esk1_0 )
        | ~ ( g @ esk1_0 )
        | ~ ( X7 @ f )
        | ( X7 @ g ) )
      & ( ( f @ esk1_0 )
        | ( g @ esk1_0 )
        | ~ ( X7 @ f )
        | ( X7 @ g ) )
      & ( ~ ( f @ X8 )
        | ( g @ X8 ) )
      & ( ~ ( g @ X8 )
        | ( f @ X8 ) )
      & ( ( h @ f )
       != ( h @ g ) ) ),
    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,
    ! [X2: ( b > $o ) > $o] :
      ( ( X2 @ g )
      | ~ ( f @ esk1_0 )
      | ~ ( g @ esk1_0 )
      | ~ ( X2 @ f ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: b] :
      ( ( f @ X1 )
      | ~ ( g @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X2: ( b > $o ) > $o] :
      ( ( f @ esk1_0 )
      | ( g @ esk1_0 )
      | ( X2 @ g )
      | ~ ( X2 @ f ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: b] :
      ( ( g @ X1 )
      | ~ ( f @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X2: ( b > $o ) > $o] :
      ( ( X2 @ g )
      | ~ ( g @ esk1_0 )
      | ~ ( X2 @ f ) ),
    inference(csr,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_8,negated_conjecture,
    ( ( h @ f )
   != ( h @ g ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ! [X2: ( b > $o ) > $o] :
      ( ( X2 @ g )
      | ~ ( X2 @ f ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).

thf(c_0_10,negated_conjecture,
    g != f,
    inference(ext_eqres,[status(thm)],[c_0_8]) ).

thf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_9]),c_0_10]),
    [proof] ).

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