↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GEO192+2 : TPTP v9.2.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n012.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:19:48 PM UTC 2026

% Result   : Theorem 1.12s 1.61s
% Output   : CNFRefutation 1.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  15 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   69 (  30   ~;  26   |;   5   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   51 (   0 sgn  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(apart1,axiom,
    ! [X1] : ~ distinct_points(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart1) ).

fof(con,conjecture,
    ! [X1,X2,X3] :
      ( convergent_lines(X1,X2)
     => ( apart_point_and_line(intersection_point(X1,X2),X3)
       => ( distinct_lines(X1,X3)
          & distinct_lines(X2,X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).

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

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/sandbox2/benchmark/Axioms/GEO008+0.ax',ceq2) ).

fof(apart2,axiom,
    ! [X1] : ~ distinct_lines(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO008+0.ax',apart2) ).

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

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

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

fof(c_0_8,plain,
    ! [X39] : ~ distinct_points(X39,X39),
    inference(variable_rename,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X54,X55,X56] :
      ( ( ~ apart_point_and_line(X56,X54)
        | distinct_points(X56,intersection_point(X54,X55))
        | ~ convergent_lines(X54,X55) )
      & ( ~ apart_point_and_line(X56,X55)
        | distinct_points(X56,intersection_point(X54,X55))
        | ~ convergent_lines(X54,X55) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[con2])])]) ).

fof(c_0_10,plain,
    ! [X64,X65,X66] :
      ( ~ apart_point_and_line(X64,X65)
      | distinct_lines(X65,X66)
      | apart_point_and_line(X64,X66) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).

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

cnf(c_0_12,plain,
    ~ distinct_points(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( distinct_points(X1,intersection_point(X3,X2))
    | ~ apart_point_and_line(X1,X2)
    | ~ convergent_lines(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

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

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

fof(c_0_16,plain,
    ! [X1] : ~ distinct_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[apart2]) ).

fof(c_0_17,plain,
    ! [X45,X46,X47] :
      ( ~ distinct_lines(X45,X46)
      | distinct_lines(X45,X47)
      | distinct_lines(X46,X47) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart5])]) ).

cnf(c_0_18,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X2)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
    | distinct_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

cnf(c_0_21,plain,
    ( distinct_points(X1,intersection_point(X2,X3))
    | ~ apart_point_and_line(X1,X2)
    | ~ convergent_lines(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_22,plain,
    ! [X40] : ~ distinct_lines(X40,X40),
    inference(variable_rename,[status(thm)],[c_0_16]) ).

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

cnf(c_0_24,negated_conjecture,
    distinct_lines(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).

cnf(c_0_25,plain,
    ( ~ apart_point_and_line(intersection_point(X1,X2),X1)
    | ~ convergent_lines(X1,X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_21]) ).

cnf(c_0_26,plain,
    ~ distinct_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_27,negated_conjecture,
    ( distinct_lines(esk3_0,X1)
    | distinct_lines(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    distinct_lines(esk3_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_20])]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ distinct_lines(esk1_0,esk3_0)
    | ~ distinct_lines(esk2_0,esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_30,negated_conjecture,
    distinct_lines(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( distinct_lines(esk3_0,X1)
    | distinct_lines(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_23,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    ~ distinct_lines(esk1_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : GEO192+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.06  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.07/0.24  % Computer : n012.cluster.edu
% 0.07/0.24  % Model    : x86_64 x86_64
% 0.07/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.24  % Memory   : 8042.1875MB
% 0.07/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.24  % CPULimit   : 300
% 0.07/0.24  % WCLimit    : 300
% 0.07/0.24  % DateTime   : Mon May  4 17:46:46 EDT 2026
% 0.07/0.24  % CPUTime    : 
% 0.07/0.25  % start to proof: theBenchmark
% 1.12/1.61  % Version  : CSE_E---1.7
% 1.12/1.61  % Problem  : theBenchmark.p
% 1.12/1.61  % SZS status Theorem for theBenchmark.p
% 1.12/1.61  % SZS output start CNFRefutation
% See solution above
% 1.12/1.61  % Total time : 1.361s
%------------------------------------------------------------------------------