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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SYO353^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n029.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 08:45:42 EDT 2024

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

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

thf(decl_22,type,
    v: a ).

thf(decl_23,type,
    u: a ).

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

thf(cE1LEIBEQ1_pme,conjecture,
    ( ! [X1: a > $o] :
        ( ( X1 @ u )
       => ( X1 @ v ) )
   => ! [X2: a > a > $o] :
        ( ! [X3: a] : ( X2 @ X3 @ X3 )
       => ( X2 @ u @ v ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cE1LEIBEQ1_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ( ! [X1: a > $o] :
          ( ( X1 @ u )
         => ( X1 @ v ) )
     => ! [X2: a > a > $o] :
          ( ! [X3: a] : ( X2 @ X3 @ X3 )
         => ( X2 @ u @ v ) ) ),
    inference(assume_negation,[status(cth)],[cE1LEIBEQ1_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X7: a > $o,X9: a] :
      ( ( ~ ( X7 @ u )
        | ( X7 @ v ) )
      & ( epred1_0 @ X9 @ X9 )
      & ~ ( epred1_0 @ u @ v ) ),
    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_1])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X1: a > $o] :
      ( ( X1 @ v )
      | ~ ( X1 @ u ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X3: a] : ( epred1_0 @ X3 @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ~ ( epred1_0 @ u @ v ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem    : SYO353^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n029.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Mon May 20 09:18:23 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.46  Running higher-order theorem proving
% 0.18/0.46  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/benchmark/theBenchmark.p
% 0.18/0.47  # Version: 3.1.0-ho
% 0.18/0.47  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47  # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.47  # Starting post_as_ho4 with 300s (1) cores
% 0.18/0.47  # Starting post_as_ho2 with 300s (1) cores
% 0.18/0.47  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.47  # Starting full_lambda_10 with 300s (1) cores
% 0.18/0.47  # Starting new_ho_8 with 300s (1) cores
% 0.18/0.47  # new_bool_9 with pid 14404 completed with status 0
% 0.18/0.47  # Result found by new_bool_9
% 0.18/0.47  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.18/0.47  # Search class: HHUNF-FFSF00-SSSFFSBN
% 0.18/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting ho_unfolding_3 with 163s (1) cores
% 0.18/0.47  # ho_unfolding_3 with pid 14411 completed with status 0
% 0.18/0.47  # Result found by ho_unfolding_3
% 0.18/0.47  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.18/0.47  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.47  # Starting post_as_ho12 with 300s (1) cores
% 0.18/0.47  # Starting new_bool_9 with 300s (1) cores
% 0.18/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.18/0.47  # Search class: HHUNF-FFSF00-SSSFFSBN
% 0.18/0.47  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.47  # Starting ho_unfolding_3 with 163s (1) cores
% 0.18/0.47  # Preprocessing time       : 0.001 s
% 0.18/0.47  # Presaturation interreduction done
% 0.18/0.47  
% 0.18/0.47  # Proof found!
% 0.18/0.47  # SZS status Theorem
% 0.18/0.47  # SZS output start CNFRefutation
% See solution above
% 0.18/0.47  # Parsed axioms                        : 4
% 0.18/0.47  # Removed by relevancy pruning/SinE    : 3
% 0.18/0.47  # Initial clauses                      : 3
% 0.18/0.47  # Removed in clause preprocessing      : 0
% 0.18/0.47  # Initial clauses in saturation        : 3
% 0.18/0.47  # Processed clauses                    : 6
% 0.18/0.47  # ...of these trivial                  : 0
% 0.18/0.47  # ...subsumed                          : 0
% 0.18/0.47  # ...remaining for further processing  : 6
% 0.18/0.47  # Other redundant clauses eliminated   : 0
% 0.18/0.47  # Clauses deleted for lack of memory   : 0
% 0.18/0.47  # Backward-subsumed                    : 0
% 0.18/0.47  # Backward-rewritten                   : 0
% 0.18/0.47  # Generated clauses                    : 3
% 0.18/0.47  # ...of the previous two non-redundant : 2
% 0.18/0.47  # ...aggressively subsumed             : 0
% 0.18/0.47  # Contextual simplify-reflections      : 0
% 0.18/0.47  # Paramodulations                      : 1
% 0.18/0.47  # Factorizations                       : 0
% 0.18/0.47  # NegExts                              : 0
% 0.18/0.47  # Equation resolutions                 : 0
% 0.18/0.47  # Disequality decompositions           : 0
% 0.18/0.47  # Total rewrite steps                  : 0
% 0.18/0.47  # ...of those cached                   : 0
% 0.18/0.47  # Propositional unsat checks           : 0
% 0.18/0.47  #    Propositional check models        : 0
% 0.18/0.47  #    Propositional check unsatisfiable : 0
% 0.18/0.47  #    Propositional clauses             : 0
% 0.18/0.47  #    Propositional clauses after purity: 0
% 0.18/0.47  #    Propositional unsat core size     : 0
% 0.18/0.47  #    Propositional preprocessing time  : 0.000
% 0.18/0.47  #    Propositional encoding time       : 0.000
% 0.18/0.47  #    Propositional solver time         : 0.000
% 0.18/0.47  #    Success case prop preproc time    : 0.000
% 0.18/0.47  #    Success case prop encoding time   : 0.000
% 0.18/0.47  #    Success case prop solver time     : 0.000
% 0.18/0.47  # Current number of processed clauses  : 3
% 0.18/0.47  #    Positive orientable unit clauses  : 1
% 0.18/0.47  #    Positive unorientable unit clauses: 0
% 0.18/0.47  #    Negative unit clauses             : 1
% 0.18/0.47  #    Non-unit-clauses                  : 1
% 0.18/0.47  # Current number of unprocessed clauses: 2
% 0.18/0.47  # ...number of literals in the above   : 2
% 0.18/0.47  # Current number of archived formulas  : 0
% 0.18/0.47  # Current number of archived clauses   : 3
% 0.18/0.47  # Clause-clause subsumption calls (NU) : 0
% 0.18/0.47  # Rec. Clause-clause subsumption calls : 0
% 0.18/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.18/0.47  # Unit Clause-clause subsumption calls : 0
% 0.18/0.47  # Rewrite failures with RHS unbound    : 0
% 0.18/0.47  # BW rewrite match attempts            : 2
% 0.18/0.47  # BW rewrite match successes           : 0
% 0.18/0.47  # Condensation attempts                : 6
% 0.18/0.47  # Condensation successes               : 0
% 0.18/0.47  # Termbank termtop insertions          : 274
% 0.18/0.47  # Search garbage collected termcells   : 86
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.002 s
% 0.18/0.47  # System time              : 0.002 s
% 0.18/0.47  # Total time               : 0.003 s
% 0.18/0.47  # Maximum resident set size: 1788 pages
% 0.18/0.47  
% 0.18/0.47  # -------------------------------------------------
% 0.18/0.47  # User time                : 0.003 s
% 0.18/0.47  # System time              : 0.004 s
% 0.18/0.47  # Total time               : 0.007 s
% 0.18/0.47  # Maximum resident set size: 1716 pages
% 0.18/0.47  % E---3.1 exiting
% 0.18/0.47  % E exiting
%------------------------------------------------------------------------------