TSTP Solution File: GEO245+3 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GEO245+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.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:21 EDT 2023

% Result   : Theorem 407.91s 136.68s
% Output   : CNFRefutation 407.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    8 (   3 unt;   0 def)
%            Number of atoms       :   16 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   14 (   6   ~;   1   |;   3   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   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;   3 con; 0-2 aty)
%            Number of variables   :   12 (   2 sgn;  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X3,X6,X7] :
      ( distinct_points(X3,X6)
     => ( left_apart_point(X7,line_connecting(X3,X6))
       => right_apart_point(X6,line_connecting(X3,X7)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.LmFweT8f1G/E---3.1_28315.p',con) ).

fof(ax10_basics,axiom,
    ! [X3,X4] :
      ~ ( left_apart_point(X3,X4)
        | left_apart_point(X3,reverse_line(X4)) ),
    file('/export/starexec/sandbox2/tmp/tmp.LmFweT8f1G/E---3.1_28315.p',ax10_basics) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X3,X6,X7] :
        ( distinct_points(X3,X6)
       => ( left_apart_point(X7,line_connecting(X3,X6))
         => right_apart_point(X6,line_connecting(X3,X7)) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_3,negated_conjecture,
    ( distinct_points(esk1_0,esk2_0)
    & left_apart_point(esk3_0,line_connecting(esk1_0,esk2_0))
    & ~ right_apart_point(esk2_0,line_connecting(esk1_0,esk3_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X23,X24] :
      ( ~ left_apart_point(X23,X24)
      & ~ left_apart_point(X23,reverse_line(X24)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])]) ).

cnf(c_0_5,negated_conjecture,
    left_apart_point(esk3_0,line_connecting(esk1_0,esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ~ left_apart_point(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_5,c_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14  % Problem    : GEO245+3 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.15  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n002.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 2400
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Tue Oct  3 07:05:00 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.23/0.51  Running first-order theorem proving
% 0.23/0.51  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.LmFweT8f1G/E---3.1_28315.p
% 407.91/136.68  # Version: 3.1pre001
% 407.91/136.68  # Preprocessing class: FSMSSMSSSSSNFFN.
% 407.91/136.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 407.91/136.68  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 407.91/136.68  # Starting new_bool_3 with 300s (1) cores
% 407.91/136.68  # Starting new_bool_1 with 300s (1) cores
% 407.91/136.68  # Starting sh5l with 300s (1) cores
% 407.91/136.68  # new_bool_3 with pid 28394 completed with status 0
% 407.91/136.68  # Result found by new_bool_3
% 407.91/136.68  # Preprocessing class: FSMSSMSSSSSNFFN.
% 407.91/136.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 407.91/136.68  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 407.91/136.68  # Starting new_bool_3 with 300s (1) cores
% 407.91/136.68  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 407.91/136.68  # Search class: FGHNS-FFMF21-SFFFFFNN
% 407.91/136.68  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 407.91/136.68  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 407.91/136.68  # SAT001_MinMin_p005000_rr_RG with pid 28397 completed with status 0
% 407.91/136.68  # Result found by SAT001_MinMin_p005000_rr_RG
% 407.91/136.68  # Preprocessing class: FSMSSMSSSSSNFFN.
% 407.91/136.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 407.91/136.68  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 407.91/136.68  # Starting new_bool_3 with 300s (1) cores
% 407.91/136.68  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 407.91/136.68  # Search class: FGHNS-FFMF21-SFFFFFNN
% 407.91/136.68  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 407.91/136.68  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 407.91/136.68  # Preprocessing time       : 0.002 s
% 407.91/136.68  # Presaturation interreduction done
% 407.91/136.68  
% 407.91/136.68  # Proof found!
% 407.91/136.68  # SZS status Theorem
% 407.91/136.68  # SZS output start CNFRefutation
% See solution above
% 407.91/136.68  # Parsed axioms                        : 37
% 407.91/136.68  # Removed by relevancy pruning/SinE    : 16
% 407.91/136.68  # Initial clauses                      : 33
% 407.91/136.68  # Removed in clause preprocessing      : 0
% 407.91/136.68  # Initial clauses in saturation        : 33
% 407.91/136.68  # Processed clauses                    : 4
% 407.91/136.68  # ...of these trivial                  : 0
% 407.91/136.68  # ...subsumed                          : 0
% 407.91/136.68  # ...remaining for further processing  : 4
% 407.91/136.68  # Other redundant clauses eliminated   : 0
% 407.91/136.68  # Clauses deleted for lack of memory   : 0
% 407.91/136.68  # Backward-subsumed                    : 0
% 407.91/136.68  # Backward-rewritten                   : 0
% 407.91/136.68  # Generated clauses                    : 1
% 407.91/136.68  # ...of the previous two non-redundant : 0
% 407.91/136.68  # ...aggressively subsumed             : 0
% 407.91/136.68  # Contextual simplify-reflections      : 0
% 407.91/136.68  # Paramodulations                      : 0
% 407.91/136.68  # Factorizations                       : 0
% 407.91/136.68  # NegExts                              : 0
% 407.91/136.68  # Equation resolutions                 : 0
% 407.91/136.68  # Total rewrite steps                  : 0
% 407.91/136.68  # Propositional unsat checks           : 0
% 407.91/136.68  #    Propositional check models        : 0
% 407.91/136.68  #    Propositional check unsatisfiable : 0
% 407.91/136.68  #    Propositional clauses             : 0
% 407.91/136.68  #    Propositional clauses after purity: 0
% 407.91/136.68  #    Propositional unsat core size     : 0
% 407.91/136.68  #    Propositional preprocessing time  : 0.000
% 407.91/136.68  #    Propositional encoding time       : 0.000
% 407.91/136.68  #    Propositional solver time         : 0.000
% 407.91/136.68  #    Success case prop preproc time    : 0.000
% 407.91/136.68  #    Success case prop encoding time   : 0.000
% 407.91/136.68  #    Success case prop solver time     : 0.000
% 407.91/136.68  # Current number of processed clauses  : 3
% 407.91/136.68  #    Positive orientable unit clauses  : 1
% 407.91/136.68  #    Positive unorientable unit clauses: 0
% 407.91/136.68  #    Negative unit clauses             : 2
% 407.91/136.68  #    Non-unit-clauses                  : 0
% 407.91/136.68  # Current number of unprocessed clauses: 29
% 407.91/136.68  # ...number of literals in the above   : 69
% 407.91/136.68  # Current number of archived formulas  : 0
% 407.91/136.68  # Current number of archived clauses   : 1
% 407.91/136.68  # Clause-clause subsumption calls (NU) : 0
% 407.91/136.68  # Rec. Clause-clause subsumption calls : 0
% 407.91/136.68  # Non-unit clause-clause subsumptions  : 0
% 407.91/136.68  # Unit Clause-clause subsumption calls : 0
% 407.91/136.68  # Rewrite failures with RHS unbound    : 0
% 407.91/136.68  # BW rewrite match attempts            : 0
% 407.91/136.68  # BW rewrite match successes           : 0
% 407.91/136.68  # Condensation attempts                : 0
% 407.91/136.68  # Condensation successes               : 0
% 407.91/136.68  # Termbank termtop insertions          : 1704
% 407.91/136.68  
% 407.91/136.68  # -------------------------------------------------
% 407.91/136.68  # User time                : 0.005 s
% 407.91/136.68  # System time              : 0.001 s
% 407.91/136.68  # Total time               : 0.006 s
% 407.91/136.68  # Maximum resident set size: 1848 pages
% 407.91/136.68  
% 407.91/136.68  # -------------------------------------------------
% 407.91/136.68  # User time                : 0.007 s
% 407.91/136.68  # System time              : 0.003 s
% 407.91/136.68  # Total time               : 0.010 s
% 407.91/136.68  # Maximum resident set size: 1720 pages
% 407.91/136.68  % E---3.1 exiting
% 407.91/136.68  % E---3.1 exiting
%------------------------------------------------------------------------------