TSTP Solution File: GEO124-1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n031.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:33:50 EDT 2023

% Result   : Unsatisfiable 0.14s 0.41s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  13 unt;   4 nHn;  26 RR)
%            Number of literals    :   47 (   8 equ;  24 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   45 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(between_c_defn_1,axiom,
    ( ~ between_c(X1,X2,X3,X4)
    | X2 != X4 ),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',between_c_defn_1) ).

cnf(start_point_defn_7,axiom,
    ( incident_o(X1,X2)
    | ~ start_point(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',start_point_defn_7) ).

cnf(corollary_4_10_1_133,negated_conjecture,
    start_point(sk26,sk25),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',corollary_4_10_1_133) ).

cnf(corollary_4_10_1_134,negated_conjecture,
    start_point(sk27,sk25),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',corollary_4_10_1_134) ).

cnf(o3_24,axiom,
    ( between_c(ax2_sk4(X1,X4,X3,X2),X2,X3,X4)
    | ~ between_o(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',o3_24) ).

cnf(start_point_defn_8,axiom,
    ( X1 = X3
    | ordered_by(X2,X1,X3)
    | ~ start_point(X1,X2)
    | ~ incident_o(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',start_point_defn_8) ).

cnf(between_o_defn_6,axiom,
    ( between_o(X1,X4,X3,X2)
    | ~ ordered_by(X1,X2,X3)
    | ~ ordered_by(X1,X3,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',between_o_defn_6) ).

cnf(corollary_4_10_1_135,negated_conjecture,
    sk26 != sk27,
    file('/export/starexec/sandbox2/tmp/tmp.NE6jLeGxs2/E---3.1_23684.p',corollary_4_10_1_135) ).

cnf(c_0_8,axiom,
    ( ~ between_c(X1,X2,X3,X4)
    | X2 != X4 ),
    between_c_defn_1 ).

cnf(c_0_9,axiom,
    ( incident_o(X1,X2)
    | ~ start_point(X1,X2) ),
    start_point_defn_7 ).

cnf(c_0_10,negated_conjecture,
    start_point(sk26,sk25),
    corollary_4_10_1_133 ).

cnf(c_0_11,negated_conjecture,
    start_point(sk27,sk25),
    corollary_4_10_1_134 ).

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

cnf(c_0_13,axiom,
    ( between_c(ax2_sk4(X1,X4,X3,X2),X2,X3,X4)
    | ~ between_o(X1,X2,X3,X4) ),
    o3_24 ).

cnf(c_0_14,axiom,
    ( X1 = X3
    | ordered_by(X2,X1,X3)
    | ~ start_point(X1,X2)
    | ~ incident_o(X3,X2) ),
    start_point_defn_8 ).

cnf(c_0_15,negated_conjecture,
    incident_o(sk26,sk25),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    incident_o(sk27,sk25),
    inference(spm,[status(thm)],[c_0_9,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,axiom,
    ( between_o(X1,X4,X3,X2)
    | ~ ordered_by(X1,X2,X3)
    | ~ ordered_by(X1,X3,X4) ),
    between_o_defn_6 ).

cnf(c_0_19,negated_conjecture,
    ( X1 = sk26
    | ordered_by(sk25,X1,sk26)
    | ~ start_point(X1,sk25) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    sk26 != sk27,
    corollary_4_10_1_135 ).

cnf(c_0_21,negated_conjecture,
    ( X1 = sk27
    | ordered_by(sk25,X1,sk27)
    | ~ start_point(X1,sk25) ),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

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

cnf(c_0_23,negated_conjecture,
    ordered_by(sk25,sk27,sk26),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ordered_by(sk25,sk26,sk27),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_10]),c_0_20]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : GEO124-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.09  % Command    : run_E %s %d THM
% 0.09/0.29  % Computer : n031.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit   : 2400
% 0.09/0.29  % WCLimit    : 300
% 0.09/0.29  % DateTime   : Tue Oct  3 07:02:59 EDT 2023
% 0.09/0.29  % CPUTime    : 
% 0.14/0.39  Running first-order model finding
% 0.14/0.39  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.NE6jLeGxs2/E---3.1_23684.p
% 0.14/0.41  # Version: 3.1pre001
% 0.14/0.41  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41  # Starting sh5l with 300s (1) cores
% 0.14/0.41  # sh5l with pid 23764 completed with status 0
% 0.14/0.41  # Result found by sh5l
% 0.14/0.41  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41  # Starting sh5l with 300s (1) cores
% 0.14/0.41  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.14/0.41  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.14/0.41  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23770 completed with status 0
% 0.14/0.41  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41  # Starting sh5l with 300s (1) cores
% 0.14/0.41  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.41  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.14/0.41  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.14/0.41  # Preprocessing time       : 0.002 s
% 0.14/0.41  # Presaturation interreduction done
% 0.14/0.41  
% 0.14/0.41  # Proof found!
% 0.14/0.41  # SZS status Unsatisfiable
% 0.14/0.41  # SZS output start CNFRefutation
% See solution above
% 0.14/0.41  # Parsed axioms                        : 99
% 0.14/0.41  # Removed by relevancy pruning/SinE    : 24
% 0.14/0.41  # Initial clauses                      : 75
% 0.14/0.41  # Removed in clause preprocessing      : 9
% 0.14/0.41  # Initial clauses in saturation        : 66
% 0.14/0.41  # Processed clauses                    : 159
% 0.14/0.41  # ...of these trivial                  : 0
% 0.14/0.41  # ...subsumed                          : 4
% 0.14/0.41  # ...remaining for further processing  : 155
% 0.14/0.41  # Other redundant clauses eliminated   : 7
% 0.14/0.41  # Clauses deleted for lack of memory   : 0
% 0.14/0.41  # Backward-subsumed                    : 0
% 0.14/0.41  # Backward-rewritten                   : 0
% 0.14/0.41  # Generated clauses                    : 132
% 0.14/0.41  # ...of the previous two non-redundant : 101
% 0.14/0.41  # ...aggressively subsumed             : 0
% 0.14/0.41  # Contextual simplify-reflections      : 2
% 0.14/0.41  # Paramodulations                      : 125
% 0.14/0.41  # Factorizations                       : 0
% 0.14/0.41  # NegExts                              : 0
% 0.14/0.41  # Equation resolutions                 : 7
% 0.14/0.41  # Total rewrite steps                  : 11
% 0.14/0.41  # Propositional unsat checks           : 0
% 0.14/0.41  #    Propositional check models        : 0
% 0.14/0.41  #    Propositional check unsatisfiable : 0
% 0.14/0.41  #    Propositional clauses             : 0
% 0.14/0.41  #    Propositional clauses after purity: 0
% 0.14/0.41  #    Propositional unsat core size     : 0
% 0.14/0.41  #    Propositional preprocessing time  : 0.000
% 0.14/0.41  #    Propositional encoding time       : 0.000
% 0.14/0.41  #    Propositional solver time         : 0.000
% 0.14/0.41  #    Success case prop preproc time    : 0.000
% 0.14/0.41  #    Success case prop encoding time   : 0.000
% 0.14/0.41  #    Success case prop solver time     : 0.000
% 0.14/0.41  # Current number of processed clauses  : 82
% 0.14/0.41  #    Positive orientable unit clauses  : 6
% 0.14/0.41  #    Positive unorientable unit clauses: 0
% 0.14/0.41  #    Negative unit clauses             : 3
% 0.14/0.41  #    Non-unit-clauses                  : 73
% 0.14/0.41  # Current number of unprocessed clauses: 74
% 0.14/0.41  # ...number of literals in the above   : 280
% 0.14/0.41  # Current number of archived formulas  : 0
% 0.14/0.41  # Current number of archived clauses   : 66
% 0.14/0.41  # Clause-clause subsumption calls (NU) : 2468
% 0.14/0.41  # Rec. Clause-clause subsumption calls : 1679
% 0.14/0.41  # Non-unit clause-clause subsumptions  : 6
% 0.14/0.41  # Unit Clause-clause subsumption calls : 64
% 0.14/0.41  # Rewrite failures with RHS unbound    : 0
% 0.14/0.41  # BW rewrite match attempts            : 0
% 0.14/0.41  # BW rewrite match successes           : 0
% 0.14/0.41  # Condensation attempts                : 0
% 0.14/0.41  # Condensation successes               : 0
% 0.14/0.41  # Termbank termtop insertions          : 4122
% 0.14/0.41  
% 0.14/0.41  # -------------------------------------------------
% 0.14/0.41  # User time                : 0.007 s
% 0.14/0.41  # System time              : 0.004 s
% 0.14/0.41  # Total time               : 0.011 s
% 0.14/0.41  # Maximum resident set size: 1928 pages
% 0.14/0.41  
% 0.14/0.41  # -------------------------------------------------
% 0.14/0.41  # User time                : 0.009 s
% 0.14/0.41  # System time              : 0.006 s
% 0.14/0.41  # Total time               : 0.015 s
% 0.14/0.41  # Maximum resident set size: 1760 pages
% 0.14/0.41  % E---3.1 exiting
%------------------------------------------------------------------------------