↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : LCL656+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n020.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 : Fri Sep 25 02:02:29 PM UTC 2026

% Result   : Theorem 3.33s 1.08s
% Output   : Proof 3.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   21 (   8 unt;   0 def)
%            Number of atoms       :  181 (   0 equ)
%            Maximal formula atoms :   37 (   8 avg)
%            Number of connectives :  287 ( 127   ~; 100   |;  60   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   36 (   0 sgn  27   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ~ ? [X] :
        ~ ( ~ ( p100(X)
              & ~ p101(X)
              & ! [Y] :
                  ( ( ( ~ p101(Y)
                      | p100(Y) )
                    & ( ~ p102(Y)
                      | p101(Y) )
                    & ( ~ p100(Y)
                      | ( ( ~ p1(Y)
                          | ! [X] :
                              ( ~ p100(X)
                              | p1(X)
                              | ~ r1(Y,X) ) )
                        & ( p1(Y)
                          | ! [X] :
                              ( ~ p100(X)
                              | ~ p1(X)
                              | ~ r1(Y,X) ) ) ) )
                    & ( ~ p101(Y)
                      | ( ( ~ p2(Y)
                          | ! [X] :
                              ( ~ p101(X)
                              | p2(X)
                              | ~ r1(Y,X) ) )
                        & ( p2(Y)
                          | ! [X] :
                              ( ~ p101(X)
                              | ~ p2(X)
                              | ~ r1(Y,X) ) ) ) )
                    & ( ~ ( p100(Y)
                          & ~ p101(Y) )
                      | ( ~ ! [X] :
                              ( ~ ( p101(X)
                                  & ~ p102(X)
                                  & p2(X) )
                              | ~ r1(Y,X) )
                        & ~ ! [X] :
                              ( ~ ( p101(X)
                                  & ~ p102(X)
                                  & ~ p2(X) )
                              | ~ r1(Y,X) ) ) ) )
                  | ~ r1(X,Y) ) )
          | ~ ! [Y] :
                ( p2(Y)
                | ~ r1(X,Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(f1_neg,negated_conjecture,
    ~ ~ ? [X] :
          ~ ( ~ ( p100(X)
                & ~ p101(X)
                & ! [Y] :
                    ( ( ( ~ p101(Y)
                        | p100(Y) )
                      & ( ~ p102(Y)
                        | p101(Y) )
                      & ( ~ p100(Y)
                        | ( ( ~ p1(Y)
                            | ! [X] :
                                ( ~ p100(X)
                                | p1(X)
                                | ~ r1(Y,X) ) )
                          & ( p1(Y)
                            | ! [X] :
                                ( ~ p100(X)
                                | ~ p1(X)
                                | ~ r1(Y,X) ) ) ) )
                      & ( ~ p101(Y)
                        | ( ( ~ p2(Y)
                            | ! [X] :
                                ( ~ p101(X)
                                | p2(X)
                                | ~ r1(Y,X) ) )
                          & ( p2(Y)
                            | ! [X] :
                                ( ~ p101(X)
                                | ~ p2(X)
                                | ~ r1(Y,X) ) ) ) )
                      & ( ~ ( p100(Y)
                            & ~ p101(Y) )
                        | ( ~ ! [X] :
                                ( ~ ( p101(X)
                                    & ~ p102(X)
                                    & p2(X) )
                                | ~ r1(Y,X) )
                          & ~ ! [X] :
                                ( ~ ( p101(X)
                                    & ~ p102(X)
                                    & ~ p2(X) )
                                | ~ r1(Y,X) ) ) ) )
                    | ~ r1(X,Y) ) )
            | ~ ! [Y] :
                  ( p2(Y)
                  | ~ r1(X,Y) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f1_nnf,plain,
    ? [X] :
      ( p100(X)
      & ~ p101(X)
      & ! [Y] :
          ( ( ( ~ p101(Y)
              | p100(Y) )
            & ( ~ p102(Y)
              | p101(Y) )
            & ( ~ p100(Y)
              | ( ( ~ p1(Y)
                  | ! [X] :
                      ( ~ p100(X)
                      | p1(X)
                      | ~ r1(Y,X) ) )
                & ( p1(Y)
                  | ! [X] :
                      ( ~ p100(X)
                      | ~ p1(X)
                      | ~ r1(Y,X) ) ) ) )
            & ( ~ p101(Y)
              | ( ( ~ p2(Y)
                  | ! [X] :
                      ( ~ p101(X)
                      | p2(X)
                      | ~ r1(Y,X) ) )
                & ( p2(Y)
                  | ! [X] :
                      ( ~ p101(X)
                      | ~ p2(X)
                      | ~ r1(Y,X) ) ) ) )
            & ( ~ p100(Y)
              | p101(Y)
              | ( ? [X] :
                    ( p101(X)
                    & ~ p102(X)
                    & p2(X)
                    & r1(Y,X) )
                & ? [X] :
                    ( p101(X)
                    & ~ p102(X)
                    & ~ p2(X)
                    & r1(Y,X) ) ) ) )
          | ~ r1(X,Y) )
      & ! [Y] :
          ( p2(Y)
          | ~ r1(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f1_neg]) ).

fof(f1_sk,plain,
    ! [Y,X] :
      ( p100(sk0)
      & ~ p101(sk0)
      & ( ( ( ~ p101(Y)
            | p100(Y) )
          & ( ~ p102(Y)
            | p101(Y) )
          & ( ~ p100(Y)
            | ( ( ~ p1(Y)
                | ~ p100(X)
                | p1(X)
                | ~ r1(Y,X) )
              & ( p1(Y)
                | ~ p100(X)
                | ~ p1(X)
                | ~ r1(Y,X) ) ) )
          & ( ~ p101(Y)
            | ( ( ~ p2(Y)
                | ~ p101(X)
                | p2(X)
                | ~ r1(Y,X) )
              & ( p2(Y)
                | ~ p101(X)
                | ~ p2(X)
                | ~ r1(Y,X) ) ) )
          & ( ~ p100(Y)
            | p101(Y)
            | ( p101(sk2(Y))
              & ~ p102(sk2(Y))
              & p2(sk2(Y))
              & r1(Y,sk2(Y))
              & p101(sk1(Y))
              & ~ p102(sk1(Y))
              & ~ p2(sk1(Y))
              & r1(Y,sk1(Y)) ) ) )
        | ~ r1(sk0,Y) )
      & ( p2(Y)
        | ~ r1(sk0,Y) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1,sk2])],[f1_nnf]) ).

cnf(c2,plain,
    ( ~ p100(X1)
    | p101(X1)
    | r1(X1,sk1(X1))
    | ~ r1(sk0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

fof(f0,axiom,
    ! [X] : r1(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

fof(f0_nnf,plain,
    ! [X] : r1(X,X),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X] : r1(X,X),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    r1(X0,X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p19,plain,
    ( ~ p100(sk0)
    | p101(sk0)
    | r1(sk0,sk1(sk0)) ),
    inference(resolution,[status(thm)],[c2,c0]) ).

cnf(c17,plain,
    p100(sk0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p30,plain,
    ( p101(sk0)
    | r1(sk0,sk1(sk0)) ),
    inference(resolution,[status(thm)],[p19,c17]) ).

cnf(c1,plain,
    ( p2(X1)
    | ~ r1(sk0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p35,plain,
    ( p2(sk1(sk0))
    | p101(sk0) ),
    inference(resolution,[status(thm)],[p30,c1]) ).

cnf(c3,plain,
    ( ~ p100(X1)
    | p101(X1)
    | ~ p2(sk1(X1))
    | ~ r1(sk0,X1) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p20,plain,
    ( ~ p100(sk0)
    | p101(sk0)
    | ~ p2(sk1(sk0)) ),
    inference(resolution,[status(thm)],[c3,c0]) ).

cnf(p48,plain,
    ( ~ p100(sk0)
    | p101(sk0)
    | p101(sk0) ),
    inference(resolution,[status(thm)],[p35,p20]) ).

cnf(p51,plain,
    ( ~ p100(sk0)
    | p101(sk0) ),
    inference(factoring,[status(thm)],[p48]) ).

cnf(p54,plain,
    p101(sk0),
    inference(resolution,[status(thm)],[p51,c17]) ).

cnf(c16,plain,
    ~ p101(sk0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p55,plain,
    $false,
    inference(resolution,[status(thm)],[p54,c16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL656+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n020.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.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Thu Sep 24 00:02:47 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.33/1.08  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.33/1.08  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------