↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET987+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 : n008.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:54 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(t141_zfmisc_1,conjecture,
    ! [X1,X2] :
      ( ~ in(X1,X2)
     => set_difference(set_union2(X2,singleton(X1)),singleton(X1)) = X2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t141_zfmisc_1) ).

fof(t40_xboole_1,axiom,
    ! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t40_xboole_1) ).

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

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( ~ in(X1,X2)
       => set_difference(set_union2(X2,singleton(X1)),singleton(X1)) = X2 ),
    inference(assume_negation,[status(cth)],[t141_zfmisc_1]) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2] :
        ( ~ in(X1,X2)
       => set_difference(set_union2(X2,singleton(X1)),singleton(X1)) = X2 ),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_5,negated_conjecture,
    ( set_difference(set_union2(esk2_0,singleton(esk1_0)),singleton(esk1_0)) != esk2_0
    & ~ in(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_4])])])]) ).

fof(c_0_6,plain,
    ! [X5,X6] : set_difference(set_union2(X5,X6),X6) = set_difference(X5,X6),
    inference(variable_rename,[status(thm)],[t40_xboole_1]) ).

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

cnf(c_0_8,negated_conjecture,
    set_difference(set_union2(esk2_0,singleton(esk1_0)),singleton(esk1_0)) != esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,plain,
    ! [X7,X8] :
      ( ( set_difference(X7,singleton(X8)) = X7
        | in(X8,X7) )
      & ( ~ in(X8,X7)
        | set_difference(X7,singleton(X8)) != X7 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_11,negated_conjecture,
    set_difference(esk2_0,singleton(esk1_0)) != esk2_0,
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_13,negated_conjecture,
    ~ in(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

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