↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.09s 0.46s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (   6 unt;   0 def)
%            Number of atoms       :  102 (  12 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   99 (  30   ~;  50   |;  10   &)
%                                         (   6 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   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-2 aty)
%            Number of variables   :   65 (   4 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th18,conjecture,
    ! [X1,X2,X3] :
      ( ! [X4] :
          ( member(X4,X1)
        <=> ( member(X4,X3)
            | member(X4,X2) ) )
     => X1 = union(X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th18) ).

fof(union_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X2)
        | member(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).

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

fof(equal_member_defn,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ! [X3] :
          ( member(X3,X1)
        <=> member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ! [X4] :
            ( member(X4,X1)
          <=> ( member(X4,X3)
              | member(X4,X2) ) )
       => X1 = union(X2,X3) ),
    inference(assume_negation,[status(cth)],[prove_th18]) ).

fof(c_0_5,plain,
    ! [X5,X6,X7] :
      ( ( member(X7,union(X5,X6))
        | ~ member(X7,X6) )
      & ( member(X7,union(X5,X6))
        | ~ member(X7,X5) )
      & ( member(X7,X6)
        | member(X7,X5)
        | ~ member(X7,union(X5,X6)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).

fof(c_0_6,plain,
    ! [X12,X13,X14,X15,X16] :
      ( ( subset(X15,X16)
        | ~ member(esk1_2(X15,X16),X16) )
      & ( subset(X15,X16)
        | member(esk1_2(X15,X16),X15) )
      & ( member(X14,X13)
        | ~ member(X14,X12)
        | ~ subset(X12,X13) ) ),
    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)],[subset_defn])])])])])])]) ).

fof(c_0_7,negated_conjecture,
    ! [X29] :
      ( esk3_0 != union(esk4_0,esk5_0)
      & ( member(X29,esk3_0)
        | ~ member(X29,esk5_0) )
      & ( member(X29,esk3_0)
        | ~ member(X29,esk4_0) )
      & ( member(X29,esk5_0)
        | member(X29,esk4_0)
        | ~ member(X29,esk3_0) ) ),
    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)],[c_0_4])])])])])]) ).

cnf(c_0_8,plain,
    ( ~ member(X1,union(X2,X3))
    | member(X1,X3)
    | member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ member(X1,esk5_0)
    | member(X1,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( member(esk1_2(union(X1,X2),X3),X2)
    | member(esk1_2(union(X1,X2),X3),X1)
    | subset(union(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    ( ~ member(esk1_2(X1,X2),X2)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    ( member(esk1_2(union(X1,esk5_0),X2),X1)
    | member(esk1_2(union(X1,esk5_0),X2),esk3_0)
    | subset(union(X1,esk5_0),X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ member(X1,esk4_0)
    | member(X1,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,negated_conjecture,
    ( member(esk1_2(union(X1,esk5_0),esk3_0),X1)
    | subset(union(X1,esk5_0),esk3_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_16,plain,
    ! [X19,X20,X21,X22,X23,X24] :
      ( ( X23 = X24
        | member(esk2_2(X23,X24),X24)
        | member(esk2_2(X23,X24),X23) )
      & ( X23 = X24
        | ~ member(esk2_2(X23,X24),X24)
        | ~ member(esk2_2(X23,X24),X23) )
      & ( X19 != X20
        | member(X22,X19)
        | ~ member(X22,X20) )
      & ( X19 != X20
        | member(X21,X20)
        | ~ member(X21,X19) ) ),
    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)],[equal_member_defn])])])])])])]) ).

cnf(c_0_17,plain,
    ( ~ member(X3,X1)
    | ~ subset(X1,X2)
    | member(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,negated_conjecture,
    subset(union(esk4_0,esk5_0),esk3_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ member(X1,esk3_0)
    | member(X1,esk5_0)
    | member(X1,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,plain,
    ( X1 = X2
    | member(esk2_2(X1,X2),X2)
    | member(esk2_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( ~ member(X1,union(esk4_0,esk5_0))
    | member(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( member(esk2_2(esk3_0,X1),X1)
    | member(esk2_2(esk3_0,X1),esk4_0)
    | member(esk2_2(esk3_0,X1),esk5_0)
    | esk3_0 = X1 ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    esk3_0 != union(esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_24,negated_conjecture,
    member(esk2_2(esk3_0,union(esk4_0,esk5_0)),esk3_0),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_14]),c_0_10]) ).

cnf(c_0_25,plain,
    ( ~ member(X1,X2)
    | member(X1,union(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_26,negated_conjecture,
    ( member(esk2_2(esk3_0,union(esk4_0,esk5_0)),esk4_0)
    | member(esk2_2(esk3_0,union(esk4_0,esk5_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_24]) ).

cnf(c_0_27,plain,
    ( ~ member(esk2_2(X1,X2),X2)
    | ~ member(esk2_2(X1,X2),X1)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_28,negated_conjecture,
    ( member(esk2_2(esk3_0,union(esk4_0,esk5_0)),esk4_0)
    | member(esk2_2(esk3_0,union(esk4_0,esk5_0)),union(X1,esk5_0)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_29,plain,
    ( ~ member(X1,X2)
    | member(X1,union(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_30,negated_conjecture,
    member(esk2_2(esk3_0,union(esk4_0,esk5_0)),esk4_0),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_24])]),c_0_23]) ).

cnf(c_0_31,negated_conjecture,
    member(esk2_2(esk3_0,union(esk4_0,esk5_0)),union(esk4_0,X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_31]),c_0_24])]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET577+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.09/0.36  % Computer : n001.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:32:30 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.09/0.46  % Version: 3.5.1
% 0.09/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46  % Starting sh5l with 300s (1) cores
% 0.09/0.46  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2282097 completed with status 0
% 0.09/0.46  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46  % No SInE strategy applied
% 0.09/0.46  % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.09/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.46  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.09/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.09/0.46  % new_bool_1 with pid 2282105 completed with status 0
% 0.09/0.46  % Result found by new_bool_1
% 0.09/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.46  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46  % No SInE strategy applied
% 0.09/0.46  % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.09/0.46  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46  % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.46  % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.46  % Starting new_bool_3 with 136s (1) cores
% 0.09/0.46  % Starting new_bool_1 with 136s (1) cores
% 0.09/0.46  % Preprocessing time       : 0.001 s
% 0.09/0.46  % Presaturation interreduction done
% 0.09/0.46  
% 0.09/0.46  % Proof found!
% 0.09/0.46  % SZS status Theorem
% 0.09/0.46  % SZS output start CNFRefutation
% See solution above
% 0.09/0.46  % Parsed axioms                        : 7
% 0.09/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.09/0.46  % Initial clauses                      : 19
% 0.09/0.46  % Removed in clause preprocessing      : 2
% 0.09/0.46  % Initial clauses in saturation        : 17
% 0.09/0.46  % Processed clauses                    : 811
% 0.09/0.46  % ...of these trivial                  : 24
% 0.09/0.46  % ...subsumed                          : 542
% 0.09/0.46  % ...remaining for further processing  : 245
% 0.09/0.46  % Other redundant clauses eliminated   : 2
% 0.09/0.46  % Clauses deleted for lack of memory   : 0
% 0.09/0.46  % Backward-subsumed                    : 2
% 0.09/0.46  % Backward-rewritten                   : 7
% 0.09/0.46  % Generated clauses                    : 2847
% 0.09/0.46  % ...of the previous two non-redundant : 2668
% 0.09/0.46  % ...aggressively subsumed             : 0
% 0.09/0.46  % Contextual simplify-reflections      : 7
% 0.09/0.46  % Paramodulations                      : 2777
% 0.09/0.46  % Factorizations                       : 68
% 0.09/0.46  % NegExts                              : 0
% 0.09/0.46  % Equation resolutions                 : 2
% 0.09/0.46  % Disequality decompositions           : 0
% 0.09/0.46  % Total rewrite steps                  : 327
% 0.09/0.46  % ...of those cached                   : 264
% 0.09/0.46  % Propositional unsat checks           : 0
% 0.09/0.46  %    Propositional check models        : 0
% 0.09/0.46  %    Propositional check unsatisfiable : 0
% 0.09/0.46  %    Propositional clauses             : 0
% 0.09/0.46  %    Propositional clauses after purity: 0
% 0.09/0.46  %    Propositional unsat core size     : 0
% 0.09/0.46  %    Propositional preprocessing time  : 0.000
% 0.09/0.46  %    Propositional encoding time       : 0.000
% 0.09/0.46  %    Propositional solver time         : 0.000
% 0.09/0.46  %    Success case prop preproc time    : 0.000
% 0.09/0.46  %    Success case prop encoding time   : 0.000
% 0.09/0.46  %    Success case prop solver time     : 0.000
% 0.09/0.46  % Current number of processed clauses  : 219
% 0.09/0.46  %    Positive orientable unit clauses  : 33
% 0.09/0.46  %    Positive unorientable unit clauses: 1
% 0.09/0.46  %    Negative unit clauses             : 2
% 0.09/0.46  %    Non-unit-clauses                  : 183
% 0.09/0.46  % Current number of unprocessed clauses: 1870
% 0.09/0.46  % ...number of literals in the above   : 4952
% 0.09/0.46  % Current number of archived formulas  : 0
% 0.09/0.46  % Current number of archived clauses   : 24
% 0.09/0.46  % Clause-clause subsumption calls (NU) : 12182
% 0.09/0.46  % Rec. Clause-clause subsumption calls : 10481
% 0.09/0.46  % Non-unit clause-clause subsumptions  : 551
% 0.09/0.46  % Unit Clause-clause subsumption calls : 584
% 0.09/0.46  % Rewrite failures with RHS unbound    : 0
% 0.09/0.46  % BW rewrite match attempts            : 62
% 0.09/0.46  % BW rewrite match successes           : 10
% 0.09/0.46  % Condensation attempts                : 0
% 0.09/0.46  % Condensation successes               : 0
% 0.09/0.46  % Termbank termtop insertions          : 36781
% 0.09/0.46  % Search garbage collected termcells   : 355
% 0.09/0.46  
% 0.09/0.46  % -------------------------------------------------
% 0.09/0.46  % User time                : 0.026 s
% 0.09/0.46  % System time              : 0.007 s
% 0.09/0.46  % Total time               : 0.033 s
% 0.09/0.46  % Maximum resident set size: 3580 pages
% 0.09/0.46  
% 0.09/0.46  % -------------------------------------------------
% 0.09/0.46  % User time                : 0.140 s
% 0.09/0.46  % System time              : 0.033 s
% 0.09/0.46  % Total time               : 0.172 s
% 0.09/0.46  % Maximum resident set size: 4608 pages
% 0.09/0.46  % E exiting
%------------------------------------------------------------------------------