↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO124+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:27:14 PM UTC 2026

% Result   : Theorem 0.22s 0.63s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   32 (   7 unt;   0 def)
%            Number of atoms       :  144 (  17 equ)
%            Maximal formula atoms :   18 (   4 avg)
%            Number of connectives :  172 (  60   ~;  61   |;  39   &)
%                                         (   7 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-5 aty)
%            Number of variables   :   99 (   7 sgn  64   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(between_c_defn,axiom,
    ! [X1,X3,X5,X7] :
      ( between_c(X1,X3,X5,X7)
    <=> ( ? [X8] :
            ( inner_point(X5,X8)
            & end_point(X7,X8)
            & end_point(X3,X8)
            & part_of(X8,X1) )
        & X3 != X7 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+1.ax',between_c_defn) ).

fof(o3,axiom,
    ! [X3,X5,X7,X9] :
      ( between_o(X9,X3,X5,X7)
    <=> ? [X1] :
          ( between_c(X1,X3,X5,X7)
          & ! [X3] :
              ( incident_o(X3,X9)
            <=> incident_c(X3,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o3) ).

fof(start_point_defn,axiom,
    ! [X3,X9] :
      ( start_point(X3,X9)
    <=> ( ! [X5] :
            ( ( incident_o(X5,X9)
              & X3 != X5 )
           => ordered_by(X9,X3,X5) )
        & incident_o(X3,X9) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',start_point_defn) ).

fof(corollary_4_10_1,conjecture,
    ! [X9,X3,X5] :
      ( ( start_point(X5,X9)
        & start_point(X3,X9) )
     => X3 = X5 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',corollary_4_10_1) ).

fof(between_o_defn,axiom,
    ! [X9,X3,X5,X7] :
      ( between_o(X9,X3,X5,X7)
    <=> ( ( ordered_by(X9,X5,X3)
          & ordered_by(X9,X7,X5) )
        | ( ordered_by(X9,X5,X7)
          & ordered_by(X9,X3,X5) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',between_o_defn) ).

fof(o1,axiom,
    ! [X9,X3,X5] :
      ( ordered_by(X9,X3,X5)
     => ( incident_o(X5,X9)
        & incident_o(X3,X9) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o1) ).

fof(c_0_6,plain,
    ! [X1,X3,X5,X7] :
      ( between_c(X1,X3,X5,X7)
    <=> ( ? [X8] :
            ( inner_point(X5,X8)
            & end_point(X7,X8)
            & end_point(X3,X8)
            & part_of(X8,X1) )
        & X3 != X7 ) ),
    inference(fof_simplification,[status(thm)],[between_c_defn]) ).

fof(c_0_7,plain,
    ! [X85,X86,X87,X88,X90,X91,X92,X93,X94] :
      ( ( between_c(X90,X91,X92,X93)
        | ~ inner_point(X92,X94)
        | ~ end_point(X93,X94)
        | ~ end_point(X91,X94)
        | ~ part_of(X94,X90)
        | X91 = X93 )
      & ( ~ between_c(X85,X86,X87,X88)
        | inner_point(X87,esk14_4(X85,X86,X87,X88)) )
      & ( ~ between_c(X85,X86,X87,X88)
        | end_point(X88,esk14_4(X85,X86,X87,X88)) )
      & ( ~ between_c(X85,X86,X87,X88)
        | end_point(X86,esk14_4(X85,X86,X87,X88)) )
      & ( ~ between_c(X85,X86,X87,X88)
        | part_of(esk14_4(X85,X86,X87,X88),X85) )
      & ( ~ between_c(X85,X86,X87,X88)
        | X86 != X88 ) ),
    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)],[c_0_6])])])])])])]) ).

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

fof(c_0_9,plain,
    ! [X118,X119,X120,X121,X123,X124,X125,X126,X127,X128,X129] :
      ( ( between_o(X128,X125,X126,X127)
        | ~ between_c(X129,X125,X126,X127)
        | incident_c(esk19_5(X125,X126,X127,X128,X129),X129)
        | incident_o(esk19_5(X125,X126,X127,X128,X129),X128) )
      & ( between_o(X128,X125,X126,X127)
        | ~ between_c(X129,X125,X126,X127)
        | ~ incident_c(esk19_5(X125,X126,X127,X128,X129),X129)
        | ~ incident_o(esk19_5(X125,X126,X127,X128,X129),X128) )
      & ( ~ between_o(X121,X118,X119,X120)
        | between_c(esk18_4(X118,X119,X120,X121),X118,X119,X120) )
      & ( ~ between_o(X121,X118,X119,X120)
        | incident_o(X124,X121)
        | ~ incident_c(X124,esk18_4(X118,X119,X120,X121)) )
      & ( ~ between_o(X121,X118,X119,X120)
        | incident_c(X123,esk18_4(X118,X119,X120,X121))
        | ~ incident_o(X123,X121) ) ),
    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)],[o3])])])])])])]) ).

fof(c_0_10,plain,
    ! [X3,X9] :
      ( start_point(X3,X9)
    <=> ( ! [X5] :
            ( ( incident_o(X5,X9)
              & X3 != X5 )
           => ordered_by(X9,X3,X5) )
        & incident_o(X3,X9) ) ),
    inference(fof_simplification,[status(thm)],[start_point_defn]) ).

fof(c_0_11,negated_conjecture,
    ~ ! [X9,X3,X5] :
        ( ( start_point(X5,X9)
          & start_point(X3,X9) )
       => X3 = X5 ),
    inference(assume_negation,[status(cth)],[corollary_4_10_1]) ).

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

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

fof(c_0_14,plain,
    ! [X95,X96,X97,X98] :
      ( ( between_o(X95,X96,X97,X98)
        | ~ ordered_by(X95,X97,X96)
        | ~ ordered_by(X95,X98,X97) )
      & ( between_o(X95,X96,X97,X98)
        | ~ ordered_by(X95,X97,X98)
        | ~ ordered_by(X95,X96,X97) )
      & ( ~ between_o(X95,X96,X97,X98)
        | ordered_by(X95,X97,X98)
        | ordered_by(X95,X97,X96) )
      & ( ~ between_o(X95,X96,X97,X98)
        | ordered_by(X95,X97,X98)
        | ordered_by(X95,X98,X97) )
      & ( ~ between_o(X95,X96,X97,X98)
        | ordered_by(X95,X96,X97)
        | ordered_by(X95,X97,X96) )
      & ( ~ between_o(X95,X96,X97,X98)
        | ordered_by(X95,X96,X97)
        | ordered_by(X95,X98,X97) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[between_o_defn])])])]) ).

fof(c_0_15,plain,
    ! [X99,X100,X101,X102,X103] :
      ( ( start_point(X102,X103)
        | ~ incident_o(X102,X103)
        | ~ ordered_by(X103,X102,esk15_2(X102,X103)) )
      & ( start_point(X102,X103)
        | ~ incident_o(X102,X103)
        | incident_o(esk15_2(X102,X103),X103) )
      & ( start_point(X102,X103)
        | ~ incident_o(X102,X103)
        | X102 != esk15_2(X102,X103) )
      & ( ~ start_point(X99,X100)
        | ordered_by(X100,X99,X101)
        | ~ incident_o(X101,X100)
        | X99 = X101 )
      & ( ~ start_point(X99,X100)
        | incident_o(X99,X100) ) ),
    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)],[c_0_10])])])])])])]) ).

fof(c_0_16,negated_conjecture,
    ( esk26_0 != esk27_0
    & start_point(esk27_0,esk25_0)
    & start_point(esk26_0,esk25_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

cnf(c_0_17,plain,
    ~ between_o(X1,X2,X3,X2),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_19,plain,
    ( ~ start_point(X1,X3)
    | ~ incident_o(X2,X3)
    | ordered_by(X3,X1,X2)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    start_point(esk27_0,esk25_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

fof(c_0_21,plain,
    ! [X111,X112,X113] :
      ( ( ~ ordered_by(X111,X112,X113)
        | incident_o(X113,X111) )
      & ( ~ ordered_by(X111,X112,X113)
        | incident_o(X112,X111) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[o1])])])]) ).

cnf(c_0_22,plain,
    ( ~ ordered_by(X1,X3,X2)
    | ~ ordered_by(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ incident_o(X1,esk25_0)
    | ordered_by(esk25_0,esk27_0,X1)
    | esk27_0 = X1 ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( ~ ordered_by(X2,X1,X3)
    | incident_o(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    start_point(esk26_0,esk25_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_26,plain,
    ( ~ start_point(X1,X2)
    | incident_o(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ ordered_by(esk25_0,X1,esk27_0)
    | esk27_0 = X1 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( ~ incident_o(X1,esk25_0)
    | ordered_by(esk25_0,esk26_0,X1)
    | esk26_0 = X1 ),
    inference(spm,[status(thm)],[c_0_19,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    incident_o(esk27_0,esk25_0),
    inference(spm,[status(thm)],[c_0_26,c_0_20]) ).

cnf(c_0_30,negated_conjecture,
    esk26_0 != esk27_0,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GEO124+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n001.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Sun Sep 20 12:01:26 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.53  Running first-order theorem proving
% 0.22/0.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/benchmark/theBenchmark.p
% 0.22/0.63  % Version: 3.5.1
% 0.22/0.63  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63  % Starting new_bool_3 with 300s (1) cores
% 0.22/0.63  % Starting new_bool_1 with 300s (1) cores
% 0.22/0.63  % Starting sh5l with 300s (1) cores
% 0.22/0.63  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 601239 completed with status 0
% 0.22/0.63  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.63  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.63  % No SInE strategy applied
% 0.22/0.63  % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.22/0.63  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.63  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.22/0.63  % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.22/0.63  % Starting new_bool_3 with 248s (1) cores
% 0.22/0.63  % Starting new_bool_1 with 241s (1) cores
% 0.22/0.63  % SubtermCWHack with pid 601243 completed with status 0
% 0.22/0.63  % Result found by SubtermCWHack
% 0.22/0.63  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.63  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.63  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.63  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.63  % No SInE strategy applied
% 0.22/0.63  % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.22/0.63  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.63  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.63  % Preprocessing time       : 0.003 s
% 0.22/0.63  
% 0.22/0.63  % Proof found!
% 0.22/0.63  % SZS status Theorem
% 0.22/0.63  % SZS output start CNFRefutation
% See solution above
% 0.22/0.63  % Parsed axioms                        : 28
% 0.22/0.63  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.63  % Initial clauses                      : 88
% 0.22/0.63  % Removed in clause preprocessing      : 0
% 0.22/0.63  % Initial clauses in saturation        : 88
% 0.22/0.63  % Processed clauses                    : 457
% 0.22/0.63  % ...of these trivial                  : 10
% 0.22/0.63  % ...subsumed                          : 198
% 0.22/0.63  % ...remaining for further processing  : 249
% 0.22/0.63  % Other redundant clauses eliminated   : 25
% 0.22/0.63  % Clauses deleted for lack of memory   : 0
% 0.22/0.63  % Backward-subsumed                    : 10
% 0.22/0.63  % Backward-rewritten                   : 3
% 0.22/0.63  % Generated clauses                    : 2705
% 0.22/0.63  % ...of the previous two non-redundant : 2246
% 0.22/0.63  % ...aggressively subsumed             : 0
% 0.22/0.63  % Contextual simplify-reflections      : 4
% 0.22/0.63  % Paramodulations                      : 2624
% 0.22/0.63  % Factorizations                       : 56
% 0.22/0.63  % NegExts                              : 0
% 0.22/0.63  % Equation resolutions                 : 25
% 0.22/0.63  % Disequality decompositions           : 0
% 0.22/0.63  % Total rewrite steps                  : 421
% 0.22/0.63  % ...of those cached                   : 383
% 0.22/0.63  % Propositional unsat checks           : 0
% 0.22/0.63  %    Propositional check models        : 0
% 0.22/0.63  %    Propositional check unsatisfiable : 0
% 0.22/0.63  %    Propositional clauses             : 0
% 0.22/0.63  %    Propositional clauses after purity: 0
% 0.22/0.63  %    Propositional unsat core size     : 0
% 0.22/0.63  %    Propositional preprocessing time  : 0.000
% 0.22/0.63  %    Propositional encoding time       : 0.000
% 0.22/0.63  %    Propositional solver time         : 0.000
% 0.22/0.63  %    Success case prop preproc time    : 0.000
% 0.22/0.63  %    Success case prop encoding time   : 0.000
% 0.22/0.63  %    Success case prop solver time     : 0.000
% 0.22/0.63  % Current number of processed clauses  : 229
% 0.22/0.63  %    Positive orientable unit clauses  : 23
% 0.22/0.63  %    Positive unorientable unit clauses: 0
% 0.22/0.63  %    Negative unit clauses             : 4
% 0.22/0.63  %    Non-unit-clauses                  : 202
% 0.22/0.63  % Current number of unprocessed clauses: 1839
% 0.22/0.63  % ...number of literals in the above   : 7832
% 0.22/0.63  % Current number of archived formulas  : 0
% 0.22/0.63  % Current number of archived clauses   : 13
% 0.22/0.63  % Clause-clause subsumption calls (NU) : 9487
% 0.22/0.63  % Rec. Clause-clause subsumption calls : 4459
% 0.22/0.63  % Non-unit clause-clause subsumptions  : 204
% 0.22/0.63  % Unit Clause-clause subsumption calls : 641
% 0.22/0.63  % Rewrite failures with RHS unbound    : 0
% 0.22/0.63  % BW rewrite match attempts            : 7
% 0.22/0.63  % BW rewrite match successes           : 4
% 0.22/0.63  % Condensation attempts                : 0
% 0.22/0.63  % Condensation successes               : 0
% 0.22/0.63  % Termbank termtop insertions          : 35591
% 0.22/0.63  % Search garbage collected termcells   : 1942
% 0.22/0.63  
% 0.22/0.63  % -------------------------------------------------
% 0.22/0.63  % User time                : 0.046 s
% 0.22/0.63  % System time              : 0.008 s
% 0.22/0.63  % Total time               : 0.054 s
% 0.22/0.63  % Maximum resident set size: 3932 pages
% 0.22/0.63  
% 0.22/0.63  % -------------------------------------------------
% 0.22/0.63  % User time                : 0.132 s
% 0.22/0.63  % System time              : 0.031 s
% 0.22/0.63  % Total time               : 0.163 s
% 0.22/0.63  % Maximum resident set size: 4864 pages
% 0.22/0.63  % E exiting
%------------------------------------------------------------------------------