TSTP Solution File: GEO087+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : GEO087+1 : TPTP v8.1.2. Released v2.4.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:41:34 EDT 2024

% Result   : Theorem 0.19s 0.48s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   9 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :   25 (   3 avg)
%            Number of connectives :  102 (  41   ~;  36   |;  17   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   51 (   1 sgn  31   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(inner_point_defn,axiom,
    ! [X3,X1] :
      ( inner_point(X3,X1)
    <=> ( incident_c(X3,X1)
        & ~ end_point(X3,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.axio2yNfrd/E---3.1_25707.p',inner_point_defn) ).

fof(corollary_2_9,conjecture,
    ! [X2,X4] :
      ( part_of(X2,X4)
     => ~ ? [X3] : meet(X3,X2,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.axio2yNfrd/E---3.1_25707.p',corollary_2_9) ).

fof(c3,axiom,
    ! [X1] :
    ? [X3] : inner_point(X3,X1),
    file('/export/starexec/sandbox2/tmp/tmp.axio2yNfrd/E---3.1_25707.p',c3) ).

fof(meet_defn,axiom,
    ! [X3,X1,X2] :
      ( meet(X3,X1,X2)
    <=> ( incident_c(X3,X1)
        & incident_c(X3,X2)
        & ! [X5] :
            ( ( incident_c(X5,X1)
              & incident_c(X5,X2) )
           => ( end_point(X5,X1)
              & end_point(X5,X2) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.axio2yNfrd/E---3.1_25707.p',meet_defn) ).

fof(part_of_defn,axiom,
    ! [X1,X2] :
      ( part_of(X2,X1)
    <=> ! [X3] :
          ( incident_c(X3,X2)
         => incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.axio2yNfrd/E---3.1_25707.p',part_of_defn) ).

fof(c_0_5,plain,
    ! [X3,X1] :
      ( inner_point(X3,X1)
    <=> ( incident_c(X3,X1)
        & ~ end_point(X3,X1) ) ),
    inference(fof_simplification,[status(thm)],[inner_point_defn]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X2,X4] :
        ( part_of(X2,X4)
       => ~ ? [X3] : meet(X3,X2,X4) ),
    inference(assume_negation,[status(cth)],[corollary_2_9]) ).

fof(c_0_7,plain,
    ! [X65,X66] :
      ( ( incident_c(X65,X66)
        | ~ inner_point(X65,X66) )
      & ( ~ end_point(X65,X66)
        | ~ inner_point(X65,X66) )
      & ( ~ incident_c(X65,X66)
        | end_point(X65,X66)
        | inner_point(X65,X66) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_8,plain,
    ! [X67] : inner_point(esk14_1(X67),X67),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).

fof(c_0_9,plain,
    ! [X11,X12,X13,X14,X15,X16,X17] :
      ( ( incident_c(X11,X12)
        | ~ meet(X11,X12,X13) )
      & ( incident_c(X11,X13)
        | ~ meet(X11,X12,X13) )
      & ( end_point(X14,X12)
        | ~ incident_c(X14,X12)
        | ~ incident_c(X14,X13)
        | ~ meet(X11,X12,X13) )
      & ( end_point(X14,X13)
        | ~ incident_c(X14,X12)
        | ~ incident_c(X14,X13)
        | ~ meet(X11,X12,X13) )
      & ( incident_c(esk4_3(X15,X16,X17),X16)
        | ~ incident_c(X15,X16)
        | ~ incident_c(X15,X17)
        | meet(X15,X16,X17) )
      & ( incident_c(esk4_3(X15,X16,X17),X17)
        | ~ incident_c(X15,X16)
        | ~ incident_c(X15,X17)
        | meet(X15,X16,X17) )
      & ( ~ end_point(esk4_3(X15,X16,X17),X16)
        | ~ end_point(esk4_3(X15,X16,X17),X17)
        | ~ incident_c(X15,X16)
        | ~ incident_c(X15,X17)
        | meet(X15,X16,X17) ) ),
    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)],[meet_defn])])])])])])]) ).

fof(c_0_10,negated_conjecture,
    ( part_of(esk1_0,esk2_0)
    & meet(esk3_0,esk1_0,esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

cnf(c_0_11,plain,
    ( ~ end_point(X1,X2)
    | ~ inner_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    inner_point(esk14_1(X1),X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( end_point(X1,X2)
    | ~ incident_c(X1,X2)
    | ~ incident_c(X1,X3)
    | ~ meet(X4,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    meet(esk3_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( incident_c(X1,X2)
    | ~ inner_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_16,plain,
    ! [X23,X24,X25,X26,X27] :
      ( ( ~ part_of(X24,X23)
        | ~ incident_c(X25,X24)
        | incident_c(X25,X23) )
      & ( incident_c(esk6_2(X26,X27),X27)
        | part_of(X27,X26) )
      & ( ~ incident_c(esk6_2(X26,X27),X26)
        | part_of(X27,X26) ) ),
    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)],[part_of_defn])])])])])])]) ).

cnf(c_0_17,plain,
    ~ end_point(esk14_1(X1),X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    ( end_point(X1,esk1_0)
    | ~ incident_c(X1,esk2_0)
    | ~ incident_c(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    incident_c(esk14_1(X1),X1),
    inference(spm,[status(thm)],[c_0_15,c_0_12]) ).

cnf(c_0_20,plain,
    ( incident_c(X3,X2)
    | ~ part_of(X1,X2)
    | ~ incident_c(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ~ incident_c(esk14_1(esk1_0),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_22,plain,
    ( incident_c(esk14_1(X1),X2)
    | ~ part_of(X1,X2) ),
    inference(spm,[status(thm)],[c_0_20,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    part_of(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : GEO087+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Fri May  3 18:22:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  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/tmp/tmp.axio2yNfrd/E---3.1_25707.p
% 0.19/0.48  # Version: 3.1.0
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # Starting sh5l with 300s (1) cores
% 0.19/0.48  # new_bool_1 with pid 25788 completed with status 0
% 0.19/0.48  # Result found by new_bool_1
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.48  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25790 completed with status 0
% 0.19/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.48  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.19/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.19/0.48  # Preprocessing time       : 0.001 s
% 0.19/0.48  # Presaturation interreduction done
% 0.19/0.48  
% 0.19/0.48  # Proof found!
% 0.19/0.48  # SZS status Theorem
% 0.19/0.48  # SZS output start CNFRefutation
% See solution above
% 0.19/0.48  # Parsed axioms                        : 17
% 0.19/0.48  # Removed by relevancy pruning/SinE    : 4
% 0.19/0.48  # Initial clauses                      : 39
% 0.19/0.48  # Removed in clause preprocessing      : 0
% 0.19/0.48  # Initial clauses in saturation        : 39
% 0.19/0.48  # Processed clauses                    : 124
% 0.19/0.48  # ...of these trivial                  : 0
% 0.19/0.48  # ...subsumed                          : 5
% 0.19/0.48  # ...remaining for further processing  : 119
% 0.19/0.48  # Other redundant clauses eliminated   : 3
% 0.19/0.48  # Clauses deleted for lack of memory   : 0
% 0.19/0.48  # Backward-subsumed                    : 0
% 0.19/0.48  # Backward-rewritten                   : 0
% 0.19/0.48  # Generated clauses                    : 259
% 0.19/0.48  # ...of the previous two non-redundant : 235
% 0.19/0.48  # ...aggressively subsumed             : 0
% 0.19/0.48  # Contextual simplify-reflections      : 0
% 0.19/0.48  # Paramodulations                      : 248
% 0.19/0.48  # Factorizations                       : 8
% 0.19/0.48  # NegExts                              : 0
% 0.19/0.48  # Equation resolutions                 : 3
% 0.19/0.48  # Disequality decompositions           : 0
% 0.19/0.48  # Total rewrite steps                  : 13
% 0.19/0.48  # ...of those cached                   : 7
% 0.19/0.48  # Propositional unsat checks           : 0
% 0.19/0.48  #    Propositional check models        : 0
% 0.19/0.48  #    Propositional check unsatisfiable : 0
% 0.19/0.48  #    Propositional clauses             : 0
% 0.19/0.48  #    Propositional clauses after purity: 0
% 0.19/0.48  #    Propositional unsat core size     : 0
% 0.19/0.48  #    Propositional preprocessing time  : 0.000
% 0.19/0.48  #    Propositional encoding time       : 0.000
% 0.19/0.48  #    Propositional solver time         : 0.000
% 0.19/0.48  #    Success case prop preproc time    : 0.000
% 0.19/0.48  #    Success case prop encoding time   : 0.000
% 0.19/0.48  #    Success case prop solver time     : 0.000
% 0.19/0.48  # Current number of processed clauses  : 77
% 0.19/0.48  #    Positive orientable unit clauses  : 10
% 0.19/0.48  #    Positive unorientable unit clauses: 0
% 0.19/0.48  #    Negative unit clauses             : 4
% 0.19/0.48  #    Non-unit-clauses                  : 63
% 0.19/0.48  # Current number of unprocessed clauses: 189
% 0.19/0.48  # ...number of literals in the above   : 734
% 0.19/0.48  # Current number of archived formulas  : 0
% 0.19/0.48  # Current number of archived clauses   : 39
% 0.19/0.48  # Clause-clause subsumption calls (NU) : 598
% 0.19/0.48  # Rec. Clause-clause subsumption calls : 343
% 0.19/0.48  # Non-unit clause-clause subsumptions  : 5
% 0.19/0.48  # Unit Clause-clause subsumption calls : 29
% 0.19/0.48  # Rewrite failures with RHS unbound    : 0
% 0.19/0.48  # BW rewrite match attempts            : 3
% 0.19/0.48  # BW rewrite match successes           : 0
% 0.19/0.48  # Condensation attempts                : 0
% 0.19/0.48  # Condensation successes               : 0
% 0.19/0.48  # Termbank termtop insertions          : 6704
% 0.19/0.48  # Search garbage collected termcells   : 872
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.011 s
% 0.19/0.48  # System time              : 0.002 s
% 0.19/0.48  # Total time               : 0.013 s
% 0.19/0.48  # Maximum resident set size: 1848 pages
% 0.19/0.48  
% 0.19/0.48  # -------------------------------------------------
% 0.19/0.48  # User time                : 0.013 s
% 0.19/0.48  # System time              : 0.003 s
% 0.19/0.48  # Total time               : 0.016 s
% 0.19/0.48  # Maximum resident set size: 1708 pages
% 0.19/0.48  % E---3.1 exiting
% 0.19/0.49  % E exiting
%------------------------------------------------------------------------------