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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SEU697^2 : TPTP v8.2.0. Released v3.7.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 03:29:14 EDT 2024

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

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

thf(decl_23,type,
    dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).

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

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

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

thf(decl_27,type,
    esk3_0: $i > $i ).

thf(lam,axiom,
    ( lam
    = ( ^ [X1: $i,X2: $i,X3: $i > $i] :
          ( dpsetconstr @ X1 @ X2
          @ ^ [X4: $i,X5: $i] :
              ( ( X3 @ X4 )
              = X5 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lam) ).

thf(lam2lamEq,conjecture,
    ! [X1: $i,X2: $i,X3: $i > $i] :
      ( ! [X4: $i] :
          ( ( in @ X4 @ X1 )
         => ( in @ ( X3 @ X4 ) @ X2 ) )
     => ( ( lam @ X1 @ X2
          @ ^ [X4: $i] : ( X3 @ X4 ) )
        = ( lam @ X1 @ X2
          @ ^ [X4: $i] : ( X3 @ X4 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lam2lamEq) ).

thf(c_0_2,plain,
    ( lam
    = ( ^ [Z0: $i,Z1: $i,Z2: $i > $i] :
          ( dpsetconstr @ Z0 @ Z1
          @ ^ [Z3: $i,Z4: $i] :
              ( ( Z2 @ Z3 )
              = Z4 ) ) ) ),
    inference(fof_simplification,[status(thm)],[lam]) ).

thf(c_0_3,negated_conjecture,
    ~ ! [X1: $i,X2: $i,X3: $i > $i] :
        ( ! [X4: $i] :
            ( ( in @ X4 @ X1 )
           => ( in @ ( X3 @ X4 ) @ X2 ) )
       => ( ( dpsetconstr @ X1 @ X2
            @ ^ [Z0: $i] : ( $eq @ ( X3 @ Z0 ) ) )
          = ( dpsetconstr @ X1 @ X2
            @ ^ [Z0: $i] : ( $eq @ ( X3 @ Z0 ) ) ) ) ),
    inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[lam2lamEq])]),c_0_2])]) ).

thf(c_0_4,negated_conjecture,
    ! [X13: $i] :
      ( ( ~ ( in @ X13 @ esk1_0 )
        | ( in @ ( esk3_0 @ X13 ) @ esk2_0 ) )
      & ( ( dpsetconstr @ esk1_0 @ esk2_0
          @ ^ [Z0: $i] : ( $eq @ ( esk3_0 @ Z0 ) ) )
       != ( dpsetconstr @ esk1_0 @ esk2_0
          @ ^ [Z0: $i] : ( $eq @ ( esk3_0 @ Z0 ) ) ) ) ),
    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,
    ( ( dpsetconstr @ esk1_0 @ esk2_0
      @ ^ [Z0: $i] : ( $eq @ ( esk3_0 @ Z0 ) ) )
   != ( dpsetconstr @ esk1_0 @ esk2_0
      @ ^ [Z0: $i] : ( $eq @ ( esk3_0 @ Z0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

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