TSTP Solution File: GEO219+1 by E---3.1

View Problem - Process Solution

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

% Computer : n009.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:32:12 EDT 2023

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   29 (  10 unt;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :   16 (   2 avg)
%            Number of connectives :  100 (  48   ~;  36   |;  11   &)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   46 (   0 sgn;  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X6,X7,X8] :
      ( ( ~ unorthogonal_lines(X6,X7)
        & ~ convergent_lines(X6,X8) )
     => ~ unorthogonal_lines(X7,X8) ),
    file('/export/starexec/sandbox/tmp/tmp.UFdKysyPoe/E---3.1_26319.p',con) ).

fof(coipo1,axiom,
    ! [X6,X7] :
      ~ ( ~ convergent_lines(X6,X7)
        & ~ unorthogonal_lines(X6,X7) ),
    file('/export/starexec/sandbox/tmp/tmp.UFdKysyPoe/E---3.1_26319.p',coipo1) ).

fof(cotno1,axiom,
    ! [X6,X7,X8] :
      ( ( ( ~ convergent_lines(X6,X7)
          | ~ unorthogonal_lines(X6,X7) )
        & ( ~ convergent_lines(X6,X8)
          | ~ unorthogonal_lines(X6,X8) ) )
     => ( ~ convergent_lines(X7,X8)
        | ~ unorthogonal_lines(X7,X8) ) ),
    file('/export/starexec/sandbox/tmp/tmp.UFdKysyPoe/E---3.1_26319.p',cotno1) ).

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

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.UFdKysyPoe/E---3.1_26319.p',apart3) ).

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

fof(c_0_6,plain,
    ! [X6,X7] :
      ~ ( ~ convergent_lines(X6,X7)
        & ~ unorthogonal_lines(X6,X7) ),
    inference(fof_simplification,[status(thm)],[coipo1]) ).

fof(c_0_7,plain,
    ! [X6,X7,X8] :
      ( ( ( ~ convergent_lines(X6,X7)
          | ~ unorthogonal_lines(X6,X7) )
        & ( ~ convergent_lines(X6,X8)
          | ~ unorthogonal_lines(X6,X8) ) )
     => ( ~ convergent_lines(X7,X8)
        | ~ unorthogonal_lines(X7,X8) ) ),
    inference(fof_simplification,[status(thm)],[cotno1]) ).

fof(c_0_8,negated_conjecture,
    ( ~ unorthogonal_lines(esk1_0,esk2_0)
    & ~ convergent_lines(esk1_0,esk3_0)
    & unorthogonal_lines(esk2_0,esk3_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_9,plain,
    ! [X12,X13] :
      ( convergent_lines(X12,X13)
      | unorthogonal_lines(X12,X13) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

fof(c_0_10,plain,
    ! [X14,X15,X16] :
      ( ( convergent_lines(X14,X16)
        | convergent_lines(X14,X15)
        | ~ convergent_lines(X15,X16)
        | ~ unorthogonal_lines(X15,X16) )
      & ( unorthogonal_lines(X14,X16)
        | convergent_lines(X14,X15)
        | ~ convergent_lines(X15,X16)
        | ~ unorthogonal_lines(X15,X16) )
      & ( convergent_lines(X14,X16)
        | unorthogonal_lines(X14,X15)
        | ~ convergent_lines(X15,X16)
        | ~ unorthogonal_lines(X15,X16) )
      & ( unorthogonal_lines(X14,X16)
        | unorthogonal_lines(X14,X15)
        | ~ convergent_lines(X15,X16)
        | ~ unorthogonal_lines(X15,X16) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_11,plain,
    ! [X21,X22,X23] :
      ( ~ convergent_lines(X21,X22)
      | convergent_lines(X21,X23)
      | convergent_lines(X22,X23) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).

cnf(c_0_12,negated_conjecture,
    ~ unorthogonal_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

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

cnf(c_0_16,negated_conjecture,
    unorthogonal_lines(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_18,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_20,negated_conjecture,
    ( convergent_lines(X1,esk3_0)
    | convergent_lines(X1,esk2_0)
    | ~ convergent_lines(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | convergent_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ convergent_lines(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_23,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ( convergent_lines(X1,esk2_0)
    | convergent_lines(X1,esk3_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_25,plain,
    ( convergent_lines(X1,X2)
    | unorthogonal_lines(X1,X3)
    | ~ convergent_lines(X3,X2)
    | ~ unorthogonal_lines(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_26,negated_conjecture,
    convergent_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    ( unorthogonal_lines(X1,esk2_0)
    | convergent_lines(X1,esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_27]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GEO219+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n009.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 2400
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Oct  3 06:49:44 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.18/0.47  Running first-order theorem proving
% 0.18/0.47  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.UFdKysyPoe/E---3.1_26319.p
% 0.18/0.48  # Version: 3.1pre001
% 0.18/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # new_bool_1 with pid 26399 completed with status 0
% 0.18/0.48  # Result found by new_bool_1
% 0.18/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.18/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48  # SAT001_MinMin_p005000_rr_RG with pid 26401 completed with status 0
% 0.18/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.18/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48  # Preprocessing time       : 0.001 s
% 0.18/0.48  # Presaturation interreduction done
% 0.18/0.48  
% 0.18/0.48  # Proof found!
% 0.18/0.48  # SZS status Theorem
% 0.18/0.48  # SZS output start CNFRefutation
% See solution above
% 0.18/0.48  # Parsed axioms                        : 18
% 0.18/0.48  # Removed by relevancy pruning/SinE    : 12
% 0.18/0.48  # Initial clauses                      : 11
% 0.18/0.48  # Removed in clause preprocessing      : 0
% 0.18/0.48  # Initial clauses in saturation        : 11
% 0.18/0.48  # Processed clauses                    : 52
% 0.18/0.48  # ...of these trivial                  : 0
% 0.18/0.48  # ...subsumed                          : 11
% 0.18/0.48  # ...remaining for further processing  : 41
% 0.18/0.48  # Other redundant clauses eliminated   : 0
% 0.18/0.48  # Clauses deleted for lack of memory   : 0
% 0.18/0.48  # Backward-subsumed                    : 2
% 0.18/0.48  # Backward-rewritten                   : 0
% 0.18/0.48  # Generated clauses                    : 109
% 0.18/0.48  # ...of the previous two non-redundant : 87
% 0.18/0.48  # ...aggressively subsumed             : 0
% 0.18/0.48  # Contextual simplify-reflections      : 1
% 0.18/0.48  # Paramodulations                      : 103
% 0.18/0.48  # Factorizations                       : 6
% 0.18/0.48  # NegExts                              : 0
% 0.18/0.48  # Equation resolutions                 : 0
% 0.18/0.48  # Total rewrite steps                  : 17
% 0.18/0.48  # Propositional unsat checks           : 0
% 0.18/0.48  #    Propositional check models        : 0
% 0.18/0.48  #    Propositional check unsatisfiable : 0
% 0.18/0.48  #    Propositional clauses             : 0
% 0.18/0.48  #    Propositional clauses after purity: 0
% 0.18/0.48  #    Propositional unsat core size     : 0
% 0.18/0.48  #    Propositional preprocessing time  : 0.000
% 0.18/0.48  #    Propositional encoding time       : 0.000
% 0.18/0.48  #    Propositional solver time         : 0.000
% 0.18/0.48  #    Success case prop preproc time    : 0.000
% 0.18/0.48  #    Success case prop encoding time   : 0.000
% 0.18/0.48  #    Success case prop solver time     : 0.000
% 0.18/0.48  # Current number of processed clauses  : 29
% 0.18/0.48  #    Positive orientable unit clauses  : 7
% 0.18/0.48  #    Positive unorientable unit clauses: 0
% 0.18/0.48  #    Negative unit clauses             : 3
% 0.18/0.48  #    Non-unit-clauses                  : 19
% 0.18/0.48  # Current number of unprocessed clauses: 55
% 0.18/0.48  # ...number of literals in the above   : 225
% 0.18/0.48  # Current number of archived formulas  : 0
% 0.18/0.48  # Current number of archived clauses   : 12
% 0.18/0.48  # Clause-clause subsumption calls (NU) : 138
% 0.18/0.48  # Rec. Clause-clause subsumption calls : 108
% 0.18/0.48  # Non-unit clause-clause subsumptions  : 9
% 0.18/0.48  # Unit Clause-clause subsumption calls : 12
% 0.18/0.48  # Rewrite failures with RHS unbound    : 0
% 0.18/0.48  # BW rewrite match attempts            : 1
% 0.18/0.48  # BW rewrite match successes           : 1
% 0.18/0.48  # Condensation attempts                : 0
% 0.18/0.48  # Condensation successes               : 0
% 0.18/0.48  # Termbank termtop insertions          : 1956
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.004 s
% 0.18/0.48  # System time              : 0.002 s
% 0.18/0.48  # Total time               : 0.006 s
% 0.18/0.48  # Maximum resident set size: 1764 pages
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.004 s
% 0.18/0.48  # System time              : 0.005 s
% 0.18/0.48  # Total time               : 0.010 s
% 0.18/0.48  # Maximum resident set size: 1692 pages
% 0.18/0.48  % E---3.1 exiting
% 0.18/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------