↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SEU435+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 : n014.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:29:26 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(t36_relset_2,conjecture,
    ! [X1,X2,X3] :
      ( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))
     => ! [X4,X5,X6] :
          ( m1_subset_1(X6,k1_zfmisc_1(X4))
         => m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_relset_2) ).

fof(s8_domain_1__e1_46__relset_2,axiom,
    ! [X1,X2,X3,X4,X5,X6] :
      ( ( m1_subset_1(X6,k1_zfmisc_1(X4))
        & m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2)))) )
     => m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s8_domain_1__e1_46__relset_2) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( m1_subset_1(X3,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X1,X2))))
       => ! [X4,X5,X6] :
            ( m1_subset_1(X6,k1_zfmisc_1(X4))
           => m1_subset_1(a_6_0_relset_2(X1,X2,X3,X4,X5,X6),k1_zfmisc_1(k1_zfmisc_1(X5))) ) ),
    inference(assume_negation,[status(cth)],[t36_relset_2]) ).

fof(c_0_3,negated_conjecture,
    ( ~ m1_subset_1(a_6_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),k1_zfmisc_1(k1_zfmisc_1(esk5_0)))
    & m1_subset_1(esk6_0,k1_zfmisc_1(esk4_0))
    & m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
    ! [X104,X105,X106,X107,X108,X109] :
      ( m1_subset_1(a_6_0_relset_2(X104,X105,X106,X107,X108,X109),k1_zfmisc_1(k1_zfmisc_1(X108)))
      | ~ m1_subset_1(X109,k1_zfmisc_1(X107))
      | ~ m1_subset_1(X106,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X104,X105)))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[s8_domain_1__e1_46__relset_2])])]) ).

cnf(c_0_5,negated_conjecture,
    ~ m1_subset_1(a_6_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),k1_zfmisc_1(k1_zfmisc_1(esk5_0))),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( ~ m1_subset_1(X4,k1_zfmisc_1(X5))
    | ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(X2,X3))))
    | m1_subset_1(a_6_0_relset_2(X2,X3,X1,X5,X6,X4),k1_zfmisc_1(k1_zfmisc_1(X6))) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    m1_subset_1(esk3_0,k1_zfmisc_1(k1_zfmisc_1(k2_zfmisc_1(esk1_0,esk2_0)))),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    m1_subset_1(esk6_0,k1_zfmisc_1(esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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.02  % Problem  : SEU435+4 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n014.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Mon Sep 21 06:31:03 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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.13/6.70  % Version: 3.5.1
% 0.13/6.70  % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.13/6.70  % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.13/6.70  % Starting new_bool_3 with 888s (3) cores
% 0.13/6.70  % Starting new_bool_1 with 888s (3) cores
% 0.13/6.70  % Starting sh5l with 296s (1) cores
% 0.13/6.70  % Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 296s (1) cores
% 0.13/6.70  % new_bool_1 with pid 3400087 completed with status 0
% 0.13/6.70  % Result found by new_bool_1
% 0.13/6.70  % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.13/6.70  % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.13/6.70  % Starting new_bool_3 with 888s (3) cores
% 0.13/6.70  % Starting new_bool_1 with 888s (3) cores
% 0.13/6.70  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/6.70  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/6.70  % Search class: FGHSM-FMLM32-MFFFFFNN
% 0.13/6.70  % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 0.13/6.70  % Scheduled 13 strats onto 3 cores with 888 seconds (888 total)
% 0.13/6.70  % Starting SubtermCWHack with 80s (1) cores
% 0.13/6.70  % Starting new_bool_1 with 89s (1) cores
% 0.13/6.70  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 67s (1) cores
% 0.13/6.70  % C12_02_nc_SAT001_MinMin_p005000_rr with pid 3400138 completed with status 0
% 0.13/6.70  % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.13/6.70  % Preprocessing class: FMLLMLLLSSSNFFN.
% 0.13/6.70  % Scheduled 4 strats onto 8 cores with 296 seconds (2368 total)
% 0.13/6.70  % Starting new_bool_3 with 888s (3) cores
% 0.13/6.70  % Starting new_bool_1 with 888s (3) cores
% 0.13/6.70  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/6.70  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/6.70  % Search class: FGHSM-FMLM32-MFFFFFNN
% 0.13/6.70  % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 0.13/6.70  % Scheduled 13 strats onto 3 cores with 888 seconds (888 total)
% 0.13/6.70  % Starting SubtermCWHack with 80s (1) cores
% 0.13/6.70  % Starting new_bool_1 with 89s (1) cores
% 0.13/6.70  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 67s (1) cores
% 0.13/6.70  % Preprocessing time       : 0.063 s
% 0.13/6.70  % Presaturation interreduction done
% 0.13/6.70  
% 0.13/6.70  % Proof found!
% 0.13/6.70  % SZS status Theorem
% 0.13/6.70  % SZS output start CNFRefutation
% See solution above
% 0.13/6.70  % Parsed axioms                        : 71120
% 0.13/6.70  % Removed by relevancy pruning/SinE    : 70661
% 0.13/6.70  % Initial clauses                      : 1001
% 0.13/6.70  % Removed in clause preprocessing      : 27
% 0.13/6.70  % Initial clauses in saturation        : 974
% 0.13/6.70  % Processed clauses                    : 5264
% 0.13/6.70  % ...of these trivial                  : 40
% 0.13/6.70  % ...subsumed                          : 2706
% 0.13/6.70  % ...remaining for further processing  : 2518
% 0.13/6.70  % Other redundant clauses eliminated   : 127
% 0.13/6.70  % Clauses deleted for lack of memory   : 0
% 0.13/6.70  % Backward-subsumed                    : 13
% 0.13/6.70  % Backward-rewritten                   : 45
% 0.13/6.70  % Generated clauses                    : 10743
% 0.13/6.70  % ...of the previous two non-redundant : 9683
% 0.13/6.70  % ...aggressively subsumed             : 0
% 0.13/6.70  % Contextual simplify-reflections      : 56
% 0.13/6.70  % Paramodulations                      : 10616
% 0.13/6.70  % Factorizations                       : 2
% 0.13/6.70  % NegExts                              : 0
% 0.13/6.70  % Equation resolutions                 : 133
% 0.13/6.70  % Disequality decompositions           : 0
% 0.13/6.70  % Total rewrite steps                  : 2681
% 0.13/6.70  % ...of those cached                   : 2387
% 0.13/6.70  % Propositional unsat checks           : 0
% 0.13/6.70  %    Propositional check models        : 0
% 0.13/6.70  %    Propositional check unsatisfiable : 0
% 0.13/6.70  %    Propositional clauses             : 0
% 0.13/6.70  %    Propositional clauses after purity: 0
% 0.13/6.70  %    Propositional unsat core size     : 0
% 0.13/6.70  %    Propositional preprocessing time  : 0.000
% 0.13/6.70  %    Propositional encoding time       : 0.000
% 0.13/6.70  %    Propositional solver time         : 0.000
% 0.13/6.70  %    Success case prop preproc time    : 0.000
% 0.13/6.70  %    Success case prop encoding time   : 0.000
% 0.13/6.70  %    Success case prop solver time     : 0.000
% 0.13/6.70  % Current number of processed clauses  : 1473
% 0.13/6.70  %    Positive orientable unit clauses  : 226
% 0.13/6.70  %    Positive unorientable unit clauses: 1
% 0.13/6.70  %    Negative unit clauses             : 313
% 0.13/6.70  %    Non-unit-clauses                  : 933
% 0.13/6.70  % Current number of unprocessed clauses: 6268
% 0.13/6.70  % ...number of literals in the above   : 23369
% 0.13/6.70  % Current number of archived formulas  : 0
% 0.13/6.70  % Current number of archived clauses   : 965
% 0.13/6.70  % Clause-clause subsumption calls (NU) : 523700
% 0.13/6.70  % Rec. Clause-clause subsumption calls : 145420
% 0.13/6.70  % Non-unit clause-clause subsumptions  : 936
% 0.13/6.70  % Unit Clause-clause subsumption calls : 16193
% 0.13/6.70  % Rewrite failures with RHS unbound    : 0
% 0.13/6.70  % BW rewrite match attempts            : 126
% 0.13/6.70  % BW rewrite match successes           : 66
% 0.13/6.70  % Condensation attempts                : 0
% 0.13/6.70  % Condensation successes               : 0
% 0.13/6.70  % Termbank termtop insertions          : 2766240
% 0.13/6.70  % Search garbage collected termcells   : 787855
% 0.13/6.70  
% 0.13/6.70  % -------------------------------------------------
% 0.13/6.70  % User time                : 1.010 s
% 0.13/6.70  % System time              : 0.261 s
% 0.13/6.70  % Total time               : 1.271 s
% 0.13/6.70  % Maximum resident set size: 149236 pages
% 0.13/6.70  
% 0.13/6.70  % -------------------------------------------------
% 0.13/6.70  % User time                : 6.897 s
% 0.13/6.70  % System time              : 0.874 s
% 0.13/6.70  % Total time               : 7.771 s
% 0.13/6.70  % Maximum resident set size: 121344 pages
% 0.13/6.70  % E exiting
%------------------------------------------------------------------------------