↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SET677+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n009.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:14:58 PM UTC 2026

% Result   : Theorem 0.14s 0.49s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   8 unt;   0 def)
%            Number of atoms       :   95 (  19 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  115 (  46   ~;  42   |;  10   &)
%                                         (   1 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   41 (   1 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(p2,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,relation_type(X1,X2))
             => ( subset(identity_relation_of(X2),X3)
               => ( X2 = range(X1,X2,X3)
                  & subset(X2,domain(X1,X2,X3)) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2) ).

fof(p34,axiom,
    ! [X1] : ilf_type(X1,set_type),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p34) ).

fof(prove_relset_1_44,conjecture,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,identity_relation_of_type(X1))
         => ( subset(identity_relation_of(X1),X2)
           => ( X1 = range(X1,X1,X2)
              & X1 = domain(X1,X1,X2) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_relset_1_44) ).

fof(p5,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ( ilf_type(X2,identity_relation_of_type(X1))
          <=> ilf_type(X2,relation_type(X1,X1)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p5) ).

fof(p1,axiom,
    ! [X1] :
      ( ilf_type(X1,set_type)
     => ! [X2] :
          ( ilf_type(X2,set_type)
         => ! [X3] :
              ( ilf_type(X3,relation_type(X2,X1))
             => ( subset(identity_relation_of(X2),X3)
               => ( subset(X2,range(X2,X1,X3))
                  & X2 = domain(X2,X1,X3) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p1) ).

fof(c_0_5,plain,
    ! [X10,X11,X12] :
      ( ( ~ ilf_type(X10,set_type)
        | ~ ilf_type(X11,set_type)
        | ~ ilf_type(X12,relation_type(X10,X11))
        | ~ subset(identity_relation_of(X11),X12)
        | X11 = range(X10,X11,X12) )
      & ( ~ ilf_type(X10,set_type)
        | ~ ilf_type(X11,set_type)
        | ~ ilf_type(X12,relation_type(X10,X11))
        | ~ subset(identity_relation_of(X11),X12)
        | subset(X11,domain(X10,X11,X12)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])])])]) ).

fof(c_0_6,plain,
    ! [X31] : ilf_type(X31,set_type),
    inference(variable_rename,[status(thm)],[p34]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ilf_type(X1,set_type)
       => ! [X2] :
            ( ilf_type(X2,identity_relation_of_type(X1))
           => ( subset(identity_relation_of(X1),X2)
             => ( X1 = range(X1,X1,X2)
                & X1 = domain(X1,X1,X2) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove_relset_1_44]) ).

fof(c_0_8,plain,
    ! [X32,X33] :
      ( ( ~ ilf_type(X32,set_type)
        | ~ ilf_type(X33,set_type)
        | ilf_type(X33,identity_relation_of_type(X32))
        | ~ ilf_type(X33,relation_type(X32,X32)) )
      & ( ~ ilf_type(X32,set_type)
        | ~ ilf_type(X33,set_type)
        | ilf_type(X33,relation_type(X32,X32))
        | ~ ilf_type(X33,identity_relation_of_type(X32)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p5])])])])]) ).

cnf(c_0_9,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X3,relation_type(X2,X1))
    | ~ subset(identity_relation_of(X1),X3)
    | X1 = range(X2,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    ilf_type(X1,set_type),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_11,negated_conjecture,
    ( ( esk1_0 != range(esk1_0,esk1_0,esk2_0)
      | esk1_0 != domain(esk1_0,esk1_0,esk2_0) )
    & subset(identity_relation_of(esk1_0),esk2_0)
    & ilf_type(esk2_0,identity_relation_of_type(esk1_0))
    & ilf_type(esk1_0,set_type) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).

cnf(c_0_12,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X1,identity_relation_of_type(X2))
    | ilf_type(X1,relation_type(X2,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_13,plain,
    ! [X7,X8,X9] :
      ( ( ~ ilf_type(X7,set_type)
        | ~ ilf_type(X8,set_type)
        | ~ ilf_type(X9,relation_type(X8,X7))
        | ~ subset(identity_relation_of(X8),X9)
        | subset(X8,range(X8,X7,X9)) )
      & ( ~ ilf_type(X7,set_type)
        | ~ ilf_type(X8,set_type)
        | ~ ilf_type(X9,relation_type(X8,X7))
        | ~ subset(identity_relation_of(X8),X9)
        | X8 = domain(X8,X7,X9) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])])]) ).

cnf(c_0_14,plain,
    ( ~ ilf_type(X3,relation_type(X1,X2))
    | ~ subset(identity_relation_of(X2),X3)
    | range(X1,X2,X3) = X2 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10])]) ).

cnf(c_0_15,negated_conjecture,
    subset(identity_relation_of(esk1_0),esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    ( ~ ilf_type(X1,identity_relation_of_type(X2))
    | ilf_type(X1,relation_type(X2,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_10]),c_0_10])]) ).

cnf(c_0_17,negated_conjecture,
    ilf_type(esk2_0,identity_relation_of_type(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,plain,
    ( ~ ilf_type(X2,set_type)
    | ~ ilf_type(X1,set_type)
    | ~ ilf_type(X3,relation_type(X1,X2))
    | ~ subset(identity_relation_of(X1),X3)
    | X1 = domain(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    ( esk1_0 != range(esk1_0,esk1_0,esk2_0)
    | esk1_0 != domain(esk1_0,esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ ilf_type(esk2_0,relation_type(X1,esk1_0))
    | range(X1,esk1_0,esk2_0) = esk1_0 ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    ilf_type(esk2_0,relation_type(esk1_0,esk1_0)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    ( ~ ilf_type(X3,relation_type(X1,X2))
    | ~ subset(identity_relation_of(X1),X3)
    | domain(X1,X2,X3) = X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_10]),c_0_10])]) ).

cnf(c_0_23,negated_conjecture,
    domain(esk1_0,esk1_0,esk2_0) != esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ ilf_type(esk2_0,relation_type(esk1_0,X1))
    | domain(esk1_0,X1,esk2_0) = esk1_0 ),
    inference(spm,[status(thm)],[c_0_22,c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET677+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36  % Computer : n009.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 05:32:27 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.14/0.49  % Version: 3.5.1
% 0.14/0.49  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49  % Starting sh5l with 300s (1) cores
% 0.14/0.49  % new_bool_3 with pid 946991 completed with status 0
% 0.14/0.49  % Result found by new_bool_3
% 0.14/0.49  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.14/0.49  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49  % SubtermCWHack with pid 946995 completed with status 0
% 0.14/0.49  % Result found by SubtermCWHack
% 0.14/0.49  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.49  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.49  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49  % Search class: FGHSF-FFMS31-SFFFFFNN
% 0.14/0.49  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49  % Preprocessing time       : 0.003 s
% 0.14/0.49  
% 0.14/0.49  % Proof found!
% 0.14/0.49  % SZS status Theorem
% 0.14/0.49  % SZS output start CNFRefutation
% See solution above
% 0.14/0.49  % Parsed axioms                        : 35
% 0.14/0.49  % Removed by relevancy pruning/SinE    : 11
% 0.14/0.49  % Initial clauses                      : 50
% 0.14/0.49  % Removed in clause preprocessing      : 1
% 0.14/0.49  % Initial clauses in saturation        : 49
% 0.14/0.49  % Processed clauses                    : 106
% 0.14/0.49  % ...of these trivial                  : 9
% 0.14/0.49  % ...subsumed                          : 17
% 0.14/0.49  % ...remaining for further processing  : 80
% 0.14/0.49  % Other redundant clauses eliminated   : 4
% 0.14/0.49  % Clauses deleted for lack of memory   : 0
% 0.14/0.49  % Backward-subsumed                    : 7
% 0.14/0.49  % Backward-rewritten                   : 1
% 0.14/0.49  % Generated clauses                    : 157
% 0.14/0.49  % ...of the previous two non-redundant : 136
% 0.14/0.49  % ...aggressively subsumed             : 0
% 0.14/0.49  % Contextual simplify-reflections      : 1
% 0.14/0.49  % Paramodulations                      : 153
% 0.14/0.49  % Factorizations                       : 0
% 0.14/0.49  % NegExts                              : 0
% 0.14/0.49  % Equation resolutions                 : 4
% 0.14/0.49  % Disequality decompositions           : 0
% 0.14/0.49  % Total rewrite steps                  : 107
% 0.14/0.49  % ...of those cached                   : 83
% 0.14/0.49  % Propositional unsat checks           : 0
% 0.14/0.49  %    Propositional check models        : 0
% 0.14/0.49  %    Propositional check unsatisfiable : 0
% 0.14/0.49  %    Propositional clauses             : 0
% 0.14/0.49  %    Propositional clauses after purity: 0
% 0.14/0.49  %    Propositional unsat core size     : 0
% 0.14/0.49  %    Propositional preprocessing time  : 0.000
% 0.14/0.49  %    Propositional encoding time       : 0.000
% 0.14/0.49  %    Propositional solver time         : 0.000
% 0.14/0.49  %    Success case prop preproc time    : 0.000
% 0.14/0.49  %    Success case prop encoding time   : 0.000
% 0.14/0.49  %    Success case prop solver time     : 0.000
% 0.14/0.49  % Current number of processed clauses  : 69
% 0.14/0.49  %    Positive orientable unit clauses  : 14
% 0.14/0.49  %    Positive unorientable unit clauses: 0
% 0.14/0.49  %    Negative unit clauses             : 1
% 0.14/0.49  %    Non-unit-clauses                  : 54
% 0.14/0.49  % Current number of unprocessed clauses: 74
% 0.14/0.49  % ...number of literals in the above   : 323
% 0.14/0.49  % Current number of archived formulas  : 0
% 0.14/0.49  % Current number of archived clauses   : 8
% 0.14/0.49  % Clause-clause subsumption calls (NU) : 732
% 0.14/0.49  % Rec. Clause-clause subsumption calls : 574
% 0.14/0.49  % Non-unit clause-clause subsumptions  : 24
% 0.14/0.49  % Unit Clause-clause subsumption calls : 22
% 0.14/0.49  % Rewrite failures with RHS unbound    : 0
% 0.14/0.49  % BW rewrite match attempts            : 2
% 0.14/0.49  % BW rewrite match successes           : 1
% 0.14/0.49  % Condensation attempts                : 0
% 0.14/0.49  % Condensation successes               : 0
% 0.14/0.49  % Termbank termtop insertions          : 6688
% 0.14/0.49  % Search garbage collected termcells   : 1149
% 0.14/0.49  
% 0.14/0.49  % -------------------------------------------------
% 0.14/0.49  % User time                : 0.022 s
% 0.14/0.49  % System time              : 0.004 s
% 0.14/0.49  % Total time               : 0.026 s
% 0.14/0.49  % Maximum resident set size: 3676 pages
% 0.14/0.49  
% 0.14/0.49  % -------------------------------------------------
% 0.14/0.49  % User time                : 0.025 s
% 0.14/0.49  % System time              : 0.012 s
% 0.14/0.49  % Total time               : 0.037 s
% 0.14/0.49  % Maximum resident set size: 4608 pages
% 0.14/0.49  % E exiting
%------------------------------------------------------------------------------