↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWC135+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n017.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 08:54:23 AM UTC 2026

% Result   : Theorem 19.66s 3.74s
% Output   : CNFRefutation 19.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   18 (  12 unt;   0 def)
%            Number of atoms       :   41 (  10 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   38 (  15   ~;  12   |;   0   &)
%                                         (   1 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   12 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ) ).

fof(ax17,axiom,
    ssList(nil) ).

fof(ax60,axiom,
    cyclefreeP(nil) ).

fof(co1,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( cyclefreeP(X1)
                    | neq(X3,nil)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( cyclefreeP(X1)
                      | neq(X3,nil)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[co1]) ).

cnf(c95,plain,
    ( X0 = X1
    | neq(X0,X1)
    | ~ ssList(X1)
    | ~ ssList(X0) ),
    inference(clausification,[status(esa)],[ax15]) ).

cnf(c97,plain,
    ssList(nil),
    inference(clausification,[status(esa)],[ax17]) ).

cnf(c154,plain,
    cyclefreeP(nil),
    inference(clausification,[status(esa)],[ax60]) ).

cnf(c209,plain,
    ssList(sK254),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c212,plain,
    sK254 = sK256,
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c214,plain,
    ~ neq(sK256,nil),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c215,plain,
    ~ cyclefreeP(sK254),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ neq(sK254,nil),
    inference(demodulation,[status(thm)],[c214,c212]) ).

cnf(d1,plain,
    ( ~ ssList(sK254)
    | ~ ssList(nil)
    | sK254 = nil ),
    inference(resolution,[status(thm)],[c95,d0]) ).

cnf(d2,plain,
    ( ~ ssList(nil)
    | sK254 = nil ),
    inference(resolution,[status(thm)],[c209,d1]) ).

cnf(d3,plain,
    sK254 = nil,
    inference(resolution,[status(thm)],[c97,d2]) ).

cnf(d4,plain,
    ~ cyclefreeP(nil),
    inference(demodulation,[status(thm)],[c215,d3]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[c154,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC135+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n017.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep 26 12:14:48 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.66/3.74  % SZS status Theorem for theBenchmark.p
% 19.66/3.74  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------