↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU211+1 : 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 : 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:24:15 PM UTC 2026

% Result   : Theorem 0.15s 5.58s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :  107 (  18 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  125 (  52   ~;  54   |;  10   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-4 aty)
%            Number of variables   :   81 (   0 sgn  35   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d14_relat_1,axiom,
    ! [X1] :
      ( relation(X1)
     => ! [X2,X3] :
          ( X3 = relation_inverse_image(X1,X2)
        <=> ! [X4] :
              ( in(X4,X3)
            <=> ? [X5] :
                  ( in(X5,X2)
                  & in(ordered_pair(X4,X5),X1) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d14_relat_1) ).

fof(d5_tarski,axiom,
    ! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).

fof(t178_relat_1,conjecture,
    ! [X1,X2,X3] :
      ( relation(X3)
     => ( subset(X1,X2)
       => subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t178_relat_1) ).

fof(commutativity_k2_tarski,axiom,
    ! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

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(c_0_5,plain,
    ! [X11,X12,X13,X14,X16,X17,X18,X19,X21] :
      ( ( ~ relation(X11)
        | X19 = relation_inverse_image(X11,X18)
        | in(esk2_3(X11,X18,X19),X19)
        | in(esk3_3(X11,X18,X19),X18) )
      & ( ~ relation(X11)
        | X19 = relation_inverse_image(X11,X18)
        | in(esk2_3(X11,X18,X19),X19)
        | in(ordered_pair(esk2_3(X11,X18,X19),esk3_3(X11,X18,X19)),X11) )
      & ( ~ relation(X11)
        | X19 = relation_inverse_image(X11,X18)
        | ~ in(X21,X18)
        | ~ in(ordered_pair(esk2_3(X11,X18,X19),X21),X11)
        | ~ in(esk2_3(X11,X18,X19),X19) )
      & ( ~ relation(X11)
        | X13 != relation_inverse_image(X11,X12)
        | in(X16,X13)
        | ~ in(X17,X12)
        | ~ in(ordered_pair(X16,X17),X11) )
      & ( ~ relation(X11)
        | X13 != relation_inverse_image(X11,X12)
        | ~ in(X14,X13)
        | in(esk1_4(X11,X12,X13,X14),X12) )
      & ( ~ relation(X11)
        | X13 != relation_inverse_image(X11,X12)
        | ~ in(X14,X13)
        | in(ordered_pair(X14,esk1_4(X11,X12,X13,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)],[d14_relat_1])])])])])])]) ).

fof(c_0_6,plain,
    ! [X29,X30] : ordered_pair(X29,X30) = unordered_pair(unordered_pair(X29,X30),singleton(X29)),
    inference(variable_rename,[status(thm)],[d5_tarski]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( relation(X3)
       => ( subset(X1,X2)
         => subset(relation_inverse_image(X3,X1),relation_inverse_image(X3,X2)) ) ),
    inference(assume_negation,[status(cth)],[t178_relat_1]) ).

cnf(c_0_8,plain,
    ( ~ relation(X2)
    | X4 != relation_inverse_image(X2,X3)
    | ~ in(X1,X4)
    | in(ordered_pair(X1,esk1_4(X2,X3,X4,X1)),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,plain,
    ! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
    inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).

fof(c_0_11,negated_conjecture,
    ( ~ subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0))
    & subset(esk12_0,esk13_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_12,plain,
    ! [X23,X24,X25,X26,X27] :
      ( ( subset(X26,X27)
        | ~ in(esk4_2(X26,X27),X27) )
      & ( subset(X26,X27)
        | in(esk4_2(X26,X27),X26) )
      & ( in(X25,X24)
        | ~ in(X25,X23)
        | ~ subset(X23,X24) ) ),
    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])])])])])])]) ).

cnf(c_0_13,plain,
    ( ~ relation(X3)
    | X5 != relation_inverse_image(X3,X4)
    | ~ in(X2,X4)
    | ~ in(ordered_pair(X1,X2),X3)
    | in(X1,X5) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,plain,
    ( ~ in(X1,X4)
    | ~ relation(X2)
    | X4 != relation_inverse_image(X2,X3)
    | in(unordered_pair(unordered_pair(X1,esk1_4(X2,X3,X4,X1)),singleton(X1)),X2) ),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_15,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ~ subset(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    ( subset(X1,X2)
    | in(esk4_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
    | ~ in(X2,X4)
    | ~ relation(X3)
    | X5 != relation_inverse_image(X3,X4)
    | in(X1,X5) ),
    inference(rw,[status(thm)],[c_0_13,c_0_9]) ).

cnf(c_0_19,plain,
    ( ~ in(X1,relation_inverse_image(X2,X3))
    | ~ relation(X2)
    | in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_4(X2,X3,relation_inverse_image(X2,X3),X1))),X2) ),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

cnf(c_0_20,negated_conjecture,
    in(esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0)),relation_inverse_image(esk14_0,esk12_0)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

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

cnf(c_0_22,plain,
    ( ~ relation(X1)
    | X3 != relation_inverse_image(X1,X2)
    | ~ in(X4,X3)
    | in(esk1_4(X1,X2,X3,X4),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_23,plain,
    ( ~ in(X4,X3)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X4)),X2)
    | ~ relation(X2)
    | in(X1,relation_inverse_image(X2,X3)) ),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_15])]) ).

cnf(c_0_24,negated_conjecture,
    in(unordered_pair(singleton(esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0))),unordered_pair(esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0)),esk1_4(esk14_0,esk12_0,relation_inverse_image(esk14_0,esk12_0),esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0))))),esk14_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_25,plain,
    ( ~ in(X3,X1)
    | ~ subset(X1,X2)
    | in(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_26,negated_conjecture,
    subset(esk12_0,esk13_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_27,plain,
    ( ~ in(X3,relation_inverse_image(X1,X2))
    | ~ relation(X1)
    | in(esk1_4(X1,X2,relation_inverse_image(X1,X2),X3),X2) ),
    inference(er,[status(thm)],[c_0_22]) ).

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

cnf(c_0_29,negated_conjecture,
    ( ~ in(esk1_4(esk14_0,esk12_0,relation_inverse_image(esk14_0,esk12_0),esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0))),X1)
    | in(esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0)),relation_inverse_image(esk14_0,X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ in(X1,esk12_0)
    | in(X1,esk13_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    in(esk1_4(esk14_0,esk12_0,relation_inverse_image(esk14_0,esk12_0),esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0))),esk12_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_21])]) ).

cnf(c_0_32,negated_conjecture,
    ~ in(esk4_2(relation_inverse_image(esk14_0,esk12_0),relation_inverse_image(esk14_0,esk13_0)),relation_inverse_image(esk14_0,esk13_0)),
    inference(spm,[status(thm)],[c_0_16,c_0_28]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU211+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/5.38  % Computer : n026.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Mon Sep 21 06:01:12 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43  Running first-order theorem proving
% 0.15/5.43  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.15/5.58  % Version: 3.5.1
% 0.15/5.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58  % Starting new_bool_3 with 300s (1) cores
% 0.15/5.58  % Starting new_bool_1 with 300s (1) cores
% 0.15/5.58  % Starting sh5l with 300s (1) cores
% 0.15/5.58  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1517846 completed with status 0
% 0.15/5.58  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58  % No SInE strategy applied
% 0.15/5.58  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/5.58  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.58  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.15/5.58  % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 0.15/5.58  % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 0.15/5.58  % G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with pid 1517854 completed with status 0
% 0.15/5.58  % Result found by G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I
% 0.15/5.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.58  % No SInE strategy applied
% 0.15/5.58  % Search class: FGHSM-FFMM31-MFFFFFNN
% 0.15/5.58  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.58  % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.58  % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 0.15/5.58  % Preprocessing time       : 0.002 s
% 0.15/5.58  % Presaturation interreduction done
% 0.15/5.58  
% 0.15/5.58  % Proof found!
% 0.15/5.58  % SZS status Theorem
% 0.15/5.58  % SZS output start CNFRefutation
% See solution above
% 0.15/5.58  % Parsed axioms                        : 36
% 0.15/5.58  % Removed by relevancy pruning/SinE    : 0
% 0.15/5.58  % Initial clauses                      : 51
% 0.15/5.58  % Removed in clause preprocessing      : 8
% 0.15/5.58  % Initial clauses in saturation        : 43
% 0.15/5.58  % Processed clauses                    : 1389
% 0.15/5.58  % ...of these trivial                  : 44
% 0.15/5.58  % ...subsumed                          : 652
% 0.15/5.58  % ...remaining for further processing  : 693
% 0.15/5.58  % Other redundant clauses eliminated   : 3
% 0.15/5.58  % Clauses deleted for lack of memory   : 0
% 0.15/5.58  % Backward-subsumed                    : 54
% 0.15/5.58  % Backward-rewritten                   : 12
% 0.15/5.58  % Generated clauses                    : 4638
% 0.15/5.58  % ...of the previous two non-redundant : 4172
% 0.15/5.58  % ...aggressively subsumed             : 0
% 0.15/5.58  % Contextual simplify-reflections      : 0
% 0.15/5.58  % Paramodulations                      : 4631
% 0.15/5.58  % Factorizations                       : 4
% 0.15/5.58  % NegExts                              : 0
% 0.15/5.58  % Equation resolutions                 : 3
% 0.15/5.58  % Disequality decompositions           : 0
% 0.15/5.58  % Total rewrite steps                  : 576
% 0.15/5.58  % ...of those cached                   : 463
% 0.15/5.58  % Propositional unsat checks           : 0
% 0.15/5.58  %    Propositional check models        : 0
% 0.15/5.58  %    Propositional check unsatisfiable : 0
% 0.15/5.58  %    Propositional clauses             : 0
% 0.15/5.58  %    Propositional clauses after purity: 0
% 0.15/5.58  %    Propositional unsat core size     : 0
% 0.15/5.58  %    Propositional preprocessing time  : 0.000
% 0.15/5.58  %    Propositional encoding time       : 0.000
% 0.15/5.58  %    Propositional solver time         : 0.000
% 0.15/5.58  %    Success case prop preproc time    : 0.000
% 0.15/5.58  %    Success case prop encoding time   : 0.000
% 0.15/5.58  %    Success case prop solver time     : 0.000
% 0.15/5.58  % Current number of processed clauses  : 583
% 0.15/5.58  %    Positive orientable unit clauses  : 130
% 0.15/5.58  %    Positive unorientable unit clauses: 1
% 0.15/5.58  %    Negative unit clauses             : 120
% 0.15/5.58  %    Non-unit-clauses                  : 332
% 0.15/5.58  % Current number of unprocessed clauses: 2808
% 0.15/5.58  % ...number of literals in the above   : 9092
% 0.15/5.58  % Current number of archived formulas  : 0
% 0.15/5.58  % Current number of archived clauses   : 108
% 0.15/5.58  % Clause-clause subsumption calls (NU) : 22386
% 0.15/5.58  % Rec. Clause-clause subsumption calls : 18351
% 0.15/5.58  % Non-unit clause-clause subsumptions  : 448
% 0.15/5.58  % Unit Clause-clause subsumption calls : 3699
% 0.15/5.58  % Rewrite failures with RHS unbound    : 0
% 0.15/5.58  % BW rewrite match attempts            : 191
% 0.15/5.58  % BW rewrite match successes           : 15
% 0.15/5.58  % Condensation attempts                : 0
% 0.15/5.58  % Condensation successes               : 0
% 0.15/5.58  % Termbank termtop insertions          : 67046
% 0.15/5.58  % Search garbage collected termcells   : 542
% 0.15/5.58  
% 0.15/5.58  % -------------------------------------------------
% 0.15/5.58  % User time                : 0.124 s
% 0.15/5.58  % System time              : 0.010 s
% 0.15/5.58  % Total time               : 0.134 s
% 0.15/5.58  % Maximum resident set size: 3400 pages
% 0.15/5.58  
% 0.15/5.58  % -------------------------------------------------
% 0.15/5.58  % User time                : 0.621 s
% 0.15/5.58  % System time              : 0.038 s
% 0.15/5.58  % Total time               : 0.660 s
% 0.15/5.58  % Maximum resident set size: 4608 pages
% 0.15/5.58  % E exiting
%------------------------------------------------------------------------------