↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.19s 0.56s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (  11 unt;   0 def)
%            Number of atoms       :  118 (  32 equ)
%            Maximal formula atoms :   23 (   4 avg)
%            Number of connectives :  155 (  64   ~;  71   |;  14   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-2 aty)
%            Number of variables   :   37 (   3 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',t34_funct_1) ).

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

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

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

fof(t52_funct_1,conjecture,
    ! [X1] : one_to_one(identity_relation(X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t52_funct_1) ).

fof(c_0_5,plain,
    ! [X35,X36,X37] :
      ( ( ~ function(X36)
        | ~ relation(X36)
        | X36 = identity_relation(X35)
        | relation_dom(X36) != X35
        | apply(X36,esk12_2(X35,X36)) != esk12_2(X35,X36) )
      & ( ~ function(X36)
        | ~ relation(X36)
        | X36 = identity_relation(X35)
        | relation_dom(X36) != X35
        | in(esk12_2(X35,X36),X35) )
      & ( ~ function(X36)
        | ~ relation(X36)
        | X36 != identity_relation(X35)
        | apply(X36,X37) = X37
        | ~ in(X37,X35) )
      & ( ~ function(X36)
        | ~ relation(X36)
        | X36 != identity_relation(X35)
        | relation_dom(X36) = X35 ) ),
    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_6,plain,
    ! [X8,X9,X10] :
      ( ( ~ function(X8)
        | ~ relation(X8)
        | one_to_one(X8)
        | esk1_1(X8) != esk2_1(X8) )
      & ( ~ function(X8)
        | ~ relation(X8)
        | one_to_one(X8)
        | apply(X8,esk1_1(X8)) = apply(X8,esk2_1(X8)) )
      & ( ~ function(X8)
        | ~ relation(X8)
        | one_to_one(X8)
        | in(esk2_1(X8),relation_dom(X8)) )
      & ( ~ function(X8)
        | ~ relation(X8)
        | one_to_one(X8)
        | in(esk1_1(X8),relation_dom(X8)) )
      & ( ~ function(X8)
        | ~ relation(X8)
        | X9 = X10
        | apply(X8,X9) != apply(X8,X10)
        | ~ in(X10,relation_dom(X8))
        | ~ in(X9,relation_dom(X8))
        | ~ one_to_one(X8) ) ),
    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)],[d8_funct_1])])])])])]) ).

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

cnf(c_0_8,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | one_to_one(X1)
    | in(esk2_1(X1),relation_dom(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | one_to_one(X1)
    | in(esk1_1(X1),relation_dom(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | one_to_one(X1)
    | apply(X1,esk1_1(X1)) = apply(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( ~ function(X2)
    | ~ function(X1)
    | ~ relation(X2)
    | ~ relation(X1)
    | X1 != identity_relation(relation_dom(X2))
    | one_to_one(X2)
    | apply(X1,esk2_1(X2)) = esk2_1(X2) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

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

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

fof(c_0_14,negated_conjecture,
    ~ ! [X1] : one_to_one(identity_relation(X1)),
    inference(assume_negation,[status(cth)],[t52_funct_1]) ).

cnf(c_0_15,plain,
    ( ~ function(X2)
    | ~ function(X1)
    | ~ relation(X2)
    | ~ relation(X1)
    | X1 != identity_relation(relation_dom(X2))
    | one_to_one(X2)
    | apply(X1,esk1_1(X2)) = esk1_1(X2) ),
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

cnf(c_0_16,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | identity_relation(relation_dom(X1)) != X1
    | one_to_one(X1)
    | apply(X1,esk1_1(X1)) = esk2_1(X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | esk1_1(X1) != esk2_1(X1)
    | one_to_one(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_19,plain,
    relation(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    function(identity_relation(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_21,negated_conjecture,
    ~ one_to_one(identity_relation(esk13_0)),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).

cnf(c_0_22,plain,
    ( ~ function(X1)
    | ~ relation(X1)
    | identity_relation(relation_dom(X1)) != X1
    | one_to_one(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

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_18]),c_0_19]),c_0_20])]) ).

cnf(c_0_24,negated_conjecture,
    ~ one_to_one(identity_relation(esk13_0)),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_25,plain,
    one_to_one(identity_relation(X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_19]),c_0_20])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU019+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42  % Computer : n026.cluster.edu
% 0.14/0.42  % Model    : x86_64 x86_64
% 0.14/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.42  % Memory   : 8046.5625MB
% 0.14/0.42  % OS       : Linux 6.8.0-71-generic
% 0.14/0.42  % CPULimit : 300
% 0.14/0.42  % WCLimit  : 300
% 0.14/0.42  % DateTime : Mon Sep 21 05:49:38 UTC 2026
% 0.14/0.43  % CPUTime  : 
% 0.14/0.43  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  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.19/0.56  % Version: 3.5.1
% 0.19/0.56  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.19/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.19/0.56  % Starting sh5l with 300s (1) cores
% 0.19/0.56  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1495064 completed with status 0
% 0.19/0.56  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.56  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.56  % No SInE strategy applied
% 0.19/0.56  % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.19/0.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.19/0.56  % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.19/0.56  % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1495072 completed with status 0
% 0.19/0.56  % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.19/0.56  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.56  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.56  % No SInE strategy applied
% 0.19/0.56  % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.19/0.56  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.56  % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.56  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.19/0.56  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.19/0.56  % Preprocessing time       : 0.002 s
% 0.19/0.56  
% 0.19/0.56  % Proof found!
% 0.19/0.56  % SZS status Theorem
% 0.19/0.56  % SZS output start CNFRefutation
% See solution above
% 0.19/0.56  % Parsed axioms                        : 32
% 0.19/0.56  % Removed by relevancy pruning/SinE    : 0
% 0.19/0.56  % Initial clauses                      : 51
% 0.19/0.56  % Removed in clause preprocessing      : 0
% 0.19/0.56  % Initial clauses in saturation        : 51
% 0.19/0.56  % Processed clauses                    : 637
% 0.19/0.56  % ...of these trivial                  : 11
% 0.19/0.56  % ...subsumed                          : 378
% 0.19/0.56  % ...remaining for further processing  : 248
% 0.19/0.56  % Other redundant clauses eliminated   : 6
% 0.19/0.56  % Clauses deleted for lack of memory   : 0
% 0.19/0.56  % Backward-subsumed                    : 19
% 0.19/0.56  % Backward-rewritten                   : 39
% 0.19/0.56  % Generated clauses                    : 1863
% 0.19/0.56  % ...of the previous two non-redundant : 1606
% 0.19/0.56  % ...aggressively subsumed             : 0
% 0.19/0.56  % Contextual simplify-reflections      : 26
% 0.19/0.56  % Paramodulations                      : 1849
% 0.19/0.56  % Factorizations                       : 0
% 0.19/0.56  % NegExts                              : 0
% 0.19/0.56  % Equation resolutions                 : 14
% 0.19/0.56  % Disequality decompositions           : 0
% 0.19/0.56  % Total rewrite steps                  : 573
% 0.19/0.56  % ...of those cached                   : 510
% 0.19/0.56  % Propositional unsat checks           : 0
% 0.19/0.56  %    Propositional check models        : 0
% 0.19/0.56  %    Propositional check unsatisfiable : 0
% 0.19/0.56  %    Propositional clauses             : 0
% 0.19/0.56  %    Propositional clauses after purity: 0
% 0.19/0.56  %    Propositional unsat core size     : 0
% 0.19/0.56  %    Propositional preprocessing time  : 0.000
% 0.19/0.56  %    Propositional encoding time       : 0.000
% 0.19/0.56  %    Propositional solver time         : 0.000
% 0.19/0.56  %    Success case prop preproc time    : 0.000
% 0.19/0.56  %    Success case prop encoding time   : 0.000
% 0.19/0.56  %    Success case prop solver time     : 0.000
% 0.19/0.56  % Current number of processed clauses  : 190
% 0.19/0.56  %    Positive orientable unit clauses  : 27
% 0.19/0.56  %    Positive unorientable unit clauses: 0
% 0.19/0.56  %    Negative unit clauses             : 14
% 0.19/0.56  %    Non-unit-clauses                  : 149
% 0.19/0.56  % Current number of unprocessed clauses: 967
% 0.19/0.56  % ...number of literals in the above   : 5112
% 0.19/0.56  % Current number of archived formulas  : 0
% 0.19/0.56  % Current number of archived clauses   : 58
% 0.19/0.56  % Clause-clause subsumption calls (NU) : 9487
% 0.19/0.56  % Rec. Clause-clause subsumption calls : 3421
% 0.19/0.56  % Non-unit clause-clause subsumptions  : 338
% 0.19/0.56  % Unit Clause-clause subsumption calls : 620
% 0.19/0.56  % Rewrite failures with RHS unbound    : 0
% 0.19/0.56  % BW rewrite match attempts            : 23
% 0.19/0.56  % BW rewrite match successes           : 20
% 0.19/0.56  % Condensation attempts                : 0
% 0.19/0.56  % Condensation successes               : 0
% 0.19/0.56  % Termbank termtop insertions          : 25638
% 0.19/0.56  % Search garbage collected termcells   : 485
% 0.19/0.56  
% 0.19/0.56  % -------------------------------------------------
% 0.19/0.56  % User time                : 0.061 s
% 0.19/0.56  % System time              : 0.007 s
% 0.19/0.56  % Total time               : 0.068 s
% 0.19/0.56  % Maximum resident set size: 3656 pages
% 0.19/0.56  
% 0.19/0.56  % -------------------------------------------------
% 0.19/0.56  % User time                : 0.295 s
% 0.19/0.56  % System time              : 0.028 s
% 0.19/0.56  % Total time               : 0.323 s
% 0.19/0.56  % Maximum resident set size: 4608 pages
% 0.19/0.56  % E exiting
%------------------------------------------------------------------------------