↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GEO193+3 : TPTP v9.2.1. Released v4.0.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 : n029.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:49 PM UTC 2026

% Result   : Theorem 1.28s 1.71s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (  17 unt;   0 def)
%            Number of atoms       :   60 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   49 (  20   ~;  14   |;   8   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   56 (   6 sgn  37   !;   0   ?)

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

fof(cp2,axiom,
    ! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp2) ).

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(p1,axiom,
    ! [X1,X2] :
      ( distinct_lines(X1,X2)
     => convergent_lines(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).

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

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

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

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

fof(c_0_8,plain,
    ! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    inference(fof_simplification,[status(thm)],[cp2]) ).

fof(c_0_9,plain,
    ! [X122,X123,X124] :
      ( ~ apart_point_and_line(X122,X123)
      | distinct_lines(X123,X124)
      | apart_point_and_line(X122,X124) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])]) ).

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

fof(c_0_11,plain,
    ! [X132,X133] : ~ apart_point_and_line(X132,parallel_through_point(X133,X132)),
    inference(variable_rename,[status(thm)],[c_0_8]) ).

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

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

fof(c_0_14,plain,
    ! [X128,X129] :
      ( ~ distinct_lines(X128,X129)
      | convergent_lines(X128,X129) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])]) ).

cnf(c_0_15,plain,
    ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_16,negated_conjecture,
    ( apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
    | distinct_lines(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_17,plain,
    ! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
    inference(fof_simplification,[status(thm)],[cp1]) ).

fof(c_0_18,plain,
    ! [X104,X105,X106] :
      ( ~ convergent_lines(X104,X105)
      | convergent_lines(X104,X106)
      | convergent_lines(X105,X106) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])]) ).

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

cnf(c_0_20,negated_conjecture,
    distinct_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

fof(c_0_21,plain,
    ! [X1] : ~ convergent_lines(X1,X1),
    inference(fof_simplification,[status(thm)],[apart3]) ).

fof(c_0_22,plain,
    ! [X130,X131] : ~ convergent_lines(parallel_through_point(X131,X130),X131),
    inference(variable_rename,[status(thm)],[c_0_17]) ).

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

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

fof(c_0_25,plain,
    ! [X97] : ~ convergent_lines(X97,X97),
    inference(variable_rename,[status(thm)],[c_0_21]) ).

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

cnf(c_0_27,negated_conjecture,
    ( convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2)
    | convergent_lines(esk3_0,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,plain,
    ~ convergent_lines(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    convergent_lines(esk3_0,X1),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_28,c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : GEO193+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.11  % 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.32  % Computer : n029.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Mon May  4 17:47:29 EDT 2026
% 0.15/0.32  % CPUTime    : 
% 0.15/0.33  % start to proof: theBenchmark
% 1.28/1.71  % Version  : CSE_E---1.7
% 1.28/1.71  % Problem  : theBenchmark.p
% 1.28/1.71  % SZS status Theorem for theBenchmark.p
% 1.28/1.71  % SZS output start CNFRefutation
% See solution above
% 1.28/1.71  % Total time : 1.371s
%------------------------------------------------------------------------------