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

View Problem - Process Solution

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

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

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    y: $i ).

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

thf(decl_24,type,
    x: $i ).

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

thf(decl_26,type,
    cR: $i > $o ).

thf(cTEST3,conjecture,
    ( ! [X1: $i > $o] : ( X1 @ y )
   => ( ( cR @ x )
      & ( cR @ ( f @ x ) )
      & ( cQ @ y ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTEST3) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $i > $o] : ( X1 @ y )
     => ( ( cR @ x )
        & ( cR @ ( f @ x ) )
        & ( cQ @ y ) ) ),
    inference(assume_negation,[status(cth)],[cTEST3]) ).

thf(c_0_2,negated_conjecture,
    ! [X3: $i > $o] :
      ( ( X3 @ y )
      & ( ~ ( cR @ x )
        | ~ ( cR @ ( f @ x ) )
        | ~ ( cQ @ y ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: $i > $o] : ( X1 @ y ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    $false,
    inference(flex_resolve,[status(thm)],[c_0_3]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem    : SYO291^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n007.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon May 20 10:00:08 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.23/0.52  Running higher-order theorem proving
% 0.23/0.52  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.23/0.53  # Version: 3.1.0-ho
% 0.23/0.53  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.23/0.53  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.53  # Starting new_bool_9 with 300s (1) cores
% 0.23/0.53  # Starting post_as_ho1 with 300s (1) cores
% 0.23/0.53  # Starting post_as_ho4 with 300s (1) cores
% 0.23/0.53  # Starting post_as_ho2 with 300s (1) cores
% 0.23/0.53  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.53  # Starting full_lambda_10 with 300s (1) cores
% 0.23/0.53  # Starting new_ho_8 with 300s (1) cores
% 0.23/0.53  # post_as_ho1 with pid 30512 completed with status 0
% 0.23/0.53  # Result found by post_as_ho1
% 0.23/0.53  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.23/0.53  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.53  # Starting new_bool_9 with 300s (1) cores
% 0.23/0.53  # Starting post_as_ho1 with 300s (1) cores
% 0.23/0.53  # No SInE strategy applied
% 0.23/0.53  # Search class: HUHNF-FFSF11-SSSFFMBN
% 0.23/0.53  # partial match(1): HGHNF-FFSF11-SSSFFMBN
% 0.23/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53  # Starting post_as_ho2 with 163s (1) cores
% 0.23/0.53  # post_as_ho2 with pid 30518 completed with status 0
% 0.23/0.53  # Result found by post_as_ho2
% 0.23/0.53  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.23/0.53  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.53  # Starting post_as_ho12 with 300s (1) cores
% 0.23/0.53  # Starting new_bool_9 with 300s (1) cores
% 0.23/0.53  # Starting post_as_ho1 with 300s (1) cores
% 0.23/0.53  # No SInE strategy applied
% 0.23/0.53  # Search class: HUHNF-FFSF11-SSSFFMBN
% 0.23/0.53  # partial match(1): HGHNF-FFSF11-SSSFFMBN
% 0.23/0.53  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.53  # Starting post_as_ho2 with 163s (1) cores
% 0.23/0.53  # Preprocessing time       : 0.001 s
% 0.23/0.53  # Presaturation interreduction done
% 0.23/0.53  
% 0.23/0.53  # Proof found!
% 0.23/0.53  # SZS status Theorem
% 0.23/0.53  # SZS output start CNFRefutation
% See solution above
% 0.23/0.53  # Parsed axioms                        : 6
% 0.23/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.23/0.53  # Initial clauses                      : 7
% 0.23/0.53  # Removed in clause preprocessing      : 5
% 0.23/0.53  # Initial clauses in saturation        : 2
% 0.23/0.53  # Processed clauses                    : 1
% 0.23/0.53  # ...of these trivial                  : 0
% 0.23/0.53  # ...subsumed                          : 0
% 0.23/0.53  # ...remaining for further processing  : 0
% 0.23/0.53  # Other redundant clauses eliminated   : 0
% 0.23/0.53  # Clauses deleted for lack of memory   : 0
% 0.23/0.53  # Backward-subsumed                    : 0
% 0.23/0.53  # Backward-rewritten                   : 0
% 0.23/0.53  # Generated clauses                    : 0
% 0.23/0.53  # ...of the previous two non-redundant : 0
% 0.23/0.53  # ...aggressively subsumed             : 0
% 0.23/0.53  # Contextual simplify-reflections      : 0
% 0.23/0.53  # Paramodulations                      : 0
% 0.23/0.53  # Factorizations                       : 0
% 0.23/0.53  # NegExts                              : 0
% 0.23/0.53  # Equation resolutions                 : 0
% 0.23/0.53  # Disequality decompositions           : 0
% 0.23/0.53  # Total rewrite steps                  : 0
% 0.23/0.53  # ...of those cached                   : 0
% 0.23/0.53  # Propositional unsat checks           : 0
% 0.23/0.53  #    Propositional check models        : 0
% 0.23/0.53  #    Propositional check unsatisfiable : 0
% 0.23/0.53  #    Propositional clauses             : 0
% 0.23/0.53  #    Propositional clauses after purity: 0
% 0.23/0.53  #    Propositional unsat core size     : 0
% 0.23/0.53  #    Propositional preprocessing time  : 0.000
% 0.23/0.53  #    Propositional encoding time       : 0.000
% 0.23/0.53  #    Propositional solver time         : 0.000
% 0.23/0.53  #    Success case prop preproc time    : 0.000
% 0.23/0.53  #    Success case prop encoding time   : 0.000
% 0.23/0.53  #    Success case prop solver time     : 0.000
% 0.23/0.53  # Current number of processed clauses  : 0
% 0.23/0.53  #    Positive orientable unit clauses  : 0
% 0.23/0.53  #    Positive unorientable unit clauses: 0
% 0.23/0.53  #    Negative unit clauses             : 0
% 0.23/0.53  #    Non-unit-clauses                  : 0
% 0.23/0.53  # Current number of unprocessed clauses: 1
% 0.23/0.53  # ...number of literals in the above   : 3
% 0.23/0.53  # Current number of archived formulas  : 0
% 0.23/0.53  # Current number of archived clauses   : 0
% 0.23/0.53  # Clause-clause subsumption calls (NU) : 0
% 0.23/0.53  # Rec. Clause-clause subsumption calls : 0
% 0.23/0.53  # Non-unit clause-clause subsumptions  : 0
% 0.23/0.53  # Unit Clause-clause subsumption calls : 0
% 0.23/0.53  # Rewrite failures with RHS unbound    : 0
% 0.23/0.53  # BW rewrite match attempts            : 0
% 0.23/0.53  # BW rewrite match successes           : 0
% 0.23/0.53  # Condensation attempts                : 0
% 0.23/0.53  # Condensation successes               : 0
% 0.23/0.53  # Termbank termtop insertions          : 215
% 0.23/0.53  # Search garbage collected termcells   : 35
% 0.23/0.53  
% 0.23/0.53  # -------------------------------------------------
% 0.23/0.53  # User time                : 0.003 s
% 0.23/0.53  # System time              : 0.000 s
% 0.23/0.53  # Total time               : 0.003 s
% 0.23/0.53  # Maximum resident set size: 1604 pages
% 0.23/0.53  
% 0.23/0.53  # -------------------------------------------------
% 0.23/0.53  # User time                : 0.003 s
% 0.23/0.53  # System time              : 0.003 s
% 0.23/0.53  # Total time               : 0.006 s
% 0.23/0.53  # Maximum resident set size: 1696 pages
% 0.23/0.53  % E---3.1 exiting
% 0.23/0.53  % E exiting
%------------------------------------------------------------------------------