↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU424+4 : TPTP v9.3.1. Released v3.4.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 : Thu Sep 24 02:25:06 PM UTC 2026

% Result   : Theorem 29.57s 9.73s
% Output   : CNFRefutation 29.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  15   ~;   6   |;   7   &)
%                                         (   0 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-4 aty)
%            Number of variables   :   28 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t18_relset_2,conjecture,
    ! [X1] :
      ( ~ v1_xboole_0(X1)
     => ! [X2,X3] :
          ( m1_subset_1(X3,k1_zfmisc_1(X1))
         => ! [X4] :
              ( m2_relset_1(X4,X1,X2)
             => m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_relset_2) ).

fof(s8_domain_1__e1_22__relset_2,axiom,
    ! [X1,X2,X3,X4] :
      ( ( m2_relset_1(X4,X1,X2)
        & m1_subset_1(X3,k1_zfmisc_1(X1))
        & ~ v1_xboole_0(X1) )
     => m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s8_domain_1__e1_22__relset_2) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1] :
        ( ~ v1_xboole_0(X1)
       => ! [X2,X3] :
            ( m1_subset_1(X3,k1_zfmisc_1(X1))
           => ! [X4] :
                ( m2_relset_1(X4,X1,X2)
               => m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
    inference(assume_negation,[status(cth)],[t18_relset_2]) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1] :
        ( ~ v1_xboole_0(X1)
       => ! [X2,X3] :
            ( m1_subset_1(X3,k1_zfmisc_1(X1))
           => ! [X4] :
                ( m2_relset_1(X4,X1,X2)
               => m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

fof(c_0_4,plain,
    ! [X1,X2,X3,X4] :
      ( ( m2_relset_1(X4,X1,X2)
        & m1_subset_1(X3,k1_zfmisc_1(X1))
        & ~ v1_xboole_0(X1) )
     => m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
    inference(fof_simplification,[status(thm)],[s8_domain_1__e1_22__relset_2]) ).

fof(c_0_5,negated_conjecture,
    ( ~ m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0)))
    & m2_relset_1(esk4_0,esk1_0,esk2_0)
    & m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
    & ~ v1_xboole_0(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_6,plain,
    ! [X100,X101,X102,X103] :
      ( m1_subset_1(a_4_0_relset_2(X100,X101,X102,X103),k1_zfmisc_1(k1_zfmisc_1(X101)))
      | ~ m2_relset_1(X103,X100,X101)
      | ~ m1_subset_1(X102,k1_zfmisc_1(X100))
      | v1_xboole_0(X100) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( ~ m2_relset_1(X3,X1,X4)
    | ~ m1_subset_1(X2,k1_zfmisc_1(X1))
    | m1_subset_1(a_4_0_relset_2(X1,X4,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X4)))
    | v1_xboole_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    m2_relset_1(esk4_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ~ v1_xboole_0(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,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_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU424+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.58  % Computer : n016.cluster.edu
% 0.11/0.58  % Model    : x86_64 x86_64
% 0.11/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58  % Memory   : 8046.5625MB
% 0.11/0.58  % OS       : Linux 6.8.0-71-generic
% 0.11/0.58  % CPULimit : 300
% 0.11/0.58  % WCLimit  : 300
% 0.11/0.58  % DateTime : Mon Sep 21 06:31:59 UTC 2026
% 0.11/0.58  % CPUTime  : 
% 0.11/0.58  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.62  Running first-order theorem proving
% 0.11/0.62  Running: /export/starexec/sandbox2/solver/bin/eprover --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
% 29.57/9.72  % Version: 3.5.1
% 29.57/9.72  % Preprocessing class: FMLLMLLLSSSNFFN.
% 29.57/9.72  % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 29.57/9.72  % Starting new_bool_3 with 888s (3) cores
% 29.57/9.72  % Starting new_bool_1 with 888s (3) cores
% 29.57/9.72  % Starting sh5l with 296s (1) cores
% 29.57/9.72  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 296s (1) cores
% 29.57/9.72  % new_bool_1 with pid 1767654 completed with status 0
% 29.57/9.72  % Result found by new_bool_1
% 29.57/9.72  % Preprocessing class: FMLLMLLLSSSNFFN.
% 29.57/9.72  % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 29.57/9.72  % Starting new_bool_3 with 888s (3) cores
% 29.57/9.72  % Starting new_bool_1 with 888s (3) cores
% 29.57/9.72  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 29.57/9.72  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.57/9.72  % Search class: FGHSM-SMLM32-DFFFFFNN
% 29.57/9.72  % Scheduled 13 strats onto 3 cores with 887 seconds (887 total)
% 29.57/9.72  % Starting SubtermCWHack with 80s (1) cores
% 29.57/9.72  % Starting new_bool_1 with 89s (1) cores
% 29.57/9.72  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 67s (1) cores
% 29.57/9.72  % SubtermCWHack with pid 1767658 completed with status 0
% 29.57/9.73  % Result found by SubtermCWHack
% 29.57/9.73  % Preprocessing class: FMLLMLLLSSSNFFN.
% 29.57/9.73  % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 29.57/9.73  % Starting new_bool_3 with 888s (3) cores
% 29.57/9.73  % Starting new_bool_1 with 888s (3) cores
% 29.57/9.73  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 29.57/9.73  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 29.57/9.73  % Search class: FGHSM-SMLM32-DFFFFFNN
% 29.57/9.73  % Scheduled 13 strats onto 3 cores with 887 seconds (887 total)
% 29.57/9.73  % Starting SubtermCWHack with 80s (1) cores
% 29.57/9.73  % Preprocessing time       : 0.110 s
% 29.57/9.73  
% 29.57/9.73  % Proof found!
% 29.57/9.73  % SZS status Theorem
% 29.57/9.73  % SZS output start CNFRefutation
% See solution above
% 29.57/9.73  % Parsed axioms                        : 71100
% 29.57/9.73  % Removed by relevancy pruning/SinE    : 69921
% 29.57/9.73  % Initial clauses                      : 2715
% 29.57/9.73  % Removed in clause preprocessing      : 55
% 29.57/9.73  % Initial clauses in saturation        : 2660
% 29.57/9.73  % Processed clauses                    : 20174
% 29.57/9.73  % ...of these trivial                  : 409
% 29.57/9.73  % ...subsumed                          : 12457
% 29.57/9.73  % ...remaining for further processing  : 7308
% 29.57/9.73  % Other redundant clauses eliminated   : 494
% 29.57/9.73  % Clauses deleted for lack of memory   : 0
% 29.57/9.73  % Backward-subsumed                    : 143
% 29.57/9.73  % Backward-rewritten                   : 792
% 29.57/9.73  % Generated clauses                    : 86603
% 29.57/9.73  % ...of the previous two non-redundant : 78253
% 29.57/9.73  % ...aggressively subsumed             : 0
% 29.57/9.73  % Contextual simplify-reflections      : 83
% 29.57/9.73  % Paramodulations                      : 86074
% 29.57/9.73  % Factorizations                       : 14
% 29.57/9.73  % NegExts                              : 0
% 29.57/9.73  % Equation resolutions                 : 514
% 29.57/9.73  % Disequality decompositions           : 0
% 29.57/9.73  % Total rewrite steps                  : 20430
% 29.57/9.73  % ...of those cached                   : 17775
% 29.57/9.73  % Propositional unsat checks           : 0
% 29.57/9.73  %    Propositional check models        : 0
% 29.57/9.73  %    Propositional check unsatisfiable : 0
% 29.57/9.73  %    Propositional clauses             : 0
% 29.57/9.73  %    Propositional clauses after purity: 0
% 29.57/9.73  %    Propositional unsat core size     : 0
% 29.57/9.73  %    Propositional preprocessing time  : 0.000
% 29.57/9.73  %    Propositional encoding time       : 0.000
% 29.57/9.73  %    Propositional solver time         : 0.000
% 29.57/9.73  %    Success case prop preproc time    : 0.000
% 29.57/9.73  %    Success case prop encoding time   : 0.000
% 29.57/9.73  %    Success case prop solver time     : 0.000
% 29.57/9.73  % Current number of processed clauses  : 6201
% 29.57/9.73  %    Positive orientable unit clauses  : 1480
% 29.57/9.73  %    Positive unorientable unit clauses: 5
% 29.57/9.73  %    Negative unit clauses             : 1593
% 29.57/9.73  %    Non-unit-clauses                  : 3123
% 29.57/9.73  % Current number of unprocessed clauses: 60404
% 29.57/9.73  % ...number of literals in the above   : 276952
% 29.57/9.73  % Current number of archived formulas  : 0
% 29.57/9.73  % Current number of archived clauses   : 951
% 29.57/9.73  % Clause-clause subsumption calls (NU) : 3979164
% 29.57/9.73  % Rec. Clause-clause subsumption calls : 1158346
% 29.57/9.73  % Non-unit clause-clause subsumptions  : 2723
% 29.57/9.73  % Unit Clause-clause subsumption calls : 676950
% 29.57/9.73  % Rewrite failures with RHS unbound    : 0
% 29.57/9.73  % BW rewrite match attempts            : 3098
% 29.57/9.73  % BW rewrite match successes           : 263
% 29.57/9.73  % Condensation attempts                : 0
% 29.57/9.73  % Condensation successes               : 0
% 29.57/9.73  % Termbank termtop insertions          : 3992239
% 29.57/9.73  % Search garbage collected termcells   : 811142
% 29.57/9.73  
% 29.57/9.73  % -------------------------------------------------
% 29.57/9.73  % User time                : 3.689 s
% 29.57/9.73  % System time              : 0.380 s
% 29.57/9.73  % Total time               : 4.069 s
% 29.57/9.73  % Maximum resident set size: 149200 pages
% 29.57/9.73  
% 29.57/9.73  % -------------------------------------------------
% 29.57/9.73  % User time                : 13.762 s
% 29.57/9.73  % System time              : 1.053 s
% 29.57/9.73  % Total time               : 14.815 s
% 29.57/9.73  % Maximum resident set size: 121600 pages
% 29.57/9.73  % E exiting
%------------------------------------------------------------------------------