TSTP Solution File: GEO118+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GEO118+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n021.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 17:31:31 EDT 2023

% Result   : Theorem 0.41s 0.55s
% Output   : CNFRefutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   85 (   4 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  107 (  40   ~;  39   |;  22   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-5 aty)
%            Number of variables   :   66 (   6 sgn;  43   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(between_c_defn,axiom,
    ! [X1,X3,X5,X7] :
      ( between_c(X1,X3,X5,X7)
    <=> ( X3 != X7
        & ? [X8] :
            ( part_of(X8,X1)
            & end_point(X3,X8)
            & end_point(X7,X8)
            & inner_point(X5,X8) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.RkuZ31in8R/E---3.1_14643.p',between_c_defn) ).

fof(o3,axiom,
    ! [X3,X5,X7,X9] :
      ( between_o(X9,X3,X5,X7)
    <=> ? [X1] :
          ( ! [X3] :
              ( incident_o(X3,X9)
            <=> incident_c(X3,X1) )
          & between_c(X1,X3,X5,X7) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.RkuZ31in8R/E---3.1_14643.p',o3) ).

fof(between_o_defn,axiom,
    ! [X9,X3,X5,X7] :
      ( between_o(X9,X3,X5,X7)
    <=> ( ( ordered_by(X9,X3,X5)
          & ordered_by(X9,X5,X7) )
        | ( ordered_by(X9,X7,X5)
          & ordered_by(X9,X5,X3) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.RkuZ31in8R/E---3.1_14643.p',between_o_defn) ).

fof(theorem_4_5,conjecture,
    ! [X9,X3,X5] :
      ( ordered_by(X9,X3,X5)
     => ~ ordered_by(X9,X5,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.RkuZ31in8R/E---3.1_14643.p',theorem_4_5) ).

fof(c_0_4,plain,
    ! [X99,X100,X101,X102,X104,X105,X106,X107,X108] :
      ( ( X100 != X102
        | ~ between_c(X99,X100,X101,X102) )
      & ( part_of(esk19_4(X99,X100,X101,X102),X99)
        | ~ between_c(X99,X100,X101,X102) )
      & ( end_point(X100,esk19_4(X99,X100,X101,X102))
        | ~ between_c(X99,X100,X101,X102) )
      & ( end_point(X102,esk19_4(X99,X100,X101,X102))
        | ~ between_c(X99,X100,X101,X102) )
      & ( inner_point(X101,esk19_4(X99,X100,X101,X102))
        | ~ between_c(X99,X100,X101,X102) )
      & ( X105 = X107
        | ~ part_of(X108,X104)
        | ~ end_point(X105,X108)
        | ~ end_point(X107,X108)
        | ~ inner_point(X106,X108)
        | between_c(X104,X105,X106,X107) ) ),
    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)],[between_c_defn])])])])])]) ).

cnf(c_0_5,plain,
    ( X1 != X2
    | ~ between_c(X3,X1,X4,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X38,X39,X40,X41,X43,X44,X45,X46,X47,X48,X49] :
      ( ( ~ incident_o(X43,X41)
        | incident_c(X43,esk8_4(X38,X39,X40,X41))
        | ~ between_o(X41,X38,X39,X40) )
      & ( ~ incident_c(X44,esk8_4(X38,X39,X40,X41))
        | incident_o(X44,X41)
        | ~ between_o(X41,X38,X39,X40) )
      & ( between_c(esk8_4(X38,X39,X40,X41),X38,X39,X40)
        | ~ between_o(X41,X38,X39,X40) )
      & ( ~ incident_o(esk9_5(X45,X46,X47,X48,X49),X48)
        | ~ incident_c(esk9_5(X45,X46,X47,X48,X49),X49)
        | ~ between_c(X49,X45,X46,X47)
        | between_o(X48,X45,X46,X47) )
      & ( incident_o(esk9_5(X45,X46,X47,X48,X49),X48)
        | incident_c(esk9_5(X45,X46,X47,X48,X49),X49)
        | ~ between_c(X49,X45,X46,X47)
        | between_o(X48,X45,X46,X47) ) ),
    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)],[o3])])])])])]) ).

cnf(c_0_7,plain,
    ~ between_c(X1,X2,X3,X2),
    inference(er,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( between_c(esk8_4(X1,X2,X3,X4),X1,X2,X3)
    | ~ between_o(X4,X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X15,X16,X17,X18] :
      ( ( ordered_by(X15,X18,X17)
        | ordered_by(X15,X16,X17)
        | ~ between_o(X15,X16,X17,X18) )
      & ( ordered_by(X15,X17,X16)
        | ordered_by(X15,X16,X17)
        | ~ between_o(X15,X16,X17,X18) )
      & ( ordered_by(X15,X18,X17)
        | ordered_by(X15,X17,X18)
        | ~ between_o(X15,X16,X17,X18) )
      & ( ordered_by(X15,X17,X16)
        | ordered_by(X15,X17,X18)
        | ~ between_o(X15,X16,X17,X18) )
      & ( ~ ordered_by(X15,X16,X17)
        | ~ ordered_by(X15,X17,X18)
        | between_o(X15,X16,X17,X18) )
      & ( ~ ordered_by(X15,X18,X17)
        | ~ ordered_by(X15,X17,X16)
        | between_o(X15,X16,X17,X18) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_o_defn])])]) ).

fof(c_0_10,negated_conjecture,
    ~ ! [X9,X3,X5] :
        ( ordered_by(X9,X3,X5)
       => ~ ordered_by(X9,X5,X3) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[theorem_4_5])]) ).

cnf(c_0_11,plain,
    ~ between_o(X1,X2,X3,X2),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( between_o(X1,X4,X3,X2)
    | ~ ordered_by(X1,X2,X3)
    | ~ ordered_by(X1,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

cnf(c_0_14,plain,
    ( ~ ordered_by(X1,X2,X3)
    | ~ ordered_by(X1,X3,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ordered_by(esk1_0,esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ordered_by(esk1_0,esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : GEO118+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n021.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Oct  3 06:35:14 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/0.51  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.RkuZ31in8R/E---3.1_14643.p
% 0.41/0.55  # Version: 3.1pre001
% 0.41/0.55  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.41/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.41/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.41/0.55  # Starting sh5l with 300s (1) cores
% 0.41/0.55  # sh5l with pid 14788 completed with status 0
% 0.41/0.55  # Result found by sh5l
% 0.41/0.55  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.41/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.41/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.41/0.55  # Starting sh5l with 300s (1) cores
% 0.41/0.55  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.41/0.55  # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.41/0.55  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.55  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 103s (1) cores
% 0.41/0.55  # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14793 completed with status 0
% 0.41/0.55  # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.41/0.55  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.41/0.55  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.55  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.41/0.55  # Starting new_bool_3 with 300s (1) cores
% 0.41/0.55  # Starting new_bool_1 with 300s (1) cores
% 0.41/0.55  # Starting sh5l with 300s (1) cores
% 0.41/0.55  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.41/0.55  # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.41/0.55  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.41/0.55  # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 103s (1) cores
% 0.41/0.55  # Preprocessing time       : 0.002 s
% 0.41/0.55  # Presaturation interreduction done
% 0.41/0.55  
% 0.41/0.55  # Proof found!
% 0.41/0.55  # SZS status Theorem
% 0.41/0.55  # SZS output start CNFRefutation
% See solution above
% 0.41/0.55  # Parsed axioms                        : 28
% 0.41/0.55  # Removed by relevancy pruning/SinE    : 2
% 0.41/0.55  # Initial clauses                      : 78
% 0.41/0.55  # Removed in clause preprocessing      : 0
% 0.41/0.55  # Initial clauses in saturation        : 78
% 0.41/0.55  # Processed clauses                    : 257
% 0.41/0.55  # ...of these trivial                  : 3
% 0.41/0.55  # ...subsumed                          : 19
% 0.41/0.55  # ...remaining for further processing  : 235
% 0.41/0.55  # Other redundant clauses eliminated   : 5
% 0.41/0.55  # Clauses deleted for lack of memory   : 0
% 0.41/0.55  # Backward-subsumed                    : 0
% 0.41/0.55  # Backward-rewritten                   : 0
% 0.41/0.55  # Generated clauses                    : 429
% 0.41/0.55  # ...of the previous two non-redundant : 392
% 0.41/0.55  # ...aggressively subsumed             : 0
% 0.41/0.55  # Contextual simplify-reflections      : 1
% 0.41/0.55  # Paramodulations                      : 424
% 0.41/0.55  # Factorizations                       : 0
% 0.41/0.55  # NegExts                              : 0
% 0.41/0.55  # Equation resolutions                 : 5
% 0.41/0.55  # Total rewrite steps                  : 24
% 0.41/0.55  # Propositional unsat checks           : 0
% 0.41/0.55  #    Propositional check models        : 0
% 0.41/0.55  #    Propositional check unsatisfiable : 0
% 0.41/0.55  #    Propositional clauses             : 0
% 0.41/0.55  #    Propositional clauses after purity: 0
% 0.41/0.55  #    Propositional unsat core size     : 0
% 0.41/0.55  #    Propositional preprocessing time  : 0.000
% 0.41/0.55  #    Propositional encoding time       : 0.000
% 0.41/0.55  #    Propositional solver time         : 0.000
% 0.41/0.55  #    Success case prop preproc time    : 0.000
% 0.41/0.55  #    Success case prop encoding time   : 0.000
% 0.41/0.55  #    Success case prop solver time     : 0.000
% 0.41/0.55  # Current number of processed clauses  : 152
% 0.41/0.55  #    Positive orientable unit clauses  : 23
% 0.41/0.55  #    Positive unorientable unit clauses: 0
% 0.41/0.55  #    Negative unit clauses             : 8
% 0.41/0.55  #    Non-unit-clauses                  : 121
% 0.41/0.55  # Current number of unprocessed clauses: 287
% 0.41/0.55  # ...number of literals in the above   : 848
% 0.41/0.55  # Current number of archived formulas  : 0
% 0.41/0.55  # Current number of archived clauses   : 78
% 0.41/0.55  # Clause-clause subsumption calls (NU) : 3500
% 0.41/0.55  # Rec. Clause-clause subsumption calls : 2398
% 0.41/0.55  # Non-unit clause-clause subsumptions  : 20
% 0.41/0.55  # Unit Clause-clause subsumption calls : 600
% 0.41/0.55  # Rewrite failures with RHS unbound    : 0
% 0.41/0.55  # BW rewrite match attempts            : 5
% 0.41/0.55  # BW rewrite match successes           : 0
% 0.41/0.55  # Condensation attempts                : 0
% 0.41/0.55  # Condensation successes               : 0
% 0.41/0.55  # Termbank termtop insertions          : 11031
% 0.41/0.55  
% 0.41/0.55  # -------------------------------------------------
% 0.41/0.55  # User time                : 0.022 s
% 0.41/0.55  # System time              : 0.007 s
% 0.41/0.55  # Total time               : 0.029 s
% 0.41/0.55  # Maximum resident set size: 2032 pages
% 0.41/0.55  
% 0.41/0.55  # -------------------------------------------------
% 0.41/0.55  # User time                : 0.024 s
% 0.41/0.55  # System time              : 0.008 s
% 0.41/0.55  # Total time               : 0.033 s
% 0.41/0.55  # Maximum resident set size: 1712 pages
% 0.41/0.55  % E---3.1 exiting
% 0.41/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------