↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n002.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:04:15 AM UTC 2026

% Result   : Theorem 29.80s 4.59s
% Output   : CNFRefutation 29.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   29 (  11   ~;   9   |;   1   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   23 (   1 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax1_99,axiom,
    ! [X0,X1] :
      ( 'tptptypes$u6$u388'(X0,X1)
     => 'tptptypes$u5$u387'(X0,X1) ) ).

fof(ax1_108,axiom,
    ! [X0,X1] :
      ( 'tptptypes$u9$u401'(X0,X1)
     => 'tptptypes$u8$u400'(X1,X0) ) ).

fof(ax1_157,axiom,
    ( mtvisible('c$utptp$umember237$umt')
   => 'tptptypes$u9$u401'('c$upushingababycarriage','c$utptpcol$u16$u10258') ) ).

fof(ax1_174,axiom,
    ! [X0,X1] :
      ( 'tptptypes$u8$u400'(X0,X1)
     => 'tptptypes$u7$u396'(X0,X1) ) ).

fof(ax1_198,axiom,
    genlmt('c$utptp$uspindlecollectormt','c$utptp$umember237$umt') ).

fof(ax1_409,axiom,
    ! [X0,X1] :
      ( 'tptptypes$u7$u396'(X0,X1)
     => 'tptptypes$u6$u388'(X0,X1) ) ).

fof(ax1_1123,axiom,
    ! [X0,X1] :
      ( ( genlmt(X0,X1)
        & mtvisible(X0) )
     => mtvisible(X1) ) ).

fof(query123,conjecture,
    ? [X0] :
      ( mtvisible('c$utptp$uspindlecollectormt')
     => 'tptptypes$u5$u387'(X0,'c$upushingababycarriage') ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] :
        ( mtvisible('c$utptp$uspindlecollectormt')
       => 'tptptypes$u5$u387'(X0,'c$upushingababycarriage') ),
    inference(negate_conjecture,[status(cth)],[query123]) ).

cnf(c1,plain,
    ( 'tptptypes$u5$u387'(X0,X1)
    | ~ 'tptptypes$u6$u388'(X0,X1) ),
    inference(clausification,[status(esa)],[ax1_99]) ).

cnf(c2,plain,
    ( 'tptptypes$u8$u400'(X1,X0)
    | ~ 'tptptypes$u9$u401'(X0,X1) ),
    inference(clausification,[status(esa)],[ax1_108]) ).

cnf(c3,plain,
    ( 'tptptypes$u9$u401'('c$upushingababycarriage','c$utptpcol$u16$u10258')
    | ~ mtvisible('c$utptp$umember237$umt') ),
    inference(clausification,[status(esa)],[ax1_157]) ).

cnf(c4,plain,
    ( 'tptptypes$u7$u396'(X0,X1)
    | ~ 'tptptypes$u8$u400'(X0,X1) ),
    inference(clausification,[status(esa)],[ax1_174]) ).

cnf(c5,plain,
    genlmt('c$utptp$uspindlecollectormt','c$utptp$umember237$umt'),
    inference(clausification,[status(esa)],[ax1_198]) ).

cnf(c7,plain,
    ( 'tptptypes$u6$u388'(X0,X1)
    | ~ 'tptptypes$u7$u396'(X0,X1) ),
    inference(clausification,[status(esa)],[ax1_409]) ).

cnf(c25,plain,
    ( mtvisible(X1)
    | ~ genlmt(X0,X1)
    | ~ mtvisible(X0) ),
    inference(clausification,[status(esa)],[ax1_1123]) ).

cnf(c27,plain,
    mtvisible('c$utptp$uspindlecollectormt'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c28,plain,
    ~ 'tptptypes$u5$u387'(X0,'c$upushingababycarriage'),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( 'tptptypes$u8$u400'('c$utptpcol$u16$u10258','c$upushingababycarriage')
    | ~ mtvisible('c$utptp$umember237$umt') ),
    inference(resolution,[status(thm)],[c3,c2]) ).

cnf(d1,plain,
    ( ~ mtvisible('c$utptp$uspindlecollectormt')
    | mtvisible('c$utptp$umember237$umt') ),
    inference(resolution,[status(thm)],[c25,c5]) ).

cnf(d2,plain,
    mtvisible('c$utptp$umember237$umt'),
    inference(resolution,[status(thm)],[c27,d1]) ).

cnf(d3,plain,
    'tptptypes$u8$u400'('c$utptpcol$u16$u10258','c$upushingababycarriage'),
    inference(resolution,[status(thm)],[d2,d0]) ).

cnf(d4,plain,
    'tptptypes$u7$u396'('c$utptpcol$u16$u10258','c$upushingababycarriage'),
    inference(resolution,[status(thm)],[d3,c4]) ).

cnf(d5,plain,
    'tptptypes$u6$u388'('c$utptpcol$u16$u10258','c$upushingababycarriage'),
    inference(resolution,[status(thm)],[d4,c7]) ).

cnf(d6,plain,
    'tptptypes$u5$u387'('c$utptpcol$u16$u10258','c$upushingababycarriage'),
    inference(resolution,[status(thm)],[d5,c1]) ).

cnf(d7,plain,
    $false,
    inference(resolution,[status(thm)],[c28,d6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR073+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n002.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 00:41:09 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 29.80/4.59  % SZS status Theorem for theBenchmark.p
% 29.80/4.59  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------