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

View Problem - Process Solution

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

% Computer : n011.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:41 EDT 2023

% Result   : Theorem 11.74s 2.03s
% Output   : CNFRefutation 11.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   40 (  19 unt;   0 def)
%            Number of atoms       :  133 (  18 equ)
%            Maximal formula atoms :   26 (   3 avg)
%            Number of connectives :  153 (  60   ~;  59   |;  28   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   15 (  15 usr;  13 con; 0-3 aty)
%            Number of variables   :   52 (   1 sgn;  25   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_enum_class_001,axiom,
    ! [X11,X12,X21] :
      ( ( iext(uri_rdf_first,X12,X21)
        & iext(uri_rdf_rest,X12,uri_rdf_nil) )
     => ( iext(uri_owl_oneOf,X11,X12)
      <=> ( ic(X11)
          & ! [X4] :
              ( icext(X11,X4)
            <=> X4 = X21 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.iEQTzjORql/E---3.1_30927.p',owl_enum_class_001) ).

fof(premise_rdfbased_sem_eqdis_disclass_ext,axiom,
    ? [X37,X42] :
      ( iext(uri_owl_oneOf,uri_ex_c2,X42)
      & iext(uri_rdf_first,X37,uri_ex_x)
      & iext(uri_rdf_rest,X37,uri_rdf_nil)
      & iext(uri_owl_differentFrom,uri_ex_x,uri_ex_y)
      & iext(uri_owl_oneOf,uri_ex_c1,X37)
      & iext(uri_rdf_first,X42,uri_ex_y)
      & iext(uri_rdf_rest,X42,uri_rdf_nil) ),
    file('/export/starexec/sandbox2/tmp/tmp.iEQTzjORql/E---3.1_30927.p',premise_rdfbased_sem_eqdis_disclass_ext) ).

fof(owl_prop_oneof_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_oneOf,X4,X7)
     => ( ic(X4)
        & icext(uri_rdf_List,X7) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.iEQTzjORql/E---3.1_30927.p',owl_prop_oneof_ext) ).

fof(conclusion_rdfbased_sem_eqdis_disclass_ext,conjecture,
    iext(uri_owl_disjointWith,uri_ex_c1,uri_ex_c2),
    file('/export/starexec/sandbox2/tmp/tmp.iEQTzjORql/E---3.1_30927.p',conclusion_rdfbased_sem_eqdis_disclass_ext) ).

fof(owl_eqdis_disjointwith,axiom,
    ! [X13,X15] :
      ( iext(uri_owl_disjointWith,X13,X15)
    <=> ( ic(X13)
        & ic(X15)
        & ! [X4] :
            ~ ( icext(X13,X4)
              & icext(X15,X4) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.iEQTzjORql/E---3.1_30927.p',owl_eqdis_disjointwith) ).

fof(owl_eqdis_differentfrom,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_differentFrom,X4,X7)
    <=> X4 != X7 ),
    file('/export/starexec/sandbox2/tmp/tmp.iEQTzjORql/E---3.1_30927.p',owl_eqdis_differentfrom) ).

fof(c_0_6,plain,
    ! [X350,X351,X352,X353,X354] :
      ( ( ic(X350)
        | ~ iext(uri_owl_oneOf,X350,X351)
        | ~ iext(uri_rdf_first,X351,X352)
        | ~ iext(uri_rdf_rest,X351,uri_rdf_nil) )
      & ( ~ icext(X350,X353)
        | X353 = X352
        | ~ iext(uri_owl_oneOf,X350,X351)
        | ~ iext(uri_rdf_first,X351,X352)
        | ~ iext(uri_rdf_rest,X351,uri_rdf_nil) )
      & ( X354 != X352
        | icext(X350,X354)
        | ~ iext(uri_owl_oneOf,X350,X351)
        | ~ iext(uri_rdf_first,X351,X352)
        | ~ iext(uri_rdf_rest,X351,uri_rdf_nil) )
      & ( ~ icext(X350,esk11_3(X350,X351,X352))
        | esk11_3(X350,X351,X352) != X352
        | ~ ic(X350)
        | iext(uri_owl_oneOf,X350,X351)
        | ~ iext(uri_rdf_first,X351,X352)
        | ~ iext(uri_rdf_rest,X351,uri_rdf_nil) )
      & ( icext(X350,esk11_3(X350,X351,X352))
        | esk11_3(X350,X351,X352) = X352
        | ~ ic(X350)
        | iext(uri_owl_oneOf,X350,X351)
        | ~ iext(uri_rdf_first,X351,X352)
        | ~ iext(uri_rdf_rest,X351,uri_rdf_nil) ) ),
    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_enum_class_001])])])])])]) ).

fof(c_0_7,plain,
    ( iext(uri_owl_oneOf,uri_ex_c2,esk193_0)
    & iext(uri_rdf_first,esk192_0,uri_ex_x)
    & iext(uri_rdf_rest,esk192_0,uri_rdf_nil)
    & iext(uri_owl_differentFrom,uri_ex_x,uri_ex_y)
    & iext(uri_owl_oneOf,uri_ex_c1,esk192_0)
    & iext(uri_rdf_first,esk193_0,uri_ex_y)
    & iext(uri_rdf_rest,esk193_0,uri_rdf_nil) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[premise_rdfbased_sem_eqdis_disclass_ext])]) ).

cnf(c_0_8,plain,
    ( X2 = X3
    | ~ icext(X1,X2)
    | ~ iext(uri_owl_oneOf,X1,X4)
    | ~ iext(uri_rdf_first,X4,X3)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    iext(uri_rdf_rest,esk193_0,uri_rdf_nil),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_10,plain,
    ! [X217,X218] :
      ( ( ic(X217)
        | ~ iext(uri_owl_oneOf,X217,X218) )
      & ( icext(uri_rdf_List,X218)
        | ~ iext(uri_owl_oneOf,X217,X218) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_oneof_ext])])]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | ~ icext(X3,X1)
    | ~ iext(uri_rdf_first,esk193_0,X2)
    | ~ iext(uri_owl_oneOf,X3,esk193_0) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    iext(uri_rdf_first,esk193_0,uri_ex_y),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_13,negated_conjecture,
    ~ iext(uri_owl_disjointWith,uri_ex_c1,uri_ex_c2),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_eqdis_disclass_ext])]) ).

fof(c_0_14,plain,
    ! [X809,X810,X811,X812,X813] :
      ( ( ic(X809)
        | ~ iext(uri_owl_disjointWith,X809,X810) )
      & ( ic(X810)
        | ~ iext(uri_owl_disjointWith,X809,X810) )
      & ( ~ icext(X809,X811)
        | ~ icext(X810,X811)
        | ~ iext(uri_owl_disjointWith,X809,X810) )
      & ( icext(X812,esk115_2(X812,X813))
        | ~ ic(X812)
        | ~ ic(X813)
        | iext(uri_owl_disjointWith,X812,X813) )
      & ( icext(X813,esk115_2(X812,X813))
        | ~ ic(X812)
        | ~ ic(X813)
        | iext(uri_owl_disjointWith,X812,X813) ) ),
    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_eqdis_disjointwith])])])])])]) ).

cnf(c_0_15,plain,
    ( ic(X1)
    | ~ iext(uri_owl_oneOf,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    iext(uri_owl_oneOf,uri_ex_c1,esk192_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,plain,
    iext(uri_owl_oneOf,uri_ex_c2,esk193_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,plain,
    iext(uri_rdf_rest,esk192_0,uri_rdf_nil),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,plain,
    ( X1 = uri_ex_y
    | ~ icext(X2,X1)
    | ~ iext(uri_owl_oneOf,X2,esk193_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_20,negated_conjecture,
    ~ iext(uri_owl_disjointWith,uri_ex_c1,uri_ex_c2),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,plain,
    ( icext(X1,esk115_2(X2,X1))
    | iext(uri_owl_disjointWith,X2,X1)
    | ~ ic(X2)
    | ~ ic(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ic(uri_ex_c1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_23,plain,
    ic(uri_ex_c2),
    inference(spm,[status(thm)],[c_0_15,c_0_17]) ).

cnf(c_0_24,plain,
    ( X1 = X2
    | ~ icext(X3,X1)
    | ~ iext(uri_rdf_first,esk192_0,X2)
    | ~ iext(uri_owl_oneOf,X3,esk192_0) ),
    inference(spm,[status(thm)],[c_0_8,c_0_18]) ).

cnf(c_0_25,plain,
    iext(uri_rdf_first,esk192_0,uri_ex_x),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_26,plain,
    ( icext(X1,esk115_2(X1,X2))
    | iext(uri_owl_disjointWith,X1,X2)
    | ~ ic(X1)
    | ~ ic(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_27,plain,
    ( X1 = uri_ex_y
    | ~ icext(uri_ex_c2,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_28,negated_conjecture,
    icext(uri_ex_c2,esk115_2(uri_ex_c1,uri_ex_c2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).

cnf(c_0_29,plain,
    ( X1 = uri_ex_x
    | ~ icext(X2,X1)
    | ~ iext(uri_owl_oneOf,X2,esk192_0) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,negated_conjecture,
    icext(uri_ex_c1,esk115_2(uri_ex_c1,uri_ex_c2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_23]),c_0_22])]) ).

cnf(c_0_31,negated_conjecture,
    esk115_2(uri_ex_c1,uri_ex_c2) = uri_ex_y,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

fof(c_0_32,plain,
    ! [X782,X783] :
      ( ( ~ iext(uri_owl_differentFrom,X782,X783)
        | X782 != X783 )
      & ( X782 = X783
        | iext(uri_owl_differentFrom,X782,X783) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_differentfrom])]) ).

cnf(c_0_33,plain,
    ( X1 = uri_ex_x
    | ~ icext(uri_ex_c1,X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_16]) ).

cnf(c_0_34,negated_conjecture,
    icext(uri_ex_c1,uri_ex_y),
    inference(rw,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,plain,
    ( ~ iext(uri_owl_differentFrom,X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_36,plain,
    iext(uri_owl_differentFrom,uri_ex_x,uri_ex_y),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_37,negated_conjecture,
    uri_ex_y = uri_ex_x,
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    ~ iext(uri_owl_differentFrom,X1,X1),
    inference(er,[status(thm)],[c_0_35]) ).

cnf(c_0_39,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWB058+1 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 20:21:08 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.19/0.52  Running first-order model finding
% 0.19/0.52  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.iEQTzjORql/E---3.1_30927.p
% 11.74/2.03  # Version: 3.1pre001
% 11.74/2.03  # Preprocessing class: FSLMSMSLSSSNFFN.
% 11.74/2.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.74/2.03  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.74/2.03  # Starting new_bool_3 with 600s (2) cores
% 11.74/2.03  # Starting new_bool_1 with 600s (2) cores
% 11.74/2.03  # Starting sh5l with 300s (1) cores
% 11.74/2.03  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 31063 completed with status 0
% 11.74/2.03  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.74/2.03  # Preprocessing class: FSLMSMSLSSSNFFN.
% 11.74/2.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.74/2.03  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.74/2.03  # No SInE strategy applied
% 11.74/2.03  # Search class: FGHSM-SMLM33-SFFFFFNN
% 11.74/2.03  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 11.74/2.03  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 11.74/2.03  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 11.74/2.03  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 11.74/2.03  # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 11.74/2.03  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 31081 completed with status 0
% 11.74/2.03  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.74/2.03  # Preprocessing class: FSLMSMSLSSSNFFN.
% 11.74/2.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.74/2.03  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.74/2.03  # No SInE strategy applied
% 11.74/2.03  # Search class: FGHSM-SMLM33-SFFFFFNN
% 11.74/2.03  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 11.74/2.03  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 11.74/2.03  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 11.74/2.03  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 11.74/2.03  # Preprocessing time       : 0.017 s
% 11.74/2.03  
% 11.74/2.03  # Proof found!
% 11.74/2.03  # SZS status Theorem
% 11.74/2.03  # SZS output start CNFRefutation
% See solution above
% 11.74/2.03  # Parsed axioms                        : 560
% 11.74/2.03  # Removed by relevancy pruning/SinE    : 0
% 11.74/2.03  # Initial clauses                      : 1274
% 11.74/2.03  # Removed in clause preprocessing      : 111
% 11.74/2.03  # Initial clauses in saturation        : 1163
% 11.74/2.03  # Processed clauses                    : 17547
% 11.74/2.03  # ...of these trivial                  : 1667
% 11.74/2.03  # ...subsumed                          : 7856
% 11.74/2.03  # ...remaining for further processing  : 8024
% 11.74/2.03  # Other redundant clauses eliminated   : 16
% 11.74/2.03  # Clauses deleted for lack of memory   : 0
% 11.74/2.03  # Backward-subsumed                    : 47
% 11.74/2.03  # Backward-rewritten                   : 324
% 11.74/2.03  # Generated clauses                    : 51091
% 11.74/2.03  # ...of the previous two non-redundant : 41545
% 11.74/2.03  # ...aggressively subsumed             : 0
% 11.74/2.03  # Contextual simplify-reflections      : 67
% 11.74/2.03  # Paramodulations                      : 51073
% 11.74/2.03  # Factorizations                       : 2
% 11.74/2.03  # NegExts                              : 0
% 11.74/2.03  # Equation resolutions                 : 16
% 11.74/2.03  # Total rewrite steps                  : 35195
% 11.74/2.03  # Propositional unsat checks           : 0
% 11.74/2.03  #    Propositional check models        : 0
% 11.74/2.03  #    Propositional check unsatisfiable : 0
% 11.74/2.03  #    Propositional clauses             : 0
% 11.74/2.03  #    Propositional clauses after purity: 0
% 11.74/2.03  #    Propositional unsat core size     : 0
% 11.74/2.03  #    Propositional preprocessing time  : 0.000
% 11.74/2.03  #    Propositional encoding time       : 0.000
% 11.74/2.03  #    Propositional solver time         : 0.000
% 11.74/2.03  #    Success case prop preproc time    : 0.000
% 11.74/2.03  #    Success case prop encoding time   : 0.000
% 11.74/2.03  #    Success case prop solver time     : 0.000
% 11.74/2.03  # Current number of processed clauses  : 7637
% 11.74/2.03  #    Positive orientable unit clauses  : 2315
% 11.74/2.03  #    Positive unorientable unit clauses: 0
% 11.74/2.03  #    Negative unit clauses             : 9
% 11.74/2.03  #    Non-unit-clauses                  : 5313
% 11.74/2.03  # Current number of unprocessed clauses: 25044
% 11.74/2.03  # ...number of literals in the above   : 110225
% 11.74/2.03  # Current number of archived formulas  : 0
% 11.74/2.03  # Current number of archived clauses   : 372
% 11.74/2.03  # Clause-clause subsumption calls (NU) : 3609487
% 11.74/2.03  # Rec. Clause-clause subsumption calls : 2486943
% 11.74/2.03  # Non-unit clause-clause subsumptions  : 7943
% 11.74/2.03  # Unit Clause-clause subsumption calls : 433934
% 11.74/2.03  # Rewrite failures with RHS unbound    : 0
% 11.74/2.03  # BW rewrite match attempts            : 1617
% 11.74/2.03  # BW rewrite match successes           : 27
% 11.74/2.03  # Condensation attempts                : 0
% 11.74/2.03  # Condensation successes               : 0
% 11.74/2.03  # Termbank termtop insertions          : 778195
% 11.74/2.03  
% 11.74/2.03  # -------------------------------------------------
% 11.74/2.03  # User time                : 1.408 s
% 11.74/2.03  # System time              : 0.044 s
% 11.74/2.03  # Total time               : 1.452 s
% 11.74/2.03  # Maximum resident set size: 5752 pages
% 11.74/2.03  
% 11.74/2.03  # -------------------------------------------------
% 11.74/2.03  # User time                : 4.140 s
% 11.74/2.03  # System time              : 0.141 s
% 11.74/2.03  # Total time               : 4.282 s
% 11.74/2.03  # Maximum resident set size: 2236 pages
% 11.74/2.03  % E---3.1 exiting
%------------------------------------------------------------------------------