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

View Problem - Process Solution

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

% Computer : n006.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:40 EDT 2024

% Result   : Theorem 0.17s 0.48s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   38 (  15   ~;  11   |;   8   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   6 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(a2_defns,axiom,
    ! [X1,X2] :
      ( right_apart_point(X1,X2)
    <=> left_apart_point(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox/tmp/tmp.nABW8M3ehf/E---3.1_11599.p',a2_defns) ).

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

fof(con,conjecture,
    ! [X3,X6,X4] :
      ( ( apart_point_and_line(X3,X4)
        & incident_point_and_line(X6,parallel_through_point(X4,X3)) )
     => apart_point_and_line(X6,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.nABW8M3ehf/E---3.1_11599.p',con) ).

fof(a6_defns,axiom,
    ! [X3,X4] :
      ( apart_point_and_line(X3,X4)
    <=> ( left_apart_point(X3,X4)
        | right_apart_point(X3,X4) ) ),
    file('/export/starexec/sandbox/tmp/tmp.nABW8M3ehf/E---3.1_11599.p',a6_defns) ).

fof(c_0_4,plain,
    ! [X11,X12] :
      ( ( ~ right_apart_point(X11,X12)
        | left_apart_point(X11,reverse_line(X12)) )
      & ( ~ left_apart_point(X11,reverse_line(X12))
        | right_apart_point(X11,X12) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_defns])])]) ).

fof(c_0_5,plain,
    ! [X52,X53] :
      ( ~ left_apart_point(X52,X53)
      & ~ left_apart_point(X52,reverse_line(X53)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax10_basics])])]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X3,X6,X4] :
        ( ( apart_point_and_line(X3,X4)
          & incident_point_and_line(X6,parallel_through_point(X4,X3)) )
       => apart_point_and_line(X6,X4) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_7,plain,
    ! [X19,X20] :
      ( ( ~ apart_point_and_line(X19,X20)
        | left_apart_point(X19,X20)
        | right_apart_point(X19,X20) )
      & ( ~ left_apart_point(X19,X20)
        | apart_point_and_line(X19,X20) )
      & ( ~ right_apart_point(X19,X20)
        | apart_point_and_line(X19,X20) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a6_defns])])])]) ).

cnf(c_0_8,plain,
    ( left_apart_point(X1,reverse_line(X2))
    | ~ right_apart_point(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

fof(c_0_10,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk3_0)
    & incident_point_and_line(esk2_0,parallel_through_point(esk3_0,esk1_0))
    & ~ apart_point_and_line(esk2_0,esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

cnf(c_0_11,plain,
    ( left_apart_point(X1,X2)
    | right_apart_point(X1,X2)
    | ~ apart_point_and_line(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ~ right_apart_point(X1,X2),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    apart_point_and_line(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ~ apart_point_and_line(X1,X2),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_11,c_0_12]),c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12  % Problem    : GEO253+3 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.13  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n006.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Fri May  3 18:41:23 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.17/0.46  Running first-order theorem proving
% 0.17/0.46  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.nABW8M3ehf/E---3.1_11599.p
% 0.17/0.48  # Version: 3.1.0
% 0.17/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48  # Starting sh5l with 300s (1) cores
% 0.17/0.48  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11677 completed with status 0
% 0.17/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48  # No SInE strategy applied
% 0.17/0.48  # Search class: FGHNS-FFMF21-SFFFFFNN
% 0.17/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.48  # Starting new_bool_3 with 136s (1) cores
% 0.17/0.48  # Starting new_bool_1 with 136s (1) cores
% 0.17/0.48  # Starting sh5l with 136s (1) cores
% 0.17/0.48  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 11684 completed with status 0
% 0.17/0.48  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48  # No SInE strategy applied
% 0.17/0.48  # Search class: FGHNS-FFMF21-SFFFFFNN
% 0.17/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.48  # Preprocessing time       : 0.001 s
% 0.17/0.48  # Presaturation interreduction done
% 0.17/0.48  
% 0.17/0.48  # Proof found!
% 0.17/0.48  # SZS status Theorem
% 0.17/0.48  # SZS output start CNFRefutation
% See solution above
% 0.17/0.48  # Parsed axioms                        : 37
% 0.17/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.17/0.48  # Initial clauses                      : 69
% 0.17/0.48  # Removed in clause preprocessing      : 0
% 0.17/0.48  # Initial clauses in saturation        : 69
% 0.17/0.48  # Processed clauses                    : 40
% 0.17/0.48  # ...of these trivial                  : 0
% 0.17/0.48  # ...subsumed                          : 5
% 0.17/0.48  # ...remaining for further processing  : 35
% 0.17/0.48  # Other redundant clauses eliminated   : 0
% 0.17/0.48  # Clauses deleted for lack of memory   : 0
% 0.17/0.48  # Backward-subsumed                    : 7
% 0.17/0.48  # Backward-rewritten                   : 0
% 0.17/0.48  # Generated clauses                    : 1
% 0.17/0.48  # ...of the previous two non-redundant : 0
% 0.17/0.48  # ...aggressively subsumed             : 0
% 0.17/0.48  # Contextual simplify-reflections      : 0
% 0.17/0.48  # Paramodulations                      : 0
% 0.17/0.48  # Factorizations                       : 0
% 0.17/0.48  # NegExts                              : 0
% 0.17/0.48  # Equation resolutions                 : 0
% 0.17/0.48  # Disequality decompositions           : 0
% 0.17/0.48  # Total rewrite steps                  : 0
% 0.17/0.48  # ...of those cached                   : 0
% 0.17/0.48  # Propositional unsat checks           : 0
% 0.17/0.48  #    Propositional check models        : 0
% 0.17/0.48  #    Propositional check unsatisfiable : 0
% 0.17/0.48  #    Propositional clauses             : 0
% 0.17/0.48  #    Propositional clauses after purity: 0
% 0.17/0.48  #    Propositional unsat core size     : 0
% 0.17/0.48  #    Propositional preprocessing time  : 0.000
% 0.17/0.48  #    Propositional encoding time       : 0.000
% 0.17/0.48  #    Propositional solver time         : 0.000
% 0.17/0.48  #    Success case prop preproc time    : 0.000
% 0.17/0.48  #    Success case prop encoding time   : 0.000
% 0.17/0.48  #    Success case prop solver time     : 0.000
% 0.17/0.48  # Current number of processed clauses  : 27
% 0.17/0.48  #    Positive orientable unit clauses  : 3
% 0.17/0.48  #    Positive unorientable unit clauses: 0
% 0.17/0.48  #    Negative unit clauses             : 8
% 0.17/0.48  #    Non-unit-clauses                  : 16
% 0.17/0.48  # Current number of unprocessed clauses: 29
% 0.17/0.48  # ...number of literals in the above   : 104
% 0.17/0.48  # Current number of archived formulas  : 0
% 0.17/0.48  # Current number of archived clauses   : 8
% 0.17/0.48  # Clause-clause subsumption calls (NU) : 118
% 0.17/0.48  # Rec. Clause-clause subsumption calls : 96
% 0.17/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.48  # Unit Clause-clause subsumption calls : 65
% 0.17/0.48  # Rewrite failures with RHS unbound    : 0
% 0.17/0.48  # BW rewrite match attempts            : 0
% 0.17/0.48  # BW rewrite match successes           : 0
% 0.17/0.48  # Condensation attempts                : 0
% 0.17/0.48  # Condensation successes               : 0
% 0.17/0.48  # Termbank termtop insertions          : 3989
% 0.17/0.48  # Search garbage collected termcells   : 738
% 0.17/0.48  
% 0.17/0.48  # -------------------------------------------------
% 0.17/0.48  # User time                : 0.005 s
% 0.17/0.48  # System time              : 0.003 s
% 0.17/0.48  # Total time               : 0.008 s
% 0.17/0.48  # Maximum resident set size: 1904 pages
% 0.17/0.48  
% 0.17/0.48  # -------------------------------------------------
% 0.17/0.48  # User time                : 0.014 s
% 0.17/0.48  # System time              : 0.009 s
% 0.17/0.48  # Total time               : 0.023 s
% 0.17/0.48  # Maximum resident set size: 1740 pages
% 0.17/0.48  % E---3.1 exiting
% 0.17/0.48  % E exiting
%------------------------------------------------------------------------------