↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n013.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:13:31 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(member_when_not_a_singleton,conjecture,
    ! [X1,X3] :
      ( ( X1 = X3
        & ~ ? [X2] :
              ( X1 = singleton(X2)
              & member(X2,universal_class) ) )
     => member_of(X1) = X3 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_when_not_a_singleton) ).

fof(member_universal_self,axiom,
    ! [X1] :
      ( member_of(X1) = X1
      | member(member_of(X1),universal_class) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',member_universal_self) ).

fof(singleton_self,axiom,
    ! [X1] :
      ( member_of(X1) = X1
      | singleton(member_of(X1)) = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',singleton_self) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X3] :
        ( ( X1 = X3
          & ~ ? [X2] :
                ( X1 = singleton(X2)
                & member(X2,universal_class) ) )
       => member_of(X1) = X3 ),
    inference(assume_negation,[status(cth)],[member_when_not_a_singleton]) ).

fof(c_0_4,negated_conjecture,
    ! [X12] :
      ( member_of(esk1_0) != esk2_0
      & esk1_0 = esk2_0
      & ( esk1_0 != singleton(X12)
        | ~ member(X12,universal_class) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).

fof(c_0_5,plain,
    ! [X15] :
      ( member_of(X15) = X15
      | member(member_of(X15),universal_class) ),
    inference(variable_rename,[status(thm)],[member_universal_self]) ).

cnf(c_0_6,negated_conjecture,
    ( esk1_0 != singleton(X1)
    | ~ member(X1,universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( member_of(X1) = X1
    | member(member_of(X1),universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X16] :
      ( member_of(X16) = X16
      | singleton(member_of(X16)) = X16 ),
    inference(variable_rename,[status(thm)],[singleton_self]) ).

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

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

cnf(c_0_11,negated_conjecture,
    ( singleton(member_of(X1)) != esk1_0
    | member_of(X1) = X1 ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_12,plain,
    ( member_of(X1) = X1
    | singleton(member_of(X1)) = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    member_of(esk1_0) != esk1_0,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12])]),c_0_13]),
    [proof] ).

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