TSTP Solution File: GEO262+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO262+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n009.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  : 600s
% DateTime : Sat Jul 16 04:05:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X2,X3,X6,X1,X4,X5] :
      ( ( between_on_line(X2,X1,X4,X5)
        & convergent_lines(X2,X3)
        & ~ apart_point_and_line(X4,X3)
        & convergent_lines(X2,X6)
        & convergent_lines(X3,X6)
        & ~ apart_point_and_line(X4,X6) )
     => between_on_line(X3,intersection_point(X3,parallel_through_point(X6,X1)),X4,intersection_point(X3,parallel_through_point(X6,X5))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).

fof(oag11,axiom,
    ! [X2,X3] :
      ~ ( left_convergent_lines(X2,X3)
        | left_convergent_lines(X2,reverse_line(X3)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).

fof(con_def,axiom,
    ! [X2,X3] :
      ( convergent_lines(X2,X3)
    <=> ( unequally_directed_lines(X2,X3)
        & unequally_directed_lines(X2,reverse_line(X3)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',con_def) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X2,X3,X6,X1,X4,X5] :
        ( ( between_on_line(X2,X1,X4,X5)
          & convergent_lines(X2,X3)
          & ~ apart_point_and_line(X4,X3)
          & convergent_lines(X2,X6)
          & convergent_lines(X3,X6)
          & ~ apart_point_and_line(X4,X6) )
       => between_on_line(X3,intersection_point(X3,parallel_through_point(X6,X1)),X4,intersection_point(X3,parallel_through_point(X6,X5))) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_5,plain,
    ! [X4,X5] :
      ( ~ unequally_directed_lines(X4,X5)
      | ~ unequally_directed_lines(X4,reverse_line(X5))
      | left_convergent_lines(X4,X5)
      | left_convergent_lines(X4,reverse_line(X5)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])]) ).

fof(c_0_6,plain,
    ! [X4,X5,X4,X5] :
      ( ~ left_convergent_lines(X4,X5)
      & ~ left_convergent_lines(X4,reverse_line(X5)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])])]) ).

fof(c_0_7,plain,
    ! [X4,X5,X4,X5] :
      ( ( unequally_directed_lines(X4,X5)
        | ~ convergent_lines(X4,X5) )
      & ( unequally_directed_lines(X4,reverse_line(X5))
        | ~ convergent_lines(X4,X5) )
      & ( ~ unequally_directed_lines(X4,X5)
        | ~ unequally_directed_lines(X4,reverse_line(X5))
        | convergent_lines(X4,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con_def])])])])]) ).

fof(c_0_8,negated_conjecture,
    ( between_on_line(esk1_0,esk4_0,esk5_0,esk6_0)
    & convergent_lines(esk1_0,esk2_0)
    & ~ apart_point_and_line(esk5_0,esk2_0)
    & convergent_lines(esk1_0,esk3_0)
    & convergent_lines(esk2_0,esk3_0)
    & ~ apart_point_and_line(esk5_0,esk3_0)
    & ~ between_on_line(esk2_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk4_0)),esk5_0,intersection_point(esk2_0,parallel_through_point(esk3_0,esk6_0))) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])]) ).

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

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

cnf(c_0_11,plain,
    ( unequally_directed_lines(X1,reverse_line(X2))
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    convergent_lines(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

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_9,c_0_10]),c_0_10]) ).

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

cnf(c_0_16,negated_conjecture,
    unequally_directed_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO262+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.07/0.14  % Command  : run_ET %s %d
% 0.14/0.35  % Computer : n009.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 : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jun 18 12:35:52 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.25/1.43  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43  # Preprocessing time       : 0.018 s
% 0.25/1.43  
% 0.25/1.43  # Proof found!
% 0.25/1.43  # SZS status Theorem
% 0.25/1.43  # SZS output start CNFRefutation
% See solution above
% 0.25/1.43  # Proof object total steps             : 18
% 0.25/1.43  # Proof object clause steps            : 9
% 0.25/1.43  # Proof object formula steps           : 9
% 0.25/1.43  # Proof object conjectures             : 7
% 0.25/1.43  # Proof object clause conjectures      : 4
% 0.25/1.43  # Proof object formula conjectures     : 3
% 0.25/1.43  # Proof object initial clauses used    : 5
% 0.25/1.43  # Proof object initial formulas used   : 4
% 0.25/1.43  # Proof object generating inferences   : 3
% 0.25/1.43  # Proof object simplifying inferences  : 4
% 0.25/1.43  # Training examples: 0 positive, 0 negative
% 0.25/1.43  # Parsed axioms                        : 32
% 0.25/1.43  # Removed by relevancy pruning/SinE    : 6
% 0.25/1.43  # Initial clauses                      : 54
% 0.25/1.43  # Removed in clause preprocessing      : 0
% 0.25/1.43  # Initial clauses in saturation        : 54
% 0.25/1.43  # Processed clauses                    : 62
% 0.25/1.43  # ...of these trivial                  : 0
% 0.25/1.43  # ...subsumed                          : 20
% 0.25/1.43  # ...remaining for further processing  : 42
% 0.25/1.43  # Other redundant clauses eliminated   : 0
% 0.25/1.43  # Clauses deleted for lack of memory   : 0
% 0.25/1.43  # Backward-subsumed                    : 3
% 0.25/1.43  # Backward-rewritten                   : 0
% 0.25/1.43  # Generated clauses                    : 32
% 0.25/1.43  # ...of the previous two non-trivial   : 21
% 0.25/1.43  # Contextual simplify-reflections      : 7
% 0.25/1.43  # Paramodulations                      : 32
% 0.25/1.43  # Factorizations                       : 0
% 0.25/1.43  # Equation resolutions                 : 0
% 0.25/1.43  # Current number of processed clauses  : 39
% 0.25/1.43  #    Positive orientable unit clauses  : 8
% 0.25/1.43  #    Positive unorientable unit clauses: 0
% 0.25/1.43  #    Negative unit clauses             : 10
% 0.25/1.43  #    Non-unit-clauses                  : 21
% 0.25/1.43  # Current number of unprocessed clauses: 13
% 0.25/1.43  # ...number of literals in the above   : 25
% 0.25/1.43  # Current number of archived formulas  : 0
% 0.25/1.43  # Current number of archived clauses   : 3
% 0.25/1.43  # Clause-clause subsumption calls (NU) : 162
% 0.25/1.43  # Rec. Clause-clause subsumption calls : 116
% 0.25/1.43  # Non-unit clause-clause subsumptions  : 15
% 0.25/1.43  # Unit Clause-clause subsumption calls : 39
% 0.25/1.43  # Rewrite failures with RHS unbound    : 0
% 0.25/1.43  # BW rewrite match attempts            : 0
% 0.25/1.43  # BW rewrite match successes           : 0
% 0.25/1.43  # Condensation attempts                : 0
% 0.25/1.43  # Condensation successes               : 0
% 0.25/1.43  # Termbank termtop insertions          : 3393
% 0.25/1.43  
% 0.25/1.43  # -------------------------------------------------
% 0.25/1.43  # User time                : 0.018 s
% 0.25/1.43  # System time              : 0.003 s
% 0.25/1.43  # Total time               : 0.020 s
% 0.25/1.43  # Maximum resident set size: 3064 pages
% 0.25/23.43  eprover: CPU time limit exceeded, terminating
% 0.25/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46  eprover: No such file or directory
% 0.25/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49  eprover: No such file or directory
% 0.25/23.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.50  eprover: No such file or directory
%------------------------------------------------------------------------------