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

View Problem - Process Solution

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

% Computer : n029.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:25 EDT 2023

% Result   : Theorem 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   59 (  23   ~;  19   |;  13   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   30 (   0 sgn;  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X6,X7,X8,X9] :
      ( ( apart_point_and_line(X6,X7)
        & ~ apart_point_and_line(X6,X8)
        & ~ apart_point_and_line(X6,X9)
        & ~ convergent_lines(X8,X7)
        & ~ convergent_lines(X9,X7) )
     => ~ distinct_lines(X8,X9) ),
    file('/export/starexec/sandbox2/tmp/tmp.JGVSIMF5yh/E---3.1_473.p',con) ).

fof(cup1,axiom,
    ! [X1,X2,X3] :
      ( distinct_lines(X2,X3)
     => ( apart_point_and_line(X1,X2)
        | apart_point_and_line(X1,X3)
        | convergent_lines(X2,X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.JGVSIMF5yh/E---3.1_473.p',cup1) ).

fof(apart6,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( convergent_lines(X1,X3)
        | convergent_lines(X2,X3) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.JGVSIMF5yh/E---3.1_473.p',apart6) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X6,X7,X8,X9] :
        ( ( apart_point_and_line(X6,X7)
          & ~ apart_point_and_line(X6,X8)
          & ~ apart_point_and_line(X6,X9)
          & ~ convergent_lines(X8,X7)
          & ~ convergent_lines(X9,X7) )
       => ~ distinct_lines(X8,X9) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

fof(c_0_4,plain,
    ! [X27,X28,X29] :
      ( ~ distinct_lines(X28,X29)
      | apart_point_and_line(X27,X28)
      | apart_point_and_line(X27,X29)
      | convergent_lines(X28,X29) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cup1])]) ).

fof(c_0_5,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk2_0)
    & ~ apart_point_and_line(esk1_0,esk3_0)
    & ~ apart_point_and_line(esk1_0,esk4_0)
    & ~ convergent_lines(esk3_0,esk2_0)
    & ~ convergent_lines(esk4_0,esk2_0)
    & distinct_lines(esk3_0,esk4_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

fof(c_0_6,plain,
    ! [X31,X32,X33] :
      ( ~ convergent_lines(X31,X32)
      | convergent_lines(X31,X33)
      | convergent_lines(X32,X33) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart6])]) ).

cnf(c_0_7,plain,
    ( apart_point_and_line(X3,X1)
    | apart_point_and_line(X3,X2)
    | convergent_lines(X1,X2)
    | ~ distinct_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    distinct_lines(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

cnf(c_0_10,negated_conjecture,
    ( apart_point_and_line(X1,esk3_0)
    | apart_point_and_line(X1,esk4_0)
    | convergent_lines(esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    ~ convergent_lines(esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_12,negated_conjecture,
    ( apart_point_and_line(X1,esk4_0)
    | apart_point_and_line(X1,esk3_0)
    | convergent_lines(esk3_0,X2)
    | convergent_lines(esk4_0,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ~ convergent_lines(esk4_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_14,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    ( apart_point_and_line(X1,esk3_0)
    | apart_point_and_line(X1,esk4_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : GEO209+2 : TPTP v8.1.2. Released v3.3.0.
% 0.09/0.11  % Command    : run_E %s %d THM
% 0.11/0.32  % Computer : n029.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit   : 2400
% 0.11/0.32  % WCLimit    : 300
% 0.11/0.32  % DateTime   : Tue Oct  3 06:29:37 EDT 2023
% 0.16/0.32  % CPUTime    : 
% 0.16/0.43  Running first-order model finding
% 0.16/0.43  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.JGVSIMF5yh/E---3.1_473.p
% 0.16/0.45  # Version: 3.1pre001
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.45  # Starting sh5l with 300s (1) cores
% 0.16/0.45  # new_bool_3 with pid 570 completed with status 0
% 0.16/0.45  # Result found by new_bool_3
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45  # SAT001_MinMin_p005000_rr_RG with pid 573 completed with status 0
% 0.16/0.45  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.45  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.45  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.45  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.45  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.001 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Theorem
% 0.16/0.45  # SZS output start CNFRefutation
% See solution above
% 0.16/0.45  # Parsed axioms                        : 16
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 4
% 0.16/0.45  # Initial clauses                      : 17
% 0.16/0.45  # Removed in clause preprocessing      : 0
% 0.16/0.45  # Initial clauses in saturation        : 17
% 0.16/0.45  # Processed clauses                    : 47
% 0.16/0.45  # ...of these trivial                  : 0
% 0.16/0.45  # ...subsumed                          : 2
% 0.16/0.45  # ...remaining for further processing  : 45
% 0.16/0.45  # Other redundant clauses eliminated   : 0
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 5
% 0.16/0.45  # Backward-rewritten                   : 0
% 0.16/0.45  # Generated clauses                    : 42
% 0.16/0.45  # ...of the previous two non-redundant : 34
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 0
% 0.16/0.45  # Paramodulations                      : 42
% 0.16/0.45  # Factorizations                       : 0
% 0.16/0.45  # NegExts                              : 0
% 0.16/0.45  # Equation resolutions                 : 0
% 0.16/0.45  # Total rewrite steps                  : 5
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 23
% 0.16/0.45  #    Positive orientable unit clauses  : 3
% 0.16/0.45  #    Positive unorientable unit clauses: 0
% 0.16/0.45  #    Negative unit clauses             : 7
% 0.16/0.45  #    Non-unit-clauses                  : 13
% 0.16/0.45  # Current number of unprocessed clauses: 21
% 0.16/0.45  # ...number of literals in the above   : 90
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 22
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 30
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 13
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 7
% 0.16/0.45  # Unit Clause-clause subsumption calls : 7
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 0
% 0.16/0.45  # BW rewrite match successes           : 0
% 0.16/0.45  # Condensation attempts                : 0
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 1568
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.003 s
% 0.16/0.45  # System time              : 0.003 s
% 0.16/0.45  # Total time               : 0.006 s
% 0.16/0.45  # Maximum resident set size: 1764 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.005 s
% 0.16/0.45  # System time              : 0.004 s
% 0.16/0.45  # Total time               : 0.009 s
% 0.16/0.45  # Maximum resident set size: 1692 pages
% 0.16/0.45  % E---3.1 exiting
%------------------------------------------------------------------------------