TSTP Solution File: SYO516^1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n022.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:47:32 EDT 2024

% Result   : Theorem 0.13s 0.40s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   11 (   4 unt;   3 typ;   0 def)
%            Number of atoms       :   20 (   6 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   38 (   3   ~;   0   |;   1   &;  31   @)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   16 (   1   ^  11   !;   4   ?;  16   :)

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

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

thf(decl_24,type,
    esk2_1: ( $i > $i ) > $i ).

thf(descr2,conjecture,
    ( ! [X1: $i] :
      ? [X2: $i] :
        ( ( r @ X1 )
        = ( ^ [X3: $i] : ( X2 = X3 ) ) )
   => ? [X4: $i > $i] :
      ! [X1: $i] : ( r @ X1 @ ( X4 @ X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',descr2) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $i] :
        ? [X2: $i] :
          ( ( r @ X1 )
          = ( $eq @ X2 ) )
     => ? [X4: $i > $i] :
        ! [X1: $i] : ( r @ X1 @ ( X4 @ X1 ) ) ),
    inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[descr2])])]) ).

thf(c_0_2,negated_conjecture,
    ! [X9: $i,X11: $i > $i] :
      ( ( ( r @ X9 )
        = ( $eq @ ( esk1_1 @ X9 ) ) )
      & ~ ( r @ ( esk2_1 @ X11 ) @ ( X11 @ ( esk2_1 @ X11 ) ) ) ),
    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] :
      ( ( r @ X1 )
      = ( $eq @ ( esk1_1 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: $i,X13: $i] :
      ( ( ( esk1_1 @ X1 )
        = X13 )
    <=> ( r @ X1 @ X13 ) ),
    inference(arg_cong,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X4: $i > $i] :
      ~ ( r @ ( esk2_1 @ X4 ) @ ( X4 @ ( esk2_1 @ X4 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: $i] : ( r @ X1 @ ( esk1_1 @ X1 ) ),
    inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]) ).

thf(c_0_7,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_5,c_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : SYO516^1 : TPTP v8.2.0. Released v4.1.0.
% 0.02/0.10  % Command    : run_E %s %d THM
% 0.08/0.29  % Computer : n022.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit   : 300
% 0.08/0.29  % WCLimit    : 300
% 0.08/0.29  % DateTime   : Mon May 20 09:22:53 EDT 2024
% 0.08/0.29  % CPUTime    : 
% 0.13/0.39  Running higher-order theorem proving
% 0.13/0.39  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.13/0.40  # Version: 3.1.0-ho
% 0.13/0.40  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.13/0.40  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.13/0.40  # Starting post_as_ho10 with 300s (1) cores
% 0.13/0.40  # Starting new_bool_9 with 300s (1) cores
% 0.13/0.40  # Starting sh5l with 300s (1) cores
% 0.13/0.40  # ehoh_best_nonlift_nonlambdatoforall with pid 11276 completed with status 0
% 0.13/0.40  # Result found by ehoh_best_nonlift_nonlambdatoforall
% 0.13/0.40  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.13/0.40  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.13/0.40  # No SInE strategy applied
% 0.13/0.40  # Search class: HUUSF-FFSF11-SSSFFFNN
% 0.13/0.40  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.40  # Starting new_ho_10 with 811s (1) cores
% 0.13/0.40  # Starting ehoh_best_nonlift_nonlambdatoforall with 151s (1) cores
% 0.13/0.40  # Starting new_bool_1 with 136s (1) cores
% 0.13/0.40  # Starting new_bool_2 with 136s (1) cores
% 0.13/0.40  # Starting new_bool_9 with 136s (1) cores
% 0.13/0.40  # new_ho_10 with pid 11280 completed with status 0
% 0.13/0.40  # Result found by new_ho_10
% 0.13/0.40  # Preprocessing class: HSSSSMSSSSSNSSN.
% 0.13/0.40  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.40  # Starting ehoh_best_nonlift_nonlambdatoforall with 1500s (5) cores
% 0.13/0.40  # No SInE strategy applied
% 0.13/0.40  # Search class: HUUSF-FFSF11-SSSFFFNN
% 0.13/0.40  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.40  # Starting new_ho_10 with 811s (1) cores
% 0.13/0.40  # Preprocessing time       : 0.001 s
% 0.13/0.40  # Presaturation interreduction done
% 0.13/0.40  
% 0.13/0.40  # Proof found!
% 0.13/0.40  # SZS status Theorem
% 0.13/0.40  # SZS output start CNFRefutation
% See solution above
% 0.13/0.40  # Parsed axioms                        : 2
% 0.13/0.40  # Removed by relevancy pruning/SinE    : 0
% 0.13/0.40  # Initial clauses                      : 3
% 0.13/0.40  # Removed in clause preprocessing      : 1
% 0.13/0.40  # Initial clauses in saturation        : 2
% 0.13/0.40  # Processed clauses                    : 7
% 0.13/0.40  # ...of these trivial                  : 0
% 0.13/0.40  # ...subsumed                          : 0
% 0.13/0.40  # ...remaining for further processing  : 7
% 0.13/0.40  # Other redundant clauses eliminated   : 1
% 0.13/0.40  # Clauses deleted for lack of memory   : 0
% 0.13/0.40  # Backward-subsumed                    : 0
% 0.13/0.40  # Backward-rewritten                   : 0
% 0.13/0.40  # Generated clauses                    : 5
% 0.13/0.40  # ...of the previous two non-redundant : 3
% 0.13/0.40  # ...aggressively subsumed             : 0
% 0.13/0.40  # Contextual simplify-reflections      : 0
% 0.13/0.40  # Paramodulations                      : 1
% 0.13/0.40  # Factorizations                       : 0
% 0.13/0.40  # NegExts                              : 0
% 0.13/0.40  # Equation resolutions                 : 1
% 0.13/0.40  # Disequality decompositions           : 0
% 0.13/0.40  # Total rewrite steps                  : 0
% 0.13/0.40  # ...of those cached                   : 0
% 0.13/0.40  # Propositional unsat checks           : 0
% 0.13/0.40  #    Propositional check models        : 0
% 0.13/0.40  #    Propositional check unsatisfiable : 0
% 0.13/0.40  #    Propositional clauses             : 0
% 0.13/0.40  #    Propositional clauses after purity: 0
% 0.13/0.40  #    Propositional unsat core size     : 0
% 0.13/0.40  #    Propositional preprocessing time  : 0.000
% 0.13/0.40  #    Propositional encoding time       : 0.000
% 0.13/0.40  #    Propositional solver time         : 0.000
% 0.13/0.40  #    Success case prop preproc time    : 0.000
% 0.13/0.40  #    Success case prop encoding time   : 0.000
% 0.13/0.40  #    Success case prop solver time     : 0.000
% 0.13/0.40  # Current number of processed clauses  : 4
% 0.13/0.40  #    Positive orientable unit clauses  : 2
% 0.13/0.40  #    Positive unorientable unit clauses: 0
% 0.13/0.40  #    Negative unit clauses             : 1
% 0.13/0.40  #    Non-unit-clauses                  : 1
% 0.13/0.40  # Current number of unprocessed clauses: 0
% 0.13/0.40  # ...number of literals in the above   : 0
% 0.13/0.40  # Current number of archived formulas  : 0
% 0.13/0.40  # Current number of archived clauses   : 3
% 0.13/0.40  # Clause-clause subsumption calls (NU) : 0
% 0.13/0.40  # Rec. Clause-clause subsumption calls : 0
% 0.13/0.40  # Non-unit clause-clause subsumptions  : 0
% 0.13/0.40  # Unit Clause-clause subsumption calls : 0
% 0.13/0.40  # Rewrite failures with RHS unbound    : 0
% 0.13/0.40  # BW rewrite match attempts            : 0
% 0.13/0.40  # BW rewrite match successes           : 0
% 0.13/0.40  # Condensation attempts                : 7
% 0.13/0.40  # Condensation successes               : 0
% 0.13/0.40  # Termbank termtop insertions          : 286
% 0.13/0.40  # Search garbage collected termcells   : 67
% 0.13/0.40  
% 0.13/0.40  # -------------------------------------------------
% 0.13/0.40  # User time                : 0.004 s
% 0.13/0.40  # System time              : 0.000 s
% 0.13/0.40  # Total time               : 0.004 s
% 0.13/0.40  # Maximum resident set size: 1724 pages
% 0.13/0.40  
% 0.13/0.40  # -------------------------------------------------
% 0.13/0.40  # User time                : 0.010 s
% 0.13/0.40  # System time              : 0.003 s
% 0.13/0.40  # Total time               : 0.013 s
% 0.13/0.40  # Maximum resident set size: 1716 pages
% 0.13/0.40  % E---3.1 exiting
% 0.13/0.40  % E exiting
%------------------------------------------------------------------------------