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

View Problem - Process Solution

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

% Computer : n008.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:35 EDT 2024

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

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

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

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

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

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

thf(decl_27,type,
    esk2_1: ( $i > $o ) > $i ).

thf(decl_28,type,
    esk3_1: ( $i > $o ) > $i ).

thf(cBLEDSOE5F,conjecture,
    ? [X1: $i > $o] :
    ! [X2: $i,X3: $i,X4: $i] :
      ( ( ( X1 @ X2 )
        | ( ( X1 @ X3 )
          & ( X1 @ X4 ) ) )
     => ( ( ( p @ X2 )
          & ( cR @ X3 ) )
        | ( ( q @ X2 )
          & ( cT @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE5F) ).

thf(c_0_1,negated_conjecture,
    ~ ? [X1: $i > $o] :
      ! [X2: $i,X3: $i,X4: $i] :
        ( ( ( X1 @ X2 )
          | ( ( X1 @ X3 )
            & ( X1 @ X4 ) ) )
       => ( ( ( p @ X2 )
            & ( cR @ X3 ) )
          | ( ( q @ X2 )
            & ( cT @ X4 ) ) ) ),
    inference(assume_negation,[status(cth)],[cBLEDSOE5F]) ).

thf(c_0_2,negated_conjecture,
    ! [X9: $i > $o] :
      ( ( ( X9 @ ( esk2_1 @ X9 ) )
        | ( X9 @ ( esk1_1 @ X9 ) ) )
      & ( ( X9 @ ( esk3_1 @ X9 ) )
        | ( X9 @ ( esk1_1 @ X9 ) ) )
      & ( ~ ( p @ ( esk1_1 @ X9 ) )
        | ~ ( cR @ ( esk2_1 @ X9 ) ) )
      & ( ~ ( q @ ( esk1_1 @ X9 ) )
        | ~ ( cT @ ( esk3_1 @ X9 ) ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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 > $o] :
      ( ( X1 @ ( esk2_1 @ X1 ) )
      | ( X1 @ ( esk1_1 @ X1 ) ) ),
    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.03/0.12  % Problem    : SYO307^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.14/0.37  % Computer : n008.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Mon May 20 09:20:53 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.24/0.49  Running higher-order theorem proving
% 0.24/0.49  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.24/0.50  # Version: 3.1.0-ho
% 0.24/0.50  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.50  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50  # Starting post_as_ho12 with 300s (1) cores
% 0.24/0.50  # Starting new_bool_9 with 300s (1) cores
% 0.24/0.50  # Starting post_as_ho1 with 300s (1) cores
% 0.24/0.50  # Starting post_as_ho4 with 300s (1) cores
% 0.24/0.50  # Starting post_as_ho2 with 300s (1) cores
% 0.24/0.50  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.24/0.50  # Starting full_lambda_10 with 300s (1) cores
% 0.24/0.50  # Starting new_ho_8 with 300s (1) cores
% 0.24/0.50  # post_as_ho12 with pid 25655 completed with status 0
% 0.24/0.50  # Result found by post_as_ho12
% 0.24/0.50  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.50  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50  # Starting post_as_ho12 with 300s (1) cores
% 0.24/0.50  # No SInE strategy applied
% 0.24/0.50  # Search class: HGHNF-FFSF11-SSSFFMBN
% 0.24/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.50  # Starting post_as_ho2 with 163s (1) cores
% 0.24/0.50  # post_as_ho2 with pid 25664 completed with status 0
% 0.24/0.50  # Result found by post_as_ho2
% 0.24/0.50  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.24/0.50  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.50  # Starting post_as_ho12 with 300s (1) cores
% 0.24/0.50  # No SInE strategy applied
% 0.24/0.50  # Search class: HGHNF-FFSF11-SSSFFMBN
% 0.24/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.50  # Starting post_as_ho2 with 163s (1) cores
% 0.24/0.50  # Preprocessing time       : 0.001 s
% 0.24/0.50  # Presaturation interreduction done
% 0.24/0.50  
% 0.24/0.50  # Proof found!
% 0.24/0.50  # SZS status Theorem
% 0.24/0.50  # SZS output start CNFRefutation
% See solution above
% 0.24/0.50  # Parsed axioms                        : 5
% 0.24/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.24/0.50  # Initial clauses                      : 8
% 0.24/0.50  # Removed in clause preprocessing      : 4
% 0.24/0.50  # Initial clauses in saturation        : 4
% 0.24/0.50  # Processed clauses                    : 3
% 0.24/0.50  # ...of these trivial                  : 0
% 0.24/0.50  # ...subsumed                          : 0
% 0.24/0.50  # ...remaining for further processing  : 2
% 0.24/0.50  # Other redundant clauses eliminated   : 0
% 0.24/0.50  # Clauses deleted for lack of memory   : 0
% 0.24/0.50  # Backward-subsumed                    : 0
% 0.24/0.50  # Backward-rewritten                   : 0
% 0.24/0.50  # Generated clauses                    : 0
% 0.24/0.50  # ...of the previous two non-redundant : 0
% 0.24/0.50  # ...aggressively subsumed             : 0
% 0.24/0.50  # Contextual simplify-reflections      : 0
% 0.24/0.50  # Paramodulations                      : 0
% 0.24/0.50  # Factorizations                       : 0
% 0.24/0.50  # NegExts                              : 0
% 0.24/0.50  # Equation resolutions                 : 0
% 0.24/0.50  # Disequality decompositions           : 0
% 0.24/0.50  # Total rewrite steps                  : 0
% 0.24/0.50  # ...of those cached                   : 0
% 0.24/0.50  # Propositional unsat checks           : 0
% 0.24/0.50  #    Propositional check models        : 0
% 0.24/0.50  #    Propositional check unsatisfiable : 0
% 0.24/0.50  #    Propositional clauses             : 0
% 0.24/0.50  #    Propositional clauses after purity: 0
% 0.24/0.50  #    Propositional unsat core size     : 0
% 0.24/0.50  #    Propositional preprocessing time  : 0.000
% 0.24/0.50  #    Propositional encoding time       : 0.000
% 0.24/0.50  #    Propositional solver time         : 0.000
% 0.24/0.50  #    Success case prop preproc time    : 0.000
% 0.24/0.50  #    Success case prop encoding time   : 0.000
% 0.24/0.50  #    Success case prop solver time     : 0.000
% 0.24/0.50  # Current number of processed clauses  : 2
% 0.24/0.50  #    Positive orientable unit clauses  : 0
% 0.24/0.50  #    Positive unorientable unit clauses: 0
% 0.24/0.50  #    Negative unit clauses             : 0
% 0.24/0.50  #    Non-unit-clauses                  : 2
% 0.24/0.50  # Current number of unprocessed clauses: 1
% 0.24/0.50  # ...number of literals in the above   : 2
% 0.24/0.50  # Current number of archived formulas  : 0
% 0.24/0.50  # Current number of archived clauses   : 0
% 0.24/0.50  # Clause-clause subsumption calls (NU) : 0
% 0.24/0.50  # Rec. Clause-clause subsumption calls : 0
% 0.24/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.24/0.50  # Unit Clause-clause subsumption calls : 0
% 0.24/0.50  # Rewrite failures with RHS unbound    : 0
% 0.24/0.50  # BW rewrite match attempts            : 0
% 0.24/0.50  # BW rewrite match successes           : 0
% 0.24/0.50  # Condensation attempts                : 0
% 0.24/0.50  # Condensation successes               : 0
% 0.24/0.50  # Termbank termtop insertions          : 407
% 0.24/0.50  # Search garbage collected termcells   : 132
% 0.24/0.50  
% 0.24/0.50  # -------------------------------------------------
% 0.24/0.50  # User time                : 0.002 s
% 0.24/0.50  # System time              : 0.002 s
% 0.24/0.50  # Total time               : 0.004 s
% 0.24/0.50  # Maximum resident set size: 1596 pages
% 0.24/0.50  
% 0.24/0.50  # -------------------------------------------------
% 0.24/0.50  # User time                : 0.003 s
% 0.24/0.50  # System time              : 0.005 s
% 0.24/0.50  # Total time               : 0.007 s
% 0.24/0.50  # Maximum resident set size: 1696 pages
% 0.24/0.50  % E---3.1 exiting
% 0.24/0.50  % E exiting
%------------------------------------------------------------------------------