TSTP Solution File: GEO045-2 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : GEO045-2 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n025.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 : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 20:00:18 EDT 2024

% Result   : Unsatisfiable 0.95s 0.58s
% Output   : CNFRefutation 0.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   53 (  26 unt;   5 nHn;  41 RR)
%            Number of literals    :  120 (  24 equ;  68 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    3 (   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   :  157 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity_for_equidistance,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_equidistance) ).

cnf(identity_for_betweeness,axiom,
    ( X1 = X2
    | ~ between(X1,X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',identity_for_betweeness) ).

cnf(inner_pasch1,axiom,
    ( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',inner_pasch1) ).

cnf(segment_construction2,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction2) ).

cnf(segment_construction1,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',segment_construction1) ).

cnf(transitivity_for_equidistance,axiom,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',transitivity_for_equidistance) ).

cnf(inner_pasch2,axiom,
    ( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',inner_pasch2) ).

cnf(outer_five_segment,axiom,
    ( X1 = X2
    | equidistant(X5,X7,X6,X8)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X2,X7,X4,X8)
    | ~ between(X1,X2,X5)
    | ~ between(X3,X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO002-0.ax',outer_five_segment) ).

cnf(w_between_v_and_x,hypothesis,
    between(v,w,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_between_v_and_x) ).

cnf(v_between_u_and_w,hypothesis,
    between(u,v,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_between_u_and_w) ).

cnf(v_not_w,hypothesis,
    v != w,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_not_w) ).

cnf(prove_v_between_u_and_x,negated_conjecture,
    ~ between(u,v,x),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_v_between_u_and_x) ).

cnf(c_0_12,plain,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    inference(fof_simplification,[status(thm)],[identity_for_equidistance]) ).

cnf(c_0_13,plain,
    ( X1 = X2
    | ~ between(X1,X2,X1) ),
    inference(fof_simplification,[status(thm)],[identity_for_betweeness]) ).

cnf(c_0_14,plain,
    ( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    inference(fof_simplification,[status(thm)],[inner_pasch1]) ).

cnf(c_0_15,plain,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    c_0_12 ).

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

cnf(c_0_17,plain,
    ( X1 = X2
    | ~ between(X1,X2,X1) ),
    c_0_13 ).

cnf(c_0_18,plain,
    ( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    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,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    inference(fof_simplification,[status(thm)],[transitivity_for_equidistance]) ).

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

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

cnf(c_0_24,plain,
    ( equidistant(X3,X4,X5,X6)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X1,X2,X5,X6) ),
    c_0_21 ).

cnf(c_0_25,plain,
    ( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    inference(fof_simplification,[status(thm)],[inner_pasch2]) ).

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

cnf(c_0_27,plain,
    ( X1 = X2
    | equidistant(X5,X7,X6,X8)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X2,X7,X4,X8)
    | ~ between(X1,X2,X5)
    | ~ between(X3,X4,X6) ),
    inference(fof_simplification,[status(thm)],[outer_five_segment]) ).

cnf(c_0_28,plain,
    ( equidistant(X1,X2,X3,X4)
    | ~ equidistant(X5,extension(X6,X5,X3,X4),X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_16]) ).

cnf(c_0_29,hypothesis,
    between(v,w,x),
    w_between_v_and_x ).

cnf(c_0_30,plain,
    ( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    c_0_25 ).

cnf(c_0_31,plain,
    inner_pasch(X1,X2,extension(X1,X2,X3,X4),extension(X1,X2,X3,X4),X2) = X2,
    inference(spm,[status(thm)],[c_0_26,c_0_19]) ).

cnf(c_0_32,plain,
    ( X1 = X2
    | equidistant(X5,X7,X6,X8)
    | ~ equidistant(X1,X2,X3,X4)
    | ~ equidistant(X2,X5,X4,X6)
    | ~ equidistant(X1,X7,X3,X8)
    | ~ equidistant(X2,X7,X4,X8)
    | ~ between(X1,X2,X5)
    | ~ between(X3,X4,X6) ),
    c_0_27 ).

cnf(c_0_33,plain,
    equidistant(X1,X2,X1,X2),
    inference(spm,[status(thm)],[c_0_28,c_0_16]) ).

cnf(c_0_34,hypothesis,
    ( inner_pasch(X1,v,x,w,v) = v
    | ~ between(X1,v,x) ),
    inference(spm,[status(thm)],[c_0_22,c_0_29]) ).

cnf(c_0_35,plain,
    between(extension(X1,X2,X3,X4),X2,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]),c_0_19])]) ).

cnf(c_0_36,plain,
    ( inner_pasch(X1,X2,X3,X1,X4) = X1
    | ~ between(X4,X1,X3)
    | ~ between(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_17,c_0_30]) ).

cnf(c_0_37,hypothesis,
    between(u,v,w),
    v_between_u_and_w ).

cnf(c_0_38,plain,
    ( X1 = X2
    | equidistant(X3,X4,X5,X4)
    | ~ between(X6,X2,X5)
    | ~ between(X1,X2,X3)
    | ~ equidistant(X2,X3,X2,X5)
    | ~ equidistant(X1,X4,X6,X4)
    | ~ equidistant(X1,X2,X6,X2) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_39,hypothesis,
    inner_pasch(extension(x,v,X1,X2),v,x,w,v) = v,
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,hypothesis,
    v != w,
    inference(fof_simplification,[status(thm)],[v_not_w]) ).

cnf(c_0_41,hypothesis,
    ( inner_pasch(v,X1,w,v,u) = v
    | ~ between(v,X1,w) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,plain,
    ( X1 = X2
    | equidistant(extension(X3,X2,X2,X4),X5,X4,X5)
    | ~ between(X1,X2,extension(X3,X2,X2,X4))
    | ~ between(X6,X2,X4)
    | ~ equidistant(X1,X5,X6,X5)
    | ~ equidistant(X1,X2,X6,X2) ),
    inference(spm,[status(thm)],[c_0_38,c_0_16]) ).

cnf(c_0_43,hypothesis,
    between(w,v,extension(x,v,X1,X2)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_39]),c_0_29]),c_0_35])]) ).

cnf(c_0_44,hypothesis,
    v != w,
    c_0_40 ).

cnf(c_0_45,hypothesis,
    inner_pasch(v,w,w,v,u) = v,
    inference(spm,[status(thm)],[c_0_41,c_0_23]) ).

cnf(c_0_46,hypothesis,
    ( equidistant(extension(x,v,v,X1),X2,X1,X2)
    | ~ between(X3,v,X1)
    | ~ equidistant(w,v,X3,v)
    | ~ equidistant(w,X2,X3,X2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).

cnf(c_0_47,hypothesis,
    between(w,v,u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_45]),c_0_37]),c_0_23])]) ).

cnf(c_0_48,hypothesis,
    equidistant(extension(x,v,v,u),X1,u,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_33]),c_0_33])]) ).

cnf(c_0_49,negated_conjecture,
    ~ between(u,v,x),
    inference(fof_simplification,[status(thm)],[prove_v_between_u_and_x]) ).

cnf(c_0_50,hypothesis,
    extension(x,v,v,u) = u,
    inference(spm,[status(thm)],[c_0_15,c_0_48]) ).

cnf(c_0_51,negated_conjecture,
    ~ between(u,v,x),
    c_0_49 ).

cnf(c_0_52,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_50]),c_0_51]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : GEO045-2 : TPTP v8.2.0. Released v1.0.0.
% 0.04/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n025.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sun May 19 13:56:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order model finding
% 0.21/0.48  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/benchmark/theBenchmark.p
% 0.95/0.58  # Version: 3.1.0
% 0.95/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.95/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.95/0.58  # Starting new_bool_3 with 300s (1) cores
% 0.95/0.58  # Starting new_bool_1 with 300s (1) cores
% 0.95/0.58  # Starting sh5l with 300s (1) cores
% 0.95/0.58  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12028 completed with status 0
% 0.95/0.58  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.95/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.95/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.95/0.58  # No SInE strategy applied
% 0.95/0.58  # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.95/0.58  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.95/0.58  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.95/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.95/0.58  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.95/0.58  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.95/0.58  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.95/0.58  # G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with pid 12034 completed with status 0
% 0.95/0.58  # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I
% 0.95/0.58  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.95/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.95/0.58  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.95/0.58  # No SInE strategy applied
% 0.95/0.58  # Search class: FGUSS-FFMF33-SFFFFFNN
% 0.95/0.58  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.95/0.58  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 0.95/0.58  # Preprocessing time       : 0.001 s
% 0.95/0.58  
% 0.95/0.58  # Proof found!
% 0.95/0.58  # SZS status Unsatisfiable
% 0.95/0.58  # SZS output start CNFRefutation
% See solution above
% 0.95/0.58  # Parsed axioms                        : 22
% 0.95/0.58  # Removed by relevancy pruning/SinE    : 0
% 0.95/0.58  # Initial clauses                      : 22
% 0.95/0.58  # Removed in clause preprocessing      : 0
% 0.95/0.58  # Initial clauses in saturation        : 22
% 0.95/0.58  # Processed clauses                    : 579
% 0.95/0.58  # ...of these trivial                  : 26
% 0.95/0.58  # ...subsumed                          : 139
% 0.95/0.58  # ...remaining for further processing  : 414
% 0.95/0.58  # Other redundant clauses eliminated   : 0
% 0.95/0.58  # Clauses deleted for lack of memory   : 0
% 0.95/0.58  # Backward-subsumed                    : 16
% 0.95/0.58  # Backward-rewritten                   : 57
% 0.95/0.58  # Generated clauses                    : 3758
% 0.95/0.58  # ...of the previous two non-redundant : 3229
% 0.95/0.58  # ...aggressively subsumed             : 0
% 0.95/0.58  # Contextual simplify-reflections      : 0
% 0.95/0.58  # Paramodulations                      : 3758
% 0.95/0.58  # Factorizations                       : 0
% 0.95/0.58  # NegExts                              : 0
% 0.95/0.58  # Equation resolutions                 : 0
% 0.95/0.58  # Disequality decompositions           : 0
% 0.95/0.58  # Total rewrite steps                  : 2185
% 0.95/0.58  # ...of those cached                   : 1883
% 0.95/0.58  # Propositional unsat checks           : 0
% 0.95/0.58  #    Propositional check models        : 0
% 0.95/0.58  #    Propositional check unsatisfiable : 0
% 0.95/0.58  #    Propositional clauses             : 0
% 0.95/0.58  #    Propositional clauses after purity: 0
% 0.95/0.58  #    Propositional unsat core size     : 0
% 0.95/0.58  #    Propositional preprocessing time  : 0.000
% 0.95/0.58  #    Propositional encoding time       : 0.000
% 0.95/0.58  #    Propositional solver time         : 0.000
% 0.95/0.58  #    Success case prop preproc time    : 0.000
% 0.95/0.58  #    Success case prop encoding time   : 0.000
% 0.95/0.58  #    Success case prop solver time     : 0.000
% 0.95/0.58  # Current number of processed clauses  : 341
% 0.95/0.58  #    Positive orientable unit clauses  : 132
% 0.95/0.58  #    Positive unorientable unit clauses: 0
% 0.95/0.58  #    Negative unit clauses             : 5
% 0.95/0.58  #    Non-unit-clauses                  : 204
% 0.95/0.58  # Current number of unprocessed clauses: 2638
% 0.95/0.58  # ...number of literals in the above   : 13205
% 0.95/0.58  # Current number of archived formulas  : 0
% 0.95/0.58  # Current number of archived clauses   : 73
% 0.95/0.58  # Clause-clause subsumption calls (NU) : 18434
% 0.95/0.58  # Rec. Clause-clause subsumption calls : 5925
% 0.95/0.58  # Non-unit clause-clause subsumptions  : 152
% 0.95/0.58  # Unit Clause-clause subsumption calls : 934
% 0.95/0.58  # Rewrite failures with RHS unbound    : 0
% 0.95/0.58  # BW rewrite match attempts            : 1852
% 0.95/0.58  # BW rewrite match successes           : 35
% 0.95/0.58  # Condensation attempts                : 0
% 0.95/0.58  # Condensation successes               : 0
% 0.95/0.58  # Termbank termtop insertions          : 87011
% 0.95/0.58  # Search garbage collected termcells   : 77
% 0.95/0.58  
% 0.95/0.58  # -------------------------------------------------
% 0.95/0.58  # User time                : 0.094 s
% 0.95/0.58  # System time              : 0.004 s
% 0.95/0.58  # Total time               : 0.098 s
% 0.95/0.58  # Maximum resident set size: 1656 pages
% 0.95/0.58  
% 0.95/0.58  # -------------------------------------------------
% 0.95/0.58  # User time                : 0.445 s
% 0.95/0.58  # System time              : 0.020 s
% 0.95/0.58  # Total time               : 0.465 s
% 0.95/0.58  # Maximum resident set size: 1716 pages
% 0.95/0.58  % E---3.1 exiting
%------------------------------------------------------------------------------