TSTP Solution File: GEO002-2 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n026.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:19 EDT 2023

% Result   : Unsatisfiable 1.69s 0.99s
% Output   : CNFRefutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (  11 unt;   0 nHn;  12 RR)
%            Number of literals    :   36 (   8 equ;  17 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    :    4 (   4 usr;   2 con; 0-5 aty)
%            Number of variables   :   62 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(identity_for_equidistance,axiom,
    ( X1 = X2
    | ~ equidistant(X1,X2,X3,X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',identity_for_equidistance) ).

cnf(segment_construction2,axiom,
    equidistant(X1,extension(X2,X1,X3,X4),X3,X4),
    file('/export/starexec/sandbox2/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',segment_construction2) ).

cnf(identity_for_betweeness,axiom,
    ( X1 = X2
    | ~ between(X1,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',identity_for_betweeness) ).

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/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',inner_pasch2) ).

cnf(segment_construction1,axiom,
    between(X1,X2,extension(X1,X2,X3,X4)),
    file('/export/starexec/sandbox2/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',segment_construction1) ).

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/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',inner_pasch1) ).

cnf(prove_a_between_a_and_b,negated_conjecture,
    ~ between(a,a,b),
    file('/export/starexec/sandbox2/tmp/tmp.vUV3yPrM4l/E---3.1_25133.p',prove_a_between_a_and_b) ).

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

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

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

cnf(c_0_10,axiom,
    ( between(X5,inner_pasch(X1,X2,X3,X5,X4),X1)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    inner_pasch2 ).

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

cnf(c_0_12,plain,
    extension(X1,X2,X3,X3) = X2,
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,plain,
    ( inner_pasch(X1,X2,X3,X1,X4) = X1
    | ~ between(X4,X1,X3)
    | ~ between(X1,X2,X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_14,plain,
    between(X1,X2,X2),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

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

cnf(c_0_16,axiom,
    ( between(X2,inner_pasch(X1,X2,X3,X5,X4),X4)
    | ~ between(X1,X2,X3)
    | ~ between(X4,X5,X3) ),
    inner_pasch1 ).

cnf(c_0_17,plain,
    inner_pasch(X1,X1,X1,X1,X2) = X1,
    inference(spm,[status(thm)],[c_0_15,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ~ between(a,a,b),
    prove_a_between_a_and_b ).

cnf(c_0_19,plain,
    between(X1,X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_14]),c_0_14])]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GEO002-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Oct  3 06:57:59 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  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.vUV3yPrM4l/E---3.1_25133.p
% 1.69/0.99  # Version: 3.1pre001
% 1.69/0.99  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.69/0.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.69/0.99  # Starting new_bool_3 with 300s (1) cores
% 1.69/0.99  # Starting new_bool_1 with 300s (1) cores
% 1.69/0.99  # Starting sh5l with 300s (1) cores
% 1.69/0.99  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 25210 completed with status 0
% 1.69/0.99  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.69/0.99  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.69/0.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.69/0.99  # No SInE strategy applied
% 1.69/0.99  # Search class: FGUSS-FFMF33-SFFFFFNN
% 1.69/0.99  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.99  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 1.69/0.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.69/0.99  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1.69/0.99  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 1.69/0.99  # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.69/0.99  # 208_C09_12_F1_SE_CS_SP_PS_S070I with pid 25219 completed with status 0
% 1.69/0.99  # Result found by 208_C09_12_F1_SE_CS_SP_PS_S070I
% 1.69/0.99  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.69/0.99  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.69/0.99  # No SInE strategy applied
% 1.69/0.99  # Search class: FGUSS-FFMF33-SFFFFFNN
% 1.69/0.99  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.99  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 888s (1) cores
% 1.69/0.99  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.69/0.99  # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 1.69/0.99  # Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 1.69/0.99  # Preprocessing time       : 0.001 s
% 1.69/0.99  # Presaturation interreduction done
% 1.69/0.99  
% 1.69/0.99  # Proof found!
% 1.69/0.99  # SZS status Unsatisfiable
% 1.69/0.99  # SZS output start CNFRefutation
% See solution above
% 1.69/0.99  # Parsed axioms                        : 19
% 1.69/0.99  # Removed by relevancy pruning/SinE    : 0
% 1.69/0.99  # Initial clauses                      : 19
% 1.69/0.99  # Removed in clause preprocessing      : 0
% 1.69/0.99  # Initial clauses in saturation        : 19
% 1.69/0.99  # Processed clauses                    : 49
% 1.69/0.99  # ...of these trivial                  : 0
% 1.69/0.99  # ...subsumed                          : 0
% 1.69/0.99  # ...remaining for further processing  : 49
% 1.69/0.99  # Other redundant clauses eliminated   : 0
% 1.69/0.99  # Clauses deleted for lack of memory   : 0
% 1.69/0.99  # Backward-subsumed                    : 0
% 1.69/0.99  # Backward-rewritten                   : 1
% 1.69/0.99  # Generated clauses                    : 46
% 1.69/0.99  # ...of the previous two non-redundant : 35
% 1.69/0.99  # ...aggressively subsumed             : 0
% 1.69/0.99  # Contextual simplify-reflections      : 0
% 1.69/0.99  # Paramodulations                      : 46
% 1.69/0.99  # Factorizations                       : 0
% 1.69/0.99  # NegExts                              : 0
% 1.69/0.99  # Equation resolutions                 : 0
% 1.69/0.99  # Total rewrite steps                  : 14
% 1.69/0.99  # Propositional unsat checks           : 0
% 1.69/0.99  #    Propositional check models        : 0
% 1.69/0.99  #    Propositional check unsatisfiable : 0
% 1.69/0.99  #    Propositional clauses             : 0
% 1.69/0.99  #    Propositional clauses after purity: 0
% 1.69/0.99  #    Propositional unsat core size     : 0
% 1.69/0.99  #    Propositional preprocessing time  : 0.000
% 1.69/0.99  #    Propositional encoding time       : 0.000
% 1.69/0.99  #    Propositional solver time         : 0.000
% 1.69/0.99  #    Success case prop preproc time    : 0.000
% 1.69/0.99  #    Success case prop encoding time   : 0.000
% 1.69/0.99  #    Success case prop solver time     : 0.000
% 1.69/0.99  # Current number of processed clauses  : 29
% 1.69/0.99  #    Positive orientable unit clauses  : 9
% 1.69/0.99  #    Positive unorientable unit clauses: 0
% 1.69/0.99  #    Negative unit clauses             : 3
% 1.69/0.99  #    Non-unit-clauses                  : 17
% 1.69/0.99  # Current number of unprocessed clauses: 24
% 1.69/0.99  # ...number of literals in the above   : 103
% 1.69/0.99  # Current number of archived formulas  : 0
% 1.69/0.99  # Current number of archived clauses   : 20
% 1.69/0.99  # Clause-clause subsumption calls (NU) : 237
% 1.69/0.99  # Rec. Clause-clause subsumption calls : 101
% 1.69/0.99  # Non-unit clause-clause subsumptions  : 0
% 1.69/0.99  # Unit Clause-clause subsumption calls : 24
% 1.69/0.99  # Rewrite failures with RHS unbound    : 0
% 1.69/0.99  # BW rewrite match attempts            : 77
% 1.69/0.99  # BW rewrite match successes           : 1
% 1.69/0.99  # Condensation attempts                : 0
% 1.69/0.99  # Condensation successes               : 0
% 1.69/0.99  # Termbank termtop insertions          : 1071
% 1.69/0.99  
% 1.69/0.99  # -------------------------------------------------
% 1.69/0.99  # User time                : 0.003 s
% 1.69/0.99  # System time              : 0.003 s
% 1.69/0.99  # Total time               : 0.006 s
% 1.69/0.99  # Maximum resident set size: 1632 pages
% 1.69/0.99  
% 1.69/0.99  # -------------------------------------------------
% 1.69/0.99  # User time                : 0.014 s
% 1.69/0.99  # System time              : 0.009 s
% 1.69/0.99  # Total time               : 0.022 s
% 1.69/0.99  # Maximum resident set size: 1692 pages
% 1.69/0.99  % E---3.1 exiting
%------------------------------------------------------------------------------