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

View Problem - Process Solution

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

% Computer : n019.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:28:37 EDT 2024

% Result   : Theorem 0.19s 0.47s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   18 (   3 unt;   8 typ;   0 def)
%            Number of atoms       :   27 (   0 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  138 (   8   ~;   5   |;   2   &; 113   @)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (  10 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   27 (   0   ^  27   !;   0   ?;  27   :)

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

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

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

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

thf(decl_26,type,
    setunionI: $o ).

thf(decl_27,type,
    secondinupair: $o ).

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

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

thf(setukpairIR,conjecture,
    ( setunionI
   => ( secondinupair
     => ! [X2: $i,X4: $i] : ( in @ X4 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setukpairIR) ).

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

thf(secondinupair,axiom,
    ( secondinupair
  <=> ! [X2: $i,X4: $i] : ( in @ X4 @ ( setadjoin @ X2 @ ( setadjoin @ X4 @ emptyset ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',secondinupair) ).

thf(c_0_3,negated_conjecture,
    ~ ( ! [X12: $i,X13: $i,X14: $i] :
          ( ( in @ X13 @ X14 )
         => ( ( in @ X14 @ X12 )
           => ( in @ X13 @ ( setunion @ X12 ) ) ) )
     => ( ! [X15: $i,X16: $i] : ( in @ X16 @ ( setadjoin @ X15 @ ( setadjoin @ X16 @ emptyset ) ) )
       => ! [X2: $i,X4: $i] : ( in @ X4 @ ( setunion @ ( setadjoin @ ( setadjoin @ X2 @ emptyset ) @ ( setadjoin @ ( setadjoin @ X2 @ ( setadjoin @ X4 @ emptyset ) ) @ emptyset ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[setukpairIR]),setunionI]),secondinupair]) ).

thf(c_0_4,negated_conjecture,
    ! [X17: $i,X18: $i,X19: $i,X20: $i,X21: $i] :
      ( ( ~ ( in @ X18 @ X19 )
        | ~ ( in @ X19 @ X17 )
        | ( in @ X18 @ ( setunion @ X17 ) ) )
      & ( in @ X21 @ ( setadjoin @ X20 @ ( setadjoin @ X21 @ emptyset ) ) )
      & ~ ( in @ esk2_0 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) ) ),
    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_3])])])])]) ).

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

thf(c_0_6,negated_conjecture,
    ! [X2: $i,X1: $i] : ( in @ X1 @ ( setadjoin @ X2 @ ( setadjoin @ X1 @ emptyset ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ~ ( in @ esk2_0 @ ( setunion @ ( setadjoin @ ( setadjoin @ esk1_0 @ emptyset ) @ ( setadjoin @ ( setadjoin @ esk1_0 @ ( setadjoin @ esk2_0 @ emptyset ) ) @ emptyset ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_8,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( in @ X1 @ ( setunion @ ( setadjoin @ X2 @ ( setadjoin @ X3 @ emptyset ) ) ) )
      | ~ ( in @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : SEU618^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n019.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Sun May 19 17:08:23 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.19/0.46  Running higher-order theorem proving
% 0.19/0.46  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.19/0.47  # Version: 3.1.0-ho
% 0.19/0.47  # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.47  # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho3 with 300s (1) cores
% 0.19/0.47  # Starting post_as_ho2 with 300s (1) cores
% 0.19/0.47  # post_as_ho8 with pid 16674 completed with status 0
% 0.19/0.47  # Result found by post_as_ho8
% 0.19/0.47  # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.47  # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.19/0.47  # Search class: HHUNF-FFSF21-MFFFMFNN
% 0.19/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47  # new_ho_10 with pid 16677 completed with status 0
% 0.19/0.47  # Result found by new_ho_10
% 0.19/0.47  # Preprocessing class: HSSSSLSSSLSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting lpo6_lambda_fix with 1500s (5) cores
% 0.19/0.47  # Starting post_as_ho8 with 300s (1) cores
% 0.19/0.47  # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.19/0.47  # Search class: HHUNF-FFSF21-MFFFMFNN
% 0.19/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting new_ho_10 with 163s (1) cores
% 0.19/0.47  # Preprocessing time       : 0.001 s
% 0.19/0.47  # Presaturation interreduction done
% 0.19/0.47  
% 0.19/0.47  # Proof found!
% 0.19/0.47  # SZS status Theorem
% 0.19/0.47  # SZS output start CNFRefutation
% See solution above
% 0.19/0.47  # Parsed axioms                        : 9
% 0.19/0.47  # Removed by relevancy pruning/SinE    : 6
% 0.19/0.47  # Initial clauses                      : 3
% 0.19/0.47  # Removed in clause preprocessing      : 0
% 0.19/0.47  # Initial clauses in saturation        : 3
% 0.19/0.47  # Processed clauses                    : 7
% 0.19/0.47  # ...of these trivial                  : 0
% 0.19/0.47  # ...subsumed                          : 0
% 0.19/0.47  # ...remaining for further processing  : 7
% 0.19/0.47  # Other redundant clauses eliminated   : 0
% 0.19/0.47  # Clauses deleted for lack of memory   : 0
% 0.19/0.47  # Backward-subsumed                    : 0
% 0.19/0.47  # Backward-rewritten                   : 0
% 0.19/0.47  # Generated clauses                    : 3
% 0.19/0.47  # ...of the previous two non-redundant : 1
% 0.19/0.47  # ...aggressively subsumed             : 0
% 0.19/0.47  # Contextual simplify-reflections      : 0
% 0.19/0.47  # Paramodulations                      : 3
% 0.19/0.47  # Factorizations                       : 0
% 0.19/0.47  # NegExts                              : 0
% 0.19/0.47  # Equation resolutions                 : 0
% 0.19/0.47  # Disequality decompositions           : 0
% 0.19/0.47  # Total rewrite steps                  : 1
% 0.19/0.47  # ...of those cached                   : 0
% 0.19/0.47  # Propositional unsat checks           : 0
% 0.19/0.47  #    Propositional check models        : 0
% 0.19/0.47  #    Propositional check unsatisfiable : 0
% 0.19/0.47  #    Propositional clauses             : 0
% 0.19/0.47  #    Propositional clauses after purity: 0
% 0.19/0.47  #    Propositional unsat core size     : 0
% 0.19/0.47  #    Propositional preprocessing time  : 0.000
% 0.19/0.47  #    Propositional encoding time       : 0.000
% 0.19/0.47  #    Propositional solver time         : 0.000
% 0.19/0.47  #    Success case prop preproc time    : 0.000
% 0.19/0.47  #    Success case prop encoding time   : 0.000
% 0.19/0.47  #    Success case prop solver time     : 0.000
% 0.19/0.47  # Current number of processed clauses  : 4
% 0.19/0.47  #    Positive orientable unit clauses  : 1
% 0.19/0.47  #    Positive unorientable unit clauses: 0
% 0.19/0.47  #    Negative unit clauses             : 1
% 0.19/0.47  #    Non-unit-clauses                  : 2
% 0.19/0.47  # Current number of unprocessed clauses: 0
% 0.19/0.47  # ...number of literals in the above   : 0
% 0.19/0.47  # Current number of archived formulas  : 0
% 0.19/0.47  # Current number of archived clauses   : 3
% 0.19/0.47  # Clause-clause subsumption calls (NU) : 2
% 0.19/0.47  # Rec. Clause-clause subsumption calls : 2
% 0.19/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.47  # Unit Clause-clause subsumption calls : 0
% 0.19/0.47  # Rewrite failures with RHS unbound    : 0
% 0.19/0.47  # BW rewrite match attempts            : 0
% 0.19/0.47  # BW rewrite match successes           : 0
% 0.19/0.47  # Condensation attempts                : 7
% 0.19/0.47  # Condensation successes               : 0
% 0.19/0.47  # Termbank termtop insertions          : 524
% 0.19/0.47  # Search garbage collected termcells   : 150
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.004 s
% 0.19/0.47  # System time              : 0.001 s
% 0.19/0.47  # Total time               : 0.005 s
% 0.19/0.47  # Maximum resident set size: 1736 pages
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.004 s
% 0.19/0.47  # System time              : 0.004 s
% 0.19/0.47  # Total time               : 0.008 s
% 0.19/0.47  # Maximum resident set size: 1696 pages
% 0.19/0.47  % E---3.1 exiting
% 0.19/0.48  % E exiting
%------------------------------------------------------------------------------