↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU516^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 : n026.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:24:20 AM UTC 2026

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

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

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

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

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

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

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

thf(setadjoinOr,conjecture,
    ( setadjoinAx
   => ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ ( setadjoin @ X1 @ X2 ) )
       => ( ( X3 = X1 )
          | ( in @ X3 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.UcmJPw8QPY/E---3.1_618612.p',setadjoinOr) ).

thf(setadjoinAx,axiom,
    ( setadjoinAx
  <=> ! [X1: $i,X2: $i,X3: $i] :
        ( ( in @ X3 @ ( setadjoin @ X1 @ X2 ) )
      <=> ( ( X3 = X1 )
          | ( in @ X3 @ X2 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.UcmJPw8QPY/E---3.1_618612.p',setadjoinAx) ).

thf(c_0_2,negated_conjecture,
    ~ ( setadjoinAx
     => ! [X1: $i,X2: $i,X3: $i] :
          ( ( in @ X3 @ ( setadjoin @ X1 @ X2 ) )
         => ( ( X3 = X1 )
            | ( in @ X3 @ X2 ) ) ) ),
    inference(assume_negation,[status(cth)],[setadjoinOr]) ).

thf(c_0_3,negated_conjecture,
    ~ ( ! [X10: $i,X11: $i,X12: $i] :
          ( ( in @ X12 @ ( setadjoin @ X10 @ X11 ) )
        <=> ( ( X12 = X10 )
            | ( in @ X12 @ X11 ) ) )
     => ! [X1: $i,X2: $i,X3: $i] :
          ( ( in @ X3 @ ( setadjoin @ X1 @ X2 ) )
         => ( ( X3 = X1 )
            | ( in @ X3 @ X2 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_2,setadjoinAx]) ).

thf(c_0_4,negated_conjecture,
    ! [X13: $i,X14: $i,X15: $i] :
      ( ( ~ ( in @ X15 @ ( setadjoin @ X13 @ X14 ) )
        | ( X15 = X13 )
        | ( in @ X15 @ X14 ) )
      & ( ( X15 != X13 )
        | ( in @ X15 @ ( setadjoin @ X13 @ X14 ) ) )
      & ( ~ ( in @ X15 @ X14 )
        | ( in @ X15 @ ( setadjoin @ X13 @ X14 ) ) )
      & ( in @ esk3_0 @ ( setadjoin @ esk1_0 @ esk2_0 ) )
      & ( esk3_0 != esk1_0 )
      & ~ ( in @ esk3_0 @ esk2_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_3])])])])])]) ).

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

thf(c_0_6,negated_conjecture,
    in @ esk3_0 @ ( setadjoin @ esk1_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_7,negated_conjecture,
    esk3_0 != esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

thf(c_0_8,negated_conjecture,
    ~ ( in @ esk3_0 @ esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

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