TSTP Solution File: GEO216+2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : GEO216+2 : TPTP v8.2.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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 : Mon May 20 19:58:40 EDT 2024

% Result   : Theorem 0.23s 0.52s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   13 (   9 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (  15   ~;   2   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   14 (   0 sgn  11   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X6] :
      ~ ~ unorthogonal_lines(X6,X6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

fof(coipo1,axiom,
    ! [X6,X7] :
      ~ ( ~ convergent_lines(X6,X7)
        & ~ unorthogonal_lines(X6,X7) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+4.ax',coipo1) ).

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart3) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X6] : unorthogonal_lines(X6,X6),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

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

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

fof(c_0_6,negated_conjecture,
    ~ unorthogonal_lines(esk1_0,esk1_0),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_7,plain,
    ! [X10,X11] :
      ( convergent_lines(X10,X11)
      | unorthogonal_lines(X10,X11) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

fof(c_0_8,plain,
    ! [X18] : ~ convergent_lines(X18,X18),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).

cnf(c_0_9,negated_conjecture,
    ~ unorthogonal_lines(esk1_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_11,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GEO216+2 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.38  % Computer : n013.cluster.edu
% 0.14/0.38  % Model    : x86_64 x86_64
% 0.14/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38  % Memory   : 8042.1875MB
% 0.14/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38  % CPULimit   : 300
% 0.14/0.38  % WCLimit    : 300
% 0.14/0.38  % DateTime   : Sun May 19 14:18:23 EDT 2024
% 0.14/0.38  % CPUTime    : 
% 0.23/0.50  Running first-order theorem proving
% 0.23/0.50  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/benchmark/theBenchmark.p
% 0.23/0.52  # Version: 3.1.0
% 0.23/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52  # Starting new_bool_1 with 300s (1) cores
% 0.23/0.52  # Starting sh5l with 300s (1) cores
% 0.23/0.52  # new_bool_3 with pid 9914 completed with status 0
% 0.23/0.52  # Result found by new_bool_3
% 0.23/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.52  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.23/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.52  # SAT001_MinMin_p005000_rr_RG with pid 9918 completed with status 0
% 0.23/0.52  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.23/0.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/0.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/0.52  # Starting new_bool_3 with 300s (1) cores
% 0.23/0.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/0.52  # Search class: FGUNF-FFSF00-SFFFFFNN
% 0.23/0.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.23/0.52  # Preprocessing time       : 0.001 s
% 0.23/0.52  # Presaturation interreduction done
% 0.23/0.52  
% 0.23/0.52  # Proof found!
% 0.23/0.52  # SZS status Theorem
% 0.23/0.52  # SZS output start CNFRefutation
% See solution above
% 0.23/0.52  # Parsed axioms                        : 16
% 0.23/0.52  # Removed by relevancy pruning/SinE    : 5
% 0.23/0.52  # Initial clauses                      : 14
% 0.23/0.52  # Removed in clause preprocessing      : 0
% 0.23/0.52  # Initial clauses in saturation        : 14
% 0.23/0.52  # Processed clauses                    : 18
% 0.23/0.52  # ...of these trivial                  : 0
% 0.23/0.52  # ...subsumed                          : 1
% 0.23/0.52  # ...remaining for further processing  : 17
% 0.23/0.52  # Other redundant clauses eliminated   : 0
% 0.23/0.52  # Clauses deleted for lack of memory   : 0
% 0.23/0.52  # Backward-subsumed                    : 0
% 0.23/0.52  # Backward-rewritten                   : 0
% 0.23/0.52  # Generated clauses                    : 1
% 0.23/0.52  # ...of the previous two non-redundant : 0
% 0.23/0.52  # ...aggressively subsumed             : 0
% 0.23/0.52  # Contextual simplify-reflections      : 0
% 0.23/0.52  # Paramodulations                      : 1
% 0.23/0.52  # Factorizations                       : 0
% 0.23/0.52  # NegExts                              : 0
% 0.23/0.52  # Equation resolutions                 : 0
% 0.23/0.52  # Disequality decompositions           : 0
% 0.23/0.52  # Total rewrite steps                  : 0
% 0.23/0.52  # ...of those cached                   : 0
% 0.23/0.52  # Propositional unsat checks           : 0
% 0.23/0.52  #    Propositional check models        : 0
% 0.23/0.52  #    Propositional check unsatisfiable : 0
% 0.23/0.52  #    Propositional clauses             : 0
% 0.23/0.52  #    Propositional clauses after purity: 0
% 0.23/0.52  #    Propositional unsat core size     : 0
% 0.23/0.52  #    Propositional preprocessing time  : 0.000
% 0.23/0.52  #    Propositional encoding time       : 0.000
% 0.23/0.52  #    Propositional solver time         : 0.000
% 0.23/0.52  #    Success case prop preproc time    : 0.000
% 0.23/0.52  #    Success case prop encoding time   : 0.000
% 0.23/0.52  #    Success case prop solver time     : 0.000
% 0.23/0.52  # Current number of processed clauses  : 4
% 0.23/0.52  #    Positive orientable unit clauses  : 0
% 0.23/0.52  #    Positive unorientable unit clauses: 0
% 0.23/0.52  #    Negative unit clauses             : 3
% 0.23/0.52  #    Non-unit-clauses                  : 1
% 0.23/0.52  # Current number of unprocessed clauses: 9
% 0.23/0.52  # ...number of literals in the above   : 32
% 0.23/0.52  # Current number of archived formulas  : 0
% 0.23/0.52  # Current number of archived clauses   : 13
% 0.23/0.52  # Clause-clause subsumption calls (NU) : 15
% 0.23/0.52  # Rec. Clause-clause subsumption calls : 15
% 0.23/0.52  # Non-unit clause-clause subsumptions  : 1
% 0.23/0.52  # Unit Clause-clause subsumption calls : 0
% 0.23/0.52  # Rewrite failures with RHS unbound    : 0
% 0.23/0.52  # BW rewrite match attempts            : 0
% 0.23/0.52  # BW rewrite match successes           : 0
% 0.23/0.52  # Condensation attempts                : 0
% 0.23/0.52  # Condensation successes               : 0
% 0.23/0.52  # Termbank termtop insertions          : 1054
% 0.23/0.52  # Search garbage collected termcells   : 196
% 0.23/0.52  
% 0.23/0.52  # -------------------------------------------------
% 0.23/0.52  # User time                : 0.004 s
% 0.23/0.52  # System time              : 0.001 s
% 0.23/0.52  # Total time               : 0.005 s
% 0.23/0.52  # Maximum resident set size: 1748 pages
% 0.23/0.52  
% 0.23/0.52  # -------------------------------------------------
% 0.23/0.52  # User time                : 0.005 s
% 0.23/0.52  # System time              : 0.003 s
% 0.23/0.52  # Total time               : 0.009 s
% 0.23/0.52  # Maximum resident set size: 1716 pages
% 0.23/0.52  % E---3.1 exiting
% 0.23/0.52  % E exiting
%------------------------------------------------------------------------------