↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SEU008+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 : n003.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:27:56 PM UTC 2026

% Result   : Theorem 0.09s 0.44s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  12 unt;   0 def)
%            Number of atoms       :  111 (  34 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  131 (  49   ~;  50   |;  20   &)
%                                         (   3 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   54 (   4 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(t38_funct_1,conjecture,
    ! [X1,X2,X3] :
      ( ( function(X3)
        & relation(X3) )
     => ( in(X2,set_intersection2(relation_dom(X3),X1))
       => apply(X3,X2) = apply(relation_composition(identity_relation(X1),X3),X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_funct_1) ).

fof(t34_funct_1,axiom,
    ! [X1,X2] :
      ( ( function(X2)
        & relation(X2) )
     => ( X2 = identity_relation(X1)
      <=> ( ! [X3] :
              ( in(X3,X1)
             => apply(X2,X3) = X3 )
          & relation_dom(X2) = X1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t34_funct_1) ).

fof(dt_k6_relat_1,axiom,
    ! [X1] : relation(identity_relation(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k6_relat_1) ).

fof(fc2_funct_1,axiom,
    ! [X1] :
      ( function(identity_relation(X1))
      & relation(identity_relation(X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc2_funct_1) ).

fof(t23_funct_1,axiom,
    ! [X1,X2] :
      ( ( function(X2)
        & relation(X2) )
     => ! [X3] :
          ( ( function(X3)
            & relation(X3) )
         => ( in(X1,relation_dom(X2))
           => apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).

fof(c_0_6,plain,
    ! [X11,X12,X13,X14,X15,X16,X17,X18] :
      ( ( X18 = set_intersection2(X16,X17)
        | in(esk1_3(X16,X17,X18),X18)
        | in(esk1_3(X16,X17,X18),X17) )
      & ( X18 = set_intersection2(X16,X17)
        | in(esk1_3(X16,X17,X18),X18)
        | in(esk1_3(X16,X17,X18),X16) )
      & ( X18 = set_intersection2(X16,X17)
        | ~ in(esk1_3(X16,X17,X18),X17)
        | ~ in(esk1_3(X16,X17,X18),X16)
        | ~ in(esk1_3(X16,X17,X18),X18) )
      & ( X13 != set_intersection2(X11,X12)
        | in(X15,X13)
        | ~ in(X15,X12)
        | ~ in(X15,X11) )
      & ( X13 != set_intersection2(X11,X12)
        | ~ in(X14,X13)
        | in(X14,X12) )
      & ( X13 != set_intersection2(X11,X12)
        | ~ in(X14,X13)
        | in(X14,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)],[d3_xboole_0])])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( function(X3)
          & relation(X3) )
       => ( in(X2,set_intersection2(relation_dom(X3),X1))
         => apply(X3,X2) = apply(relation_composition(identity_relation(X1),X3),X2) ) ),
    inference(assume_negation,[status(cth)],[t38_funct_1]) ).

fof(c_0_8,plain,
    ! [X57,X58,X59] :
      ( ( ~ function(X58)
        | ~ relation(X58)
        | X58 = identity_relation(X57)
        | relation_dom(X58) != X57
        | apply(X58,esk11_2(X57,X58)) != esk11_2(X57,X58) )
      & ( ~ function(X58)
        | ~ relation(X58)
        | X58 = identity_relation(X57)
        | relation_dom(X58) != X57
        | in(esk11_2(X57,X58),X57) )
      & ( ~ function(X58)
        | ~ relation(X58)
        | X58 != identity_relation(X57)
        | apply(X58,X59) = X59
        | ~ in(X59,X57) )
      & ( ~ function(X58)
        | ~ relation(X58)
        | X58 != identity_relation(X57)
        | relation_dom(X58) = X57 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_funct_1])])])])])]) ).

fof(c_0_9,plain,
    ! [X22] : relation(identity_relation(X22)),
    inference(variable_rename,[status(thm)],[dt_k6_relat_1]) ).

fof(c_0_10,plain,
    ! [X32] :
      ( function(identity_relation(X32))
      & relation(identity_relation(X32)) ),
    inference(variable_rename,[status(thm)],[fc2_funct_1]) ).

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

fof(c_0_12,negated_conjecture,
    ( apply(esk14_0,esk13_0) != apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0)
    & in(esk13_0,set_intersection2(relation_dom(esk14_0),esk12_0))
    & function(esk14_0)
    & relation(esk14_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

fof(c_0_13,plain,
    ! [X51,X52,X53] :
      ( apply(relation_composition(X52,X53),X51) = apply(X53,apply(X52,X51))
      | ~ in(X51,relation_dom(X52))
      | ~ function(X53)
      | ~ relation(X53)
      | ~ function(X52)
      | ~ relation(X52) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])])]) ).

cnf(c_0_14,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | X1 != identity_relation(X2)
    | relation_dom(X1) = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,plain,
    relation(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    function(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

cnf(c_0_18,negated_conjecture,
    in(esk13_0,set_intersection2(relation_dom(esk14_0),esk12_0)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    apply(esk14_0,esk13_0) != apply(relation_composition(identity_relation(esk12_0),esk14_0),esk13_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    ( ~ in(X3,relation_dom(X1))
    | ~ function(X2)
    | ~ relation(X2)
    | ~ function(X1)
    | ~ relation(X1)
    | apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    relation(esk14_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_22,negated_conjecture,
    function(esk14_0),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_23,plain,
    relation_dom(identity_relation(X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_15]),c_0_16])]) ).

cnf(c_0_24,negated_conjecture,
    in(esk13_0,esk12_0),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    ( ~ function(X3)
    | ~ relation(X3)
    | X3 != identity_relation(X2)
    | ~ in(X1,X2)
    | apply(X3,X1) = X1 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_26,negated_conjecture,
    apply(esk14_0,apply(identity_relation(esk12_0),esk13_0)) != apply(esk14_0,esk13_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_15]),c_0_22]),c_0_16])]),c_0_23]),c_0_24])]) ).

cnf(c_0_27,plain,
    ( ~ in(X2,X1)
    | apply(identity_relation(X1),X2) = X2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_25]),c_0_15]),c_0_16])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_24])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU008+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n003.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 05:47:46 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/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.09/0.44  % Version: 3.5.1
% 0.09/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44  % Starting sh5l with 300s (1) cores
% 0.09/0.44  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3538385 completed with status 0
% 0.09/0.44  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44  % No SInE strategy applied
% 0.09/0.44  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.09/0.44  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.44  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.09/0.44  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.09/0.44  % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.09/0.44  % G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with pid 3538393 completed with status 0
% 0.09/0.44  % Result found by G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 0.09/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.44  % No SInE strategy applied
% 0.09/0.44  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.09/0.44  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.44  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.09/0.44  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.09/0.44  % Preprocessing time       : 0.002 s
% 0.09/0.44  
% 0.09/0.44  % Proof found!
% 0.09/0.44  % SZS status Theorem
% 0.09/0.44  % SZS output start CNFRefutation
% See solution above
% 0.09/0.44  % Parsed axioms                        : 41
% 0.09/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.44  % Initial clauses                      : 67
% 0.09/0.44  % Removed in clause preprocessing      : 0
% 0.09/0.44  % Initial clauses in saturation        : 67
% 0.09/0.44  % Processed clauses                    : 325
% 0.09/0.44  % ...of these trivial                  : 6
% 0.09/0.44  % ...subsumed                          : 164
% 0.09/0.44  % ...remaining for further processing  : 155
% 0.09/0.44  % Other redundant clauses eliminated   : 7
% 0.09/0.44  % Clauses deleted for lack of memory   : 0
% 0.09/0.44  % Backward-subsumed                    : 1
% 0.09/0.44  % Backward-rewritten                   : 11
% 0.09/0.44  % Generated clauses                    : 662
% 0.09/0.44  % ...of the previous two non-redundant : 551
% 0.09/0.44  % ...aggressively subsumed             : 0
% 0.09/0.44  % Contextual simplify-reflections      : 0
% 0.09/0.44  % Paramodulations                      : 648
% 0.09/0.44  % Factorizations                       : 4
% 0.09/0.44  % NegExts                              : 0
% 0.09/0.44  % Equation resolutions                 : 7
% 0.09/0.44  % Disequality decompositions           : 0
% 0.09/0.44  % Total rewrite steps                  : 166
% 0.09/0.44  % ...of those cached                   : 138
% 0.09/0.44  % Propositional unsat checks           : 0
% 0.09/0.44  %    Propositional check models        : 0
% 0.09/0.44  %    Propositional check unsatisfiable : 0
% 0.09/0.44  %    Propositional clauses             : 0
% 0.09/0.44  %    Propositional clauses after purity: 0
% 0.09/0.44  %    Propositional unsat core size     : 0
% 0.09/0.44  %    Propositional preprocessing time  : 0.000
% 0.09/0.44  %    Propositional encoding time       : 0.000
% 0.09/0.44  %    Propositional solver time         : 0.000
% 0.09/0.44  %    Success case prop preproc time    : 0.000
% 0.09/0.44  %    Success case prop encoding time   : 0.000
% 0.09/0.44  %    Success case prop solver time     : 0.000
% 0.09/0.44  % Current number of processed clauses  : 135
% 0.09/0.44  %    Positive orientable unit clauses  : 32
% 0.09/0.44  %    Positive unorientable unit clauses: 1
% 0.09/0.44  %    Negative unit clauses             : 15
% 0.09/0.44  %    Non-unit-clauses                  : 87
% 0.09/0.44  % Current number of unprocessed clauses: 277
% 0.09/0.44  % ...number of literals in the above   : 898
% 0.09/0.44  % Current number of archived formulas  : 0
% 0.09/0.44  % Current number of archived clauses   : 12
% 0.09/0.44  % Clause-clause subsumption calls (NU) : 1459
% 0.09/0.44  % Rec. Clause-clause subsumption calls : 1212
% 0.09/0.44  % Non-unit clause-clause subsumptions  : 123
% 0.09/0.44  % Unit Clause-clause subsumption calls : 175
% 0.09/0.44  % Rewrite failures with RHS unbound    : 0
% 0.09/0.44  % BW rewrite match attempts            : 14
% 0.09/0.44  % BW rewrite match successes           : 10
% 0.09/0.44  % Condensation attempts                : 0
% 0.09/0.44  % Condensation successes               : 0
% 0.09/0.44  % Termbank termtop insertions          : 9292
% 0.09/0.44  % Search garbage collected termcells   : 722
% 0.09/0.44  
% 0.09/0.44  % -------------------------------------------------
% 0.09/0.44  % User time                : 0.019 s
% 0.09/0.44  % System time              : 0.004 s
% 0.09/0.44  % Total time               : 0.023 s
% 0.09/0.44  % Maximum resident set size: 3668 pages
% 0.09/0.44  
% 0.09/0.44  % -------------------------------------------------
% 0.09/0.44  % User time                : 0.082 s
% 0.09/0.44  % System time              : 0.016 s
% 0.09/0.44  % Total time               : 0.099 s
% 0.09/0.44  % Maximum resident set size: 4864 pages
% 0.09/0.44  % E exiting
%------------------------------------------------------------------------------