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

View Problem - Process Solution

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

% Computer : n024.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:44:40 EDT 2024

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

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

thf(decl_23,type,
    esk1_0: $i ).

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

thf(decl_25,type,
    esk3_0: $i ).

thf(decl_26,type,
    esk4_0: $i ).

thf(cTHM66,conjecture,
    ( ? [X1: $i] :
      ! [X2: $i] :
        ( ( cP @ X1 )
       => ( cP @ X2 ) )
  <=> ? [X1: $i] :
        ( ( cP @ X1 )
       => ! [X2: $i] : ( cP @ X2 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM66) ).

thf(c_0_1,negated_conjecture,
    ~ ( ? [X1: $i] :
        ! [X2: $i] :
          ( ( cP @ X1 )
         => ( cP @ X2 ) )
    <=> ? [X1: $i] :
          ( ( cP @ X1 )
         => ! [X2: $i] : ( cP @ X2 ) ) ),
    inference(assume_negation,[status(cth)],[cTHM66]) ).

thf(c_0_2,negated_conjecture,
    ! [X7: $i,X9: $i,X12: $i,X14: $i] :
      ( ( ( cP @ X9 )
        | ( cP @ X7 ) )
      & ( ~ ( cP @ esk2_0 )
        | ( cP @ X7 ) )
      & ( ( cP @ X9 )
        | ~ ( cP @ esk1_0 ) )
      & ( ~ ( cP @ esk2_0 )
        | ~ ( cP @ esk1_0 ) )
      & ( ~ ( cP @ esk3_0 )
        | ( cP @ X12 )
        | ~ ( cP @ esk4_0 )
        | ( cP @ X14 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( cP @ X1 )
      | ( cP @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ~ ( cP @ esk2_0 )
    | ~ ( cP @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i] : ( cP @ X1 ),
    inference(condense,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5])]),
    [proof] ).

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