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

View Problem - Process Solution

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

% Computer : n016.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:48 EDT 2024

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

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

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

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

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

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

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

thf(c_0_2,negated_conjecture,
    ! [X9: $i,X11: $i,X14: $i,X15: $i,X16: $i] :
      ( ( ~ ( cR @ X9 @ ( esk1_1 @ X9 ) )
        | ~ ( cR @ X11 @ ( esk2_1 @ X11 ) ) )
      & ( ( cR @ esk3_0 @ X14 )
        | ( cR @ X15 @ X16 ) ) ),
    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,X3: $i] :
      ( ( cR @ esk3_0 @ X1 )
      | ( cR @ X2 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ~ ( cR @ X1 @ ( esk1_1 @ X1 ) )
      | ~ ( cR @ X2 @ ( esk2_1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

thf(c_0_6,negated_conjecture,
    ! [X1: $i] :
      ~ ( cR @ X1 @ ( esk1_1 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

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

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