TSTP Solution File: CSR104+6 by E---3.1.00

View Problem - Process Solution

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

% Computer : n014.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:32:37 EDT 2024

% Result   : Theorem 67.46s 66.10s
% Output   : CNFRefutation 67.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   40 (  23 unt;   0 def)
%            Number of atoms       :   89 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   86 (  37   ~;  34   |;   8   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   38 (   2 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_26636,axiom,
    ! [X1,X15,X13] :
      ( ( s__instance(X15,s__SetOrClass)
        & s__instance(X1,s__SetOrClass) )
     => ( ( s__subclass(X1,X15)
          & s__instance(X13,X1) )
       => s__instance(X13,X15) ) ),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',kb_SUMO_26636) ).

fof(kb_SUMO_26635,axiom,
    ! [X1,X15] :
      ( s__subclass(X1,X15)
     => ( s__instance(X1,s__SetOrClass)
        & s__instance(X15,s__SetOrClass) ) ),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',kb_SUMO_26635) ).

fof(kb_SUMO_27781,axiom,
    s__subclass(s__TimePoint,s__TimePosition),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',kb_SUMO_27781) ).

fof(kb_SUMO_27777,axiom,
    s__subclass(s__TimeInterval,s__TimePosition),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',kb_SUMO_27777) ).

fof(kb_SUMO_28419,axiom,
    ! [X1034,X1035,X1097] :
      ( ( s__instance(X1097,s__TimePosition)
        & s__instance(X1035,s__TimePosition)
        & s__instance(X1034,s__TimePosition) )
     => ( ( s__temporalPart(X1034,X1035)
          & s__temporalPart(X1035,X1097) )
       => s__temporalPart(X1034,X1097) ) ),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',kb_SUMO_28419) ).

fof(local_1,axiom,
    s__instance(s__TimePoint35_1,s__TimePoint),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',local_1) ).

fof(local_2,axiom,
    s__instance(s__TimeInterval35_1,s__TimeInterval),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',local_2) ).

fof(kb_SUMO_26696,axiom,
    ! [X548,X550] :
      ( ( s__instance(X550,s__TimeInterval)
        & s__instance(X548,s__TimeInterval) )
     => ( s__during(X548,X550)
       => s__temporalPart(X548,X550) ) ),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',kb_SUMO_26696) ).

fof(prove_from_ALL,conjecture,
    s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',prove_from_ALL) ).

fof(local_4,axiom,
    s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',local_4) ).

fof(local_5,axiom,
    s__during(s__TimeInterval35_1,s__TimeInterval35_2),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',local_5) ).

fof(local_3,axiom,
    s__instance(s__TimeInterval35_2,s__TimeInterval),
    file('/export/starexec/sandbox/tmp/tmp.3STH5kJMrF/E---3.1_5688.p',local_3) ).

fof(c_0_12,plain,
    ! [X2522,X2523,X2524] :
      ( ~ s__instance(X2523,s__SetOrClass)
      | ~ s__instance(X2522,s__SetOrClass)
      | ~ s__subclass(X2522,X2523)
      | ~ s__instance(X2524,X2522)
      | s__instance(X2524,X2523) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26636])])]) ).

fof(c_0_13,plain,
    ! [X2520,X2521] :
      ( ( s__instance(X2520,s__SetOrClass)
        | ~ s__subclass(X2520,X2521) )
      & ( s__instance(X2521,s__SetOrClass)
        | ~ s__subclass(X2520,X2521) ) ),
    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_14,plain,
    ( s__instance(X3,X1)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__subclass(X2,X1)
    | ~ s__instance(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

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

cnf(c_0_17,plain,
    ( s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

cnf(c_0_18,plain,
    s__subclass(s__TimePoint,s__TimePosition),
    inference(split_conjunct,[status(thm)],[kb_SUMO_27781]) ).

cnf(c_0_19,plain,
    s__subclass(s__TimeInterval,s__TimePosition),
    inference(split_conjunct,[status(thm)],[kb_SUMO_27777]) ).

fof(c_0_20,plain,
    ! [X2350,X2351,X2352] :
      ( ~ s__instance(X2352,s__TimePosition)
      | ~ s__instance(X2351,s__TimePosition)
      | ~ s__instance(X2350,s__TimePosition)
      | ~ s__temporalPart(X2350,X2351)
      | ~ s__temporalPart(X2351,X2352)
      | s__temporalPart(X2350,X2352) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_28419])])]) ).

cnf(c_0_21,plain,
    ( s__instance(X1,s__TimePosition)
    | ~ s__instance(X1,s__TimePoint) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    s__instance(s__TimePoint35_1,s__TimePoint),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_23,plain,
    ( s__instance(X1,s__TimePosition)
    | ~ s__instance(X1,s__TimeInterval) ),
    inference(spm,[status(thm)],[c_0_17,c_0_19]) ).

cnf(c_0_24,plain,
    s__instance(s__TimeInterval35_1,s__TimeInterval),
    inference(split_conjunct,[status(thm)],[local_2]) ).

fof(c_0_25,plain,
    ! [X2341,X2342] :
      ( ~ s__instance(X2342,s__TimeInterval)
      | ~ s__instance(X2341,s__TimeInterval)
      | ~ s__during(X2341,X2342)
      | s__temporalPart(X2341,X2342) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26696])])]) ).

fof(c_0_26,negated_conjecture,
    ~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_ALL])]) ).

cnf(c_0_27,plain,
    ( s__temporalPart(X3,X1)
    | ~ s__instance(X1,s__TimePosition)
    | ~ s__instance(X2,s__TimePosition)
    | ~ s__instance(X3,s__TimePosition)
    | ~ s__temporalPart(X3,X2)
    | ~ s__temporalPart(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    s__temporalPart(s__TimePoint35_1,s__TimeInterval35_1),
    inference(split_conjunct,[status(thm)],[local_4]) ).

cnf(c_0_29,plain,
    s__instance(s__TimePoint35_1,s__TimePosition),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_30,plain,
    s__instance(s__TimeInterval35_1,s__TimePosition),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,plain,
    ( s__temporalPart(X2,X1)
    | ~ s__instance(X1,s__TimeInterval)
    | ~ s__instance(X2,s__TimeInterval)
    | ~ s__during(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_32,plain,
    s__during(s__TimeInterval35_1,s__TimeInterval35_2),
    inference(split_conjunct,[status(thm)],[local_5]) ).

cnf(c_0_33,plain,
    s__instance(s__TimeInterval35_2,s__TimeInterval),
    inference(split_conjunct,[status(thm)],[local_3]) ).

fof(c_0_34,negated_conjecture,
    ~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
    inference(fof_nnf,[status(thm)],[c_0_26]) ).

cnf(c_0_35,plain,
    ( s__temporalPart(s__TimePoint35_1,X1)
    | ~ s__temporalPart(s__TimeInterval35_1,X1)
    | ~ s__instance(X1,s__TimePosition) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).

cnf(c_0_36,plain,
    s__temporalPart(s__TimeInterval35_1,s__TimeInterval35_2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]),c_0_33])]) ).

cnf(c_0_37,plain,
    s__instance(s__TimeInterval35_2,s__TimePosition),
    inference(spm,[status(thm)],[c_0_23,c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    ~ s__temporalPart(s__TimePoint35_1,s__TimeInterval35_2),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 37.15/37.41  % Problem    : CSR104+6 : TPTP v8.1.2. Bugfixed v7.3.0.
% 37.25/37.43  % Command    : run_E %s %d THM
% 37.26/37.63  % Computer : n014.cluster.edu
% 37.26/37.63  % Model    : x86_64 x86_64
% 37.26/37.63  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 37.26/37.63  % Memory   : 8042.1875MB
% 37.26/37.63  % OS       : Linux 3.10.0-693.el7.x86_64
% 37.26/37.63  % CPULimit   : 300
% 37.26/37.63  % WCLimit    : 300
% 37.26/37.63  % DateTime   : Fri May  3 14:59:45 EDT 2024
% 37.26/37.64  % CPUTime    : 
% 64.15/64.53  Running first-order theorem proving
% 64.15/64.53  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/tmp/tmp.3STH5kJMrF/E---3.1_5688.p
% 67.46/66.10  # Version: 3.1.0
% 67.46/66.10  # Preprocessing class: FMLLSMSLSSSNFFN.
% 67.46/66.10  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 67.46/66.10  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 67.46/66.10  # Starting new_bool_3 with 299s (1) cores
% 67.46/66.10  # Starting new_bool_1 with 299s (1) cores
% 67.46/66.10  # Starting sh5l with 299s (1) cores
% 67.46/66.10  # new_bool_3 with pid 6447 completed with status 0
% 67.46/66.10  # Result found by new_bool_3
% 67.46/66.10  # Preprocessing class: FMLLSMSLSSSNFFN.
% 67.46/66.10  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 67.46/66.10  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 67.46/66.10  # Starting new_bool_3 with 299s (1) cores
% 67.46/66.10  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 67.46/66.10  # Search class: FGHSS-FSLM31-MFFFFFNN
% 67.46/66.10  # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 67.46/66.10  # Scheduled 7 strats onto 1 cores with 299 seconds (299 total)
% 67.46/66.10  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 67.46/66.10  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 6451 completed with status 0
% 67.46/66.10  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 67.46/66.10  # Preprocessing class: FMLLSMSLSSSNFFN.
% 67.46/66.10  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 67.46/66.10  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 67.46/66.10  # Starting new_bool_3 with 299s (1) cores
% 67.46/66.10  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 67.46/66.10  # Search class: FGHSS-FSLM31-MFFFFFNN
% 67.46/66.10  # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 67.46/66.10  # Scheduled 7 strats onto 1 cores with 299 seconds (299 total)
% 67.46/66.10  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 67.46/66.10  # Preprocessing time       : 0.020 s
% 67.46/66.10  # Presaturation interreduction done
% 67.46/66.10  
% 67.46/66.10  # Proof found!
% 67.46/66.10  # SZS status Theorem
% 67.46/66.10  # SZS output start CNFRefutation
% See solution above
% 67.46/66.10  # Parsed axioms                        : 55592
% 67.46/66.10  # Removed by relevancy pruning/SinE    : 55419
% 67.46/66.10  # Initial clauses                      : 221
% 67.46/66.10  # Removed in clause preprocessing      : 8
% 67.46/66.10  # Initial clauses in saturation        : 213
% 67.46/66.10  # Processed clauses                    : 919
% 67.46/66.10  # ...of these trivial                  : 43
% 67.46/66.10  # ...subsumed                          : 3
% 67.46/66.10  # ...remaining for further processing  : 873
% 67.46/66.10  # Other redundant clauses eliminated   : 3
% 67.46/66.10  # Clauses deleted for lack of memory   : 0
% 67.46/66.10  # Backward-subsumed                    : 1
% 67.46/66.10  # Backward-rewritten                   : 9
% 67.46/66.10  # Generated clauses                    : 1075
% 67.46/66.10  # ...of the previous two non-redundant : 808
% 67.46/66.10  # ...aggressively subsumed             : 0
% 67.46/66.10  # Contextual simplify-reflections      : 23
% 67.46/66.10  # Paramodulations                      : 1071
% 67.46/66.10  # Factorizations                       : 0
% 67.46/66.10  # NegExts                              : 0
% 67.46/66.10  # Equation resolutions                 : 4
% 67.46/66.10  # Disequality decompositions           : 0
% 67.46/66.10  # Total rewrite steps                  : 678
% 67.46/66.10  # ...of those cached                   : 499
% 67.46/66.10  # Propositional unsat checks           : 0
% 67.46/66.10  #    Propositional check models        : 0
% 67.46/66.10  #    Propositional check unsatisfiable : 0
% 67.46/66.10  #    Propositional clauses             : 0
% 67.46/66.10  #    Propositional clauses after purity: 0
% 67.46/66.10  #    Propositional unsat core size     : 0
% 67.46/66.10  #    Propositional preprocessing time  : 0.000
% 67.46/66.10  #    Propositional encoding time       : 0.000
% 67.46/66.10  #    Propositional solver time         : 0.000
% 67.46/66.10  #    Success case prop preproc time    : 0.000
% 67.46/66.10  #    Success case prop encoding time   : 0.000
% 67.46/66.10  #    Success case prop solver time     : 0.000
% 67.46/66.10  # Current number of processed clauses  : 650
% 67.46/66.10  #    Positive orientable unit clauses  : 339
% 67.46/66.10  #    Positive unorientable unit clauses: 0
% 67.46/66.10  #    Negative unit clauses             : 1
% 67.46/66.10  #    Non-unit-clauses                  : 310
% 67.46/66.10  # Current number of unprocessed clauses: 312
% 67.46/66.10  # ...number of literals in the above   : 726
% 67.46/66.10  # Current number of archived formulas  : 0
% 67.46/66.10  # Current number of archived clauses   : 220
% 67.46/66.10  # Clause-clause subsumption calls (NU) : 25393
% 67.46/66.10  # Rec. Clause-clause subsumption calls : 4778
% 67.46/66.10  # Non-unit clause-clause subsumptions  : 27
% 67.46/66.10  # Unit Clause-clause subsumption calls : 4605
% 67.46/66.10  # Rewrite failures with RHS unbound    : 0
% 67.46/66.10  # BW rewrite match attempts            : 7
% 67.46/66.10  # BW rewrite match successes           : 3
% 67.46/66.10  # Condensation attempts                : 0
% 67.46/66.10  # Condensation successes               : 0
% 67.46/66.10  # Termbank termtop insertions          : 686901
% 67.46/66.10  # Search garbage collected termcells   : 293653
% 67.46/66.10  
% 67.46/66.10  # -------------------------------------------------
% 67.46/66.10  # User time                : 0.330 s
% 67.46/66.10  # System time              : 0.127 s
% 67.46/66.10  # Total time               : 0.457 s
% 67.46/66.10  # Maximum resident set size: 132604 pages
% 67.46/66.10  
% 67.46/66.10  # -------------------------------------------------
% 67.46/66.10  # User time                : 1.327 s
% 67.46/66.10  # System time              : 0.178 s
% 67.46/66.10  # Total time               : 1.505 s
% 67.46/66.10  # Maximum resident set size: 58280 pages
% 67.46/66.10  % E---3.1 exiting
% 67.76/66.10  % E exiting
%------------------------------------------------------------------------------