TSTP Solution File: GEO237+3 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n022.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:35 EDT 2023

% Result   : Theorem 408.17s 136.52s
% Output   : CNFRefutation 408.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   42 (  16   ~;  13   |;   7   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   30 (   6 sgn;  20   !;   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.Gon85ZF1s2/E---3.1_21280.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.Gon85ZF1s2/E---3.1_21280.p',ax10_basics) ).

fof(con,conjecture,
    ! [X3,X6,X7,X4] :
      ( apart_point_and_line(X7,X4)
     => ( divides_points(X4,X3,X6)
       => ( divides_points(X4,X3,X7)
          | divides_points(X4,X6,X7) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.Gon85ZF1s2/E---3.1_21280.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.Gon85ZF1s2/E---3.1_21280.p',a6_defns) ).

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

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

fof(c_0_6,negated_conjecture,
    ~ ! [X3,X6,X7,X4] :
        ( apart_point_and_line(X7,X4)
       => ( divides_points(X4,X3,X6)
         => ( divides_points(X4,X3,X7)
            | divides_points(X4,X6,X7) ) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_7,plain,
    ! [X25,X26] :
      ( ( ~ apart_point_and_line(X25,X26)
        | left_apart_point(X25,X26)
        | right_apart_point(X25,X26) )
      & ( ~ left_apart_point(X25,X26)
        | apart_point_and_line(X25,X26) )
      & ( ~ right_apart_point(X25,X26)
        | apart_point_and_line(X25,X26) ) ),
    inference(distribute,[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(esk3_0,esk4_0)
    & divides_points(esk4_0,esk1_0,esk2_0)
    & ~ divides_points(esk4_0,esk1_0,esk3_0)
    & ~ divides_points(esk4_0,esk2_0,esk3_0) ),
    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(esk3_0,esk4_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.07/0.13  % Problem    : GEO237+3 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n022.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Oct  3 06:52:39 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.20/0.50  Running first-order model finding
% 0.20/0.50  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Gon85ZF1s2/E---3.1_21280.p
% 408.17/136.52  # Version: 3.1pre001
% 408.17/136.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.17/136.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.17/136.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.17/136.52  # Starting new_bool_3 with 300s (1) cores
% 408.17/136.52  # Starting new_bool_1 with 300s (1) cores
% 408.17/136.52  # Starting sh5l with 300s (1) cores
% 408.17/136.52  # new_bool_3 with pid 21359 completed with status 0
% 408.17/136.52  # Result found by new_bool_3
% 408.17/136.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.17/136.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.17/136.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.17/136.52  # Starting new_bool_3 with 300s (1) cores
% 408.17/136.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.17/136.52  # Search class: FGHNF-FFMF21-SFFFFFNN
% 408.17/136.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.17/136.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 408.17/136.52  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 21362 completed with status 0
% 408.17/136.52  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 408.17/136.52  # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.17/136.52  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.17/136.52  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.17/136.52  # Starting new_bool_3 with 300s (1) cores
% 408.17/136.52  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.17/136.52  # Search class: FGHNF-FFMF21-SFFFFFNN
% 408.17/136.52  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.17/136.52  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 408.17/136.52  # Preprocessing time       : 0.002 s
% 408.17/136.52  # Presaturation interreduction done
% 408.17/136.52  
% 408.17/136.52  # Proof found!
% 408.17/136.52  # SZS status Theorem
% 408.17/136.52  # SZS output start CNFRefutation
% See solution above
% 408.17/136.52  # Parsed axioms                        : 37
% 408.17/136.52  # Removed by relevancy pruning/SinE    : 19
% 408.17/136.52  # Initial clauses                      : 36
% 408.17/136.52  # Removed in clause preprocessing      : 0
% 408.17/136.52  # Initial clauses in saturation        : 36
% 408.17/136.52  # Processed clauses                    : 19
% 408.17/136.52  # ...of these trivial                  : 0
% 408.17/136.52  # ...subsumed                          : 4
% 408.17/136.52  # ...remaining for further processing  : 15
% 408.17/136.52  # Other redundant clauses eliminated   : 0
% 408.17/136.52  # Clauses deleted for lack of memory   : 0
% 408.17/136.52  # Backward-subsumed                    : 3
% 408.17/136.52  # Backward-rewritten                   : 0
% 408.17/136.52  # Generated clauses                    : 1
% 408.17/136.52  # ...of the previous two non-redundant : 0
% 408.17/136.52  # ...aggressively subsumed             : 0
% 408.17/136.52  # Contextual simplify-reflections      : 0
% 408.17/136.52  # Paramodulations                      : 0
% 408.17/136.52  # Factorizations                       : 0
% 408.17/136.52  # NegExts                              : 0
% 408.17/136.52  # Equation resolutions                 : 0
% 408.17/136.52  # Total rewrite steps                  : 0
% 408.17/136.52  # Propositional unsat checks           : 0
% 408.17/136.52  #    Propositional check models        : 0
% 408.17/136.52  #    Propositional check unsatisfiable : 0
% 408.17/136.52  #    Propositional clauses             : 0
% 408.17/136.52  #    Propositional clauses after purity: 0
% 408.17/136.52  #    Propositional unsat core size     : 0
% 408.17/136.52  #    Propositional preprocessing time  : 0.000
% 408.17/136.52  #    Propositional encoding time       : 0.000
% 408.17/136.52  #    Propositional solver time         : 0.000
% 408.17/136.52  #    Success case prop preproc time    : 0.000
% 408.17/136.52  #    Success case prop encoding time   : 0.000
% 408.17/136.52  #    Success case prop solver time     : 0.000
% 408.17/136.52  # Current number of processed clauses  : 11
% 408.17/136.52  #    Positive orientable unit clauses  : 2
% 408.17/136.52  #    Positive unorientable unit clauses: 0
% 408.17/136.52  #    Negative unit clauses             : 7
% 408.17/136.52  #    Non-unit-clauses                  : 2
% 408.17/136.52  # Current number of unprocessed clauses: 17
% 408.17/136.52  # ...number of literals in the above   : 55
% 408.17/136.52  # Current number of archived formulas  : 0
% 408.17/136.52  # Current number of archived clauses   : 4
% 408.17/136.52  # Clause-clause subsumption calls (NU) : 2
% 408.17/136.52  # Rec. Clause-clause subsumption calls : 2
% 408.17/136.52  # Non-unit clause-clause subsumptions  : 0
% 408.17/136.52  # Unit Clause-clause subsumption calls : 11
% 408.17/136.52  # Rewrite failures with RHS unbound    : 0
% 408.17/136.52  # BW rewrite match attempts            : 1
% 408.17/136.52  # BW rewrite match successes           : 0
% 408.17/136.52  # Condensation attempts                : 0
% 408.17/136.52  # Condensation successes               : 0
% 408.17/136.52  # Termbank termtop insertions          : 1838
% 408.17/136.52  
% 408.17/136.52  # -------------------------------------------------
% 408.17/136.52  # User time                : 0.004 s
% 408.17/136.52  # System time              : 0.003 s
% 408.17/136.52  # Total time               : 0.006 s
% 408.17/136.52  # Maximum resident set size: 1856 pages
% 408.17/136.52  
% 408.17/136.52  # -------------------------------------------------
% 408.17/136.52  # User time                : 0.006 s
% 408.17/136.52  # System time              : 0.004 s
% 408.17/136.52  # Total time               : 0.010 s
% 408.17/136.52  # Maximum resident set size: 1724 pages
% 408.17/136.52  % E---3.1 exiting
%------------------------------------------------------------------------------