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

View Problem - Process Solution

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

% Computer : n032.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:46 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_22,type,
    cQ: $o ).

thf(decl_23,type,
    cP: $o ).

thf(cEXT_O_LEIB,conjecture,
    ( ! [X1: $o > $o] :
        ( ( X1 @ cP )
       => ( X1 @ cQ ) )
   => ( cP
    <=> cQ ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEXT_O_LEIB) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: $o > $o] :
          ( ( X1 @ cP )
         => ( X1 @ cQ ) )
     => ( cP
      <=> cQ ) ),
    inference(assume_negation,[status(cth)],[cEXT_O_LEIB]) ).

thf(c_0_2,negated_conjecture,
    ! [X3: $o > $o] :
      ( ( ~ ( X3 @ cP )
        | ( X3 @ cQ ) )
      & ( ~ cP
        | ~ cQ )
      & ( cP
        | cQ ) ),
    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: $o > $o] :
      ( ( X1 @ cQ )
      | ~ ( X1 @ cP ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( cQ
  <=> cP ),
    inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ( cP
    | cQ ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ~ cP
    | ~ cQ ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    cP,
    inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4]),c_0_5]) ).

thf(c_0_8,negated_conjecture,
    ~ cQ,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

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

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