↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GEO258+1 : TPTP v9.2.1. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n022.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  : 300s
% DateTime : Tue May  5 04:20:10 PM UTC 2026

% Result   : Theorem 1.29s 1.72s
% Output   : CNFRefutation 1.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   47 (  14 unt;   0 def)
%            Number of atoms       :  144 (   0 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :  153 (  56   ~;  70   |;  21   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   86 (   5 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(con,conjecture,
    ! [X2,X1,X4,X5] :
      ( between_on_line(X2,X1,X4,X5)
     => between_on_line(X2,X5,X4,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

fof(bf_def,axiom,
    ! [X2,X1,X4] :
      ( before_on_line(X2,X1,X4)
    <=> ( distinct_points(X1,X4)
        & ~ ( left_apart_point(X1,X2)
            | left_apart_point(X1,reverse_line(X2)) )
        & ~ ( left_apart_point(X4,X2)
            | left_apart_point(X4,reverse_line(X2)) )
        & ~ unequally_directed_lines(X2,line_connecting(X1,X4)) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',bf_def) ).

fof(bet_def,axiom,
    ! [X2,X1,X4,X5] :
      ( between_on_line(X2,X1,X4,X5)
    <=> ( ( before_on_line(X2,X1,X4)
          & before_on_line(X2,X4,X5) )
        | ( before_on_line(X2,X5,X4)
          & before_on_line(X2,X4,X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',bet_def) ).

fof(oag1,axiom,
    ! [X1] : ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag1) ).

fof(oag2,axiom,
    ! [X1,X4,X5] :
      ( distinct_points(X1,X4)
     => ( distinct_points(X1,X5)
        | distinct_points(X4,X5) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag2) ).

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

fof(c_0_6,negated_conjecture,
    ~ ! [X2,X1,X4,X5] :
        ( between_on_line(X2,X1,X4,X5)
       => between_on_line(X2,X5,X4,X1) ),
    inference(assume_negation,[status(cth)],[con]) ).

fof(c_0_7,plain,
    ! [X2,X1,X4] :
      ( before_on_line(X2,X1,X4)
    <=> ( distinct_points(X1,X4)
        & ~ ( left_apart_point(X1,X2)
            | left_apart_point(X1,reverse_line(X2)) )
        & ~ ( left_apart_point(X4,X2)
            | left_apart_point(X4,reverse_line(X2)) )
        & ~ unequally_directed_lines(X2,line_connecting(X1,X4)) ) ),
    inference(fof_simplification,[status(thm)],[bf_def]) ).

fof(c_0_8,plain,
    ! [X92,X93,X94,X95] :
      ( ( before_on_line(X92,X95,X94)
        | before_on_line(X92,X93,X94)
        | ~ between_on_line(X92,X93,X94,X95) )
      & ( before_on_line(X92,X94,X93)
        | before_on_line(X92,X93,X94)
        | ~ between_on_line(X92,X93,X94,X95) )
      & ( before_on_line(X92,X95,X94)
        | before_on_line(X92,X94,X95)
        | ~ between_on_line(X92,X93,X94,X95) )
      & ( before_on_line(X92,X94,X93)
        | before_on_line(X92,X94,X95)
        | ~ between_on_line(X92,X93,X94,X95) )
      & ( ~ before_on_line(X92,X93,X94)
        | ~ before_on_line(X92,X94,X95)
        | between_on_line(X92,X93,X94,X95) )
      & ( ~ before_on_line(X92,X95,X94)
        | ~ before_on_line(X92,X94,X93)
        | between_on_line(X92,X93,X94,X95) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[bet_def])])]) ).

fof(c_0_9,negated_conjecture,
    ( between_on_line(esk1_0,esk2_0,esk3_0,esk4_0)
    & ~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_10,plain,
    ! [X89,X90,X91] :
      ( ( distinct_points(X90,X91)
        | ~ before_on_line(X89,X90,X91) )
      & ( ~ left_apart_point(X90,X89)
        | ~ before_on_line(X89,X90,X91) )
      & ( ~ left_apart_point(X90,reverse_line(X89))
        | ~ before_on_line(X89,X90,X91) )
      & ( ~ left_apart_point(X91,X89)
        | ~ before_on_line(X89,X90,X91) )
      & ( ~ left_apart_point(X91,reverse_line(X89))
        | ~ before_on_line(X89,X90,X91) )
      & ( ~ unequally_directed_lines(X89,line_connecting(X90,X91))
        | ~ before_on_line(X89,X90,X91) )
      & ( ~ distinct_points(X90,X91)
        | left_apart_point(X90,X89)
        | left_apart_point(X90,reverse_line(X89))
        | left_apart_point(X91,X89)
        | left_apart_point(X91,reverse_line(X89))
        | unequally_directed_lines(X89,line_connecting(X90,X91))
        | before_on_line(X89,X90,X91) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_11,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X3,X2)
    | ~ between_on_line(X1,X4,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    between_on_line(esk1_0,esk2_0,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X1] : ~ distinct_points(X1,X1),
    inference(fof_simplification,[status(thm)],[oag1]) ).

fof(c_0_14,plain,
    ! [X97,X98,X99] :
      ( ~ distinct_points(X97,X98)
      | distinct_points(X97,X99)
      | distinct_points(X98,X99) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag2])]) ).

cnf(c_0_15,plain,
    ( distinct_points(X1,X2)
    | ~ before_on_line(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    ( before_on_line(esk1_0,esk4_0,esk3_0)
    | before_on_line(esk1_0,esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

fof(c_0_17,plain,
    ! [X115,X116] :
      ( ~ left_apart_point(X115,X116)
      & ~ left_apart_point(X115,reverse_line(X116)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])]) ).

fof(c_0_18,plain,
    ! [X96] : ~ distinct_points(X96,X96),
    inference(variable_rename,[status(thm)],[c_0_13]) ).

cnf(c_0_19,plain,
    ( distinct_points(X1,X3)
    | distinct_points(X2,X3)
    | ~ distinct_points(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_20,negated_conjecture,
    ( distinct_points(esk4_0,esk3_0)
    | before_on_line(esk1_0,esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( left_apart_point(X1,X3)
    | left_apart_point(X1,reverse_line(X3))
    | left_apart_point(X2,X3)
    | left_apart_point(X2,reverse_line(X3))
    | unequally_directed_lines(X3,line_connecting(X1,X2))
    | before_on_line(X3,X1,X2)
    | ~ distinct_points(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_22,plain,
    ~ left_apart_point(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_23,plain,
    ~ distinct_points(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_24,negated_conjecture,
    ( distinct_points(esk4_0,X1)
    | distinct_points(esk3_0,X1)
    | before_on_line(esk1_0,esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_25,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X3,X2)
    | ~ between_on_line(X1,X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_26,plain,
    ( before_on_line(X1,X2,X3)
    | unequally_directed_lines(X1,line_connecting(X2,X3))
    | ~ distinct_points(X2,X3) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22]),c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    distinct_points(esk3_0,esk4_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).

cnf(c_0_28,plain,
    ( between_on_line(X1,X2,X3,X4)
    | ~ before_on_line(X1,X2,X3)
    | ~ before_on_line(X1,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_29,negated_conjecture,
    ( before_on_line(esk1_0,esk3_0,esk2_0)
    | before_on_line(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_25,c_0_12]) ).

cnf(c_0_30,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X4,X3)
    | ~ between_on_line(X1,X4,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_31,plain,
    ( between_on_line(X1,X4,X3,X2)
    | ~ before_on_line(X1,X2,X3)
    | ~ before_on_line(X1,X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_32,negated_conjecture,
    ( before_on_line(X1,esk3_0,esk4_0)
    | unequally_directed_lines(X1,line_connecting(esk3_0,esk4_0)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_33,negated_conjecture,
    ( between_on_line(esk1_0,X1,esk3_0,esk2_0)
    | before_on_line(esk1_0,esk2_0,esk3_0)
    | ~ before_on_line(esk1_0,X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ( before_on_line(esk1_0,esk4_0,esk3_0)
    | before_on_line(esk1_0,esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_30,c_0_12]) ).

cnf(c_0_35,negated_conjecture,
    ~ between_on_line(esk1_0,esk4_0,esk3_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_36,negated_conjecture,
    ( between_on_line(X1,esk4_0,esk3_0,X2)
    | unequally_directed_lines(X1,line_connecting(esk3_0,esk4_0))
    | ~ before_on_line(X1,X2,esk3_0) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    before_on_line(esk1_0,esk2_0,esk3_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).

cnf(c_0_38,plain,
    ( before_on_line(X1,X2,X3)
    | before_on_line(X1,X2,X4)
    | ~ between_on_line(X1,X3,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_39,plain,
    ( ~ unequally_directed_lines(X1,line_connecting(X2,X3))
    | ~ before_on_line(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_40,negated_conjecture,
    unequally_directed_lines(esk1_0,line_connecting(esk3_0,esk4_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_35]) ).

cnf(c_0_41,negated_conjecture,
    ( before_on_line(esk1_0,esk3_0,esk2_0)
    | before_on_line(esk1_0,esk3_0,esk4_0) ),
    inference(spm,[status(thm)],[c_0_38,c_0_12]) ).

cnf(c_0_42,negated_conjecture,
    ~ before_on_line(esk1_0,esk3_0,esk4_0),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_43,negated_conjecture,
    before_on_line(esk1_0,esk3_0,esk2_0),
    inference(sr,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_44,negated_conjecture,
    ( between_on_line(esk1_0,X1,esk3_0,esk2_0)
    | ~ before_on_line(esk1_0,X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_28,c_0_43]) ).

cnf(c_0_45,negated_conjecture,
    before_on_line(esk1_0,esk4_0,esk3_0),
    inference(sr,[status(thm)],[c_0_16,c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GEO258+1 : TPTP v9.2.1. Bugfixed v6.4.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33  % Computer : n022.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 17:50:36 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.29/1.72  % Version  : CSE_E---1.7
% 1.29/1.72  % Problem  : theBenchmark.p
% 1.29/1.72  % SZS status Theorem for theBenchmark.p
% 1.29/1.72  % SZS output start CNFRefutation
% See solution above
% 1.29/1.72  % Total time : 1.371s
%------------------------------------------------------------------------------