TSTP Solution File: SEU783^2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU783^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.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 03:30:12 EDT 2024

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

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

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

thf(decl_24,type,
    binunionIL: $o ).

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

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

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

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

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

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

thf(decl_31,type,
    esk5_0: $i ).

thf(breln1unionIL,conjecture,
    ( binunionIL
   => ! [X1: $i,X4: $i] :
        ( ( breln1 @ X1 @ X4 )
       => ! [X5: $i] :
            ( ( breln1 @ X1 @ X5 )
           => ! [X3: $i] :
                ( ( in @ X3 @ X1 )
               => ! [X6: $i] :
                    ( ( in @ X6 @ X1 )
                   => ( ( in @ ( kpair @ X3 @ X6 ) @ X4 )
                     => ( in @ ( kpair @ X3 @ X6 ) @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',breln1unionIL) ).

thf(binunionIL,axiom,
    ( binunionIL
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ( in @ X3 @ ( binunion @ X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionIL) ).

thf(c_0_2,negated_conjecture,
    ~ ( ! [X15: $i,X16: $i,X17: $i] :
          ( ( in @ X17 @ X15 )
         => ( in @ X17 @ ( binunion @ X15 @ X16 ) ) )
     => ! [X1: $i,X4: $i] :
          ( ( breln1 @ X1 @ X4 )
         => ! [X5: $i] :
              ( ( breln1 @ X1 @ X5 )
             => ! [X3: $i] :
                  ( ( in @ X3 @ X1 )
                 => ! [X6: $i] :
                      ( ( in @ X6 @ X1 )
                     => ( ( in @ ( kpair @ X3 @ X6 ) @ X4 )
                       => ( in @ ( kpair @ X3 @ X6 ) @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1unionIL]),binunionIL]) ).

thf(c_0_3,negated_conjecture,
    ! [X18: $i,X19: $i,X20: $i] :
      ( ( ~ ( in @ X20 @ X18 )
        | ( in @ X20 @ ( binunion @ X18 @ X19 ) ) )
      & ( breln1 @ esk1_0 @ esk2_0 )
      & ( breln1 @ esk1_0 @ esk3_0 )
      & ( in @ esk4_0 @ esk1_0 )
      & ( in @ esk5_0 @ esk1_0 )
      & ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 )
      & ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ esk3_0 ) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).

thf(c_0_4,negated_conjecture,
    ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_5,negated_conjecture,
    ! [X1: $i,X3: $i,X2: $i] :
      ( ( in @ X1 @ ( binunion @ X2 @ X3 ) )
      | ~ ( in @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

thf(c_0_6,negated_conjecture,
    in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : SEU783^2 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.09  % Command    : run_E %s %d THM
% 0.08/0.29  % Computer : n025.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit   : 300
% 0.08/0.29  % WCLimit    : 300
% 0.08/0.29  % DateTime   : Sun May 19 16:40:22 EDT 2024
% 0.08/0.29  % CPUTime    : 
% 0.13/0.40  Running higher-order theorem proving
% 0.13/0.40  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.13/0.41  # Version: 3.1.0-ho
% 0.13/0.41  # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.13/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41  # Starting new_ho_10 with 1500s (5) cores
% 0.13/0.41  # Starting sh5l with 300s (1) cores
% 0.13/0.41  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.13/0.41  # Starting lpo1_def_fix with 300s (1) cores
% 0.13/0.41  # ehoh_best_sine_rwall with pid 2335 completed with status 0
% 0.13/0.41  # Result found by ehoh_best_sine_rwall
% 0.13/0.41  # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.13/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41  # Starting new_ho_10 with 1500s (5) cores
% 0.13/0.41  # Starting sh5l with 300s (1) cores
% 0.13/0.41  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.13/0.41  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.41  # Search class: HHUNF-FFSS22-SFFFMFNN
% 0.13/0.41  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41  # Starting new_ho_10 with 163s (1) cores
% 0.13/0.41  # new_ho_10 with pid 2338 completed with status 0
% 0.13/0.41  # Result found by new_ho_10
% 0.13/0.41  # Preprocessing class: HSSSSMSSSLSNFFN.
% 0.13/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41  # Starting new_ho_10 with 1500s (5) cores
% 0.13/0.41  # Starting sh5l with 300s (1) cores
% 0.13/0.41  # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.13/0.41  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.41  # Search class: HHUNF-FFSS22-SFFFMFNN
% 0.13/0.41  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.41  # Starting new_ho_10 with 163s (1) cores
% 0.13/0.41  # Preprocessing time       : 0.001 s
% 0.13/0.41  # Presaturation interreduction done
% 0.13/0.41  
% 0.13/0.41  # Proof found!
% 0.13/0.41  # SZS status Theorem
% 0.13/0.41  # SZS output start CNFRefutation
% See solution above
% 0.13/0.41  # Parsed axioms                        : 7
% 0.13/0.41  # Removed by relevancy pruning/SinE    : 5
% 0.13/0.41  # Initial clauses                      : 7
% 0.13/0.41  # Removed in clause preprocessing      : 0
% 0.13/0.41  # Initial clauses in saturation        : 7
% 0.13/0.41  # Processed clauses                    : 14
% 0.13/0.41  # ...of these trivial                  : 0
% 0.13/0.41  # ...subsumed                          : 0
% 0.13/0.41  # ...remaining for further processing  : 14
% 0.13/0.41  # Other redundant clauses eliminated   : 0
% 0.13/0.41  # Clauses deleted for lack of memory   : 0
% 0.13/0.41  # Backward-subsumed                    : 0
% 0.13/0.41  # Backward-rewritten                   : 0
% 0.13/0.41  # Generated clauses                    : 1
% 0.13/0.41  # ...of the previous two non-redundant : 0
% 0.13/0.41  # ...aggressively subsumed             : 0
% 0.13/0.41  # Contextual simplify-reflections      : 0
% 0.13/0.41  # Paramodulations                      : 1
% 0.13/0.41  # Factorizations                       : 0
% 0.13/0.41  # NegExts                              : 0
% 0.13/0.41  # Equation resolutions                 : 0
% 0.13/0.41  # Disequality decompositions           : 0
% 0.13/0.41  # Total rewrite steps                  : 1
% 0.13/0.41  # ...of those cached                   : 0
% 0.13/0.41  # Propositional unsat checks           : 0
% 0.13/0.41  #    Propositional check models        : 0
% 0.13/0.41  #    Propositional check unsatisfiable : 0
% 0.13/0.41  #    Propositional clauses             : 0
% 0.13/0.41  #    Propositional clauses after purity: 0
% 0.13/0.41  #    Propositional unsat core size     : 0
% 0.13/0.41  #    Propositional preprocessing time  : 0.000
% 0.13/0.41  #    Propositional encoding time       : 0.000
% 0.13/0.41  #    Propositional solver time         : 0.000
% 0.13/0.41  #    Success case prop preproc time    : 0.000
% 0.13/0.41  #    Success case prop encoding time   : 0.000
% 0.13/0.41  #    Success case prop solver time     : 0.000
% 0.13/0.41  # Current number of processed clauses  : 7
% 0.13/0.41  #    Positive orientable unit clauses  : 5
% 0.13/0.41  #    Positive unorientable unit clauses: 0
% 0.13/0.41  #    Negative unit clauses             : 1
% 0.13/0.41  #    Non-unit-clauses                  : 1
% 0.13/0.41  # Current number of unprocessed clauses: 0
% 0.13/0.41  # ...number of literals in the above   : 0
% 0.13/0.41  # Current number of archived formulas  : 0
% 0.13/0.41  # Current number of archived clauses   : 7
% 0.13/0.41  # Clause-clause subsumption calls (NU) : 0
% 0.13/0.41  # Rec. Clause-clause subsumption calls : 0
% 0.13/0.41  # Non-unit clause-clause subsumptions  : 0
% 0.13/0.41  # Unit Clause-clause subsumption calls : 0
% 0.13/0.41  # Rewrite failures with RHS unbound    : 0
% 0.13/0.41  # BW rewrite match attempts            : 0
% 0.13/0.41  # BW rewrite match successes           : 0
% 0.13/0.41  # Condensation attempts                : 14
% 0.13/0.41  # Condensation successes               : 0
% 0.13/0.41  # Termbank termtop insertions          : 481
% 0.13/0.41  # Search garbage collected termcells   : 187
% 0.13/0.41  
% 0.13/0.41  # -------------------------------------------------
% 0.13/0.41  # User time                : 0.001 s
% 0.13/0.41  # System time              : 0.002 s
% 0.13/0.41  # Total time               : 0.003 s
% 0.13/0.41  # Maximum resident set size: 1748 pages
% 0.13/0.41  
% 0.13/0.41  # -------------------------------------------------
% 0.13/0.41  # User time                : 0.002 s
% 0.13/0.41  # System time              : 0.003 s
% 0.13/0.41  # Total time               : 0.005 s
% 0.13/0.41  # Maximum resident set size: 1700 pages
% 0.13/0.41  % E---3.1 exiting
% 0.13/0.41  % E exiting
%------------------------------------------------------------------------------