↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GEO186+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 07:14:36 AM UTC 2026

% Result   : Theorem 17.00s 2.85s
% Output   : CNFRefutation 17.00s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :   66 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   65 (  25   ~;  27   |;   7   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   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   :   37 (   0 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(apart1,axiom,
    ! [X0] : ~ 'distinct$upoints'(X0,X0) ).

fof(con2,axiom,
    ! [X0,X1,X2] :
      ( 'convergent$ulines'(X0,X1)
     => ( ( 'apart$upoint$uand$uline'(X2,X1)
          | 'apart$upoint$uand$uline'(X2,X0) )
       => 'distinct$upoints'(X2,'intersection$upoint'(X0,X1)) ) ) ).

fof(cu1,axiom,
    ! [X0,X1,X2,X3] :
      ( ( 'distinct$ulines'(X2,X3)
        & 'distinct$upoints'(X0,X1) )
     => ( 'apart$upoint$uand$uline'(X1,X3)
        | 'apart$upoint$uand$uline'(X1,X2)
        | 'apart$upoint$uand$uline'(X0,X3)
        | 'apart$upoint$uand$uline'(X0,X2) ) ) ).

fof(ceq3,axiom,
    ! [X0,X1] :
      ( 'convergent$ulines'(X0,X1)
     => 'distinct$ulines'(X0,X1) ) ).

fof(con,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( ~ 'apart$upoint$uand$uline'(X0,X3)
        & ~ 'apart$upoint$uand$uline'(X0,X2)
        & 'convergent$ulines'(X2,X3)
        & 'distinct$upoints'(X0,X1) )
     => ~ 'distinct$upoints'(X0,'intersection$upoint'(X2,X3)) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( ~ 'apart$upoint$uand$uline'(X0,X3)
          & ~ 'apart$upoint$uand$uline'(X0,X2)
          & 'convergent$ulines'(X2,X3)
          & 'distinct$upoints'(X0,X1) )
       => ~ 'distinct$upoints'(X0,'intersection$upoint'(X2,X3)) ),
    inference(negate_conjecture,[status(cth)],[con]) ).

cnf(c0,plain,
    ~ 'distinct$upoints'(X0,X0),
    inference(clausification,[status(esa)],[apart1]) ).

cnf(c8,plain,
    ( 'distinct$upoints'(X2,'intersection$upoint'(X0,X1))
    | ~ 'apart$upoint$uand$uline'(X2,X0)
    | ~ 'convergent$ulines'(X0,X1) ),
    inference(clausification,[status(esa)],[con2]) ).

cnf(c9,plain,
    ( 'distinct$upoints'(X2,'intersection$upoint'(X0,X1))
    | ~ 'apart$upoint$uand$uline'(X2,X1)
    | ~ 'convergent$ulines'(X0,X1) ),
    inference(clausification,[status(esa)],[con2]) ).

cnf(c10,plain,
    ( ~ 'distinct$upoints'(X0,X3)
    | 'apart$upoint$uand$uline'(X3,X1)
    | 'apart$upoint$uand$uline'(X3,X2)
    | ~ 'distinct$ulines'(X1,X2)
    | 'apart$upoint$uand$uline'(X0,X2)
    | 'apart$upoint$uand$uline'(X0,X1) ),
    inference(clausification,[status(esa)],[cu1]) ).

cnf(c13,plain,
    ( 'distinct$ulines'(X0,X1)
    | ~ 'convergent$ulines'(X0,X1) ),
    inference(clausification,[status(esa)],[ceq3]) ).

cnf(c15,plain,
    'convergent$ulines'(sK32,sK33),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c16,plain,
    ~ 'apart$upoint$uand$uline'(sK30,sK32),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c17,plain,
    ~ 'apart$upoint$uand$uline'(sK30,sK33),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c18,plain,
    'distinct$upoints'(sK30,'intersection$upoint'(sK32,sK33)),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ 'apart$upoint$uand$uline'('intersection$upoint'(X0,X1),X0)
    | ~ 'convergent$ulines'(X0,X1) ),
    inference(resolution,[status(thm)],[c8,c0]) ).

cnf(d1,plain,
    ( ~ 'apart$upoint$uand$uline'('intersection$upoint'(X0,X1),X1)
    | ~ 'convergent$ulines'(X0,X1) ),
    inference(resolution,[status(thm)],[c9,c0]) ).

cnf(d2,plain,
    'distinct$ulines'(sK32,sK33),
    inference(resolution,[status(thm)],[c13,c15]) ).

cnf(d3,plain,
    ( 'apart$upoint$uand$uline'(X0,sK32)
    | 'apart$upoint$uand$uline'(X0,sK33)
    | 'apart$upoint$uand$uline'(X1,sK32)
    | 'apart$upoint$uand$uline'(X1,sK33)
    | ~ 'distinct$upoints'(X0,X1) ),
    inference(resolution,[status(thm)],[d2,c10]) ).

cnf(d4,plain,
    ( 'apart$upoint$uand$uline'(sK30,sK33)
    | 'apart$upoint$uand$uline'(sK30,sK32)
    | 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK33)
    | 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK32) ),
    inference(resolution,[status(thm)],[d3,c18]) ).

cnf(d5,plain,
    ( 'apart$upoint$uand$uline'(sK30,sK33)
    | 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK33)
    | 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK32) ),
    inference(resolution,[status(thm)],[c16,d4]) ).

cnf(d6,plain,
    ( 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK33)
    | 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK32) ),
    inference(resolution,[status(thm)],[c17,d5]) ).

cnf(d7,plain,
    ( ~ 'convergent$ulines'(sK32,sK33)
    | 'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK32) ),
    inference(resolution,[status(thm)],[d6,d1]) ).

cnf(d8,plain,
    'apart$upoint$uand$uline'('intersection$upoint'(sK32,sK33),sK32),
    inference(resolution,[status(thm)],[c15,d7]) ).

cnf(d9,plain,
    ~ 'convergent$ulines'(sK32,sK33),
    inference(resolution,[status(thm)],[d8,d0]) ).

cnf(d10,plain,
    $false,
    inference(resolution,[status(thm)],[c15,d9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO186+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 13:01:09 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 17.00/2.85  % SZS status Theorem for theBenchmark.p
% 17.00/2.85  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------