↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : NUM607+3 : TPTP v9.3.1. Released v4.0.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 01:49:45 PM UTC 2026

% Result   : Theorem 2.86s 1.32s
% Output   : CNFRefutation 2.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   4 unt;   0 def)
%            Number of atoms       :   47 (   2 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :   45 (  11   ~;  12   |;  16   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( aElementOf0(xQ,szDzozmdt0(xc))
    | aSubsetOf0(xQ,xS)
    | ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,xS) )
    | aSubsetOf0(xQ,xS)
    | ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,xS) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(m__5078,hypothesis,
    ( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
    & sbrdtbr0(xQ) = xK
    & aSubsetOf0(xQ,xO)
    & ! [X1] :
        ( aElementOf0(X1,xQ)
       => aElementOf0(X1,xO) )
    & aSet0(xQ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).

fof(m__4998,hypothesis,
    ( aSubsetOf0(xO,xS)
    & ! [X1] :
        ( aElementOf0(X1,xO)
       => aElementOf0(X1,xS) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).

fof(c_0_3,negated_conjecture,
    ~ ( aElementOf0(xQ,szDzozmdt0(xc))
      | aSubsetOf0(xQ,xS)
      | ! [X1] :
          ( aElementOf0(X1,xQ)
         => aElementOf0(X1,xS) )
      | aSubsetOf0(xQ,xS)
      | ! [X1] :
          ( aElementOf0(X1,xQ)
         => aElementOf0(X1,xS) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_4,hypothesis,
    ! [X255] :
      ( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
      & sbrdtbr0(xQ) = xK
      & aSubsetOf0(xQ,xO)
      & ( aElementOf0(X255,xO)
        | ~ aElementOf0(X255,xQ) )
      & aSet0(xQ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).

fof(c_0_5,negated_conjecture,
    ( ~ aElementOf0(xQ,szDzozmdt0(xc))
    & ~ aSubsetOf0(xQ,xS)
    & ~ aElementOf0(esk42_0,xS)
    & aElementOf0(esk42_0,xQ)
    & ~ aSubsetOf0(xQ,xS)
    & ~ aElementOf0(esk41_0,xS)
    & aElementOf0(esk41_0,xQ) ),
    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,hypothesis,
    ! [X254] :
      ( aSubsetOf0(xO,xS)
      & ( aElementOf0(X254,xS)
        | ~ aElementOf0(X254,xO) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])])]) ).

cnf(c_0_7,hypothesis,
    ( ~ aElementOf0(X1,xQ)
    | aElementOf0(X1,xO) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    aElementOf0(esk42_0,xQ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,hypothesis,
    ( ~ aElementOf0(X1,xO)
    | aElementOf0(X1,xS) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    aElementOf0(esk42_0,xO),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ aElementOf0(esk42_0,xS),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM607+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.54  % Computer : n026.cluster.edu
% 0.11/0.54  % Model    : x86_64 x86_64
% 0.11/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54  % Memory   : 8046.5625MB
% 0.11/0.54  % OS       : Linux 6.8.0-71-generic
% 0.11/0.54  % CPULimit : 300
% 0.11/0.54  % WCLimit  : 300
% 0.11/0.54  % DateTime : Mon Sep 21 02:47:22 UTC 2026
% 0.11/0.54  % CPUTime  : 
% 0.11/0.54  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.59  Running first-order theorem proving
% 0.15/0.59  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
% 2.86/1.32  % Version: 3.5.1
% 2.86/1.32  % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.86/1.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/1.32  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.86/1.32  % Starting new_bool_3 with 300s (1) cores
% 2.86/1.32  % Starting new_bool_1 with 300s (1) cores
% 2.86/1.32  % Starting sh5l with 300s (1) cores
% 2.86/1.32  % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1201589 completed with status 0
% 2.86/1.32  % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.86/1.32  % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.86/1.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/1.32  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.86/1.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.86/1.32  % No SInE strategy applied
% 2.86/1.32  % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.86/1.32  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.86/1.32  % Starting SubtermCWHack with 136s (1) cores
% 2.86/1.32  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.86/1.32  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 2.86/1.32  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.86/1.32  % Starting new_bool_3 with 136s (1) cores
% 2.86/1.32  % SubtermCWHack with pid 1201628 completed with status 0
% 2.86/1.32  % Result found by SubtermCWHack
% 2.86/1.32  % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.86/1.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/1.32  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.86/1.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.86/1.32  % No SInE strategy applied
% 2.86/1.32  % Search class: FGHSF-SMLM32-MFFFFFNN
% 2.86/1.32  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.86/1.32  % Starting SubtermCWHack with 136s (1) cores
% 2.86/1.32  % Preprocessing time       : 0.172 s
% 2.86/1.32  
% 2.86/1.32  % Proof found!
% 2.86/1.32  % SZS status Theorem
% 2.86/1.32  % SZS output start CNFRefutation
% See solution above
% 2.86/1.32  % Parsed axioms                        : 102
% 2.86/1.32  % Removed by relevancy pruning/SinE    : 0
% 2.86/1.32  % Initial clauses                      : 4893
% 2.86/1.32  % Removed in clause preprocessing      : 7
% 2.86/1.32  % Initial clauses in saturation        : 4886
% 2.86/1.32  % Processed clauses                    : 83
% 2.86/1.32  % ...of these trivial                  : 2
% 2.86/1.32  % ...subsumed                          : 3
% 2.86/1.32  % ...remaining for further processing  : 78
% 2.86/1.32  % Other redundant clauses eliminated   : 3
% 2.86/1.32  % Clauses deleted for lack of memory   : 0
% 2.86/1.32  % Backward-subsumed                    : 0
% 2.86/1.32  % Backward-rewritten                   : 0
% 2.86/1.32  % Generated clauses                    : 22
% 2.86/1.32  % ...of the previous two non-redundant : 16
% 2.86/1.32  % ...aggressively subsumed             : 0
% 2.86/1.32  % Contextual simplify-reflections      : 0
% 2.86/1.32  % Paramodulations                      : 19
% 2.86/1.32  % Factorizations                       : 0
% 2.86/1.32  % NegExts                              : 0
% 2.86/1.32  % Equation resolutions                 : 3
% 2.86/1.32  % Disequality decompositions           : 0
% 2.86/1.32  % Total rewrite steps                  : 19
% 2.86/1.32  % ...of those cached                   : 7
% 2.86/1.32  % Propositional unsat checks           : 0
% 2.86/1.32  %    Propositional check models        : 0
% 2.86/1.32  %    Propositional check unsatisfiable : 0
% 2.86/1.32  %    Propositional clauses             : 0
% 2.86/1.32  %    Propositional clauses after purity: 0
% 2.86/1.32  %    Propositional unsat core size     : 0
% 2.86/1.32  %    Propositional preprocessing time  : 0.000
% 2.86/1.32  %    Propositional encoding time       : 0.000
% 2.86/1.32  %    Propositional solver time         : 0.000
% 2.86/1.32  %    Success case prop preproc time    : 0.000
% 2.86/1.32  %    Success case prop encoding time   : 0.000
% 2.86/1.32  %    Success case prop solver time     : 0.000
% 2.86/1.32  % Current number of processed clauses  : 75
% 2.86/1.32  %    Positive orientable unit clauses  : 48
% 2.86/1.32  %    Positive unorientable unit clauses: 0
% 2.86/1.32  %    Negative unit clauses             : 9
% 2.86/1.32  %    Non-unit-clauses                  : 18
% 2.86/1.32  % Current number of unprocessed clauses: 4819
% 2.86/1.32  % ...number of literals in the above   : 55903
% 2.86/1.32  % Current number of archived formulas  : 0
% 2.86/1.32  % Current number of archived clauses   : 0
% 2.86/1.32  % Clause-clause subsumption calls (NU) : 26
% 2.86/1.32  % Rec. Clause-clause subsumption calls : 26
% 2.86/1.32  % Non-unit clause-clause subsumptions  : 0
% 2.86/1.32  % Unit Clause-clause subsumption calls : 26
% 2.86/1.32  % Rewrite failures with RHS unbound    : 0
% 2.86/1.32  % BW rewrite match attempts            : 0
% 2.86/1.32  % BW rewrite match successes           : 0
% 2.86/1.32  % Condensation attempts                : 0
% 2.86/1.32  % Condensation successes               : 0
% 2.86/1.32  % Termbank termtop insertions          : 382286
% 2.86/1.32  % Search garbage collected termcells   : 31904
% 2.86/1.32  
% 2.86/1.32  % -------------------------------------------------
% 2.86/1.32  % User time                : 0.599 s
% 2.86/1.32  % System time              : 0.053 s
% 2.86/1.32  % Total time               : 0.652 s
% 2.86/1.32  % Maximum resident set size: 16100 pages
% 2.86/1.32  
% 2.86/1.32  % -------------------------------------------------
% 2.86/1.32  % User time                : 1.218 s
% 2.86/1.32  % System time              : 0.123 s
% 2.86/1.32  % Total time               : 1.341 s
% 2.86/1.32  % Maximum resident set size: 5120 pages
% 2.86/1.32  % E exiting
%------------------------------------------------------------------------------