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

View Problem - Process Solution

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

% Computer : n027.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:19 EDT 2024

% Result   : Theorem 0.17s 0.45s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   16 (   6 unt;   6 typ;   0 def)
%            Number of atoms       :   22 (  21 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   82 (  16   ~;   2   |;   2   &;  56   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :   12 (  12   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (  10   ^  11   !;   2   ?;  23   :)

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

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

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

thf(decl_23,type,
    esk1_0: b > a ).

thf(decl_24,type,
    esk2_0: b > a ).

thf(decl_25,type,
    esk3_0: b ).

thf(cX5500,conjecture,
    ( ! [X1: b > $o] :
        ( ? [X2: b] : ( X1 @ X2 )
       => ( X1 @ ( cJ @ X1 ) ) )
   => ! [X3: b > a,X4: b > a] :
        ( ( ( X3
            @ ( cJ
              @ ^ [X2: b] :
                  ( ( X3 @ X2 )
                 != ( X4 @ X2 ) ) ) )
          = ( X4
            @ ( cJ
              @ ^ [X2: b] :
                  ( ( X3 @ X2 )
                 != ( X4 @ X2 ) ) ) ) )
       => ( X3 = X4 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5500) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: b > $o] :
          ( ? [X2: b] : ( X1 @ X2 )
         => ( X1 @ ( cJ @ X1 ) ) )
     => ! [X3: b > a,X4: b > a] :
          ( ( ( X3
              @ ( cJ
                @ ^ [Z0: b] :
                    ( ( X3 @ Z0 )
                   != ( X4 @ Z0 ) ) ) )
            = ( X4
              @ ( cJ
                @ ^ [Z0: b] :
                    ( ( X3 @ Z0 )
                   != ( X4 @ Z0 ) ) ) ) )
         => ( X3 = X4 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cX5500])]) ).

thf(c_0_2,negated_conjecture,
    ! [X9: b > $o,X10: b] :
      ( ( ~ ( X9 @ X10 )
        | ( X9 @ ( cJ @ X9 ) ) )
      & ( ( esk1_0
          @ ( cJ
            @ ^ [Z0: b] :
                ( ( esk1_0 @ Z0 )
               != ( esk2_0 @ Z0 ) ) ) )
        = ( esk2_0
          @ ( cJ
            @ ^ [Z0: b] :
                ( ( esk1_0 @ Z0 )
               != ( esk2_0 @ Z0 ) ) ) ) )
      & ( esk1_0 != esk2_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,
    ( ( esk1_0
      @ ( cJ
        @ ^ [Z0: b] :
            ( ( esk1_0 @ Z0 )
           != ( esk2_0 @ Z0 ) ) ) )
    = ( esk2_0
      @ ( cJ
        @ ^ [Z0: b] :
            ( ( esk1_0 @ Z0 )
           != ( esk2_0 @ Z0 ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    esk1_0 != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ( ( esk1_0
      @ ( cJ
        @ ^ [Z0: b] :
            ( ( esk1_0 @ Z0 )
           != ( esk2_0 @ Z0 ) ) ) )
    = ( esk2_0
      @ ( cJ
        @ ^ [Z0: b] :
            ( ( esk1_0 @ Z0 )
           != ( esk2_0 @ Z0 ) ) ) ) ),
    inference(cn,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: b > $o,X2: b] :
      ( ( X1 @ ( cJ @ X1 ) )
      | ~ ( X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ( ( esk1_0 @ esk3_0 )
   != ( esk2_0 @ esk3_0 ) ),
    inference(neg_ext,[status(thm)],[c_0_4]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: b] :
      ( ( esk1_0 @ X2 )
      = ( esk2_0 @ X2 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(choice_inst,[status(thm)],[inference(cn,[status(thm)],[]),c_0_5,c_0_6]),c_0_5])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem    : SYO271^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n027.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 300
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Mon May 20 10:02:38 EDT 2024
% 0.12/0.32  % CPUTime    : 
% 0.17/0.44  Running higher-order theorem proving
% 0.17/0.44  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.17/0.45  # Version: 3.1.0-ho
% 0.17/0.45  # Preprocessing class: HSSSSMSSSSMCSSA.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.17/0.45  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45  # new_bool_3 with pid 25031 completed with status 0
% 0.17/0.45  # Result found by new_bool_3
% 0.17/0.45  # Preprocessing class: HSSSSMSSSSMCSSA.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.17/0.45  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45  # Search class: HHUSF-FFSF11-DSSFFSBC
% 0.17/0.45  # partial match(3): HHUSF-FFSF11-SSSFFMBN
% 0.17/0.45  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45  # Starting ehoh_best_nonlift with 163s (1) cores
% 0.17/0.45  # ehoh_best_nonlift with pid 25033 completed with status 0
% 0.17/0.45  # Result found by ehoh_best_nonlift
% 0.17/0.45  # Preprocessing class: HSSSSMSSSSMCSSA.
% 0.17/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45  # Starting ho_unfolding_3 with 1500s (5) cores
% 0.17/0.45  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45  # Search class: HHUSF-FFSF11-DSSFFSBC
% 0.17/0.45  # partial match(3): HHUSF-FFSF11-SSSFFMBN
% 0.17/0.45  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45  # Starting ehoh_best_nonlift with 163s (1) cores
% 0.17/0.45  # Preprocessing time       : 0.001 s
% 0.17/0.45  # Presaturation interreduction done
% 0.17/0.45  
% 0.17/0.45  # Proof found!
% 0.17/0.45  # SZS status Theorem
% 0.17/0.45  # SZS output start CNFRefutation
% See solution above
% 0.17/0.45  # Parsed axioms                        : 4
% 0.17/0.45  # Removed by relevancy pruning/SinE    : 3
% 0.17/0.45  # Initial clauses                      : 3
% 0.17/0.45  # Removed in clause preprocessing      : 0
% 0.17/0.45  # Initial clauses in saturation        : 3
% 0.17/0.45  # Processed clauses                    : 7
% 0.17/0.45  # ...of these trivial                  : 0
% 0.17/0.45  # ...subsumed                          : 0
% 0.17/0.45  # ...remaining for further processing  : 7
% 0.17/0.45  # Other redundant clauses eliminated   : 0
% 0.17/0.45  # Clauses deleted for lack of memory   : 0
% 0.17/0.45  # Backward-subsumed                    : 0
% 0.17/0.45  # Backward-rewritten                   : 2
% 0.17/0.45  # Generated clauses                    : 6
% 0.17/0.45  # ...of the previous two non-redundant : 5
% 0.17/0.45  # ...aggressively subsumed             : 0
% 0.17/0.45  # Contextual simplify-reflections      : 0
% 0.17/0.45  # Paramodulations                      : 0
% 0.17/0.45  # Factorizations                       : 0
% 0.17/0.45  # NegExts                              : 1
% 0.17/0.45  # Equation resolutions                 : 0
% 0.17/0.45  # Disequality decompositions           : 0
% 0.17/0.45  # Total rewrite steps                  : 4
% 0.17/0.45  # ...of those cached                   : 1
% 0.17/0.45  # Propositional unsat checks           : 0
% 0.17/0.45  #    Propositional check models        : 0
% 0.17/0.45  #    Propositional check unsatisfiable : 0
% 0.17/0.45  #    Propositional clauses             : 0
% 0.17/0.45  #    Propositional clauses after purity: 0
% 0.17/0.45  #    Propositional unsat core size     : 0
% 0.17/0.45  #    Propositional preprocessing time  : 0.000
% 0.17/0.45  #    Propositional encoding time       : 0.000
% 0.17/0.45  #    Propositional solver time         : 0.000
% 0.17/0.45  #    Success case prop preproc time    : 0.000
% 0.17/0.45  #    Success case prop encoding time   : 0.000
% 0.17/0.45  #    Success case prop solver time     : 0.000
% 0.17/0.45  # Current number of processed clauses  : 2
% 0.17/0.45  #    Positive orientable unit clauses  : 1
% 0.17/0.45  #    Positive unorientable unit clauses: 0
% 0.17/0.45  #    Negative unit clauses             : 1
% 0.17/0.45  #    Non-unit-clauses                  : 0
% 0.17/0.45  # Current number of unprocessed clauses: 4
% 0.17/0.45  # ...number of literals in the above   : 7
% 0.17/0.45  # Current number of archived formulas  : 0
% 0.17/0.45  # Current number of archived clauses   : 5
% 0.17/0.45  # Clause-clause subsumption calls (NU) : 0
% 0.17/0.45  # Rec. Clause-clause subsumption calls : 0
% 0.17/0.45  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.45  # Unit Clause-clause subsumption calls : 1
% 0.17/0.45  # Rewrite failures with RHS unbound    : 0
% 0.17/0.45  # BW rewrite match attempts            : 3
% 0.17/0.45  # BW rewrite match successes           : 2
% 0.17/0.45  # Condensation attempts                : 0
% 0.17/0.45  # Condensation successes               : 0
% 0.17/0.45  # Termbank termtop insertions          : 480
% 0.17/0.45  # Search garbage collected termcells   : 119
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.002 s
% 0.17/0.45  # System time              : 0.001 s
% 0.17/0.45  # Total time               : 0.003 s
% 0.17/0.45  # Maximum resident set size: 1756 pages
% 0.17/0.45  
% 0.17/0.45  # -------------------------------------------------
% 0.17/0.45  # User time                : 0.004 s
% 0.17/0.45  # System time              : 0.001 s
% 0.17/0.45  # Total time               : 0.006 s
% 0.17/0.45  # Maximum resident set size: 1720 pages
% 0.17/0.45  % E---3.1 exiting
% 0.17/0.45  % E exiting
%------------------------------------------------------------------------------