TSTP Solution File: SWB040+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWB040+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:38:39 EDT 2023

% Result   : Theorem 7.30s 1.60s
% Output   : CNFRefutation 7.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (  12 unt;   0 def)
%            Number of atoms       :  102 (   0 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  111 (  41   ~;  40   |;  21   &)
%                                         (   3 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   46 (   1 sgn;  27   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_bool_complementof_class,axiom,
    ! [X11,X5] :
      ( iext(uri_owl_complementOf,X11,X5)
     => ( ic(X11)
        & ic(X5)
        & ! [X4] :
            ( icext(X11,X4)
          <=> ~ icext(X5,X4) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p',owl_bool_complementof_class) ).

fof(owl_prop_complementof_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_complementOf,X4,X7)
     => ( ic(X4)
        & ic(X7) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p',owl_prop_complementof_ext) ).

fof(owl_rdfsext_subclassof,axiom,
    ! [X13,X15] :
      ( iext(uri_rdfs_subClassOf,X13,X15)
    <=> ( ic(X13)
        & ic(X15)
        & ! [X4] :
            ( icext(X13,X4)
           => icext(X15,X4) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p',owl_rdfsext_subclassof) ).

fof(premise_rdfbased_sem_bool_tollens,axiom,
    ( iext(uri_owl_complementOf,uri_ex_n2,uri_ex_c2)
    & iext(uri_owl_complementOf,uri_ex_n1,uri_ex_c1)
    & iext(uri_rdfs_subClassOf,uri_ex_c1,uri_ex_c2) ),
    file('/export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p',premise_rdfbased_sem_bool_tollens) ).

fof(rdfs_subclassof_main,axiom,
    ! [X5,X6] :
      ( iext(uri_rdfs_subClassOf,X5,X6)
     => ( ic(X5)
        & ic(X6)
        & ! [X4] :
            ( icext(X5,X4)
           => icext(X6,X4) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p',rdfs_subclassof_main) ).

fof(conclusion_rdfbased_sem_bool_tollens,conjecture,
    iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    file('/export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p',conclusion_rdfbased_sem_bool_tollens) ).

fof(c_0_6,plain,
    ! [X11,X5] :
      ( iext(uri_owl_complementOf,X11,X5)
     => ( ic(X11)
        & ic(X5)
        & ! [X4] :
            ( icext(X11,X4)
          <=> ~ icext(X5,X4) ) ) ),
    inference(fof_simplification,[status(thm)],[owl_bool_complementof_class]) ).

fof(c_0_7,plain,
    ! [X252,X253,X254] :
      ( ( ic(X252)
        | ~ iext(uri_owl_complementOf,X252,X253) )
      & ( ic(X253)
        | ~ iext(uri_owl_complementOf,X252,X253) )
      & ( ~ icext(X252,X254)
        | ~ icext(X253,X254)
        | ~ iext(uri_owl_complementOf,X252,X253) )
      & ( icext(X253,X254)
        | icext(X252,X254)
        | ~ iext(uri_owl_complementOf,X252,X253) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

fof(c_0_8,plain,
    ! [X164,X165] :
      ( ( ic(X164)
        | ~ iext(uri_owl_complementOf,X164,X165) )
      & ( ic(X165)
        | ~ iext(uri_owl_complementOf,X164,X165) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_complementof_ext])])]) ).

fof(c_0_9,plain,
    ! [X767,X768,X769,X770,X771] :
      ( ( ic(X767)
        | ~ iext(uri_rdfs_subClassOf,X767,X768) )
      & ( ic(X768)
        | ~ iext(uri_rdfs_subClassOf,X767,X768) )
      & ( ~ icext(X767,X769)
        | icext(X768,X769)
        | ~ iext(uri_rdfs_subClassOf,X767,X768) )
      & ( icext(X770,esk109_2(X770,X771))
        | ~ ic(X770)
        | ~ ic(X771)
        | iext(uri_rdfs_subClassOf,X770,X771) )
      & ( ~ icext(X771,esk109_2(X770,X771))
        | ~ ic(X770)
        | ~ ic(X771)
        | iext(uri_rdfs_subClassOf,X770,X771) ) ),
    inference(distribute,[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)],[owl_rdfsext_subclassof])])])])])]) ).

cnf(c_0_10,plain,
    ( icext(X1,X2)
    | icext(X3,X2)
    | ~ iext(uri_owl_complementOf,X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    iext(uri_owl_complementOf,uri_ex_n1,uri_ex_c1),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_bool_tollens]) ).

cnf(c_0_12,plain,
    ( ic(X1)
    | ~ iext(uri_owl_complementOf,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_13,plain,
    ! [X64,X65,X66] :
      ( ( ic(X64)
        | ~ iext(uri_rdfs_subClassOf,X64,X65) )
      & ( ic(X65)
        | ~ iext(uri_rdfs_subClassOf,X64,X65) )
      & ( ~ icext(X64,X66)
        | icext(X65,X66)
        | ~ iext(uri_rdfs_subClassOf,X64,X65) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_subclassof_main])])])]) ).

fof(c_0_14,negated_conjecture,
    ~ iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_bool_tollens])]) ).

cnf(c_0_15,plain,
    ( iext(uri_rdfs_subClassOf,X2,X1)
    | ~ icext(X1,esk109_2(X2,X1))
    | ~ ic(X2)
    | ~ ic(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    ( icext(uri_ex_n1,X1)
    | icext(uri_ex_c1,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    ic(uri_ex_n1),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_18,plain,
    iext(uri_owl_complementOf,uri_ex_n2,uri_ex_c2),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_bool_tollens]) ).

cnf(c_0_19,plain,
    ( icext(X3,X2)
    | ~ icext(X1,X2)
    | ~ iext(uri_rdfs_subClassOf,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    iext(uri_rdfs_subClassOf,uri_ex_c1,uri_ex_c2),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_bool_tollens]) ).

cnf(c_0_21,negated_conjecture,
    ~ iext(uri_rdfs_subClassOf,uri_ex_n2,uri_ex_n1),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( icext(uri_ex_c1,esk109_2(X1,uri_ex_n1))
    | iext(uri_rdfs_subClassOf,X1,uri_ex_n1)
    | ~ ic(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).

cnf(c_0_23,plain,
    ic(uri_ex_n2),
    inference(spm,[status(thm)],[c_0_12,c_0_18]) ).

cnf(c_0_24,plain,
    ( ~ icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_owl_complementOf,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_25,plain,
    ( icext(uri_ex_c2,X1)
    | ~ icext(uri_ex_c1,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,negated_conjecture,
    icext(uri_ex_c1,esk109_2(uri_ex_n2,uri_ex_n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).

cnf(c_0_27,plain,
    ( icext(X1,esk109_2(X1,X2))
    | iext(uri_rdfs_subClassOf,X1,X2)
    | ~ ic(X1)
    | ~ ic(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_28,plain,
    ( ~ icext(uri_ex_c2,X1)
    | ~ icext(uri_ex_n2,X1) ),
    inference(spm,[status(thm)],[c_0_24,c_0_18]) ).

cnf(c_0_29,negated_conjecture,
    icext(uri_ex_c2,esk109_2(uri_ex_n2,uri_ex_n1)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    icext(uri_ex_n2,esk109_2(uri_ex_n2,uri_ex_n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_17]),c_0_23])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : SWB040+1 : TPTP v8.1.2. Released v5.2.0.
% 0.13/0.16  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n013.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 2400
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon Oct  2 20:22:14 EDT 2023
% 0.16/0.38  % CPUTime    : 
% 0.23/0.57  Running first-order model finding
% 0.23/0.57  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.8iOouuUnpE/E---3.1_22166.p
% 7.30/1.60  # Version: 3.1pre001
% 7.30/1.60  # Preprocessing class: FSLMSMSLSSSNFFN.
% 7.30/1.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.30/1.60  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 7.30/1.60  # Starting new_bool_3 with 600s (2) cores
% 7.30/1.60  # Starting new_bool_1 with 600s (2) cores
% 7.30/1.60  # Starting sh5l with 300s (1) cores
% 7.30/1.60  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 22243 completed with status 0
% 7.30/1.60  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 7.30/1.60  # Preprocessing class: FSLMSMSLSSSNFFN.
% 7.30/1.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.30/1.60  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 7.30/1.60  # No SInE strategy applied
% 7.30/1.60  # Search class: FGHSM-SMLM33-SFFFFFNN
% 7.30/1.60  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 7.30/1.60  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 7.30/1.60  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 7.30/1.60  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 7.30/1.60  # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 7.30/1.60  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 22259 completed with status 0
% 7.30/1.60  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 7.30/1.60  # Preprocessing class: FSLMSMSLSSSNFFN.
% 7.30/1.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.30/1.60  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 7.30/1.60  # No SInE strategy applied
% 7.30/1.60  # Search class: FGHSM-SMLM33-SFFFFFNN
% 7.30/1.60  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 7.30/1.60  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 7.30/1.60  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 7.30/1.60  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 7.30/1.60  # Preprocessing time       : 0.014 s
% 7.30/1.60  
% 7.30/1.60  # Proof found!
% 7.30/1.60  # SZS status Theorem
% 7.30/1.60  # SZS output start CNFRefutation
% See solution above
% 7.30/1.60  # Parsed axioms                        : 560
% 7.30/1.60  # Removed by relevancy pruning/SinE    : 0
% 7.30/1.60  # Initial clauses                      : 1270
% 7.30/1.60  # Removed in clause preprocessing      : 111
% 7.30/1.60  # Initial clauses in saturation        : 1159
% 7.30/1.60  # Processed clauses                    : 10573
% 7.30/1.60  # ...of these trivial                  : 1548
% 7.30/1.60  # ...subsumed                          : 3857
% 7.30/1.60  # ...remaining for further processing  : 5168
% 7.30/1.60  # Other redundant clauses eliminated   : 16
% 7.30/1.60  # Clauses deleted for lack of memory   : 0
% 7.30/1.60  # Backward-subsumed                    : 39
% 7.30/1.60  # Backward-rewritten                   : 32
% 7.30/1.60  # Generated clauses                    : 29152
% 7.30/1.60  # ...of the previous two non-redundant : 22461
% 7.30/1.60  # ...aggressively subsumed             : 0
% 7.30/1.60  # Contextual simplify-reflections      : 42
% 7.30/1.60  # Paramodulations                      : 29134
% 7.30/1.60  # Factorizations                       : 2
% 7.30/1.60  # NegExts                              : 0
% 7.30/1.60  # Equation resolutions                 : 16
% 7.30/1.60  # Total rewrite steps                  : 21706
% 7.30/1.60  # Propositional unsat checks           : 0
% 7.30/1.60  #    Propositional check models        : 0
% 7.30/1.60  #    Propositional check unsatisfiable : 0
% 7.30/1.60  #    Propositional clauses             : 0
% 7.30/1.60  #    Propositional clauses after purity: 0
% 7.30/1.60  #    Propositional unsat core size     : 0
% 7.30/1.60  #    Propositional preprocessing time  : 0.000
% 7.30/1.60  #    Propositional encoding time       : 0.000
% 7.30/1.60  #    Propositional solver time         : 0.000
% 7.30/1.60  #    Success case prop preproc time    : 0.000
% 7.30/1.60  #    Success case prop encoding time   : 0.000
% 7.30/1.60  #    Success case prop solver time     : 0.000
% 7.30/1.60  # Current number of processed clauses  : 5081
% 7.30/1.60  #    Positive orientable unit clauses  : 2279
% 7.30/1.60  #    Positive unorientable unit clauses: 0
% 7.30/1.60  #    Negative unit clauses             : 9
% 7.30/1.60  #    Non-unit-clauses                  : 2793
% 7.30/1.60  # Current number of unprocessed clauses: 13037
% 7.30/1.60  # ...number of literals in the above   : 61946
% 7.30/1.60  # Current number of archived formulas  : 0
% 7.30/1.60  # Current number of archived clauses   : 72
% 7.30/1.60  # Clause-clause subsumption calls (NU) : 1582623
% 7.30/1.60  # Rec. Clause-clause subsumption calls : 847865
% 7.30/1.60  # Non-unit clause-clause subsumptions  : 3917
% 7.30/1.60  # Unit Clause-clause subsumption calls : 411834
% 7.30/1.60  # Rewrite failures with RHS unbound    : 0
% 7.30/1.60  # BW rewrite match attempts            : 1571
% 7.30/1.60  # BW rewrite match successes           : 1
% 7.30/1.60  # Condensation attempts                : 0
% 7.30/1.60  # Condensation successes               : 0
% 7.30/1.60  # Termbank termtop insertions          : 486676
% 7.30/1.60  
% 7.30/1.60  # -------------------------------------------------
% 7.30/1.60  # User time                : 0.884 s
% 7.30/1.60  # System time              : 0.025 s
% 7.30/1.60  # Total time               : 0.909 s
% 7.30/1.60  # Maximum resident set size: 5740 pages
% 7.30/1.60  
% 7.30/1.60  # -------------------------------------------------
% 7.30/1.60  # User time                : 2.473 s
% 7.30/1.60  # System time              : 0.085 s
% 7.30/1.60  # Total time               : 2.558 s
% 7.30/1.60  # Maximum resident set size: 2232 pages
% 7.30/1.60  % E---3.1 exiting
%------------------------------------------------------------------------------