TSTP Solution File: GEO037-3 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GEO037-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.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:12 EDT 2023

% Result   : Unsatisfiable 1.14s 0.65s
% Output   : CNFRefutation 1.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  12 unt;   0 nHn;  16 RR)
%            Number of literals    :   40 (   8 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-4 aty)
%            Number of variables   :   70 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(d4_4,axiom,
    ( equidistant(X4,X3,X1,X2)
    | ~ equidistant(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.IJbcPjeVJY/E---3.1_17837.p',d4_4) ).

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

cnf(transitivity_for_equidistance,axiom,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    file('/export/starexec/sandbox/tmp/tmp.IJbcPjeVJY/E---3.1_17837.p',transitivity_for_equidistance) ).

cnf(prove_lengthen,negated_conjecture,
    ( v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2)
    | ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))
    | ~ between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) ),
    file('/export/starexec/sandbox/tmp/tmp.IJbcPjeVJY/E---3.1_17837.p',prove_lengthen) ).

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

cnf(d4_5,axiom,
    ( equidistant(X4,X3,X2,X1)
    | ~ equidistant(X1,X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.IJbcPjeVJY/E---3.1_17837.p',d4_5) ).

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

cnf(e2_1,axiom,
    lower_dimension_point_1 != lower_dimension_point_2,
    file('/export/starexec/sandbox/tmp/tmp.IJbcPjeVJY/E---3.1_17837.p',e2_1) ).

cnf(c_0_8,axiom,
    ( equidistant(X4,X3,X1,X2)
    | ~ equidistant(X1,X2,X3,X4) ),
    d4_4 ).

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

cnf(c_0_10,axiom,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    transitivity_for_equidistance ).

cnf(c_0_11,plain,
    equidistant(X1,X2,X3,extension(X4,X3,X2,X1)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( v = extension(u,v,lower_dimension_point_1,lower_dimension_point_2)
    | ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))
    | ~ between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)) ),
    prove_lengthen ).

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

cnf(c_0_14,plain,
    ( equidistant(X1,X2,X3,extension(X4,X3,X5,X6))
    | ~ equidistant(X6,X5,X1,X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,axiom,
    ( equidistant(X4,X3,X2,X1)
    | ~ equidistant(X1,X2,X3,X4) ),
    d4_5 ).

cnf(c_0_16,negated_conjecture,
    ( extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v
    | ~ equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_17,plain,
    equidistant(X1,extension(X2,X1,X3,X4),X5,extension(X6,X5,X3,X4)),
    inference(spm,[status(thm)],[c_0_14,c_0_11]) ).

cnf(c_0_18,plain,
    equidistant(X1,X2,extension(X3,X4,X2,X1),X4),
    inference(spm,[status(thm)],[c_0_15,c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    extension(u,v,lower_dimension_point_1,lower_dimension_point_2) = v,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

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

cnf(c_0_21,negated_conjecture,
    equidistant(lower_dimension_point_2,lower_dimension_point_1,v,v),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,axiom,
    lower_dimension_point_1 != lower_dimension_point_2,
    e2_1 ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14  % Problem    : GEO037-3 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n027.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 2400
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Tue Oct  3 07:00:16 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.23/0.52  Running first-order theorem proving
% 0.23/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.IJbcPjeVJY/E---3.1_17837.p
% 1.14/0.65  # Version: 3.1pre001
% 1.14/0.65  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.14/0.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.65  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.14/0.65  # Starting new_bool_3 with 300s (1) cores
% 1.14/0.65  # Starting new_bool_1 with 300s (1) cores
% 1.14/0.65  # Starting sh5l with 300s (1) cores
% 1.14/0.65  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 17915 completed with status 0
% 1.14/0.65  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.14/0.65  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.14/0.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.65  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.14/0.65  # No SInE strategy applied
% 1.14/0.65  # Search class: FGUSM-FFMF33-SFFFFFNN
% 1.14/0.65  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.14/0.65  # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 1.14/0.65  # Starting G-E--_207_C18_F1_AE_CS_SP_PI_S0a with 151s (1) cores
% 1.14/0.65  # Starting new_bool_3 with 151s (1) cores
% 1.14/0.65  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 151s (1) cores
% 1.14/0.65  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 146s (1) cores
% 1.14/0.65  # G-E--_215_C46_F1_AE_CS_SP_PS_S2S with pid 17921 completed with status 0
% 1.14/0.65  # Result found by G-E--_215_C46_F1_AE_CS_SP_PS_S2S
% 1.14/0.65  # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.14/0.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.14/0.65  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.14/0.65  # No SInE strategy applied
% 1.14/0.65  # Search class: FGUSM-FFMF33-SFFFFFNN
% 1.14/0.65  # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.14/0.65  # Starting G-E--_215_C46_F1_AE_CS_SP_PS_S2S with 901s (1) cores
% 1.14/0.65  # Preprocessing time       : 0.002 s
% 1.14/0.65  # Presaturation interreduction done
% 1.14/0.65  
% 1.14/0.65  # Proof found!
% 1.14/0.65  # SZS status Unsatisfiable
% 1.14/0.65  # SZS output start CNFRefutation
% See solution above
% 1.14/0.65  # Parsed axioms                        : 61
% 1.14/0.65  # Removed by relevancy pruning/SinE    : 0
% 1.14/0.65  # Initial clauses                      : 61
% 1.14/0.65  # Removed in clause preprocessing      : 2
% 1.14/0.65  # Initial clauses in saturation        : 59
% 1.14/0.65  # Processed clauses                    : 833
% 1.14/0.65  # ...of these trivial                  : 61
% 1.14/0.65  # ...subsumed                          : 341
% 1.14/0.65  # ...remaining for further processing  : 431
% 1.14/0.65  # Other redundant clauses eliminated   : 0
% 1.14/0.65  # Clauses deleted for lack of memory   : 0
% 1.14/0.65  # Backward-subsumed                    : 17
% 1.14/0.65  # Backward-rewritten                   : 2
% 1.14/0.65  # Generated clauses                    : 8571
% 1.14/0.65  # ...of the previous two non-redundant : 6888
% 1.14/0.65  # ...aggressively subsumed             : 0
% 1.14/0.65  # Contextual simplify-reflections      : 2
% 1.14/0.65  # Paramodulations                      : 8564
% 1.14/0.65  # Factorizations                       : 0
% 1.14/0.65  # NegExts                              : 0
% 1.14/0.65  # Equation resolutions                 : 7
% 1.14/0.65  # Total rewrite steps                  : 1961
% 1.14/0.65  # Propositional unsat checks           : 0
% 1.14/0.65  #    Propositional check models        : 0
% 1.14/0.65  #    Propositional check unsatisfiable : 0
% 1.14/0.65  #    Propositional clauses             : 0
% 1.14/0.65  #    Propositional clauses after purity: 0
% 1.14/0.65  #    Propositional unsat core size     : 0
% 1.14/0.65  #    Propositional preprocessing time  : 0.000
% 1.14/0.65  #    Propositional encoding time       : 0.000
% 1.14/0.65  #    Propositional solver time         : 0.000
% 1.14/0.65  #    Success case prop preproc time    : 0.000
% 1.14/0.65  #    Success case prop encoding time   : 0.000
% 1.14/0.65  #    Success case prop solver time     : 0.000
% 1.14/0.65  # Current number of processed clauses  : 359
% 1.14/0.65  #    Positive orientable unit clauses  : 81
% 1.14/0.65  #    Positive unorientable unit clauses: 0
% 1.14/0.65  #    Negative unit clauses             : 6
% 1.14/0.65  #    Non-unit-clauses                  : 272
% 1.14/0.65  # Current number of unprocessed clauses: 6145
% 1.14/0.65  # ...number of literals in the above   : 11201
% 1.14/0.65  # Current number of archived formulas  : 0
% 1.14/0.65  # Current number of archived clauses   : 73
% 1.14/0.65  # Clause-clause subsumption calls (NU) : 20727
% 1.14/0.65  # Rec. Clause-clause subsumption calls : 17733
% 1.14/0.65  # Non-unit clause-clause subsumptions  : 358
% 1.14/0.65  # Unit Clause-clause subsumption calls : 767
% 1.14/0.65  # Rewrite failures with RHS unbound    : 0
% 1.14/0.65  # BW rewrite match attempts            : 2734
% 1.14/0.65  # BW rewrite match successes           : 4
% 1.14/0.65  # Condensation attempts                : 0
% 1.14/0.65  # Condensation successes               : 0
% 1.14/0.65  # Termbank termtop insertions          : 72305
% 1.14/0.65  
% 1.14/0.65  # -------------------------------------------------
% 1.14/0.65  # User time                : 0.098 s
% 1.14/0.65  # System time              : 0.006 s
% 1.14/0.65  # Total time               : 0.104 s
% 1.14/0.65  # Maximum resident set size: 1760 pages
% 1.14/0.65  
% 1.14/0.65  # -------------------------------------------------
% 1.14/0.65  # User time                : 0.536 s
% 1.14/0.65  # System time              : 0.020 s
% 1.14/0.65  # Total time               : 0.556 s
% 1.14/0.65  # Maximum resident set size: 1720 pages
% 1.14/0.65  % E---3.1 exiting
% 1.14/0.65  % E---3.1 exiting
%------------------------------------------------------------------------------