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

View Problem - Process Solution

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

% Computer : n020.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:26 EDT 2023

% Result   : Theorem 408.26s 136.54s
% Output   : CNFRefutation 408.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   9 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   7   ~;   3   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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   :   12 (   0 sgn;   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X6] : unorthogonal_lines(X6,X6),
    file('/export/starexec/sandbox2/tmp/tmp.1VS45wbMB6/E---3.1_6596.p',con) ).

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.1VS45wbMB6/E---3.1_6596.p',apart3) ).

fof(occu1,axiom,
    ! [X6,X7] :
      ( convergent_lines(X6,X7)
      | unorthogonal_lines(X6,X7) ),
    file('/export/starexec/sandbox2/tmp/tmp.1VS45wbMB6/E---3.1_6596.p',occu1) ).

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

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

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

fof(c_0_6,plain,
    ! [X11,X12] :
      ( convergent_lines(X11,X12)
      | unorthogonal_lines(X11,X12) ),
    inference(variable_rename,[status(thm)],[occu1]) ).

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

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

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

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

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

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