TSTP Solution File: GEO007-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GEO007-1 : TPTP v8.1.2. Bugfixed v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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:03 EDT 2023

% Result   : Unsatisfiable 0.20s 0.54s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   41 (  20 unt;   6 nHn;  35 RR)
%            Number of literals    :   77 (  10 equ;  34 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-5 aty)
%            Number of variables   :   81 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity_for_betweeness,axiom,
    ( X1 = X2
    | ~ between(X1,X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',identity_for_betweeness) ).

cnf(outer_pasch1,axiom,
    ( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X3,X5) ),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',outer_pasch1) ).

cnf(identity_for_equidistance,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',identity_for_equidistance) ).

cnf(segment_construction2,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',segment_construction2) ).

cnf(outer_pasch2,axiom,
    ( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
    | ~ between(X1,X2,X3)
    | ~ between(X4,X3,X5) ),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',outer_pasch2) ).

cnf(segment_construction1,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',segment_construction1) ).

cnf(a_between_a_and_e,hypothesis,
    between(e,a,c),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',a_between_a_and_e) ).

cnf(connectivity_for_betweeness,axiom,
    ( X1 = X2
    | between(X1,X3,X4)
    | between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | ~ between(X1,X2,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',connectivity_for_betweeness) ).

cnf(a_not_c,hypothesis,
    a != c,
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',a_not_c) ).

cnf(a_between_a_and_c,hypothesis,
    between(d,a,c),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',a_between_a_and_c) ).

cnf(transitivity_for_betweeness,axiom,
    ( between(X1,X2,X4)
    | ~ between(X1,X2,X3)
    | ~ between(X2,X4,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',transitivity_for_betweeness) ).

cnf(prove_d_between_e_and_a,negated_conjecture,
    ~ between(e,d,a),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',prove_d_between_e_and_a) ).

cnf(e_not_between_d_and_a,hypothesis,
    ~ between(d,e,a),
    file('/export/starexec/sandbox/tmp/tmp.jrFTtOwHyx/E---3.1_4217.p',e_not_between_d_and_a) ).

cnf(c_0_13,axiom,
    ( X1 = X2
    | ~ between(X1,X2,X1) ),
    identity_for_betweeness ).

cnf(c_0_14,axiom,
    ( between(X1,outer_pasch(X2,X1,X4,X5,X3),X4)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X3,X5) ),
    outer_pasch1 ).

cnf(c_0_15,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    identity_for_equidistance ).

cnf(c_0_16,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    segment_construction2 ).

cnf(c_0_17,axiom,
    ( between(X5,X2,outer_pasch(X2,X1,X4,X5,X3))
    | ~ between(X1,X2,X3)
    | ~ between(X4,X3,X5) ),
    outer_pasch2 ).

cnf(c_0_18,plain,
    ( outer_pasch(X1,X2,X2,X3,X4) = X2
    | ~ between(X2,X4,X3)
    | ~ between(X2,X1,X4) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    segment_construction1 ).

cnf(c_0_20,plain,
    extension(X1,X2,X3,X3) = X2,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( between(X1,X2,X3)
    | ~ between(X3,X4,X1)
    | ~ between(X3,X2,X4) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    between(X1,X2,X2),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    ( between(X1,X2,X3)
    | ~ between(X3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_24,hypothesis,
    between(e,a,c),
    a_between_a_and_e ).

cnf(c_0_25,axiom,
    ( X1 = X2
    | between(X1,X3,X4)
    | between(X1,X4,X3)
    | ~ between(X1,X2,X3)
    | ~ between(X1,X2,X4) ),
    connectivity_for_betweeness ).

cnf(c_0_26,hypothesis,
    between(c,a,e),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,hypothesis,
    a != c,
    a_not_c ).

cnf(c_0_28,hypothesis,
    between(d,a,c),
    a_between_a_and_c ).

cnf(c_0_29,hypothesis,
    ( between(c,X1,e)
    | between(c,e,X1)
    | ~ between(c,a,X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).

cnf(c_0_30,hypothesis,
    between(c,a,d),
    inference(spm,[status(thm)],[c_0_23,c_0_28]) ).

cnf(c_0_31,hypothesis,
    ( between(c,e,d)
    | between(c,d,e) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,axiom,
    ( between(X1,X2,X4)
    | ~ between(X1,X2,X3)
    | ~ between(X2,X4,X3) ),
    transitivity_for_betweeness ).

cnf(c_0_33,hypothesis,
    ( between(c,d,e)
    | between(d,e,c) ),
    inference(spm,[status(thm)],[c_0_23,c_0_31]) ).

cnf(c_0_34,hypothesis,
    ( between(X1,d,a)
    | ~ between(X1,d,c) ),
    inference(spm,[status(thm)],[c_0_32,c_0_28]) ).

cnf(c_0_35,hypothesis,
    ( between(d,e,c)
    | between(e,d,c) ),
    inference(spm,[status(thm)],[c_0_23,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    ~ between(e,d,a),
    prove_d_between_e_and_a ).

cnf(c_0_37,hypothesis,
    ( between(X1,e,a)
    | ~ between(X1,e,c) ),
    inference(spm,[status(thm)],[c_0_32,c_0_24]) ).

cnf(c_0_38,hypothesis,
    between(d,e,c),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_39,hypothesis,
    ~ between(d,e,a),
    e_not_between_d_and_a ).

cnf(c_0_40,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.15  % Problem    : GEO007-1 : TPTP v8.1.2. Bugfixed v2.5.0.
% 0.07/0.16  % Command    : run_E %s %d THM
% 0.13/0.37  % Computer : n002.cluster.edu
% 0.13/0.37  % Model    : x86_64 x86_64
% 0.13/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37  % Memory   : 8042.1875MB
% 0.13/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.37  % CPULimit   : 2400
% 0.13/0.37  % WCLimit    : 300
% 0.13/0.37  % DateTime   : Tue Oct  3 06:48:15 EDT 2023
% 0.13/0.37  % CPUTime    : 
% 0.20/0.52  Running first-order theorem proving
% 0.20/0.52  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.jrFTtOwHyx/E---3.1_4217.p
% 0.20/0.54  # Version: 3.1pre001
% 0.20/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.54  # Starting sh5l with 300s (1) cores
% 0.20/0.54  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4295 completed with status 0
% 0.20/0.54  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54  # No SInE strategy applied
% 0.20/0.54  # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.20/0.54  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.54  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.54  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.20/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.54  # SAT001_MinMin_p005000_rr_RG with pid 4306 completed with status 0
% 0.20/0.54  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.54  # No SInE strategy applied
% 0.20/0.54  # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.20/0.54  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.54  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.20/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.54  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.20/0.54  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.20/0.54  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.54  # Preprocessing time       : 0.001 s
% 0.20/0.54  # Presaturation interreduction done
% 0.20/0.54  
% 0.20/0.54  # Proof found!
% 0.20/0.54  # SZS status Unsatisfiable
% 0.20/0.54  # SZS output start CNFRefutation
% See solution above
% 0.20/0.54  # Parsed axioms                        : 25
% 0.20/0.54  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.54  # Initial clauses                      : 25
% 0.20/0.54  # Removed in clause preprocessing      : 0
% 0.20/0.54  # Initial clauses in saturation        : 25
% 0.20/0.54  # Processed clauses                    : 95
% 0.20/0.54  # ...of these trivial                  : 2
% 0.20/0.54  # ...subsumed                          : 3
% 0.20/0.54  # ...remaining for further processing  : 90
% 0.20/0.54  # Other redundant clauses eliminated   : 0
% 0.20/0.54  # Clauses deleted for lack of memory   : 0
% 0.20/0.54  # Backward-subsumed                    : 0
% 0.20/0.54  # Backward-rewritten                   : 2
% 0.20/0.54  # Generated clauses                    : 235
% 0.20/0.54  # ...of the previous two non-redundant : 167
% 0.20/0.54  # ...aggressively subsumed             : 0
% 0.20/0.54  # Contextual simplify-reflections      : 0
% 0.20/0.54  # Paramodulations                      : 235
% 0.20/0.54  # Factorizations                       : 0
% 0.20/0.54  # NegExts                              : 0
% 0.20/0.54  # Equation resolutions                 : 0
% 0.20/0.54  # Total rewrite steps                  : 72
% 0.20/0.54  # Propositional unsat checks           : 0
% 0.20/0.54  #    Propositional check models        : 0
% 0.20/0.54  #    Propositional check unsatisfiable : 0
% 0.20/0.54  #    Propositional clauses             : 0
% 0.20/0.54  #    Propositional clauses after purity: 0
% 0.20/0.54  #    Propositional unsat core size     : 0
% 0.20/0.54  #    Propositional preprocessing time  : 0.000
% 0.20/0.54  #    Propositional encoding time       : 0.000
% 0.20/0.54  #    Propositional solver time         : 0.000
% 0.20/0.54  #    Success case prop preproc time    : 0.000
% 0.20/0.54  #    Success case prop encoding time   : 0.000
% 0.20/0.54  #    Success case prop solver time     : 0.000
% 0.20/0.54  # Current number of processed clauses  : 63
% 0.20/0.54  #    Positive orientable unit clauses  : 20
% 0.20/0.54  #    Positive unorientable unit clauses: 0
% 0.20/0.54  #    Negative unit clauses             : 6
% 0.20/0.54  #    Non-unit-clauses                  : 37
% 0.20/0.54  # Current number of unprocessed clauses: 118
% 0.20/0.54  # ...number of literals in the above   : 500
% 0.20/0.54  # Current number of archived formulas  : 0
% 0.20/0.54  # Current number of archived clauses   : 27
% 0.20/0.54  # Clause-clause subsumption calls (NU) : 648
% 0.20/0.54  # Rec. Clause-clause subsumption calls : 398
% 0.20/0.54  # Non-unit clause-clause subsumptions  : 3
% 0.20/0.54  # Unit Clause-clause subsumption calls : 86
% 0.20/0.54  # Rewrite failures with RHS unbound    : 0
% 0.20/0.54  # BW rewrite match attempts            : 254
% 0.20/0.54  # BW rewrite match successes           : 1
% 0.20/0.54  # Condensation attempts                : 0
% 0.20/0.54  # Condensation successes               : 0
% 0.20/0.54  # Termbank termtop insertions          : 3354
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.007 s
% 0.20/0.54  # System time              : 0.004 s
% 0.20/0.54  # Total time               : 0.011 s
% 0.20/0.54  # Maximum resident set size: 1644 pages
% 0.20/0.54  
% 0.20/0.54  # -------------------------------------------------
% 0.20/0.54  # User time                : 0.042 s
% 0.20/0.54  # System time              : 0.011 s
% 0.20/0.54  # Total time               : 0.053 s
% 0.20/0.54  # Maximum resident set size: 1696 pages
% 0.20/0.54  % E---3.1 exiting
% 0.20/0.54  % E---3.1 exiting
%------------------------------------------------------------------------------