TSTP Solution File: CSR103+7 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : CSR103+7 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:36:20 EDT 2024

% Result   : Theorem 30.30s 28.71s
% Output   : CNFRefutation 30.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   9 unt;   0 def)
%            Number of atoms       :   80 (  13 equ)
%            Maximal formula atoms :   45 (   4 avg)
%            Number of connectives :   98 (  35   ~;  41   |;  18   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   24 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   37 (   9 sgn  22   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
    ? [X2341] :
    ! [X2342] : s__instance(X2342,X2341),
    file('/export/starexec/sandbox2/tmp/tmp.8Ip9KydrMf/E---3.1_20084.p',prove_from_ALL) ).

fof(kb_SUMO_32603,axiom,
    ! [X137,X12,X136] :
      ( X12 = s__UnionFn(X136,X137)
    <=> ! [X1138,X34,X1139] :
          ( ( s__instance(X136,s__SetOrClass)
            & s__instance(X12,s__SetOrClass)
            & s__instance(X137,s__SetOrClass) )
         => ( ( s__instance(X1138,X136)
              & s__instance(X34,X137)
              & s__instance(X1139,X12) )
           => ( s__instance(X1138,X12)
              & s__instance(X34,X12)
              & ( s__instance(X1139,X136)
                | s__instance(X1139,X137) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8Ip9KydrMf/E---3.1_20084.p',kb_SUMO_32603) ).

fof(kb_SUMO_26635,axiom,
    ! [X1,X15] :
      ( s__subclass(X1,X15)
     => ( s__instance(X1,s__SetOrClass)
        & s__instance(X15,s__SetOrClass) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.8Ip9KydrMf/E---3.1_20084.p',kb_SUMO_26635) ).

fof(kb_SUMO_35008,axiom,
    s__subclass(s__City,s__GeopoliticalArea),
    file('/export/starexec/sandbox2/tmp/tmp.8Ip9KydrMf/E---3.1_20084.p',kb_SUMO_35008) ).

fof(c_0_4,negated_conjecture,
    ~ ? [X2341] :
      ! [X2342] : s__instance(X2342,X2341),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

fof(c_0_5,negated_conjecture,
    ! [X2343] : ~ s__instance(esk1_1(X2343),X2343),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

fof(c_0_6,plain,
    ! [X2369,X2370,X2371,X2372,X2373,X2374,X2375,X2376,X2377] :
      ( ( s__instance(X2372,X2370)
        | ~ s__instance(X2372,X2371)
        | ~ s__instance(X2373,X2369)
        | ~ s__instance(X2374,X2370)
        | ~ s__instance(X2371,s__SetOrClass)
        | ~ s__instance(X2370,s__SetOrClass)
        | ~ s__instance(X2369,s__SetOrClass)
        | X2370 != s__UnionFn(X2371,X2369) )
      & ( s__instance(X2373,X2370)
        | ~ s__instance(X2372,X2371)
        | ~ s__instance(X2373,X2369)
        | ~ s__instance(X2374,X2370)
        | ~ s__instance(X2371,s__SetOrClass)
        | ~ s__instance(X2370,s__SetOrClass)
        | ~ s__instance(X2369,s__SetOrClass)
        | X2370 != s__UnionFn(X2371,X2369) )
      & ( s__instance(X2374,X2371)
        | s__instance(X2374,X2369)
        | ~ s__instance(X2372,X2371)
        | ~ s__instance(X2373,X2369)
        | ~ s__instance(X2374,X2370)
        | ~ s__instance(X2371,s__SetOrClass)
        | ~ s__instance(X2370,s__SetOrClass)
        | ~ s__instance(X2369,s__SetOrClass)
        | X2370 != s__UnionFn(X2371,X2369) )
      & ( s__instance(X2377,s__SetOrClass)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( s__instance(X2376,s__SetOrClass)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( s__instance(X2375,s__SetOrClass)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( s__instance(esk2_3(X2375,X2376,X2377),X2377)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( s__instance(esk3_3(X2375,X2376,X2377),X2375)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( s__instance(esk4_3(X2375,X2376,X2377),X2376)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( ~ s__instance(esk4_3(X2375,X2376,X2377),X2377)
        | ~ s__instance(esk2_3(X2375,X2376,X2377),X2376)
        | ~ s__instance(esk3_3(X2375,X2376,X2377),X2376)
        | X2376 = s__UnionFn(X2377,X2375) )
      & ( ~ s__instance(esk4_3(X2375,X2376,X2377),X2375)
        | ~ s__instance(esk2_3(X2375,X2376,X2377),X2376)
        | ~ s__instance(esk3_3(X2375,X2376,X2377),X2376)
        | X2376 = s__UnionFn(X2377,X2375) ) ),
    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)],[kb_SUMO_32603])])])])])])]) ).

cnf(c_0_7,negated_conjecture,
    ~ s__instance(esk1_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( s__instance(X1,s__SetOrClass)
    | X2 = s__UnionFn(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X2345,X2346] :
      ( ( s__instance(X2345,s__SetOrClass)
        | ~ s__subclass(X2345,X2346) )
      & ( s__instance(X2346,s__SetOrClass)
        | ~ s__subclass(X2345,X2346) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26635])])])]) ).

cnf(c_0_10,negated_conjecture,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__instance(s__UnionFn(X2,X1),X3) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_12,plain,
    s__subclass(s__City,s__GeopoliticalArea),
    inference(split_conjunct,[status(thm)],[kb_SUMO_35008]) ).

cnf(c_0_13,negated_conjecture,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,X3) ),
    inference(spm,[status(thm)],[c_0_10,c_0_8]) ).

cnf(c_0_14,plain,
    s__instance(s__City,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    s__instance(X1,s__SetOrClass),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_7,c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : CSR103+7 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.08/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri May  3 15:03:23 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 27.14/27.33  Running first-order model finding
% 27.14/27.33  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.8Ip9KydrMf/E---3.1_20084.p
% 30.30/28.71  # Version: 3.1.0
% 30.30/28.71  # Preprocessing class: FMLLSMSLSSSNFFN.
% 30.30/28.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.30/28.71  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 30.30/28.71  # Starting new_bool_3 with 300s (1) cores
% 30.30/28.71  # Starting new_bool_1 with 300s (1) cores
% 30.30/28.71  # Starting sh5l with 300s (1) cores
% 30.30/28.71  # sh5l with pid 20312 completed with status 0
% 30.30/28.71  # Result found by sh5l
% 30.30/28.71  # Preprocessing class: FMLLSMSLSSSNFFN.
% 30.30/28.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.30/28.71  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 30.30/28.71  # Starting new_bool_3 with 300s (1) cores
% 30.30/28.71  # Starting new_bool_1 with 300s (1) cores
% 30.30/28.71  # Starting sh5l with 300s (1) cores
% 30.30/28.71  # SinE strategy is gf500_gu_R04_F100_L20000
% 30.30/28.71  # Search class: FGHSS-FSLM31-MFFFFFNN
% 30.30/28.71  # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 30.30/28.71  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 30.30/28.71  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 30.30/28.71  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 20315 completed with status 0
% 30.30/28.71  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 30.30/28.71  # Preprocessing class: FMLLSMSLSSSNFFN.
% 30.30/28.71  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.30/28.71  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 30.30/28.71  # Starting new_bool_3 with 300s (1) cores
% 30.30/28.71  # Starting new_bool_1 with 300s (1) cores
% 30.30/28.71  # Starting sh5l with 300s (1) cores
% 30.30/28.71  # SinE strategy is gf500_gu_R04_F100_L20000
% 30.30/28.71  # Search class: FGHSS-FSLM31-MFFFFFNN
% 30.30/28.71  # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 30.30/28.71  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 30.30/28.71  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 30.30/28.71  # Preprocessing time       : 0.030 s
% 30.30/28.71  # Presaturation interreduction done
% 30.30/28.71  
% 30.30/28.71  # Proof found!
% 30.30/28.71  # SZS status Theorem
% 30.30/28.71  # SZS output start CNFRefutation
% See solution above
% 30.30/28.71  # Parsed axioms                        : 55587
% 30.30/28.71  # Removed by relevancy pruning/SinE    : 55427
% 30.30/28.71  # Initial clauses                      : 196
% 30.30/28.71  # Removed in clause preprocessing      : 25
% 30.30/28.71  # Initial clauses in saturation        : 171
% 30.30/28.71  # Processed clauses                    : 274
% 30.30/28.71  # ...of these trivial                  : 15
% 30.30/28.71  # ...subsumed                          : 2
% 30.30/28.71  # ...remaining for further processing  : 257
% 30.30/28.71  # Other redundant clauses eliminated   : 8
% 30.30/28.71  # Clauses deleted for lack of memory   : 0
% 30.30/28.71  # Backward-subsumed                    : 1
% 30.30/28.71  # Backward-rewritten                   : 25
% 30.30/28.71  # Generated clauses                    : 103
% 30.30/28.71  # ...of the previous two non-redundant : 102
% 30.30/28.71  # ...aggressively subsumed             : 0
% 30.30/28.71  # Contextual simplify-reflections      : 17
% 30.30/28.71  # Paramodulations                      : 96
% 30.30/28.71  # Factorizations                       : 0
% 30.30/28.71  # NegExts                              : 0
% 30.30/28.71  # Equation resolutions                 : 8
% 30.30/28.71  # Disequality decompositions           : 0
% 30.30/28.71  # Total rewrite steps                  : 41
% 30.30/28.71  # ...of those cached                   : 11
% 30.30/28.71  # Propositional unsat checks           : 0
% 30.30/28.71  #    Propositional check models        : 0
% 30.30/28.71  #    Propositional check unsatisfiable : 0
% 30.30/28.71  #    Propositional clauses             : 0
% 30.30/28.71  #    Propositional clauses after purity: 0
% 30.30/28.71  #    Propositional unsat core size     : 0
% 30.30/28.71  #    Propositional preprocessing time  : 0.000
% 30.30/28.71  #    Propositional encoding time       : 0.000
% 30.30/28.71  #    Propositional solver time         : 0.000
% 30.30/28.71  #    Success case prop preproc time    : 0.000
% 30.30/28.71  #    Success case prop encoding time   : 0.000
% 30.30/28.71  #    Success case prop solver time     : 0.000
% 30.30/28.71  # Current number of processed clauses  : 55
% 30.30/28.71  #    Positive orientable unit clauses  : 28
% 30.30/28.71  #    Positive unorientable unit clauses: 0
% 30.30/28.71  #    Negative unit clauses             : 1
% 30.30/28.71  #    Non-unit-clauses                  : 26
% 30.30/28.71  # Current number of unprocessed clauses: 167
% 30.30/28.71  # ...number of literals in the above   : 578
% 30.30/28.71  # Current number of archived formulas  : 0
% 30.30/28.71  # Current number of archived clauses   : 195
% 30.30/28.71  # Clause-clause subsumption calls (NU) : 4909
% 30.30/28.71  # Rec. Clause-clause subsumption calls : 875
% 30.30/28.71  # Non-unit clause-clause subsumptions  : 20
% 30.30/28.71  # Unit Clause-clause subsumption calls : 181
% 30.30/28.71  # Rewrite failures with RHS unbound    : 0
% 30.30/28.71  # BW rewrite match attempts            : 22
% 30.30/28.71  # BW rewrite match successes           : 22
% 30.30/28.71  # Condensation attempts                : 0
% 30.30/28.71  # Condensation successes               : 0
% 30.30/28.71  # Termbank termtop insertions          : 668341
% 30.30/28.71  # Search garbage collected termcells   : 293736
% 30.30/28.71  
% 30.30/28.71  # -------------------------------------------------
% 30.30/28.71  # User time                : 0.281 s
% 30.30/28.71  # System time              : 0.116 s
% 30.30/28.71  # Total time               : 0.397 s
% 30.30/28.71  # Maximum resident set size: 132856 pages
% 30.30/28.71  
% 30.30/28.71  # -------------------------------------------------
% 30.30/28.71  # User time                : 1.122 s
% 30.30/28.71  # System time              : 0.173 s
% 30.30/28.71  # Total time               : 1.294 s
% 30.30/28.71  # Maximum resident set size: 58276 pages
% 30.30/28.71  % E---3.1 exiting
%------------------------------------------------------------------------------