↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.28s 0.62s
% Output   : CNFRefutation 0.28s
% 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,
    ! [X68,X69,X70,X71] :
      ( m1_subset_1(a_4_0_relset_2(X68,X69,X70,X71),k1_zfmisc_1(k1_zfmisc_1(X69)))
      | ~ m2_relset_1(X71,X68,X69)
      | ~ m1_subset_1(X70,k1_zfmisc_1(X68))
      | v1_xboole_0(X68) ),
    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.05  % Problem  : SEU424+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45  % Computer : n026.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Mon Sep 21 06:28:52 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.55  Running first-order theorem proving
% 0.28/0.55  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
% 0.28/0.62  % Version: 3.5.1
% 0.28/0.62  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.62  % Starting new_bool_3 with 300s (1) cores
% 0.28/0.62  % Starting new_bool_1 with 300s (1) cores
% 0.28/0.62  % Starting sh5l with 300s (1) cores
% 0.28/0.62  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1579559 completed with status 0
% 0.28/0.62  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.28/0.62  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.62  % No SInE strategy applied
% 0.28/0.62  % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.28/0.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.62  % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.28/0.62  % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 316s (1) cores
% 0.28/0.62  % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.28/0.62  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.28/0.62  % G-E--_301_C18_F1_URBAN_S5PRR_S0Y with pid 1579565 completed with status 0
% 0.28/0.62  % Result found by G-E--_301_C18_F1_URBAN_S5PRR_S0Y
% 0.28/0.62  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.28/0.62  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.28/0.62  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.28/0.62  % No SInE strategy applied
% 0.28/0.62  % Search class: FGHSM-FFMM32-SFFFFFNN
% 0.28/0.62  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.28/0.62  % Starting SubtermCWHack with 136s (1) cores
% 0.28/0.62  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.28/0.62  % Starting G-E--_301_C18_F1_URBAN_S5PRR_S0Y with 316s (1) cores
% 0.28/0.62  % Preprocessing time       : 0.005 s
% 0.28/0.62  
% 0.28/0.62  % Proof found!
% 0.28/0.62  % SZS status Theorem
% 0.28/0.62  % SZS output start CNFRefutation
% See solution above
% 0.28/0.62  % Parsed axioms                        : 43
% 0.28/0.62  % Removed by relevancy pruning/SinE    : 0
% 0.28/0.62  % Initial clauses                      : 60
% 0.28/0.62  % Removed in clause preprocessing      : 7
% 0.28/0.62  % Initial clauses in saturation        : 53
% 0.28/0.62  % Processed clauses                    : 45
% 0.28/0.62  % ...of these trivial                  : 2
% 0.28/0.62  % ...subsumed                          : 0
% 0.28/0.62  % ...remaining for further processing  : 43
% 0.28/0.62  % Other redundant clauses eliminated   : 0
% 0.28/0.62  % Clauses deleted for lack of memory   : 0
% 0.28/0.62  % Backward-subsumed                    : 0
% 0.28/0.62  % Backward-rewritten                   : 0
% 0.28/0.62  % Generated clauses                    : 33
% 0.28/0.62  % ...of the previous two non-redundant : 27
% 0.28/0.62  % ...aggressively subsumed             : 0
% 0.28/0.62  % Contextual simplify-reflections      : 0
% 0.28/0.62  % Paramodulations                      : 33
% 0.28/0.62  % Factorizations                       : 0
% 0.28/0.62  % NegExts                              : 0
% 0.28/0.62  % Equation resolutions                 : 0
% 0.28/0.62  % Disequality decompositions           : 0
% 0.28/0.62  % Total rewrite steps                  : 4
% 0.28/0.62  % ...of those cached                   : 0
% 0.28/0.62  % Propositional unsat checks           : 0
% 0.28/0.62  %    Propositional check models        : 0
% 0.28/0.62  %    Propositional check unsatisfiable : 0
% 0.28/0.62  %    Propositional clauses             : 0
% 0.28/0.62  %    Propositional clauses after purity: 0
% 0.28/0.62  %    Propositional unsat core size     : 0
% 0.28/0.62  %    Propositional preprocessing time  : 0.000
% 0.28/0.62  %    Propositional encoding time       : 0.000
% 0.28/0.62  %    Propositional solver time         : 0.000
% 0.28/0.62  %    Success case prop preproc time    : 0.000
% 0.28/0.62  %    Success case prop encoding time   : 0.000
% 0.28/0.62  %    Success case prop solver time     : 0.000
% 0.28/0.62  % Current number of processed clauses  : 43
% 0.28/0.62  %    Positive orientable unit clauses  : 17
% 0.28/0.62  %    Positive unorientable unit clauses: 0
% 0.28/0.62  %    Negative unit clauses             : 5
% 0.28/0.62  %    Non-unit-clauses                  : 21
% 0.28/0.62  % Current number of unprocessed clauses: 33
% 0.28/0.62  % ...number of literals in the above   : 85
% 0.28/0.62  % Current number of archived formulas  : 0
% 0.28/0.62  % Current number of archived clauses   : 0
% 0.28/0.62  % Clause-clause subsumption calls (NU) : 48
% 0.28/0.62  % Rec. Clause-clause subsumption calls : 36
% 0.28/0.62  % Non-unit clause-clause subsumptions  : 0
% 0.28/0.62  % Unit Clause-clause subsumption calls : 13
% 0.28/0.62  % Rewrite failures with RHS unbound    : 0
% 0.28/0.62  % BW rewrite match attempts            : 0
% 0.28/0.62  % BW rewrite match successes           : 0
% 0.28/0.62  % Condensation attempts                : 0
% 0.28/0.62  % Condensation successes               : 0
% 0.28/0.62  % Termbank termtop insertions          : 3515
% 0.28/0.62  % Search garbage collected termcells   : 606
% 0.28/0.62  
% 0.28/0.62  % -------------------------------------------------
% 0.28/0.62  % User time                : 0.012 s
% 0.28/0.62  % System time              : 0.006 s
% 0.28/0.62  % Total time               : 0.018 s
% 0.28/0.62  % Maximum resident set size: 3624 pages
% 0.28/0.62  
% 0.28/0.62  % -------------------------------------------------
% 0.28/0.62  % User time                : 0.042 s
% 0.28/0.62  % System time              : 0.020 s
% 0.28/0.62  % Total time               : 0.063 s
% 0.28/0.62  % Maximum resident set size: 4864 pages
% 0.28/0.62  % E exiting
%------------------------------------------------------------------------------