↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU700^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Sep 30 08:25:16 AM UTC 2026

% Result   : Theorem 0.09s 0.23s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   12 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   48 (  11 equ;   0 cnn)
%            Maximal formula atoms :   10 (   4 avg)
%            Number of connectives :  140 (  20   ~;  10   |;  15   &;  75   @)
%                                         (   2 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   9 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   34 (   7   ^;  27   !;   0   ?;  34   :)

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

thf(decl_24,type,
    dsetconstr: $i > ( $i > $o ) > $i ).

thf(decl_25,type,
    dsetconstrI: $o ).

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

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

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

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

thf(iffalseProp1,conjecture,
    ( dsetconstrI
   => ! [X1: $i,X5: $o,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ! [X4: $i] :
            ( ( in @ X4 @ X1 )
           => ( ~ X5
             => ( in @ X4
                @ ( dsetconstr @ X1
                  @ ^ [X6: $i] :
                      ( ( X5
                        & ( X6 = X3 ) )
                      | ( ~ X5
                        & ( X6 = X4 ) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.7vaFP2f8lW/E---3.1_1350470.p',iffalseProp1) ).

thf(dsetconstrI,axiom,
    ( dsetconstrI
  <=> ! [X1: $i,X2: $i > $o,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ( ( X2 @ X3 )
         => ( in @ X3
            @ ( dsetconstr @ X1
              @ ^ [X4: $i] : ( X2 @ X4 ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.7vaFP2f8lW/E---3.1_1350470.p',dsetconstrI) ).

thf(c_0_2,negated_conjecture,
    ~ ( dsetconstrI
     => ! [X1: $i,X5: $o,X3: $i] :
          ( ( in @ X3 @ X1 )
         => ! [X4: $i] :
              ( ( in @ X4 @ X1 )
             => ( ~ X5
               => ( in @ X4
                  @ ( dsetconstr @ X1
                    @ ^ [X6: $i] :
                        ( ( X5
                          & ( X6 = X3 ) )
                        | ( ~ X5
                          & ( X6 = X4 ) ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[iffalseProp1]) ).

thf(c_0_3,plain,
    ( dsetconstrI
  <=> ! [X1: $i,X2: $i > $o,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ( ( X2 @ X3 )
         => ( in @ X3
            @ ( dsetconstr @ X1
              @ ^ [Z0: $i] : ( X2 @ Z0 ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[dsetconstrI]) ).

thf(c_0_4,negated_conjecture,
    ~ ( ! [X14: $i,X15: $i > $o,X16: $i] :
          ( ( in @ X16 @ X14 )
         => ( ( X15 @ X16 )
           => ( in @ X16 @ ( dsetconstr @ X14 @ X15 ) ) ) )
     => ! [X1: $i,X5: $o,X3: $i] :
          ( ( in @ X3 @ X1 )
         => ! [X4: $i] :
              ( ( in @ X4 @ X1 )
             => ( ~ X5
               => ( in @ X4
                  @ ( dsetconstr @ X1
                    @ ^ [Z0: $i] :
                        ( ( X5
                          & ( Z0 = X3 ) )
                        | ( ~ X5
                          & ( Z0 = X4 ) ) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2]),c_0_3])])]) ).

thf(c_0_5,negated_conjecture,
    ! [X17: $i,X18: $i > $o,X19: $i] :
      ( ( ~ ( in @ X19 @ X17 )
        | ~ ( X18 @ X19 )
        | ( in @ X19 @ ( dsetconstr @ X17 @ X18 ) ) )
      & ( in @ esk2_0 @ esk1_0 )
      & ( in @ esk3_0 @ esk1_0 )
      & ~ epred1_0
      & ~ ( in @ esk3_0
          @ ( dsetconstr @ esk1_0
            @ ^ [Z0: $i] :
                ( ( epred1_0
                  & ( Z0 = esk2_0 ) )
                | ( ~ epred1_0
                  & ( Z0 = 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_4])])])])]) ).

thf(c_0_6,negated_conjecture,
    ~ ( in @ esk3_0
      @ ( dsetconstr @ esk1_0
        @ ^ [Z0: $i] :
            ( ( epred1_0
              & ( Z0 = esk2_0 ) )
            | ( ~ epred1_0
              & ( Z0 = esk3_0 ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

thf(c_0_8,negated_conjecture,
    in @ esk3_0 @ esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_9,negated_conjecture,
    ~ ( ~ epred1_0
      | ( epred1_0
        & ( esk3_0 = esk2_0 ) ) ),
    inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])])]) ).

thf(c_0_10,negated_conjecture,
    ~ epred1_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

thf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU700^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.16  % Computer : n002.cluster.edu
% 0.09/0.16  % Model    : x86_64 x86_64
% 0.09/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16  % Memory   : 8046.5625MB
% 0.09/0.16  % OS       : Linux 6.8.0-71-generic
% 0.09/0.16  % CPULimit : 300
% 0.09/0.16  % WCLimit  : 300
% 0.09/0.16  % DateTime : Tue Sep 29 14:14:52 UTC 2026
% 0.09/0.16  % CPUTime  : 
% 0.09/0.16  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  Running higher-order theorem proving
% 0.09/0.22  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/tmp/tmp.7vaFP2f8lW/E---3.1_1350470.p
% 0.09/0.23  % Version: 3.5.1-ho
% 0.09/0.23  % Preprocessing class: HSSSSMSSSLMNSSA.
% 0.09/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23  % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.23  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.23  % Starting new_bool_2 with 300s (1) cores
% 0.09/0.23  % Starting new_bool_9 with 300s (1) cores
% 0.09/0.23  % new_bool_1 with pid 1350484 completed with status 0
% 0.09/0.23  % Result found by new_bool_1
% 0.09/0.23  % Preprocessing class: HSSSSMSSSLMNSSA.
% 0.09/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23  % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.23  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.23  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.23  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.23  % Search class: HHUNF-FFSF22-MSSFMSBN
% 0.09/0.23  % partial match(3): HGUNF-FFSF32-MSSFFSBN
% 0.09/0.23  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.23  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.23  % SubtermCWHack with pid 1350487 completed with status 0
% 0.09/0.23  % Result found by SubtermCWHack
% 0.09/0.23  % Preprocessing class: HSSSSMSSSLMNSSA.
% 0.09/0.23  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.23  % Starting new_ho_10 with 1500s (5) cores
% 0.09/0.23  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.23  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.23  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.23  % Search class: HHUNF-FFSF22-MSSFMSBN
% 0.09/0.23  % partial match(3): HGUNF-FFSF32-MSSFFSBN
% 0.09/0.23  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.23  % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.23  % Preprocessing time       : 0.001 s
% 0.09/0.23  
% 0.09/0.23  % Proof found!
% 0.09/0.23  % SZS status Theorem
% 0.09/0.23  % SZS output start CNFRefutation
% See solution above
% 0.09/0.23  % Parsed axioms                        : 5
% 0.09/0.23  % Removed by relevancy pruning/SinE    : 3
% 0.09/0.23  % Initial clauses                      : 5
% 0.09/0.23  % Removed in clause preprocessing      : 0
% 0.09/0.23  % Initial clauses in saturation        : 5
% 0.09/0.23  % Processed clauses                    : 6
% 0.09/0.23  % ...of these trivial                  : 0
% 0.09/0.23  % ...subsumed                          : 0
% 0.09/0.23  % ...remaining for further processing  : 6
% 0.09/0.23  % Other redundant clauses eliminated   : 0
% 0.09/0.23  % Clauses deleted for lack of memory   : 0
% 0.09/0.23  % Backward-subsumed                    : 0
% 0.09/0.23  % Backward-rewritten                   : 0
% 0.09/0.23  % Generated clauses                    : 3
% 0.09/0.23  % ...of the previous two non-redundant : 2
% 0.09/0.23  % ...aggressively subsumed             : 0
% 0.09/0.23  % Contextual simplify-reflections      : 0
% 0.09/0.23  % Paramodulations                      : 1
% 0.09/0.23  % Factorizations                       : 0
% 0.09/0.23  % NegExts                              : 0
% 0.09/0.23  % Equation resolutions                 : 0
% 0.09/0.23  % Disequality decompositions           : 0
% 0.09/0.23  % Total rewrite steps                  : 1
% 0.09/0.23  % ...of those cached                   : 0
% 0.09/0.23  % Propositional unsat checks           : 0
% 0.09/0.23  %    Propositional check models        : 0
% 0.09/0.23  %    Propositional check unsatisfiable : 0
% 0.09/0.23  %    Propositional clauses             : 0
% 0.09/0.23  %    Propositional clauses after purity: 0
% 0.09/0.23  %    Propositional unsat core size     : 0
% 0.09/0.23  %    Propositional preprocessing time  : 0.000
% 0.09/0.23  %    Propositional encoding time       : 0.000
% 0.09/0.23  %    Propositional solver time         : 0.000
% 0.09/0.23  %    Success case prop preproc time    : 0.000
% 0.09/0.23  %    Success case prop encoding time   : 0.000
% 0.09/0.23  %    Success case prop solver time     : 0.000
% 0.09/0.23  % Current number of processed clauses  : 5
% 0.09/0.23  %    Positive orientable unit clauses  : 2
% 0.09/0.23  %    Positive unorientable unit clauses: 0
% 0.09/0.23  %    Negative unit clauses             : 2
% 0.09/0.23  %    Non-unit-clauses                  : 1
% 0.09/0.23  % Current number of unprocessed clauses: 0
% 0.09/0.23  % ...number of literals in the above   : 0
% 0.09/0.23  % Current number of archived formulas  : 0
% 0.09/0.23  % Current number of archived clauses   : 1
% 0.09/0.23  % Clause-clause subsumption calls (NU) : 0
% 0.09/0.23  % Rec. Clause-clause subsumption calls : 0
% 0.09/0.23  % Non-unit clause-clause subsumptions  : 0
% 0.09/0.23  % Unit Clause-clause subsumption calls : 0
% 0.09/0.23  % Rewrite failures with RHS unbound    : 0
% 0.09/0.23  % BW rewrite match attempts            : 0
% 0.09/0.23  % BW rewrite match successes           : 0
% 0.09/0.23  % Condensation attempts                : 0
% 0.09/0.23  % Condensation successes               : 0
% 0.09/0.23  % Termbank termtop insertions          : 698
% 0.09/0.23  % Search garbage collected termcells   : 214
% 0.09/0.23  
% 0.09/0.23  % -------------------------------------------------
% 0.09/0.23  % User time                : 0.003 s
% 0.09/0.23  % System time              : 0.002 s
% 0.09/0.23  % Total time               : 0.005 s
% 0.09/0.23  % Maximum resident set size: 3636 pages
% 0.09/0.23  
% 0.09/0.23  % -------------------------------------------------
% 0.09/0.23  % User time                : 0.005 s
% 0.09/0.23  % System time              : 0.006 s
% 0.09/0.23  % Total time               : 0.011 s
% 0.09/0.23  % Maximum resident set size: 4864 pages
% 0.09/0.23  % E exiting
%------------------------------------------------------------------------------