TSTP Solution File: GEO231+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GEO231+1 : TPTP v8.1.2. Bugfixed v6.4.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:32:17 EDT 2023

% Result   : Theorem 0.48s 0.54s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  10 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   65 (  29   ~;  26   |;   6   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   45 (   2 sgn;  23   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X2,X3,X6] :
      ( ( ~ unequally_directed_lines(X2,reverse_line(X3))
        & ~ unequally_directed_lines(X2,X6) )
     => ~ unequally_directed_lines(X3,reverse_line(X6)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9ywuIY3Qmz/E---3.1_23724.p',con) ).

fof(oag9,axiom,
    ! [X2,X3] :
      ( ( unequally_directed_lines(X2,X3)
        & unequally_directed_lines(X2,reverse_line(X3)) )
     => ( left_convergent_lines(X2,X3)
        | left_convergent_lines(X2,reverse_line(X3)) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9ywuIY3Qmz/E---3.1_23724.p',oag9) ).

fof(oag11,axiom,
    ! [X2,X3] :
      ~ ( left_convergent_lines(X2,X3)
        | left_convergent_lines(X2,reverse_line(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.9ywuIY3Qmz/E---3.1_23724.p',oag11) ).

fof(oag6,axiom,
    ! [X2,X3,X6] :
      ( unequally_directed_lines(X2,X3)
     => ( unequally_directed_lines(X2,X6)
        | unequally_directed_lines(X3,X6) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.9ywuIY3Qmz/E---3.1_23724.p',oag6) ).

fof(oag5,axiom,
    ! [X2] : ~ unequally_directed_lines(X2,X2),
    file('/export/starexec/sandbox2/tmp/tmp.9ywuIY3Qmz/E---3.1_23724.p',oag5) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X2,X3,X6] :
        ( ( ~ unequally_directed_lines(X2,reverse_line(X3))
          & ~ unequally_directed_lines(X2,X6) )
       => ~ unequally_directed_lines(X3,reverse_line(X6)) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).

fof(c_0_6,plain,
    ! [X19,X20] :
      ( ~ unequally_directed_lines(X19,X20)
      | ~ unequally_directed_lines(X19,reverse_line(X20))
      | left_convergent_lines(X19,X20)
      | left_convergent_lines(X19,reverse_line(X20)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).

fof(c_0_7,plain,
    ! [X35,X36] :
      ( ~ left_convergent_lines(X35,X36)
      & ~ left_convergent_lines(X35,reverse_line(X36)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])]) ).

fof(c_0_8,plain,
    ! [X11,X12,X13] :
      ( ~ unequally_directed_lines(X11,X12)
      | unequally_directed_lines(X11,X13)
      | unequally_directed_lines(X12,X13) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])]) ).

fof(c_0_9,negated_conjecture,
    ( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
    & ~ unequally_directed_lines(esk1_0,esk3_0)
    & unequally_directed_lines(esk2_0,reverse_line(esk3_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

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

cnf(c_0_11,plain,
    ~ left_convergent_lines(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( unequally_directed_lines(X1,X3)
    | unequally_directed_lines(X2,X3)
    | ~ unequally_directed_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    unequally_directed_lines(esk2_0,reverse_line(esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( ~ unequally_directed_lines(X1,reverse_line(X2))
    | ~ unequally_directed_lines(X1,X2) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    ( unequally_directed_lines(reverse_line(esk3_0),X1)
    | unequally_directed_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    ( unequally_directed_lines(esk2_0,X1)
    | ~ unequally_directed_lines(reverse_line(esk3_0),reverse_line(X1)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_17,plain,
    ! [X2] : ~ unequally_directed_lines(X2,X2),
    inference(fof_simplification,[status(thm)],[oag5]) ).

cnf(c_0_18,negated_conjecture,
    ( unequally_directed_lines(esk2_0,reverse_line(X1))
    | unequally_directed_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_15]) ).

fof(c_0_19,plain,
    ! [X10] : ~ unequally_directed_lines(X10,X10),
    inference(variable_rename,[status(thm)],[c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),X2)
    | unequally_directed_lines(esk2_0,X1)
    | unequally_directed_lines(esk2_0,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_18]) ).

cnf(c_0_21,plain,
    ~ unequally_directed_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    ( unequally_directed_lines(reverse_line(X1),X2)
    | unequally_directed_lines(esk2_0,X3)
    | unequally_directed_lines(esk2_0,X1)
    | unequally_directed_lines(X3,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_24,negated_conjecture,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | unequally_directed_lines(esk2_0,X2)
    | unequally_directed_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_25,negated_conjecture,
    unequally_directed_lines(esk2_0,esk1_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).

cnf(c_0_26,negated_conjecture,
    ( unequally_directed_lines(esk2_0,X1)
    | unequally_directed_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_25]) ).

cnf(c_0_27,negated_conjecture,
    ( unequally_directed_lines(esk1_0,X1)
    | ~ unequally_directed_lines(esk2_0,reverse_line(X1)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ~ unequally_directed_lines(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_29,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_13]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : GEO231+1 : TPTP v8.1.2. Bugfixed v6.4.0.
% 0.04/0.15  % Command    : run_E %s %d THM
% 0.16/0.36  % Computer : n007.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36  % CPULimit   : 2400
% 0.16/0.36  % WCLimit    : 300
% 0.16/0.36  % DateTime   : Tue Oct  3 06:19:55 EDT 2023
% 0.16/0.36  % CPUTime    : 
% 0.22/0.51  Running first-order theorem proving
% 0.22/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.9ywuIY3Qmz/E---3.1_23724.p
% 0.48/0.54  # Version: 3.1pre001
% 0.48/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.48/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.48/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.48/0.54  # Starting sh5l with 300s (1) cores
% 0.48/0.54  # sh5l with pid 23874 completed with status 0
% 0.48/0.54  # Result found by sh5l
% 0.48/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.48/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.48/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.48/0.54  # Starting sh5l with 300s (1) cores
% 0.48/0.54  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/0.54  # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.48/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.54  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.48/0.54  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 23879 completed with status 0
% 0.48/0.54  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.48/0.54  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.48/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.54  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.48/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.48/0.54  # Starting sh5l with 300s (1) cores
% 0.48/0.54  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.48/0.54  # Search class: FGHNF-FFMF21-SFFFFFNN
% 0.48/0.54  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.54  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.48/0.54  # Preprocessing time       : 0.003 s
% 0.48/0.54  # Presaturation interreduction done
% 0.48/0.54  
% 0.48/0.54  # Proof found!
% 0.48/0.54  # SZS status Theorem
% 0.48/0.54  # SZS output start CNFRefutation
% See solution above
% 0.48/0.54  # Parsed axioms                        : 32
% 0.48/0.54  # Removed by relevancy pruning/SinE    : 2
% 0.48/0.54  # Initial clauses                      : 52
% 0.48/0.54  # Removed in clause preprocessing      : 0
% 0.48/0.54  # Initial clauses in saturation        : 52
% 0.48/0.54  # Processed clauses                    : 109
% 0.48/0.54  # ...of these trivial                  : 0
% 0.48/0.54  # ...subsumed                          : 22
% 0.48/0.54  # ...remaining for further processing  : 87
% 0.48/0.54  # Other redundant clauses eliminated   : 0
% 0.48/0.54  # Clauses deleted for lack of memory   : 0
% 0.48/0.54  # Backward-subsumed                    : 7
% 0.48/0.54  # Backward-rewritten                   : 0
% 0.48/0.54  # Generated clauses                    : 70
% 0.48/0.54  # ...of the previous two non-redundant : 59
% 0.48/0.54  # ...aggressively subsumed             : 0
% 0.48/0.54  # Contextual simplify-reflections      : 0
% 0.48/0.54  # Paramodulations                      : 68
% 0.48/0.54  # Factorizations                       : 2
% 0.48/0.54  # NegExts                              : 0
% 0.48/0.54  # Equation resolutions                 : 0
% 0.48/0.54  # Total rewrite steps                  : 9
% 0.48/0.54  # Propositional unsat checks           : 0
% 0.48/0.54  #    Propositional check models        : 0
% 0.48/0.54  #    Propositional check unsatisfiable : 0
% 0.48/0.54  #    Propositional clauses             : 0
% 0.48/0.54  #    Propositional clauses after purity: 0
% 0.48/0.54  #    Propositional unsat core size     : 0
% 0.48/0.54  #    Propositional preprocessing time  : 0.000
% 0.48/0.54  #    Propositional encoding time       : 0.000
% 0.48/0.54  #    Propositional solver time         : 0.000
% 0.48/0.54  #    Success case prop preproc time    : 0.000
% 0.48/0.54  #    Success case prop encoding time   : 0.000
% 0.48/0.54  #    Success case prop solver time     : 0.000
% 0.48/0.54  # Current number of processed clauses  : 50
% 0.48/0.54  #    Positive orientable unit clauses  : 5
% 0.48/0.54  #    Positive unorientable unit clauses: 0
% 0.48/0.54  #    Negative unit clauses             : 15
% 0.48/0.54  #    Non-unit-clauses                  : 30
% 0.48/0.54  # Current number of unprocessed clauses: 30
% 0.48/0.54  # ...number of literals in the above   : 100
% 0.48/0.54  # Current number of archived formulas  : 0
% 0.48/0.54  # Current number of archived clauses   : 37
% 0.48/0.54  # Clause-clause subsumption calls (NU) : 206
% 0.48/0.54  # Rec. Clause-clause subsumption calls : 145
% 0.48/0.54  # Non-unit clause-clause subsumptions  : 11
% 0.48/0.54  # Unit Clause-clause subsumption calls : 125
% 0.48/0.54  # Rewrite failures with RHS unbound    : 0
% 0.48/0.54  # BW rewrite match attempts            : 0
% 0.48/0.54  # BW rewrite match successes           : 0
% 0.48/0.54  # Condensation attempts                : 0
% 0.48/0.54  # Condensation successes               : 0
% 0.48/0.54  # Termbank termtop insertions          : 3911
% 0.48/0.54  
% 0.48/0.54  # -------------------------------------------------
% 0.48/0.54  # User time                : 0.015 s
% 0.48/0.54  # System time              : 0.004 s
% 0.48/0.54  # Total time               : 0.019 s
% 0.48/0.54  # Maximum resident set size: 1884 pages
% 0.48/0.54  
% 0.48/0.54  # -------------------------------------------------
% 0.48/0.54  # User time                : 0.016 s
% 0.48/0.54  # System time              : 0.008 s
% 0.48/0.54  # Total time               : 0.025 s
% 0.48/0.54  # Maximum resident set size: 1712 pages
% 0.48/0.54  % E---3.1 exiting
% 0.48/0.55  % E---3.1 exiting
%------------------------------------------------------------------------------