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

View Problem - Process Solution

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

% Computer : n007.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:43 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X4,X5] :
      ( equally_directed_lines(X4,reverse_line(X5))
     => equally_directed_opposite_lines(X4,X5) ),
    file('/export/starexec/sandbox2/tmp/tmp.t48rwpUzHZ/E---3.1_12197.p',con) ).

fof(a5_defns,axiom,
    ! [X1,X2] :
      ( equally_directed_opposite_lines(X1,X2)
    <=> ~ unequally_directed_opposite_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.t48rwpUzHZ/E---3.1_12197.p',a5_defns) ).

fof(a4_defns,axiom,
    ! [X1,X2] :
      ( equally_directed_lines(X1,X2)
    <=> ~ unequally_directed_lines(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/tmp.t48rwpUzHZ/E---3.1_12197.p',a4_defns) ).

fof(a1_defns,axiom,
    ! [X1,X2] :
      ( unequally_directed_opposite_lines(X1,X2)
    <=> unequally_directed_lines(X1,reverse_line(X2)) ),
    file('/export/starexec/sandbox2/tmp/tmp.t48rwpUzHZ/E---3.1_12197.p',a1_defns) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X4,X5] :
        ( equally_directed_lines(X4,reverse_line(X5))
       => equally_directed_opposite_lines(X4,X5) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_5,plain,
    ! [X1,X2] :
      ( equally_directed_opposite_lines(X1,X2)
    <=> ~ unequally_directed_opposite_lines(X1,X2) ),
    inference(fof_simplification,[status(thm)],[a5_defns]) ).

fof(c_0_6,plain,
    ! [X1,X2] :
      ( equally_directed_lines(X1,X2)
    <=> ~ unequally_directed_lines(X1,X2) ),
    inference(fof_simplification,[status(thm)],[a4_defns]) ).

fof(c_0_7,negated_conjecture,
    ( equally_directed_lines(esk1_0,reverse_line(esk2_0))
    & ~ equally_directed_opposite_lines(esk1_0,esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).

fof(c_0_8,plain,
    ! [X11,X12] :
      ( ( ~ equally_directed_opposite_lines(X11,X12)
        | ~ unequally_directed_opposite_lines(X11,X12) )
      & ( unequally_directed_opposite_lines(X11,X12)
        | equally_directed_opposite_lines(X11,X12) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).

fof(c_0_9,plain,
    ! [X13,X14] :
      ( ( ~ equally_directed_lines(X13,X14)
        | ~ unequally_directed_lines(X13,X14) )
      & ( unequally_directed_lines(X13,X14)
        | equally_directed_lines(X13,X14) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

fof(c_0_10,plain,
    ! [X23,X24] :
      ( ( ~ unequally_directed_opposite_lines(X23,X24)
        | unequally_directed_lines(X23,reverse_line(X24)) )
      & ( ~ unequally_directed_lines(X23,reverse_line(X24))
        | unequally_directed_opposite_lines(X23,X24) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a1_defns])]) ).

cnf(c_0_11,negated_conjecture,
    ~ equally_directed_opposite_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( unequally_directed_opposite_lines(X1,X2)
    | equally_directed_opposite_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ equally_directed_lines(X1,X2)
    | ~ unequally_directed_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,negated_conjecture,
    equally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_opposite_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    unequally_directed_opposite_lines(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
    [proof] ).

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