TSTP Solution File: GEO209+3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : GEO209+3 : TPTP v8.1.2. Released v4.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 : Sat May  4 07:42:22 EDT 2024

% Result   : Theorem 0.22s 0.51s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   8 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   56 (  19   ~;  14   |;  15   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   40 (   0 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X9,X6,X7,X8] :
      ( ( apart_point_and_line(X9,X6)
        & incident_point_and_line(X9,X7)
        & incident_point_and_line(X9,X8)
        & parallel_lines(X7,X6)
        & parallel_lines(X8,X6) )
     => equal_lines(X7,X8) ),
    file('/export/starexec/sandbox2/tmp/tmp.62h2X0UaOz/E---3.1_4646.p',con) ).

fof(ax2,axiom,
    ! [X1,X2] :
      ( equal_lines(X1,X2)
    <=> ~ distinct_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.62h2X0UaOz/E---3.1_4646.p',ax2) ).

fof(a3,axiom,
    ! [X1,X2] :
      ( parallel_lines(X1,X2)
    <=> ~ convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.62h2X0UaOz/E---3.1_4646.p',a3) ).

fof(p1,axiom,
    ! [X1,X2] :
      ( distinct_lines(X1,X2)
     => convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.62h2X0UaOz/E---3.1_4646.p',p1) ).

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

fof(c_0_5,negated_conjecture,
    ~ ! [X9,X6,X7,X8] :
        ( ( apart_point_and_line(X9,X6)
          & incident_point_and_line(X9,X7)
          & incident_point_and_line(X9,X8)
          & parallel_lines(X7,X6)
          & parallel_lines(X8,X6) )
       => equal_lines(X7,X8) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_6,plain,
    ! [X1,X2] :
      ( equal_lines(X1,X2)
    <=> ~ distinct_lines(X1,X2) ),
    inference(fof_simplification,[status(thm)],[ax2]) ).

fof(c_0_7,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk2_0)
    & incident_point_and_line(esk1_0,esk3_0)
    & incident_point_and_line(esk1_0,esk4_0)
    & parallel_lines(esk3_0,esk2_0)
    & parallel_lines(esk4_0,esk2_0)
    & ~ equal_lines(esk3_0,esk4_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_8,plain,
    ! [X15,X16] :
      ( ( ~ equal_lines(X15,X16)
        | ~ distinct_lines(X15,X16) )
      & ( distinct_lines(X15,X16)
        | equal_lines(X15,X16) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_9,plain,
    ! [X1,X2] :
      ( parallel_lines(X1,X2)
    <=> ~ convergent_lines(X1,X2) ),
    inference(fof_simplification,[status(thm)],[a3]) ).

fof(c_0_10,plain,
    ! [X38,X39] :
      ( ~ distinct_lines(X38,X39)
      | convergent_lines(X38,X39) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).

cnf(c_0_11,negated_conjecture,
    ~ equal_lines(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( distinct_lines(X1,X2)
    | equal_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_13,plain,
    ! [X17,X18] :
      ( ( ~ parallel_lines(X17,X18)
        | ~ convergent_lines(X17,X18) )
      & ( convergent_lines(X17,X18)
        | parallel_lines(X17,X18) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

fof(c_0_14,plain,
    ! [X45,X46,X47] :
      ( ~ convergent_lines(X45,X46)
      | convergent_lines(X45,X47)
      | convergent_lines(X46,X47) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).

cnf(c_0_15,plain,
    ( convergent_lines(X1,X2)
    | ~ distinct_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    distinct_lines(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,plain,
    ( ~ parallel_lines(X1,X2)
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    parallel_lines(esk4_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_20,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    parallel_lines(esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_22,negated_conjecture,
    ~ convergent_lines(esk4_0,esk2_0),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    ( convergent_lines(esk4_0,X1)
    | convergent_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    ~ convergent_lines(esk3_0,esk2_0),
    inference(spm,[status(thm)],[c_0_17,c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : GEO209+3 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.15/0.35  % Computer : n025.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 18:47:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.22/0.49  Running first-order theorem proving
% 0.22/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.62h2X0UaOz/E---3.1_4646.p
% 0.22/0.51  # Version: 3.1.0
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.51  # Starting sh5l with 300s (1) cores
% 0.22/0.51  # new_bool_3 with pid 4726 completed with status 0
% 0.22/0.51  # Result found by new_bool_3
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51  # Search class: FGHNF-FFMS00-SFFFFFNN
% 0.22/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.22/0.51  # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 4729 completed with status 0
% 0.22/0.51  # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.22/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.51  # Search class: FGHNF-FFMS00-SFFFFFNN
% 0.22/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.51  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.22/0.51  # Preprocessing time       : 0.002 s
% 0.22/0.51  
% 0.22/0.51  # Proof found!
% 0.22/0.51  # SZS status Theorem
% 0.22/0.51  # SZS output start CNFRefutation
% See solution above
% 0.22/0.51  # Parsed axioms                        : 36
% 0.22/0.51  # Removed by relevancy pruning/SinE    : 14
% 0.22/0.51  # Initial clauses                      : 36
% 0.22/0.51  # Removed in clause preprocessing      : 0
% 0.22/0.51  # Initial clauses in saturation        : 36
% 0.22/0.51  # Processed clauses                    : 45
% 0.22/0.51  # ...of these trivial                  : 0
% 0.22/0.51  # ...subsumed                          : 4
% 0.22/0.51  # ...remaining for further processing  : 41
% 0.22/0.51  # Other redundant clauses eliminated   : 0
% 0.22/0.51  # Clauses deleted for lack of memory   : 0
% 0.22/0.51  # Backward-subsumed                    : 0
% 0.22/0.51  # Backward-rewritten                   : 0
% 0.22/0.51  # Generated clauses                    : 37
% 0.22/0.51  # ...of the previous two non-redundant : 24
% 0.22/0.51  # ...aggressively subsumed             : 0
% 0.22/0.51  # Contextual simplify-reflections      : 0
% 0.22/0.51  # Paramodulations                      : 37
% 0.22/0.51  # Factorizations                       : 0
% 0.22/0.51  # NegExts                              : 0
% 0.22/0.51  # Equation resolutions                 : 0
% 0.22/0.51  # Disequality decompositions           : 0
% 0.22/0.51  # Total rewrite steps                  : 3
% 0.22/0.51  # ...of those cached                   : 1
% 0.22/0.51  # Propositional unsat checks           : 0
% 0.22/0.51  #    Propositional check models        : 0
% 0.22/0.51  #    Propositional check unsatisfiable : 0
% 0.22/0.51  #    Propositional clauses             : 0
% 0.22/0.51  #    Propositional clauses after purity: 0
% 0.22/0.51  #    Propositional unsat core size     : 0
% 0.22/0.51  #    Propositional preprocessing time  : 0.000
% 0.22/0.51  #    Propositional encoding time       : 0.000
% 0.22/0.51  #    Propositional solver time         : 0.000
% 0.22/0.51  #    Success case prop preproc time    : 0.000
% 0.22/0.51  #    Success case prop encoding time   : 0.000
% 0.22/0.51  #    Success case prop solver time     : 0.000
% 0.22/0.51  # Current number of processed clauses  : 41
% 0.22/0.51  #    Positive orientable unit clauses  : 7
% 0.22/0.51  #    Positive unorientable unit clauses: 0
% 0.22/0.51  #    Negative unit clauses             : 8
% 0.22/0.51  #    Non-unit-clauses                  : 26
% 0.22/0.51  # Current number of unprocessed clauses: 12
% 0.22/0.51  # ...number of literals in the above   : 42
% 0.22/0.51  # Current number of archived formulas  : 0
% 0.22/0.51  # Current number of archived clauses   : 0
% 0.22/0.51  # Clause-clause subsumption calls (NU) : 92
% 0.22/0.51  # Rec. Clause-clause subsumption calls : 54
% 0.22/0.51  # Non-unit clause-clause subsumptions  : 4
% 0.22/0.51  # Unit Clause-clause subsumption calls : 2
% 0.22/0.51  # Rewrite failures with RHS unbound    : 0
% 0.22/0.51  # BW rewrite match attempts            : 0
% 0.22/0.51  # BW rewrite match successes           : 0
% 0.22/0.51  # Condensation attempts                : 0
% 0.22/0.51  # Condensation successes               : 0
% 0.22/0.51  # Termbank termtop insertions          : 2670
% 0.22/0.51  # Search garbage collected termcells   : 463
% 0.22/0.51  
% 0.22/0.51  # -------------------------------------------------
% 0.22/0.51  # User time                : 0.008 s
% 0.22/0.51  # System time              : 0.001 s
% 0.22/0.51  # Total time               : 0.009 s
% 0.22/0.51  # Maximum resident set size: 1892 pages
% 0.22/0.51  
% 0.22/0.51  # -------------------------------------------------
% 0.22/0.51  # User time                : 0.010 s
% 0.22/0.51  # System time              : 0.002 s
% 0.22/0.51  # Total time               : 0.012 s
% 0.22/0.51  # Maximum resident set size: 1752 pages
% 0.22/0.51  % E---3.1 exiting
% 0.22/0.51  % E exiting
%------------------------------------------------------------------------------