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

View Problem - Process Solution

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

% Computer : n017.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:43 EDT 2022

% Result   : Theorem 0.24s 1.41s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (   8 unt;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   52 (  17   ~;  14   |;  15   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   40 (   4 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X9,X6,X7,X8] :
      ( ( apart_point_and_line(X9,X6)
        & incident_point_and_line(X9,X7)
        & incident_point_and_line(X9,X8)
        & parallel_lines(X7,X6)
        & parallel_lines(X8,X6) )
     => equal_lines(X7,X8) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).

fof(p1,axiom,
    ! [X1,X2] :
      ( distinct_lines(X1,X2)
     => convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).

fof(a3,axiom,
    ! [X1,X2] :
      ( parallel_lines(X1,X2)
    <=> ~ convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',a3) ).

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

fof(c_0_5,negated_conjecture,
    ~ ! [X9,X6,X7,X8] :
        ( ( apart_point_and_line(X9,X6)
          & incident_point_and_line(X9,X7)
          & incident_point_and_line(X9,X8)
          & parallel_lines(X7,X6)
          & parallel_lines(X8,X6) )
       => equal_lines(X7,X8) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_6,negated_conjecture,
    ( apart_point_and_line(esk1_0,esk2_0)
    & incident_point_and_line(esk1_0,esk3_0)
    & incident_point_and_line(esk1_0,esk4_0)
    & parallel_lines(esk3_0,esk2_0)
    & parallel_lines(esk4_0,esk2_0)
    & ~ equal_lines(esk3_0,esk4_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_7,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_8,plain,
    ! [X3,X4] :
      ( ~ distinct_lines(X3,X4)
      | convergent_lines(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).

cnf(c_0_9,negated_conjecture,
    ~ equal_lines(esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

fof(c_0_11,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ parallel_lines(X3,X4)
        | ~ convergent_lines(X3,X4) )
      & ( convergent_lines(X3,X4)
        | parallel_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)],[a3])])])])]) ).

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

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

cnf(c_0_14,negated_conjecture,
    distinct_lines(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,plain,
    ( ~ convergent_lines(X1,X2)
    | ~ parallel_lines(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    parallel_lines(esk4_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

cnf(c_0_18,negated_conjecture,
    convergent_lines(esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,negated_conjecture,
    parallel_lines(esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_20,negated_conjecture,
    ~ convergent_lines(esk4_0,esk2_0),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( convergent_lines(esk3_0,X1)
    | convergent_lines(esk4_0,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ convergent_lines(esk3_0,esk2_0),
    inference(spm,[status(thm)],[c_0_15,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO209+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n017.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jun 18 14:58:57 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.24/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41  # Preprocessing time       : 0.017 s
% 0.24/1.41  
% 0.24/1.41  # Proof found!
% 0.24/1.41  # SZS status Theorem
% 0.24/1.41  # SZS output start CNFRefutation
% See solution above
% 0.24/1.41  # Proof object total steps             : 24
% 0.24/1.41  # Proof object clause steps            : 13
% 0.24/1.41  # Proof object formula steps           : 11
% 0.24/1.41  # Proof object conjectures             : 12
% 0.24/1.41  # Proof object clause conjectures      : 9
% 0.24/1.41  # Proof object formula conjectures     : 3
% 0.24/1.41  # Proof object initial clauses used    : 7
% 0.24/1.41  # Proof object initial formulas used   : 5
% 0.24/1.41  # Proof object generating inferences   : 6
% 0.24/1.41  # Proof object simplifying inferences  : 1
% 0.24/1.41  # Training examples: 0 positive, 0 negative
% 0.24/1.41  # Parsed axioms                        : 36
% 0.24/1.41  # Removed by relevancy pruning/SinE    : 14
% 0.24/1.41  # Initial clauses                      : 36
% 0.24/1.41  # Removed in clause preprocessing      : 0
% 0.24/1.41  # Initial clauses in saturation        : 36
% 0.24/1.41  # Processed clauses                    : 53
% 0.24/1.41  # ...of these trivial                  : 0
% 0.24/1.41  # ...subsumed                          : 4
% 0.24/1.41  # ...remaining for further processing  : 49
% 0.24/1.41  # Other redundant clauses eliminated   : 0
% 0.24/1.41  # Clauses deleted for lack of memory   : 0
% 0.24/1.41  # Backward-subsumed                    : 0
% 0.24/1.41  # Backward-rewritten                   : 0
% 0.24/1.41  # Generated clauses                    : 105
% 0.24/1.41  # ...of the previous two non-trivial   : 80
% 0.24/1.41  # Contextual simplify-reflections      : 4
% 0.24/1.41  # Paramodulations                      : 95
% 0.24/1.41  # Factorizations                       : 10
% 0.24/1.41  # Equation resolutions                 : 0
% 0.24/1.41  # Current number of processed clauses  : 49
% 0.24/1.41  #    Positive orientable unit clauses  : 9
% 0.24/1.41  #    Positive unorientable unit clauses: 0
% 0.24/1.41  #    Negative unit clauses             : 8
% 0.24/1.41  #    Non-unit-clauses                  : 32
% 0.24/1.41  # Current number of unprocessed clauses: 63
% 0.24/1.41  # ...number of literals in the above   : 293
% 0.24/1.41  # Current number of archived formulas  : 0
% 0.24/1.41  # Current number of archived clauses   : 0
% 0.24/1.41  # Clause-clause subsumption calls (NU) : 134
% 0.24/1.41  # Rec. Clause-clause subsumption calls : 81
% 0.24/1.41  # Non-unit clause-clause subsumptions  : 8
% 0.24/1.41  # Unit Clause-clause subsumption calls : 8
% 0.24/1.41  # Rewrite failures with RHS unbound    : 0
% 0.24/1.41  # BW rewrite match attempts            : 0
% 0.24/1.41  # BW rewrite match successes           : 0
% 0.24/1.41  # Condensation attempts                : 0
% 0.24/1.41  # Condensation successes               : 0
% 0.24/1.41  # Termbank termtop insertions          : 3319
% 0.24/1.41  
% 0.24/1.41  # -------------------------------------------------
% 0.24/1.41  # User time                : 0.013 s
% 0.24/1.41  # System time              : 0.008 s
% 0.24/1.41  # Total time               : 0.020 s
% 0.24/1.41  # Maximum resident set size: 3016 pages
%------------------------------------------------------------------------------