↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU783^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 : n008.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:37 AM UTC 2026

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

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

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

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

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

thf(decl_27,type,
    breln1: $i > $i > $o ).

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

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

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

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

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

thf(breln1unionIL,conjecture,
    ( binunionIL
   => ! [X1: $i,X4: $i] :
        ( ( breln1 @ X1 @ X4 )
       => ! [X5: $i] :
            ( ( breln1 @ X1 @ X5 )
           => ! [X3: $i] :
                ( ( in @ X3 @ X1 )
               => ! [X6: $i] :
                    ( ( in @ X6 @ X1 )
                   => ( ( in @ ( kpair @ X3 @ X6 ) @ X4 )
                     => ( in @ ( kpair @ X3 @ X6 ) @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9ZpRB5KQA8/E---3.1_3234863.p',breln1unionIL) ).

thf(binunionIL,axiom,
    ( binunionIL
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ X1 )
       => ( in @ X3 @ ( binunion @ X1 @ X2 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9ZpRB5KQA8/E---3.1_3234863.p',binunionIL) ).

thf(c_0_2,negated_conjecture,
    ~ ( binunionIL
     => ! [X1: $i,X4: $i] :
          ( ( breln1 @ X1 @ X4 )
         => ! [X5: $i] :
              ( ( breln1 @ X1 @ X5 )
             => ! [X3: $i] :
                  ( ( in @ X3 @ X1 )
                 => ! [X6: $i] :
                      ( ( in @ X6 @ X1 )
                     => ( ( in @ ( kpair @ X3 @ X6 ) @ X4 )
                       => ( in @ ( kpair @ X3 @ X6 ) @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[breln1unionIL]) ).

thf(c_0_3,negated_conjecture,
    ~ ( ! [X15: $i,X16: $i,X17: $i] :
          ( ( in @ X17 @ X15 )
         => ( in @ X17 @ ( binunion @ X15 @ X16 ) ) )
     => ! [X1: $i,X4: $i] :
          ( ( breln1 @ X1 @ X4 )
         => ! [X5: $i] :
              ( ( breln1 @ X1 @ X5 )
             => ! [X3: $i] :
                  ( ( in @ X3 @ X1 )
                 => ! [X6: $i] :
                      ( ( in @ X6 @ X1 )
                     => ( ( in @ ( kpair @ X3 @ X6 ) @ X4 )
                       => ( in @ ( kpair @ X3 @ X6 ) @ ( binunion @ X4 @ X5 ) ) ) ) ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_2,binunionIL]) ).

thf(c_0_4,negated_conjecture,
    ! [X18: $i,X19: $i,X20: $i] :
      ( ( ~ ( in @ X20 @ X18 )
        | ( in @ X20 @ ( binunion @ X18 @ X19 ) ) )
      & ( breln1 @ esk1_0 @ esk2_0 )
      & ( breln1 @ esk1_0 @ esk3_0 )
      & ( in @ esk4_0 @ esk1_0 )
      & ( in @ esk5_0 @ esk1_0 )
      & ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0 )
      & ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ 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_3])])])])]) ).

thf(c_0_5,negated_conjecture,
    ~ ( in @ ( kpair @ esk4_0 @ esk5_0 ) @ ( binunion @ esk2_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_6,negated_conjecture,
    ! [X1: $i,X3: $i,X2: $i] :
      ( ( in @ X1 @ ( binunion @ X2 @ X3 ) )
      | ~ ( in @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    in @ ( kpair @ esk4_0 @ esk5_0 ) @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU783^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n008.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 14:29:09 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running higher-order theorem proving
% 0.07/0.25  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.9ZpRB5KQA8/E---3.1_3234863.p
% 0.26/0.26  % Version: 3.5.1-ho
% 0.26/0.26  % Preprocessing class: HSSSSMSSSLSNFFN.
% 0.26/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26  % Starting sh5l with 300s (1) cores
% 0.26/0.26  % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.26/0.26  % Starting lpo1_def_fix with 300s (1) cores
% 0.26/0.26  % sh5l with pid 3234893 completed with status 0
% 0.26/0.26  % Result found by sh5l
% 0.26/0.26  % Preprocessing class: HSSSSMSSSLSNFFN.
% 0.26/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26  % Starting sh5l with 300s (1) cores
% 0.26/0.26  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.26  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.26  % Search class: HHUNF-FFSS22-SFFFMFNN
% 0.26/0.26  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.26  % SubtermCWHack with pid 3234899 completed with status 0
% 0.26/0.26  % Result found by SubtermCWHack
% 0.26/0.26  % Preprocessing class: HSSSSMSSSLSNFFN.
% 0.26/0.26  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.26  % Starting new_ho_10 with 1500s (5) cores
% 0.26/0.26  % Starting sh5l with 300s (1) cores
% 0.26/0.26  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.26  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.26  % Search class: HHUNF-FFSS22-SFFFMFNN
% 0.26/0.26  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.26  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.26  % Preprocessing time       : 0.001 s
% 0.26/0.26  
% 0.26/0.26  % Proof found!
% 0.26/0.26  % SZS status Theorem
% 0.26/0.26  % SZS output start CNFRefutation
% See solution above
% 0.26/0.26  % Parsed axioms                        : 7
% 0.26/0.26  % Removed by relevancy pruning/SinE    : 5
% 0.26/0.26  % Initial clauses                      : 7
% 0.26/0.26  % Removed in clause preprocessing      : 0
% 0.26/0.26  % Initial clauses in saturation        : 7
% 0.26/0.26  % Processed clauses                    : 7
% 0.26/0.26  % ...of these trivial                  : 0
% 0.26/0.26  % ...subsumed                          : 0
% 0.26/0.26  % ...remaining for further processing  : 7
% 0.26/0.26  % Other redundant clauses eliminated   : 0
% 0.26/0.26  % Clauses deleted for lack of memory   : 0
% 0.26/0.26  % Backward-subsumed                    : 0
% 0.26/0.26  % Backward-rewritten                   : 0
% 0.26/0.26  % Generated clauses                    : 1
% 0.26/0.26  % ...of the previous two non-redundant : 0
% 0.26/0.26  % ...aggressively subsumed             : 0
% 0.26/0.26  % Contextual simplify-reflections      : 0
% 0.26/0.26  % Paramodulations                      : 1
% 0.26/0.26  % Factorizations                       : 0
% 0.26/0.26  % NegExts                              : 0
% 0.26/0.26  % Equation resolutions                 : 0
% 0.26/0.26  % Disequality decompositions           : 0
% 0.26/0.26  % Total rewrite steps                  : 1
% 0.26/0.26  % ...of those cached                   : 0
% 0.26/0.26  % Propositional unsat checks           : 0
% 0.26/0.26  %    Propositional check models        : 0
% 0.26/0.26  %    Propositional check unsatisfiable : 0
% 0.26/0.26  %    Propositional clauses             : 0
% 0.26/0.26  %    Propositional clauses after purity: 0
% 0.26/0.26  %    Propositional unsat core size     : 0
% 0.26/0.26  %    Propositional preprocessing time  : 0.000
% 0.26/0.26  %    Propositional encoding time       : 0.000
% 0.26/0.26  %    Propositional solver time         : 0.000
% 0.26/0.26  %    Success case prop preproc time    : 0.000
% 0.26/0.26  %    Success case prop encoding time   : 0.000
% 0.26/0.26  %    Success case prop solver time     : 0.000
% 0.26/0.26  % Current number of processed clauses  : 7
% 0.26/0.26  %    Positive orientable unit clauses  : 5
% 0.26/0.26  %    Positive unorientable unit clauses: 0
% 0.26/0.26  %    Negative unit clauses             : 1
% 0.26/0.26  %    Non-unit-clauses                  : 1
% 0.26/0.26  % Current number of unprocessed clauses: 0
% 0.26/0.26  % ...number of literals in the above   : 0
% 0.26/0.26  % Current number of archived formulas  : 0
% 0.26/0.26  % Current number of archived clauses   : 0
% 0.26/0.26  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.26  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.26  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.26  % Unit Clause-clause subsumption calls : 0
% 0.26/0.26  % Rewrite failures with RHS unbound    : 0
% 0.26/0.26  % BW rewrite match attempts            : 0
% 0.26/0.26  % BW rewrite match successes           : 0
% 0.26/0.26  % Condensation attempts                : 0
% 0.26/0.26  % Condensation successes               : 0
% 0.26/0.26  % Termbank termtop insertions          : 497
% 0.26/0.26  % Search garbage collected termcells   : 186
% 0.26/0.26  
% 0.26/0.26  % -------------------------------------------------
% 0.26/0.26  % User time                : 0.001 s
% 0.26/0.26  % System time              : 0.003 s
% 0.26/0.26  % Total time               : 0.004 s
% 0.26/0.26  % Maximum resident set size: 3632 pages
% 0.26/0.26  
% 0.26/0.26  % -------------------------------------------------
% 0.26/0.26  % User time                : 0.003 s
% 0.26/0.26  % System time              : 0.007 s
% 0.26/0.26  % Total time               : 0.010 s
% 0.26/0.26  % Maximum resident set size: 4864 pages
% 0.26/0.26  % E exiting
%------------------------------------------------------------------------------