TSTP Solution File: GEO205+3 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO205+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n019.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:04:40 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  10 unt;   0 def)
%            Number of atoms       :  112 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  107 (  37   ~;  52   |;   9   &)
%                                         (   2 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   73 (   4 sgn  48   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X1,X2,X3] :
      ( ( convergent_lines(X1,X2)
        & equal_lines(X2,X3) )
     => ( convergent_lines(X1,X3)
        & equal_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',con) ).

fof(ax2,axiom,
    ! [X1,X2] :
      ( equal_lines(X1,X2)
    <=> ~ distinct_lines(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax2) ).

fof(ceq3,axiom,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( distinct_lines(X2,X3)
        | convergent_lines(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).

fof(ax1,axiom,
    ! [X1,X2] :
      ( equal_points(X1,X2)
    <=> ~ distinct_points(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+6.ax',ax1) ).

fof(cu1,axiom,
    ! [X1,X2,X4,X5] :
      ( ( distinct_points(X1,X2)
        & distinct_lines(X4,X5) )
     => ( apart_point_and_line(X1,X4)
        | apart_point_and_line(X1,X5)
        | apart_point_and_line(X2,X4)
        | apart_point_and_line(X2,X5) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).

fof(ci3,axiom,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).

fof(apart3,axiom,
    ! [X1] : ~ convergent_lines(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).

fof(ceq2,axiom,
    ! [X1,X2,X3] :
      ( apart_point_and_line(X1,X2)
     => ( distinct_lines(X2,X3)
        | apart_point_and_line(X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).

fof(ci4,axiom,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
     => ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( ( convergent_lines(X1,X2)
          & equal_lines(X2,X3) )
       => ( convergent_lines(X1,X3)
          & equal_points(intersection_point(X1,X2),intersection_point(X1,X3)) ) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_10,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ equal_lines(X3,X4)
        | ~ distinct_lines(X3,X4) )
      & ( distinct_lines(X3,X4)
        | equal_lines(X3,X4) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax2])])])])]) ).

fof(c_0_11,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    & equal_lines(esk2_0,esk3_0)
    & ( ~ convergent_lines(esk1_0,esk3_0)
      | ~ equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)) ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

fof(c_0_12,plain,
    ! [X4,X5,X6] :
      ( ~ convergent_lines(X4,X5)
      | distinct_lines(X5,X6)
      | convergent_lines(X4,X6) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])])]) ).

fof(c_0_13,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ equal_points(X3,X4)
        | ~ distinct_points(X3,X4) )
      & ( distinct_points(X3,X4)
        | equal_points(X3,X4) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax1])])])])]) ).

cnf(c_0_14,plain,
    ( ~ distinct_lines(X1,X2)
    | ~ equal_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    equal_lines(esk2_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,plain,
    ( convergent_lines(X1,X2)
    | distinct_lines(X3,X2)
    | ~ convergent_lines(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    convergent_lines(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

fof(c_0_18,plain,
    ! [X6,X7,X8,X9] :
      ( ~ distinct_points(X6,X7)
      | ~ distinct_lines(X8,X9)
      | apart_point_and_line(X6,X8)
      | apart_point_and_line(X6,X9)
      | apart_point_and_line(X7,X8)
      | apart_point_and_line(X7,X9) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ equal_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
    | ~ convergent_lines(esk1_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_20,plain,
    ( equal_points(X1,X2)
    | distinct_points(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    ~ distinct_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    ( convergent_lines(esk1_0,X1)
    | distinct_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    ( apart_point_and_line(X1,X2)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X4,X2)
    | apart_point_and_line(X4,X3)
    | ~ distinct_lines(X3,X2)
    | ~ distinct_points(X4,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    ( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
    | ~ convergent_lines(esk1_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,negated_conjecture,
    convergent_lines(esk1_0,esk3_0),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

fof(c_0_26,plain,
    ! [X3,X4] :
      ( ~ convergent_lines(X3,X4)
      | ~ apart_point_and_line(intersection_point(X3,X4),X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci3])])]) ).

cnf(c_0_27,negated_conjecture,
    ( apart_point_and_line(X1,esk2_0)
    | apart_point_and_line(X2,esk2_0)
    | apart_point_and_line(X1,X3)
    | apart_point_and_line(X2,X3)
    | convergent_lines(esk1_0,X3)
    | ~ distinct_points(X1,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).

fof(c_0_29,plain,
    ! [X2] : ~ convergent_lines(X2,X2),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[apart3])]) ).

fof(c_0_30,plain,
    ! [X4,X5,X6] :
      ( ~ apart_point_and_line(X4,X5)
      | distinct_lines(X5,X6)
      | apart_point_and_line(X4,X6) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])])]) ).

cnf(c_0_31,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X1)
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_32,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
    | convergent_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

fof(c_0_34,plain,
    ! [X3,X4] :
      ( ~ convergent_lines(X3,X4)
      | ~ apart_point_and_line(intersection_point(X3,X4),X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ci4])])]) ).

cnf(c_0_35,plain,
    ( apart_point_and_line(X1,X2)
    | distinct_lines(X3,X2)
    | ~ apart_point_and_line(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_36,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk3_0),esk2_0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_25])]),c_0_33]) ).

cnf(c_0_37,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X2)
    | ~ convergent_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk3_0),X1)
    | distinct_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
    | apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_25])]),c_0_21]) ).

cnf(c_0_40,negated_conjecture,
    apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_17])]) ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO205+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n019.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 : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 23:59:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.017 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 42
% 0.23/1.42  # Proof object clause steps            : 23
% 0.23/1.42  # Proof object formula steps           : 19
% 0.23/1.42  # Proof object conjectures             : 18
% 0.23/1.42  # Proof object clause conjectures      : 15
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 11
% 0.23/1.42  # Proof object initial formulas used   : 9
% 0.23/1.42  # Proof object generating inferences   : 11
% 0.23/1.42  # Proof object simplifying inferences  : 12
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 36
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 3
% 0.23/1.42  # Initial clauses                      : 43
% 0.23/1.42  # Removed in clause preprocessing      : 0
% 0.23/1.42  # Initial clauses in saturation        : 43
% 0.23/1.42  # Processed clauses                    : 448
% 0.23/1.42  # ...of these trivial                  : 4
% 0.23/1.42  # ...subsumed                          : 180
% 0.23/1.42  # ...remaining for further processing  : 264
% 0.23/1.42  # Other redundant clauses eliminated   : 0
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 13
% 0.23/1.42  # Backward-rewritten                   : 4
% 0.23/1.42  # Generated clauses                    : 3784
% 0.23/1.42  # ...of the previous two non-trivial   : 3342
% 0.23/1.42  # Contextual simplify-reflections      : 90
% 0.23/1.42  # Paramodulations                      : 3600
% 0.23/1.42  # Factorizations                       : 184
% 0.23/1.42  # Equation resolutions                 : 0
% 0.23/1.42  # Current number of processed clauses  : 247
% 0.23/1.42  #    Positive orientable unit clauses  : 27
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 9
% 0.23/1.42  #    Non-unit-clauses                  : 211
% 0.23/1.42  # Current number of unprocessed clauses: 2756
% 0.23/1.42  # ...number of literals in the above   : 14272
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 17
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 24082
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 5572
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 251
% 0.23/1.42  # Unit Clause-clause subsumption calls : 1172
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 6
% 0.23/1.42  # BW rewrite match successes           : 6
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 51970
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.106 s
% 0.23/1.42  # System time              : 0.009 s
% 0.23/1.42  # Total time               : 0.115 s
% 0.23/1.42  # Maximum resident set size: 5428 pages
% 0.23/23.41  eprover: CPU time limit exceeded, terminating
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43  eprover: No such file or directory
% 0.23/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46  eprover: No such file or directory
% 0.23/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48  eprover: No such file or directory
% 0.23/23.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49  eprover: No such file or directory
%------------------------------------------------------------------------------