↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n016.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:03 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :  165 (  12 equ;   0 cnn)
%            Maximal formula atoms :   30 (   5 avg)
%            Number of connectives :  733 (  62   ~;  62   |;   9   &; 540   @)
%                                         (   2 <=>;  58  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (  11 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   15 (  13 usr;   7 con; 0-4 aty)
%            Number of variables   :   96 (   6   ^;  90   !;   0   ?;  96   :)

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

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

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

thf(decl_26,type,
    kpair: $i > $i > $i ).

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

thf(decl_28,type,
    breln: $i > $i > $i > $o ).

thf(decl_29,type,
    subbreln: $o ).

thf(decl_30,type,
    esk1_4: $i > $i > $i > $i > $i ).

thf(decl_31,type,
    esk2_4: $i > $i > $i > $i > $i ).

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

thf(decl_33,type,
    esk4_0: $i ).

thf(decl_34,type,
    esk5_0: $i ).

thf(decl_35,type,
    esk6_0: $i ).

thf(breln,axiom,
    ( breln
    = ( ^ [X1: $i,X2: $i,X3: $i] : ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.yYlxjEjJTW/E---3.1_415967.p',breln) ).

thf(eqbreln,conjecture,
    ( setextsub
   => ( subbreln
     => ! [X1: $i,X2: $i,X4: $i] :
          ( ( breln @ X1 @ X2 @ X4 )
         => ! [X5: $i] :
              ( ( breln @ X1 @ X2 @ X5 )
             => ( ! [X6: $i] :
                    ( ( in @ X6 @ X1 )
                   => ! [X7: $i] :
                        ( ( in @ X7 @ X2 )
                       => ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
                         => ( in @ ( kpair @ X6 @ X7 ) @ X5 ) ) ) )
               => ( ! [X6: $i] :
                      ( ( in @ X6 @ X1 )
                     => ! [X7: $i] :
                          ( ( in @ X7 @ X2 )
                         => ( ( in @ ( kpair @ X6 @ X7 ) @ X5 )
                           => ( in @ ( kpair @ X6 @ X7 ) @ X4 ) ) ) )
                 => ( X4 = X5 ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.yYlxjEjJTW/E---3.1_415967.p',eqbreln) ).

thf(subbreln,axiom,
    ( subbreln
  <=> ! [X1: $i,X2: $i,X4: $i] :
        ( ( breln @ X1 @ X2 @ X4 )
       => ! [X5: $i] :
            ( ( breln @ X1 @ X2 @ X5 )
           => ( ! [X6: $i] :
                  ( ( in @ X6 @ X1 )
                 => ! [X7: $i] :
                      ( ( in @ X7 @ X2 )
                     => ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
                       => ( in @ ( kpair @ X6 @ X7 ) @ X5 ) ) ) )
             => ( subset @ X4 @ X5 ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.yYlxjEjJTW/E---3.1_415967.p',subbreln) ).

thf(setextsub,axiom,
    ( setextsub
  <=> ! [X1: $i,X2: $i] :
        ( ( subset @ X1 @ X2 )
       => ( ( subset @ X2 @ X1 )
         => ( X1 = X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.yYlxjEjJTW/E---3.1_415967.p',setextsub) ).

thf(c_0_4,plain,
    ( breln
    = ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
    inference(fof_simplification,[status(thm)],[breln]) ).

thf(c_0_5,negated_conjecture,
    ~ ( setextsub
     => ( subbreln
       => ! [X1: $i,X2: $i,X4: $i] :
            ( ( breln @ X1 @ X2 @ X4 )
           => ! [X5: $i] :
                ( ( breln @ X1 @ X2 @ X5 )
               => ( ! [X6: $i] :
                      ( ( in @ X6 @ X1 )
                     => ! [X7: $i] :
                          ( ( in @ X7 @ X2 )
                         => ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
                           => ( in @ ( kpair @ X6 @ X7 ) @ X5 ) ) ) )
                 => ( ! [X6: $i] :
                        ( ( in @ X6 @ X1 )
                       => ! [X7: $i] :
                            ( ( in @ X7 @ X2 )
                           => ( ( in @ ( kpair @ X6 @ X7 ) @ X5 )
                             => ( in @ ( kpair @ X6 @ X7 ) @ X4 ) ) ) )
                   => ( X4 = X5 ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[eqbreln]) ).

thf(c_0_6,axiom,
    ( subbreln
    = ( ! [X1: $i,X2: $i,X4: $i] :
          ( ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
         => ! [X5: $i] :
              ( ( subset @ X5 @ ( cartprod @ X1 @ X2 ) )
             => ( ! [X6: $i] :
                    ( ( in @ X6 @ X1 )
                   => ! [X7: $i] :
                        ( ( in @ X7 @ X2 )
                       => ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
                         => ( in @ ( kpair @ X6 @ X7 ) @ X5 ) ) ) )
               => ( subset @ X4 @ X5 ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[subbreln,c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ~ ( ! [X24: $i,X25: $i] :
          ( ( subset @ X24 @ X25 )
         => ( ( subset @ X25 @ X24 )
           => ( X24 = X25 ) ) )
     => ( ! [X26: $i,X27: $i,X28: $i] :
            ( ( subset @ X28 @ ( cartprod @ X26 @ X27 ) )
           => ! [X29: $i] :
                ( ( subset @ X29 @ ( cartprod @ X26 @ X27 ) )
               => ( ! [X30: $i] :
                      ( ( in @ X30 @ X26 )
                     => ! [X31: $i] :
                          ( ( in @ X31 @ X27 )
                         => ( ( in @ ( kpair @ X30 @ X31 ) @ X28 )
                           => ( in @ ( kpair @ X30 @ X31 ) @ X29 ) ) ) )
                 => ( subset @ X28 @ X29 ) ) ) )
       => ! [X1: $i,X2: $i,X4: $i] :
            ( ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
           => ! [X5: $i] :
                ( ( subset @ X5 @ ( cartprod @ X1 @ X2 ) )
               => ( ! [X6: $i] :
                      ( ( in @ X6 @ X1 )
                     => ! [X7: $i] :
                          ( ( in @ X7 @ X2 )
                         => ( ( in @ ( kpair @ X6 @ X7 ) @ X4 )
                           => ( in @ ( kpair @ X6 @ X7 ) @ X5 ) ) ) )
                 => ( ! [X6: $i] :
                        ( ( in @ X6 @ X1 )
                       => ! [X7: $i] :
                            ( ( in @ X7 @ X2 )
                           => ( ( in @ ( kpair @ X6 @ X7 ) @ X5 )
                             => ( in @ ( kpair @ X6 @ X7 ) @ X4 ) ) ) )
                   => ( X4 = X5 ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_5,setextsub]),c_0_4]),c_0_6]) ).

thf(c_0_8,negated_conjecture,
    ! [X32: $i,X33: $i,X34: $i,X35: $i,X36: $i,X37: $i,X44: $i,X45: $i,X46: $i,X47: $i] :
      ( ( ~ ( subset @ X32 @ X33 )
        | ~ ( subset @ X33 @ X32 )
        | ( X32 = X33 ) )
      & ( ( in @ ( esk1_4 @ X34 @ X35 @ X36 @ X37 ) @ X34 )
        | ( subset @ X36 @ X37 )
        | ~ ( subset @ X37 @ ( cartprod @ X34 @ X35 ) )
        | ~ ( subset @ X36 @ ( cartprod @ X34 @ X35 ) ) )
      & ( ( in @ ( esk2_4 @ X34 @ X35 @ X36 @ X37 ) @ X35 )
        | ( subset @ X36 @ X37 )
        | ~ ( subset @ X37 @ ( cartprod @ X34 @ X35 ) )
        | ~ ( subset @ X36 @ ( cartprod @ X34 @ X35 ) ) )
      & ( ( in @ ( kpair @ ( esk1_4 @ X34 @ X35 @ X36 @ X37 ) @ ( esk2_4 @ X34 @ X35 @ X36 @ X37 ) ) @ X36 )
        | ( subset @ X36 @ X37 )
        | ~ ( subset @ X37 @ ( cartprod @ X34 @ X35 ) )
        | ~ ( subset @ X36 @ ( cartprod @ X34 @ X35 ) ) )
      & ( ~ ( in @ ( kpair @ ( esk1_4 @ X34 @ X35 @ X36 @ X37 ) @ ( esk2_4 @ X34 @ X35 @ X36 @ X37 ) ) @ X37 )
        | ( subset @ X36 @ X37 )
        | ~ ( subset @ X37 @ ( cartprod @ X34 @ X35 ) )
        | ~ ( subset @ X36 @ ( cartprod @ X34 @ X35 ) ) )
      & ( subset @ esk5_0 @ ( cartprod @ esk3_0 @ esk4_0 ) )
      & ( subset @ esk6_0 @ ( cartprod @ esk3_0 @ esk4_0 ) )
      & ( ~ ( in @ X44 @ esk3_0 )
        | ~ ( in @ X45 @ esk4_0 )
        | ~ ( in @ ( kpair @ X44 @ X45 ) @ esk5_0 )
        | ( in @ ( kpair @ X44 @ X45 ) @ esk6_0 ) )
      & ( ~ ( in @ X46 @ esk3_0 )
        | ~ ( in @ X47 @ esk4_0 )
        | ~ ( in @ ( kpair @ X46 @ X47 ) @ esk6_0 )
        | ( in @ ( kpair @ X46 @ X47 ) @ esk5_0 ) )
      & ( esk5_0 != esk6_0 ) ),
    inference(distribute,[status(thm)],[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_7])])])])])]) ).

thf(c_0_9,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( in @ ( kpair @ X1 @ X2 ) @ esk6_0 )
      | ~ ( in @ X1 @ esk3_0 )
      | ~ ( in @ X2 @ esk4_0 )
      | ~ ( in @ ( kpair @ X1 @ X2 ) @ esk5_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_10,negated_conjecture,
    ! [X1: $i,X4: $i,X3: $i,X2: $i] :
      ( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X4 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) ) @ X3 )
      | ( subset @ X3 @ X4 )
      | ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_11,negated_conjecture,
    ! [X1: $i,X4: $i,X3: $i,X2: $i] :
      ( ( subset @ X3 @ X4 )
      | ~ ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ X3 @ X4 ) @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) ) @ X4 )
      | ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_12,negated_conjecture,
    ! [X1: $i,X3: $i,X2: $i] :
      ( ( in @ ( kpair @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X3 ) @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X3 ) ) @ esk6_0 )
      | ( subset @ esk5_0 @ X3 )
      | ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ X3 ) @ esk4_0 )
      | ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ X3 ) @ esk3_0 )
      | ~ ( subset @ esk5_0 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_13,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( subset @ esk5_0 @ esk6_0 )
      | ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk5_0 @ esk6_0 ) @ esk4_0 )
      | ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk5_0 @ esk6_0 ) @ esk3_0 )
      | ~ ( subset @ esk6_0 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ esk5_0 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

thf(c_0_14,negated_conjecture,
    ! [X1: $i,X4: $i,X3: $i,X2: $i] :
      ( ( in @ ( esk2_4 @ X1 @ X2 @ X3 @ X4 ) @ X2 )
      | ( subset @ X3 @ X4 )
      | ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_15,negated_conjecture,
    ! [X1: $i] :
      ( ( subset @ esk5_0 @ esk6_0 )
      | ~ ( in @ ( esk1_4 @ X1 @ esk4_0 @ esk5_0 @ esk6_0 ) @ esk3_0 )
      | ~ ( subset @ esk6_0 @ ( cartprod @ X1 @ esk4_0 ) )
      | ~ ( subset @ esk5_0 @ ( cartprod @ X1 @ esk4_0 ) ) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

thf(c_0_16,negated_conjecture,
    ! [X1: $i,X4: $i,X3: $i,X2: $i] :
      ( ( in @ ( esk1_4 @ X1 @ X2 @ X3 @ X4 ) @ X1 )
      | ( subset @ X3 @ X4 )
      | ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ X3 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_17,negated_conjecture,
    subset @ esk6_0 @ ( cartprod @ esk3_0 @ esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_18,negated_conjecture,
    subset @ esk5_0 @ ( cartprod @ esk3_0 @ esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_19,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ( in @ ( kpair @ X1 @ X2 ) @ esk5_0 )
      | ~ ( in @ X1 @ esk3_0 )
      | ~ ( in @ X2 @ esk4_0 )
      | ~ ( in @ ( kpair @ X1 @ X2 ) @ esk6_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_20,negated_conjecture,
    ! [X2: $i,X1: $i] :
      ( ( X1 = X2 )
      | ~ ( subset @ X1 @ X2 )
      | ~ ( subset @ X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_21,negated_conjecture,
    subset @ esk5_0 @ esk6_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).

thf(c_0_22,negated_conjecture,
    esk5_0 != esk6_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_23,negated_conjecture,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( subset @ X1 @ esk5_0 )
      | ~ ( in @ ( kpair @ ( esk1_4 @ X2 @ X3 @ X1 @ esk5_0 ) @ ( esk2_4 @ X2 @ X3 @ X1 @ esk5_0 ) ) @ esk6_0 )
      | ~ ( in @ ( esk2_4 @ X2 @ X3 @ X1 @ esk5_0 ) @ esk4_0 )
      | ~ ( in @ ( esk1_4 @ X2 @ X3 @ X1 @ esk5_0 ) @ esk3_0 )
      | ~ ( subset @ esk5_0 @ ( cartprod @ X2 @ X3 ) )
      | ~ ( subset @ X1 @ ( cartprod @ X2 @ X3 ) ) ),
    inference(spm,[status(thm)],[c_0_11,c_0_19]) ).

thf(c_0_24,negated_conjecture,
    ~ ( subset @ esk6_0 @ esk5_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

thf(c_0_25,negated_conjecture,
    ! [X1: $i,X2: $i] :
      ( ~ ( in @ ( esk2_4 @ X1 @ X2 @ esk6_0 @ esk5_0 ) @ esk4_0 )
      | ~ ( in @ ( esk1_4 @ X1 @ X2 @ esk6_0 @ esk5_0 ) @ esk3_0 )
      | ~ ( subset @ esk5_0 @ ( cartprod @ X1 @ X2 ) )
      | ~ ( subset @ esk6_0 @ ( cartprod @ X1 @ X2 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_10]),c_0_24]) ).

thf(c_0_26,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( in @ ( esk1_4 @ X1 @ esk4_0 @ esk6_0 @ esk5_0 ) @ esk3_0 )
      | ~ ( subset @ esk5_0 @ ( cartprod @ X1 @ esk4_0 ) )
      | ~ ( subset @ esk6_0 @ ( cartprod @ X1 @ esk4_0 ) ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_24]) ).

thf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_18]),c_0_17])]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU690^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n016.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 14:15:36 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 0.08/0.24  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/tmp/tmp.yYlxjEjJTW/E---3.1_415967.p
% 0.08/0.26  % Version: 3.5.1-ho
% 0.08/0.26  % partial match(1): HSSSSLSSSLSNSFN
% 0.08/0.26  % Preprocessing class: HSMSSLSSSLSNSFN.
% 0.08/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.08/0.26  % Starting lpo1_def_fix with 300s (1) cores
% 0.08/0.26  % Starting ehoh_best8_lambda with 300s (1) cores
% 0.08/0.26  % ehoh_best_sine_rwall with pid 415981 completed with status 0
% 0.08/0.26  % Result found by ehoh_best_sine_rwall
% 0.08/0.26  % partial match(1): HSSSSLSSSLSNSFN
% 0.08/0.26  % Preprocessing class: HSMSSLSSSLSNSFN.
% 0.08/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.26  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.26  % Search class: HGUSF-FFSF33-SSFFMFNN
% 0.08/0.26  % partial match(2): HGUSF-FFSF22-SSFFMFNN
% 0.08/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.26  % SubtermCWHack with pid 415984 completed with status 0
% 0.08/0.26  % Result found by SubtermCWHack
% 0.08/0.26  % partial match(1): HSSSSLSSSLSNSFN
% 0.08/0.26  % Preprocessing class: HSMSSLSSSLSNSFN.
% 0.08/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.08/0.26  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.08/0.26  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.08/0.26  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.08/0.26  % Search class: HGUSF-FFSF33-SSFFMFNN
% 0.08/0.26  % partial match(2): HGUSF-FFSF22-SSFFMFNN
% 0.08/0.26  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.08/0.26  % Starting SubtermCWHack with 28s (1) cores
% 0.08/0.26  % Preprocessing time       : 0.001 s
% 0.08/0.26  
% 0.08/0.26  % Proof found!
% 0.08/0.26  % SZS status Theorem
% 0.08/0.26  % SZS output start CNFRefutation
% See solution above
% 0.08/0.26  % Parsed axioms                        : 11
% 0.08/0.26  % Removed by relevancy pruning/SinE    : 7
% 0.08/0.26  % Initial clauses                      : 10
% 0.08/0.26  % Removed in clause preprocessing      : 0
% 0.08/0.26  % Initial clauses in saturation        : 10
% 0.08/0.26  % Processed clauses                    : 23
% 0.08/0.26  % ...of these trivial                  : 0
% 0.08/0.26  % ...subsumed                          : 0
% 0.08/0.26  % ...remaining for further processing  : 23
% 0.08/0.26  % Other redundant clauses eliminated   : 0
% 0.08/0.26  % Clauses deleted for lack of memory   : 0
% 0.08/0.26  % Backward-subsumed                    : 0
% 0.08/0.26  % Backward-rewritten                   : 2
% 0.08/0.26  % Generated clauses                    : 16
% 0.08/0.26  % ...of the previous two non-redundant : 13
% 0.08/0.26  % ...aggressively subsumed             : 0
% 0.08/0.26  % Contextual simplify-reflections      : 0
% 0.08/0.26  % Paramodulations                      : 16
% 0.08/0.26  % Factorizations                       : 0
% 0.08/0.26  % NegExts                              : 0
% 0.08/0.26  % Equation resolutions                 : 0
% 0.08/0.26  % Disequality decompositions           : 0
% 0.08/0.26  % Total rewrite steps                  : 7
% 0.08/0.26  % ...of those cached                   : 3
% 0.08/0.26  % Propositional unsat checks           : 0
% 0.08/0.26  %    Propositional check models        : 0
% 0.08/0.26  %    Propositional check unsatisfiable : 0
% 0.08/0.26  %    Propositional clauses             : 0
% 0.08/0.26  %    Propositional clauses after purity: 0
% 0.08/0.26  %    Propositional unsat core size     : 0
% 0.08/0.26  %    Propositional preprocessing time  : 0.000
% 0.08/0.26  %    Propositional encoding time       : 0.000
% 0.08/0.26  %    Propositional solver time         : 0.000
% 0.08/0.26  %    Success case prop preproc time    : 0.000
% 0.08/0.26  %    Success case prop encoding time   : 0.000
% 0.08/0.26  %    Success case prop solver time     : 0.000
% 0.08/0.26  % Current number of processed clauses  : 21
% 0.08/0.26  %    Positive orientable unit clauses  : 5
% 0.08/0.26  %    Positive unorientable unit clauses: 0
% 0.08/0.26  %    Negative unit clauses             : 2
% 0.08/0.26  %    Non-unit-clauses                  : 14
% 0.08/0.26  % Current number of unprocessed clauses: 0
% 0.08/0.26  % ...number of literals in the above   : 0
% 0.08/0.26  % Current number of archived formulas  : 0
% 0.08/0.26  % Current number of archived clauses   : 2
% 0.08/0.26  % Clause-clause subsumption calls (NU) : 87
% 0.08/0.26  % Rec. Clause-clause subsumption calls : 20
% 0.08/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.08/0.26  % Unit Clause-clause subsumption calls : 8
% 0.08/0.26  % Rewrite failures with RHS unbound    : 0
% 0.08/0.26  % BW rewrite match attempts            : 1
% 0.08/0.26  % BW rewrite match successes           : 1
% 0.08/0.26  % Condensation attempts                : 0
% 0.08/0.26  % Condensation successes               : 0
% 0.08/0.26  % Termbank termtop insertions          : 2229
% 0.08/0.26  % Search garbage collected termcells   : 555
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.005 s
% 0.08/0.26  % System time              : 0.002 s
% 0.08/0.26  % Total time               : 0.007 s
% 0.08/0.26  % Maximum resident set size: 3640 pages
% 0.08/0.26  
% 0.08/0.26  % -------------------------------------------------
% 0.08/0.26  % User time                : 0.006 s
% 0.08/0.26  % System time              : 0.008 s
% 0.08/0.26  % Total time               : 0.014 s
% 0.08/0.26  % Maximum resident set size: 4864 pages
% 0.08/0.26  % E exiting
%------------------------------------------------------------------------------