TSTP Solution File: GEO228+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : GEO228+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n032.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 16091.75MB
% OS       : Linux 3.10.0-327.10.1.el7.x86_64
% CPULimit : 300s
% DateTime : Fri Apr  1 13:39:15 EDT 2016

% Result   : Theorem 0.06s
% Output   : CNFRefutation 0.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   26 (   5 unt;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  103 (  46   ~;  38   |;  15   &)
%                                         (   4 <=>;   0  =>;   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    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   24 (   0 sgn  14   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(4,axiom,
    ! [X1,X2] :
      ( convergent_lines(X1,X2)
    <=> ( unequally_directed_lines(X1,X2)
        & unequally_directed_lines(X1,reverse_line(X2)) ) ),
    file('/export/starexec/sandbox/tmp/tmp41_RSM/sel_theBenchmark.p_1',con_def) ).

fof(5,conjecture,
    ! [X1,X2] :
      ( ~ convergent_lines(X1,X2)
    <=> ( ~ unequally_directed_lines(X1,X2)
        | ~ unequally_directed_lines(X1,reverse_line(X2)) ) ),
    file('/export/starexec/sandbox/tmp/tmp41_RSM/sel_theBenchmark.p_1',con) ).

fof(6,negated_conjecture,
    ~ ! [X1,X2] :
        ( ~ convergent_lines(X1,X2)
      <=> ( ~ unequally_directed_lines(X1,X2)
          | ~ unequally_directed_lines(X1,reverse_line(X2)) ) ),
    inference(assume_negation,[status(cth)],[5]) ).

fof(8,negated_conjecture,
    ~ ! [X1,X2] :
        ( ~ convergent_lines(X1,X2)
      <=> ( ~ unequally_directed_lines(X1,X2)
          | ~ unequally_directed_lines(X1,reverse_line(X2)) ) ),
    inference(fof_simplification,[status(thm)],[6,theory(equality)]) ).

fof(21,plain,
    ! [X1,X2] :
      ( ( ~ convergent_lines(X1,X2)
        | ( unequally_directed_lines(X1,X2)
          & unequally_directed_lines(X1,reverse_line(X2)) ) )
      & ( ~ unequally_directed_lines(X1,X2)
        | ~ unequally_directed_lines(X1,reverse_line(X2))
        | convergent_lines(X1,X2) ) ),
    inference(fof_nnf,[status(thm)],[4]) ).

fof(22,plain,
    ! [X3,X4] :
      ( ( ~ convergent_lines(X3,X4)
        | ( unequally_directed_lines(X3,X4)
          & unequally_directed_lines(X3,reverse_line(X4)) ) )
      & ( ~ unequally_directed_lines(X3,X4)
        | ~ unequally_directed_lines(X3,reverse_line(X4))
        | convergent_lines(X3,X4) ) ),
    inference(variable_rename,[status(thm)],[21]) ).

fof(23,plain,
    ! [X3,X4] :
      ( ( unequally_directed_lines(X3,X4)
        | ~ convergent_lines(X3,X4) )
      & ( unequally_directed_lines(X3,reverse_line(X4))
        | ~ convergent_lines(X3,X4) )
      & ( ~ unequally_directed_lines(X3,X4)
        | ~ unequally_directed_lines(X3,reverse_line(X4))
        | convergent_lines(X3,X4) ) ),
    inference(distribute,[status(thm)],[22]) ).

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

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

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

fof(27,negated_conjecture,
    ? [X1,X2] :
      ( ( convergent_lines(X1,X2)
        | ( unequally_directed_lines(X1,X2)
          & unequally_directed_lines(X1,reverse_line(X2)) ) )
      & ( ~ convergent_lines(X1,X2)
        | ~ unequally_directed_lines(X1,X2)
        | ~ unequally_directed_lines(X1,reverse_line(X2)) ) ),
    inference(fof_nnf,[status(thm)],[8]) ).

fof(28,negated_conjecture,
    ? [X3,X4] :
      ( ( convergent_lines(X3,X4)
        | ( unequally_directed_lines(X3,X4)
          & unequally_directed_lines(X3,reverse_line(X4)) ) )
      & ( ~ convergent_lines(X3,X4)
        | ~ unequally_directed_lines(X3,X4)
        | ~ unequally_directed_lines(X3,reverse_line(X4)) ) ),
    inference(variable_rename,[status(thm)],[27]) ).

fof(29,negated_conjecture,
    ( ( convergent_lines(esk1_0,esk2_0)
      | ( unequally_directed_lines(esk1_0,esk2_0)
        & unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ) )
    & ( ~ convergent_lines(esk1_0,esk2_0)
      | ~ unequally_directed_lines(esk1_0,esk2_0)
      | ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ) ),
    inference(skolemize,[status(esa)],[28]) ).

fof(30,negated_conjecture,
    ( ( unequally_directed_lines(esk1_0,esk2_0)
      | convergent_lines(esk1_0,esk2_0) )
    & ( unequally_directed_lines(esk1_0,reverse_line(esk2_0))
      | convergent_lines(esk1_0,esk2_0) )
    & ( ~ convergent_lines(esk1_0,esk2_0)
      | ~ unequally_directed_lines(esk1_0,esk2_0)
      | ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ) ),
    inference(distribute,[status(thm)],[29]) ).

cnf(31,negated_conjecture,
    ( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
    | ~ unequally_directed_lines(esk1_0,esk2_0)
    | ~ convergent_lines(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[30]) ).

cnf(32,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    | unequally_directed_lines(esk1_0,reverse_line(esk2_0)) ),
    inference(split_conjunct,[status(thm)],[30]) ).

cnf(33,negated_conjecture,
    ( convergent_lines(esk1_0,esk2_0)
    | unequally_directed_lines(esk1_0,esk2_0) ),
    inference(split_conjunct,[status(thm)],[30]) ).

cnf(40,negated_conjecture,
    ( ~ convergent_lines(esk1_0,esk2_0)
    | ~ unequally_directed_lines(esk1_0,esk2_0) ),
    inference(csr,[status(thm)],[31,25]) ).

cnf(41,negated_conjecture,
    ~ convergent_lines(esk1_0,esk2_0),
    inference(csr,[status(thm)],[40,26]) ).

cnf(42,negated_conjecture,
    ( ~ unequally_directed_lines(esk1_0,reverse_line(esk2_0))
    | ~ unequally_directed_lines(esk1_0,esk2_0) ),
    inference(spm,[status(thm)],[41,24,theory(equality)]) ).

cnf(43,negated_conjecture,
    unequally_directed_lines(esk1_0,esk2_0),
    inference(sr,[status(thm)],[33,41,theory(equality)]) ).

cnf(44,negated_conjecture,
    unequally_directed_lines(esk1_0,reverse_line(esk2_0)),
    inference(sr,[status(thm)],[32,41,theory(equality)]) ).

cnf(60,negated_conjecture,
    ( $false
    | ~ unequally_directed_lines(esk1_0,esk2_0) ),
    inference(rw,[status(thm)],[42,44,theory(equality)]) ).

cnf(61,negated_conjecture,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[60,43,theory(equality)]) ).

cnf(62,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[61,theory(equality)]) ).

cnf(63,negated_conjecture,
    $false,
    62,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO228+1 : TPTP v6.4.0. Bugfixed v6.4.0.
% 0.00/0.03  % Command  : Source/sine.py -e eprover -t %d %s
% 0.03/0.22  % Computer : n032.star.cs.uiowa.edu
% 0.03/0.22  % Model    : x86_64 x86_64
% 0.03/0.22  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.22  % Memory   : 16091.75MB
% 0.03/0.22  % OS       : Linux 3.10.0-327.10.1.el7.x86_64
% 0.03/0.22  % CPULimit : 300
% 0.03/0.22  % DateTime : Fri Apr  1 11:09:38 CDT 2016
% 0.03/0.22  % CPUTime  : 
% 0.03/0.27  % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.27  --creating new selector for [GEO007+0.ax]
% 0.06/0.33  -running prover on /export/starexec/sandbox/tmp/tmp41_RSM/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.33  -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmp41_RSM/sel_theBenchmark.p_1']
% 0.06/0.33  -prover status Theorem
% 0.06/0.33  Problem theBenchmark.p solved in phase 0.
% 0.06/0.33  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.33  % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.33  Solved 1 out of 1.
% 0.06/0.33  # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.33  # SZS status Theorem
% 0.06/0.33  # SZS output start CNFRefutation.
% See solution above
% 0.06/0.33  # SZS output end CNFRefutation
%------------------------------------------------------------------------------