↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET875+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n004.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:15:40 PM UTC 2026

% Result   : Theorem 0.14s 0.59s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   36 (  16 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   38 (  17   ~;  12   |;   7   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t16_zfmisc_1,conjecture,
    ! [X1,X2] :
      ~ ( X1 = X2
        & disjoint(singleton(X1),singleton(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_zfmisc_1) ).

fof(l25_zfmisc_1,axiom,
    ! [X1,X2] :
      ~ ( in(X1,X2)
        & disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l25_zfmisc_1) ).

fof(d1_tarski,axiom,
    ! [X1,X2] :
      ( X2 = singleton(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> X3 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ~ ( X1 = X2
          & disjoint(singleton(X1),singleton(X2)) ),
    inference(assume_negation,[status(cth)],[t16_zfmisc_1]) ).

fof(c_0_4,negated_conjecture,
    ( esk1_0 = esk2_0
    & disjoint(singleton(esk1_0),singleton(esk2_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_5,plain,
    ! [X6,X7] :
      ( ~ in(X6,X7)
      | ~ disjoint(singleton(X6),X7) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l25_zfmisc_1])])]) ).

cnf(c_0_6,negated_conjecture,
    disjoint(singleton(esk1_0),singleton(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    esk1_0 = esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,plain,
    ! [X10,X11,X12,X13,X14,X15] :
      ( ( X15 = singleton(X14)
        | esk3_2(X14,X15) = X14
        | in(esk3_2(X14,X15),X15) )
      & ( X15 = singleton(X14)
        | esk3_2(X14,X15) != X14
        | ~ in(esk3_2(X14,X15),X15) )
      & ( X11 != singleton(X10)
        | in(X13,X11)
        | X13 != X10 )
      & ( X11 != singleton(X10)
        | X12 = X10
        | ~ in(X12,X11) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])]) ).

cnf(c_0_9,plain,
    ( ~ in(X1,X2)
    | ~ disjoint(singleton(X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,negated_conjecture,
    disjoint(singleton(esk1_0),singleton(esk1_0)),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,plain,
    ( X3 != singleton(X2)
    | X1 != X2
    | in(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    ~ in(esk1_0,singleton(esk1_0)),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET875+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.52  % Computer : n004.cluster.edu
% 0.11/0.52  % Model    : x86_64 x86_64
% 0.11/0.52  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.52  % Memory   : 8046.5625MB
% 0.11/0.52  % OS       : Linux 6.8.0-71-generic
% 0.11/0.53  % CPULimit : 300
% 0.11/0.53  % WCLimit  : 300
% 0.11/0.53  % DateTime : Mon Sep 21 05:42:20 UTC 2026
% 0.11/0.53  % CPUTime  : 
% 0.11/0.53  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.57  Running first-order theorem proving
% 0.14/0.57  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.59  % Version: 3.5.1
% 0.14/0.59  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59  % Starting sh5l with 300s (1) cores
% 0.14/0.59  % new_bool_1 with pid 2362232 completed with status 0
% 0.14/0.59  % Result found by new_bool_1
% 0.14/0.59  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.59  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.59  % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.59  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.59  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.59  % SubtermCWHack with pid 2362234 completed with status 0
% 0.14/0.59  % Result found by SubtermCWHack
% 0.14/0.59  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.59  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.59  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.59  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.59  % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.14/0.59  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.59  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.59  % Preprocessing time       : 0.001 s
% 0.14/0.59  
% 0.14/0.59  % Proof found!
% 0.14/0.59  % SZS status Theorem
% 0.14/0.59  % SZS output start CNFRefutation
% See solution above
% 0.14/0.59  % Parsed axioms                        : 7
% 0.14/0.59  % Removed by relevancy pruning/SinE    : 2
% 0.14/0.59  % Initial clauses                      : 9
% 0.14/0.59  % Removed in clause preprocessing      : 0
% 0.14/0.59  % Initial clauses in saturation        : 9
% 0.14/0.59  % Processed clauses                    : 8
% 0.14/0.59  % ...of these trivial                  : 0
% 0.14/0.59  % ...subsumed                          : 0
% 0.14/0.59  % ...remaining for further processing  : 8
% 0.14/0.59  % Other redundant clauses eliminated   : 2
% 0.14/0.59  % Clauses deleted for lack of memory   : 0
% 0.14/0.59  % Backward-subsumed                    : 0
% 0.14/0.59  % Backward-rewritten                   : 1
% 0.14/0.59  % Generated clauses                    : 4
% 0.14/0.59  % ...of the previous two non-redundant : 2
% 0.14/0.59  % ...aggressively subsumed             : 0
% 0.14/0.59  % Contextual simplify-reflections      : 0
% 0.14/0.59  % Paramodulations                      : 3
% 0.14/0.59  % Factorizations                       : 0
% 0.14/0.59  % NegExts                              : 0
% 0.14/0.59  % Equation resolutions                 : 2
% 0.14/0.59  % Disequality decompositions           : 0
% 0.14/0.59  % Total rewrite steps                  : 3
% 0.14/0.59  % ...of those cached                   : 0
% 0.14/0.59  % Propositional unsat checks           : 0
% 0.14/0.59  %    Propositional check models        : 0
% 0.14/0.59  %    Propositional check unsatisfiable : 0
% 0.14/0.59  %    Propositional clauses             : 0
% 0.14/0.59  %    Propositional clauses after purity: 0
% 0.14/0.59  %    Propositional unsat core size     : 0
% 0.14/0.59  %    Propositional preprocessing time  : 0.000
% 0.14/0.59  %    Propositional encoding time       : 0.000
% 0.14/0.59  %    Propositional solver time         : 0.000
% 0.14/0.59  %    Success case prop preproc time    : 0.000
% 0.14/0.59  %    Success case prop encoding time   : 0.000
% 0.14/0.59  %    Success case prop solver time     : 0.000
% 0.14/0.59  % Current number of processed clauses  : 6
% 0.14/0.59  %    Positive orientable unit clauses  : 3
% 0.14/0.59  %    Positive unorientable unit clauses: 0
% 0.14/0.59  %    Negative unit clauses             : 0
% 0.14/0.59  %    Non-unit-clauses                  : 3
% 0.14/0.59  % Current number of unprocessed clauses: 3
% 0.14/0.59  % ...number of literals in the above   : 9
% 0.14/0.59  % Current number of archived formulas  : 0
% 0.14/0.59  % Current number of archived clauses   : 1
% 0.14/0.59  % Clause-clause subsumption calls (NU) : 0
% 0.14/0.59  % Rec. Clause-clause subsumption calls : 0
% 0.14/0.59  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.59  % Unit Clause-clause subsumption calls : 1
% 0.14/0.59  % Rewrite failures with RHS unbound    : 0
% 0.14/0.59  % BW rewrite match attempts            : 1
% 0.14/0.59  % BW rewrite match successes           : 1
% 0.14/0.59  % Condensation attempts                : 0
% 0.14/0.59  % Condensation successes               : 0
% 0.14/0.59  % Termbank termtop insertions          : 581
% 0.14/0.59  % Search garbage collected termcells   : 171
% 0.14/0.59  
% 0.14/0.59  % -------------------------------------------------
% 0.14/0.59  % User time                : 0.001 s
% 0.14/0.59  % System time              : 0.004 s
% 0.14/0.59  % Total time               : 0.005 s
% 0.14/0.59  % Maximum resident set size: 3632 pages
% 0.14/0.59  
% 0.14/0.59  % -------------------------------------------------
% 0.14/0.59  % User time                : 0.003 s
% 0.14/0.59  % System time              : 0.009 s
% 0.14/0.59  % Total time               : 0.011 s
% 0.14/0.59  % Maximum resident set size: 4864 pages
% 0.14/0.59  % E exiting
%------------------------------------------------------------------------------