↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET926+1 : TPTP v9.3.1. Released v3.2.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:15:47 PM UTC 2026

% Result   : Theorem 0.13s 0.64s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   14 (   4 unt;   0 def)
%            Number of atoms       :   28 (  17 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   27 (  13   ~;   8   |;   3   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t69_zfmisc_1,conjecture,
    ! [X1,X2] :
      ( set_difference(singleton(X1),X2) = singleton(X1)
      | set_difference(singleton(X1),X2) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_zfmisc_1) ).

fof(l34_zfmisc_1,axiom,
    ! [X1,X2] :
      ( set_difference(singleton(X1),X2) = singleton(X1)
    <=> ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l34_zfmisc_1) ).

fof(l36_zfmisc_1,axiom,
    ! [X1,X2] :
      ( set_difference(singleton(X1),X2) = empty_set
    <=> in(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l36_zfmisc_1) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( set_difference(singleton(X1),X2) = singleton(X1)
        | set_difference(singleton(X1),X2) = empty_set ),
    inference(assume_negation,[status(cth)],[t69_zfmisc_1]) ).

fof(c_0_4,plain,
    ! [X1,X2] :
      ( set_difference(singleton(X1),X2) = singleton(X1)
    <=> ~ in(X1,X2) ),
    inference(fof_simplification,[status(thm)],[l34_zfmisc_1]) ).

fof(c_0_5,negated_conjecture,
    ( set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0)
    & set_difference(singleton(esk3_0),esk4_0) != empty_set ),
    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,
    ! [X7,X8] :
      ( ( set_difference(singleton(X7),X8) = empty_set
        | ~ in(X7,X8) )
      & ( in(X7,X8)
        | set_difference(singleton(X7),X8) != empty_set ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l36_zfmisc_1])])]) ).

fof(c_0_7,plain,
    ! [X5,X6] :
      ( ( set_difference(singleton(X5),X6) = singleton(X5)
        | in(X5,X6) )
      & ( ~ in(X5,X6)
        | set_difference(singleton(X5),X6) != singleton(X5) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

cnf(c_0_8,negated_conjecture,
    set_difference(singleton(esk3_0),esk4_0) != empty_set,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ in(X1,X2)
    | set_difference(singleton(X1),X2) = empty_set ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( set_difference(singleton(X1),X2) = singleton(X1)
    | in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    ~ in(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

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