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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET011^5 : TPTP v8.2.0. Released v4.0.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 02:52:21 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_22,type,
    epred1_0: a > $o ).

thf(decl_23,type,
    epred2_0: a > $o ).

thf(decl_24,type,
    esk1_0: a ).

thf(cBOOL_PROP_82_pme,conjecture,
    ! [X1: a > $o,X2: a > $o] :
      ( ( ^ [X3: a] :
            ( ( X1 @ X3 )
            & ~ ( ( X1 @ X3 )
                & ~ ( X2 @ X3 ) ) ) )
      = ( ^ [X3: a] :
            ( ( X1 @ X3 )
            & ( X2 @ X3 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBOOL_PROP_82_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > $o,X2: a > $o,X6: a] :
        ( ( ( X1 @ X6 )
          & ~ ( ( X1 @ X6 )
              & ~ ( X2 @ X6 ) ) )
      <=> ( ( X1 @ X6 )
          & ( X2 @ X6 ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_82_pme])])]) ).

thf(c_0_2,negated_conjecture,
    ( ( ( epred1_0 @ esk1_0 )
      | ~ ( epred1_0 @ esk1_0 )
      | ~ ( epred1_0 @ esk1_0 )
      | ~ ( epred2_0 @ esk1_0 ) )
    & ( ~ ( epred2_0 @ esk1_0 )
      | ~ ( epred1_0 @ esk1_0 )
      | ~ ( epred1_0 @ esk1_0 )
      | ~ ( epred2_0 @ esk1_0 ) )
    & ( ( epred1_0 @ esk1_0 )
      | ( epred1_0 @ esk1_0 ) )
    & ( ( epred2_0 @ esk1_0 )
      | ( epred1_0 @ esk1_0 ) )
    & ( ( epred1_0 @ esk1_0 )
      | ~ ( epred1_0 @ esk1_0 )
      | ( epred2_0 @ esk1_0 ) )
    & ( ( epred2_0 @ esk1_0 )
      | ~ ( epred1_0 @ esk1_0 )
      | ( epred2_0 @ esk1_0 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

thf(c_0_3,negated_conjecture,
    ( ~ ( epred2_0 @ esk1_0 )
    | ~ ( epred1_0 @ esk1_0 )
    | ~ ( epred1_0 @ esk1_0 )
    | ~ ( epred2_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ( ( epred1_0 @ esk1_0 )
    | ( epred1_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ( ( epred2_0 @ esk1_0 )
    | ( epred2_0 @ esk1_0 )
    | ~ ( epred1_0 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ~ ( epred1_0 @ esk1_0 )
    | ~ ( epred2_0 @ esk1_0 ) ),
    inference(cn,[status(thm)],[c_0_3]) ).

thf(c_0_7,negated_conjecture,
    epred1_0 @ esk1_0,
    inference(cn,[status(thm)],[c_0_4]) ).

thf(c_0_8,negated_conjecture,
    ( ( epred2_0 @ esk1_0 )
    | ~ ( epred1_0 @ esk1_0 ) ),
    inference(cn,[status(thm)],[c_0_5]) ).

thf(c_0_9,negated_conjecture,
    ~ ( epred2_0 @ esk1_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).

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

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