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

View Problem - Process Solution

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

% Computer : n016.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:14 EDT 2023

% Result   : Theorem 272.10s 136.86s
% Output   : CNFRefutation 272.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   13 (   5 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   43 (  18   ~;  11   |;  10   &)
%                                         (   0 <=>;   4  =>;   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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn;  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X1,X2,X4,X5] :
      ( ( distinct_points(X1,X2)
        & convergent_lines(X4,X5)
        & ~ distinct_points(X1,intersection_point(X4,X5)) )
     => ( ~ apart_point_and_line(X1,X4)
        & ~ apart_point_and_line(X1,X5) ) ),
    file('/export/starexec/sandbox/tmp/tmp.T45AIm1v4h/E---3.1_30528.p',con) ).

fof(con2,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( ( apart_point_and_line(X3,X1)
          | apart_point_and_line(X3,X2) )
       => distinct_points(X3,intersection_point(X1,X2)) ) ),
    file('/export/starexec/sandbox/tmp/tmp.T45AIm1v4h/E---3.1_30528.p',con2) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X4,X5] :
        ( ( distinct_points(X1,X2)
          & convergent_lines(X4,X5)
          & ~ distinct_points(X1,intersection_point(X4,X5)) )
       => ( ~ apart_point_and_line(X1,X4)
          & ~ apart_point_and_line(X1,X5) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

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

fof(c_0_4,plain,
    ! [X24,X25,X26] :
      ( ( ~ apart_point_and_line(X26,X24)
        | distinct_points(X26,intersection_point(X24,X25))
        | ~ convergent_lines(X24,X25) )
      & ( ~ apart_point_and_line(X26,X25)
        | distinct_points(X26,intersection_point(X24,X25))
        | ~ convergent_lines(X24,X25) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])]) ).

cnf(c_0_5,negated_conjecture,
    ~ distinct_points(esk1_0,intersection_point(esk3_0,esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

cnf(c_0_7,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk3_0)
    | apart_point_and_line(esk1_0,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    ~ apart_point_and_line(esk1_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).

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

cnf(c_0_11,negated_conjecture,
    apart_point_and_line(esk1_0,esk3_0),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_10]),c_0_7])]),c_0_11])]),
    [proof] ).

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