TSTP Solution File: GEO200+2 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : GEO200+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n019.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:34:21 EDT 2023

% Result   : Theorem 0.19s 0.50s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  14 unt;   0 def)
%            Number of atoms       :   90 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   82 (  28   ~;  43   |;   4   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn;  36   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X1,X2] :
      ( distinct_points(X1,X2)
     => ~ distinct_lines(line_connecting(X1,X2),line_connecting(X2,X1)) ),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',con) ).

fof(apart2,axiom,
    ! [X1] : ~ distinct_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',apart2) ).

fof(apart5,axiom,
    ! [X1,X2,X3] :
      ( distinct_lines(X1,X2)
     => ( distinct_lines(X1,X3)
        | distinct_lines(X2,X3) ) ),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',apart5) ).

fof(apart1,axiom,
    ! [X1] : ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',apart1) ).

fof(apart4,axiom,
    ! [X1,X2,X3] :
      ( distinct_points(X1,X2)
     => ( distinct_points(X1,X3)
        | distinct_points(X2,X3) ) ),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',apart4) ).

fof(cu1,axiom,
    ! [X1,X2,X4,X5] :
      ( ( distinct_points(X1,X2)
        & distinct_lines(X4,X5) )
     => ( apart_point_and_line(X1,X4)
        | apart_point_and_line(X1,X5)
        | apart_point_and_line(X2,X4)
        | apart_point_and_line(X2,X5) ) ),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',cu1) ).

fof(con1,axiom,
    ! [X1,X2,X3] :
      ( distinct_points(X1,X2)
     => ( apart_point_and_line(X3,line_connecting(X1,X2))
       => ( distinct_points(X3,X1)
          & distinct_points(X3,X2) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p',con1) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2] :
        ( distinct_points(X1,X2)
       => ~ distinct_lines(line_connecting(X1,X2),line_connecting(X2,X1)) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

fof(c_0_8,plain,
    ! [X1] : ~ distinct_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[apart2]) ).

fof(c_0_9,plain,
    ! [X9,X10,X11] :
      ( ~ distinct_lines(X9,X10)
      | distinct_lines(X9,X11)
      | distinct_lines(X10,X11) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).

fof(c_0_10,negated_conjecture,
    ( distinct_points(esk1_0,esk2_0)
    & distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_11,plain,
    ! [X8] : ~ distinct_lines(X8,X8),
    inference(variable_rename,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( distinct_lines(X1,X3)
    | distinct_lines(X2,X3)
    | ~ distinct_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,plain,
    ! [X1] : ~ distinct_points(X1,X1),
    inference(fof_simplification,[status(thm)],[apart1]) ).

fof(c_0_15,plain,
    ! [X25,X26,X27] :
      ( ~ distinct_points(X25,X26)
      | distinct_points(X25,X27)
      | distinct_points(X26,X27) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])]) ).

fof(c_0_16,plain,
    ! [X12,X13,X14,X15] :
      ( ~ distinct_points(X12,X13)
      | ~ distinct_lines(X14,X15)
      | apart_point_and_line(X12,X14)
      | apart_point_and_line(X12,X15)
      | apart_point_and_line(X13,X14)
      | apart_point_and_line(X13,X15) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).

cnf(c_0_17,plain,
    ~ distinct_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    ( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
    | distinct_lines(line_connecting(esk2_0,esk1_0),X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_19,plain,
    ! [X24] : ~ distinct_points(X24,X24),
    inference(variable_rename,[status(thm)],[c_0_14]) ).

cnf(c_0_20,plain,
    ( distinct_points(X1,X3)
    | distinct_points(X2,X3)
    | ~ distinct_points(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    distinct_points(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_22,plain,
    ( apart_point_and_line(X1,X3)
    | apart_point_and_line(X1,X4)
    | apart_point_and_line(X2,X3)
    | apart_point_and_line(X2,X4)
    | ~ distinct_points(X1,X2)
    | ~ distinct_lines(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_23,negated_conjecture,
    distinct_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_24,plain,
    ~ distinct_points(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ( distinct_points(esk1_0,X1)
    | distinct_points(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_26,plain,
    ! [X21,X22,X23] :
      ( ( distinct_points(X23,X21)
        | ~ apart_point_and_line(X23,line_connecting(X21,X22))
        | ~ distinct_points(X21,X22) )
      & ( distinct_points(X23,X22)
        | ~ apart_point_and_line(X23,line_connecting(X21,X22))
        | ~ distinct_points(X21,X22) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con1])])]) ).

cnf(c_0_27,negated_conjecture,
    ( apart_point_and_line(X1,line_connecting(esk2_0,esk1_0))
    | apart_point_and_line(X1,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(X2,line_connecting(esk2_0,esk1_0))
    | apart_point_and_line(X2,line_connecting(esk1_0,esk2_0))
    | ~ distinct_points(X1,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,negated_conjecture,
    distinct_points(esk2_0,esk1_0),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    ( distinct_points(X1,X2)
    | ~ apart_point_and_line(X1,line_connecting(X2,X3))
    | ~ distinct_points(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ( apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0))
    | apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( distinct_points(X1,X2)
    | ~ apart_point_and_line(X1,line_connecting(X3,X2))
    | ~ distinct_points(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    ( apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0))
    | apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(esk1_0,line_connecting(esk2_0,esk1_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_21])]),c_0_24]) ).

cnf(c_0_33,negated_conjecture,
    ( apart_point_and_line(esk2_0,line_connecting(esk1_0,esk2_0))
    | apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_28])]),c_0_24]) ).

cnf(c_0_34,negated_conjecture,
    apart_point_and_line(esk2_0,line_connecting(esk2_0,esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_21])]),c_0_24]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_28])]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : GEO200+2 : TPTP v8.1.2. Released v3.3.0.
% 0.08/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n019.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:45:51 EDT 2023
% 0.13/0.35  % CPUTime    : 
% 0.19/0.48  Running first-order model finding
% 0.19/0.48  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.HoYnuQegd6/E---3.1_21557.p
% 0.19/0.50  # Version: 3.1pre001
% 0.19/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # Starting sh5l with 300s (1) cores
% 0.19/0.50  # new_bool_1 with pid 21637 completed with status 0
% 0.19/0.50  # Result found by new_bool_1
% 0.19/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50  # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.19/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50  # SAT001_MinMin_p005000_rr_RG with pid 21640 completed with status 0
% 0.19/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50  # Search class: FGUNF-FFSF22-SFFFFFNN
% 0.19/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.50  # Preprocessing time       : 0.001 s
% 0.19/0.50  # Presaturation interreduction done
% 0.19/0.50  
% 0.19/0.50  # Proof found!
% 0.19/0.50  # SZS status Theorem
% 0.19/0.50  # SZS output start CNFRefutation
% See solution above
% 0.19/0.50  # Parsed axioms                        : 13
% 0.19/0.50  # Removed by relevancy pruning/SinE    : 1
% 0.19/0.50  # Initial clauses                      : 14
% 0.19/0.50  # Removed in clause preprocessing      : 0
% 0.19/0.50  # Initial clauses in saturation        : 14
% 0.19/0.50  # Processed clauses                    : 129
% 0.19/0.50  # ...of these trivial                  : 0
% 0.19/0.50  # ...subsumed                          : 73
% 0.19/0.50  # ...remaining for further processing  : 56
% 0.19/0.50  # Other redundant clauses eliminated   : 0
% 0.19/0.50  # Clauses deleted for lack of memory   : 0
% 0.19/0.50  # Backward-subsumed                    : 2
% 0.19/0.50  # Backward-rewritten                   : 1
% 0.19/0.50  # Generated clauses                    : 274
% 0.19/0.50  # ...of the previous two non-redundant : 216
% 0.19/0.50  # ...aggressively subsumed             : 0
% 0.19/0.50  # Contextual simplify-reflections      : 0
% 0.19/0.50  # Paramodulations                      : 188
% 0.19/0.50  # Factorizations                       : 86
% 0.19/0.50  # NegExts                              : 0
% 0.19/0.50  # Equation resolutions                 : 0
% 0.19/0.50  # Total rewrite steps                  : 66
% 0.19/0.50  # Propositional unsat checks           : 0
% 0.19/0.50  #    Propositional check models        : 0
% 0.19/0.50  #    Propositional check unsatisfiable : 0
% 0.19/0.50  #    Propositional clauses             : 0
% 0.19/0.50  #    Propositional clauses after purity: 0
% 0.19/0.50  #    Propositional unsat core size     : 0
% 0.19/0.50  #    Propositional preprocessing time  : 0.000
% 0.19/0.50  #    Propositional encoding time       : 0.000
% 0.19/0.50  #    Propositional solver time         : 0.000
% 0.19/0.50  #    Success case prop preproc time    : 0.000
% 0.19/0.50  #    Success case prop encoding time   : 0.000
% 0.19/0.50  #    Success case prop solver time     : 0.000
% 0.19/0.50  # Current number of processed clauses  : 39
% 0.19/0.50  #    Positive orientable unit clauses  : 5
% 0.19/0.50  #    Positive unorientable unit clauses: 0
% 0.19/0.50  #    Negative unit clauses             : 3
% 0.19/0.50  #    Non-unit-clauses                  : 31
% 0.19/0.50  # Current number of unprocessed clauses: 113
% 0.19/0.50  # ...number of literals in the above   : 609
% 0.19/0.50  # Current number of archived formulas  : 0
% 0.19/0.50  # Current number of archived clauses   : 17
% 0.19/0.50  # Clause-clause subsumption calls (NU) : 632
% 0.19/0.50  # Rec. Clause-clause subsumption calls : 315
% 0.19/0.50  # Non-unit clause-clause subsumptions  : 75
% 0.19/0.50  # Unit Clause-clause subsumption calls : 4
% 0.19/0.50  # Rewrite failures with RHS unbound    : 0
% 0.19/0.50  # BW rewrite match attempts            : 1
% 0.19/0.50  # BW rewrite match successes           : 1
% 0.19/0.50  # Condensation attempts                : 0
% 0.19/0.50  # Condensation successes               : 0
% 0.19/0.50  # Termbank termtop insertions          : 4083
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.010 s
% 0.19/0.50  # System time              : 0.000 s
% 0.19/0.50  # Total time               : 0.010 s
% 0.19/0.50  # Maximum resident set size: 1764 pages
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.014 s
% 0.19/0.50  # System time              : 0.000 s
% 0.19/0.50  # Total time               : 0.014 s
% 0.19/0.50  # Maximum resident set size: 1692 pages
% 0.19/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------