↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n015.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:23:53 PM UTC 2026

% Result   : Theorem 0.13s 0.44s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (   7 unt;   0 def)
%            Number of atoms       :   70 (   8 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :   78 (  30   ~;  30   |;  12   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   42 (   0 sgn  26   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t19_xboole_1,conjecture,
    ! [X1,X2,X3] :
      ( ( subset(X1,X3)
        & subset(X1,X2) )
     => subset(X1,set_intersection2(X2,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_xboole_1) ).

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

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

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( subset(X1,X3)
          & subset(X1,X2) )
       => subset(X1,set_intersection2(X2,X3)) ),
    inference(assume_negation,[status(cth)],[t19_xboole_1]) ).

fof(c_0_4,negated_conjecture,
    ( ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0))
    & subset(esk7_0,esk9_0)
    & subset(esk7_0,esk8_0) ),
    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_5,plain,
    ! [X26,X27,X28,X29,X30] :
      ( ( subset(X29,X30)
        | ~ in(esk3_2(X29,X30),X30) )
      & ( subset(X29,X30)
        | in(esk3_2(X29,X30),X29) )
      & ( in(X28,X27)
        | ~ in(X28,X26)
        | ~ subset(X26,X27) ) ),
    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)],[d3_tarski])])])])])])]) ).

fof(c_0_6,plain,
    ! [X32,X33,X34,X35,X36,X37,X38,X39] :
      ( ( X39 = set_intersection2(X37,X38)
        | in(esk4_3(X37,X38,X39),X39)
        | in(esk4_3(X37,X38,X39),X38) )
      & ( X39 = set_intersection2(X37,X38)
        | in(esk4_3(X37,X38,X39),X39)
        | in(esk4_3(X37,X38,X39),X37) )
      & ( X39 = set_intersection2(X37,X38)
        | ~ in(esk4_3(X37,X38,X39),X38)
        | ~ in(esk4_3(X37,X38,X39),X37)
        | ~ in(esk4_3(X37,X38,X39),X39) )
      & ( X34 != set_intersection2(X32,X33)
        | in(X36,X34)
        | ~ in(X36,X33)
        | ~ in(X36,X32) )
      & ( X34 != set_intersection2(X32,X33)
        | ~ in(X35,X34)
        | in(X35,X33) )
      & ( X34 != set_intersection2(X32,X33)
        | ~ in(X35,X34)
        | in(X35,X32) ) ),
    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)],[d3_xboole_0])])])])])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( ~ in(esk3_2(X1,X2),X2)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( X4 != set_intersection2(X2,X3)
    | ~ in(X1,X3)
    | ~ in(X1,X2)
    | in(X1,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ~ in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),set_intersection2(esk8_0,esk9_0)),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( ~ in(X1,X2)
    | ~ in(X1,X3)
    | in(X1,set_intersection2(X2,X3)) ),
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_12,plain,
    ( ~ in(X3,X1)
    | ~ subset(X1,X2)
    | in(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,negated_conjecture,
    subset(esk7_0,esk9_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_14,plain,
    ( subset(X1,X2)
    | in(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk8_0)
    | ~ in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk9_0) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    ( ~ in(X1,esk7_0)
    | in(X1,esk9_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk7_0),
    inference(spm,[status(thm)],[c_0_7,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    subset(esk7_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_19,negated_conjecture,
    ~ in(esk3_2(esk7_0,set_intersection2(esk8_0,esk9_0)),esk8_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ in(X1,esk7_0)
    | in(X1,esk8_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU128+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36  % Computer : n015.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Mon Sep 21 05:54:50 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40  Running first-order theorem proving
% 0.13/0.40  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.13/0.44  % Version: 3.5.1
% 0.13/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.44  % Starting sh5l with 300s (1) cores
% 0.13/0.44  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 700990 completed with status 0
% 0.13/0.44  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44  % No SInE strategy applied
% 0.13/0.44  % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.13/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.44  % Starting new_bool_3 with 136s (1) cores
% 0.13/0.44  % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 701000 completed with status 0
% 0.13/0.44  % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.13/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.44  % No SInE strategy applied
% 0.13/0.44  % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.13/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.44  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.44  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.13/0.44  % Preprocessing time       : 0.001 s
% 0.13/0.44  % Presaturation interreduction done
% 0.13/0.44  
% 0.13/0.44  % Proof found!
% 0.13/0.44  % SZS status Theorem
% 0.13/0.44  % SZS output start CNFRefutation
% See solution above
% 0.13/0.44  % Parsed axioms                        : 36
% 0.13/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.13/0.44  % Initial clauses                      : 57
% 0.13/0.44  % Removed in clause preprocessing      : 3
% 0.13/0.44  % Initial clauses in saturation        : 54
% 0.13/0.44  % Processed clauses                    : 509
% 0.13/0.44  % ...of these trivial                  : 30
% 0.13/0.44  % ...subsumed                          : 240
% 0.13/0.44  % ...remaining for further processing  : 239
% 0.13/0.44  % Other redundant clauses eliminated   : 12
% 0.13/0.44  % Clauses deleted for lack of memory   : 0
% 0.13/0.44  % Backward-subsumed                    : 15
% 0.13/0.44  % Backward-rewritten                   : 1
% 0.13/0.44  % Generated clauses                    : 1047
% 0.13/0.44  % ...of the previous two non-redundant : 781
% 0.13/0.44  % ...aggressively subsumed             : 0
% 0.13/0.44  % Contextual simplify-reflections      : 0
% 0.13/0.44  % Paramodulations                      : 1025
% 0.13/0.44  % Factorizations                       : 10
% 0.13/0.44  % NegExts                              : 0
% 0.13/0.44  % Equation resolutions                 : 12
% 0.13/0.44  % Disequality decompositions           : 0
% 0.13/0.44  % Total rewrite steps                  : 274
% 0.13/0.44  % ...of those cached                   : 189
% 0.13/0.44  % Propositional unsat checks           : 0
% 0.13/0.44  %    Propositional check models        : 0
% 0.13/0.44  %    Propositional check unsatisfiable : 0
% 0.13/0.44  %    Propositional clauses             : 0
% 0.13/0.44  %    Propositional clauses after purity: 0
% 0.13/0.44  %    Propositional unsat core size     : 0
% 0.13/0.44  %    Propositional preprocessing time  : 0.000
% 0.13/0.44  %    Propositional encoding time       : 0.000
% 0.13/0.44  %    Propositional solver time         : 0.000
% 0.13/0.44  %    Success case prop preproc time    : 0.000
% 0.13/0.44  %    Success case prop encoding time   : 0.000
% 0.13/0.44  %    Success case prop solver time     : 0.000
% 0.13/0.44  % Current number of processed clauses  : 162
% 0.13/0.44  %    Positive orientable unit clauses  : 39
% 0.13/0.44  %    Positive unorientable unit clauses: 2
% 0.13/0.44  %    Negative unit clauses             : 11
% 0.13/0.44  %    Non-unit-clauses                  : 110
% 0.13/0.44  % Current number of unprocessed clauses: 369
% 0.13/0.44  % ...number of literals in the above   : 1002
% 0.13/0.44  % Current number of archived formulas  : 0
% 0.13/0.44  % Current number of archived clauses   : 68
% 0.13/0.44  % Clause-clause subsumption calls (NU) : 3340
% 0.13/0.44  % Rec. Clause-clause subsumption calls : 2627
% 0.13/0.44  % Non-unit clause-clause subsumptions  : 174
% 0.13/0.44  % Unit Clause-clause subsumption calls : 111
% 0.13/0.44  % Rewrite failures with RHS unbound    : 0
% 0.13/0.44  % BW rewrite match attempts            : 65
% 0.13/0.44  % BW rewrite match successes           : 35
% 0.13/0.44  % Condensation attempts                : 0
% 0.13/0.44  % Condensation successes               : 0
% 0.13/0.44  % Termbank termtop insertions          : 11921
% 0.13/0.44  % Search garbage collected termcells   : 784
% 0.13/0.44  
% 0.13/0.44  % -------------------------------------------------
% 0.13/0.44  % User time                : 0.017 s
% 0.13/0.44  % System time              : 0.003 s
% 0.13/0.44  % Total time               : 0.020 s
% 0.13/0.44  % Maximum resident set size: 3660 pages
% 0.13/0.44  
% 0.13/0.44  % -------------------------------------------------
% 0.13/0.44  % User time                : 0.069 s
% 0.13/0.44  % System time              : 0.016 s
% 0.13/0.44  % Total time               : 0.085 s
% 0.13/0.44  % Maximum resident set size: 4864 pages
% 0.13/0.44  % E exiting
%------------------------------------------------------------------------------