↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : SWV372+1 : 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 : n004.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 09:02:12 AM UTC 2026

% Result   : Theorem 14.79s 3.47s
% Output   : CNFRefutation 14.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  12 unt;   0 def)
%            Number of atoms       :   55 (  22 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  14   ~;  15   |;   1   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   5 con; 0-3 aty)
%            Number of variables   :   54 (  13 sgn  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(l8_li56,lemma,
    ! [X0,X1,X2,X3] :
      ( 'contains$ucpq'(triple(X0,X1,X2),X3)
    <=> 'contains$upq'(i(triple(X0,X1,X2)),X3) ) ).

fof(l8_lX,lemma,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ phi(triple(X0,X1,X2)) ) ).

fof(ax39,axiom,
    ! [X0,X1,X2,X3] :
      ( 'contains$ucpq'(triple(X0,X1,X2),X3)
    <=> 'contains$uslb'(X1,X3) ) ).

fof(ax40,axiom,
    ! [X0,X1] :
      ( ok(triple(X0,X1,bad))
    <=> $false ) ).

fof(ax46,axiom,
    ! [X0,X1] : 'findmin$ucpq$ueff'(triple(X0,'create$uslb',X1)) = triple(X0,'create$uslb',bad) ).

fof(ax47,axiom,
    ! [X0,X1,X2,X3] :
      ( ( ~ 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
        & X1 != 'create$uslb' )
     => 'findmin$ucpq$ueff'(triple(X0,X1,X2)) = triple(X0,'update$uslb'(X1,'findmin$upqp$ures'(X0)),bad) ) ).

fof(ax51,axiom,
    ! [X0,X1,X2,X3] :
      ( X1 != 'create$uslb'
     => 'findmin$ucpq$ures'(triple(X0,X1,X2)) = 'findmin$upqp$ures'(X0) ) ).

fof(l8_co,conjecture,
    ! [X0,X1,X2] :
      ( phi('findmin$ucpq$ueff'(triple(X0,X1,X2)))
     => 'contains$upq'(i(triple(X0,X1,X2)),'findmin$ucpq$ures'(triple(X0,X1,X2))) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( phi('findmin$ucpq$ueff'(triple(X0,X1,X2)))
       => 'contains$upq'(i(triple(X0,X1,X2)),'findmin$ucpq$ures'(triple(X0,X1,X2))) ),
    inference(negate_conjecture,[status(cth)],[l8_co]) ).

cnf(c0,plain,
    ( 'contains$upq'(i(triple(X0,X1,X2)),X3)
    | ~ 'contains$ucpq'(triple(X0,X1,X2),X3) ),
    inference(clausification,[status(esa)],[l8_li56]) ).

cnf(c3,plain,
    ( ~ phi(triple(X0,X1,X2))
    | ok(triple(X0,X1,X2)) ),
    inference(clausification,[status(esa)],[l8_lX]) ).

cnf(c55,plain,
    ( ~ 'contains$uslb'(X1,X3)
    | 'contains$ucpq'(triple(X0,X1,X2),X3) ),
    inference(clausification,[status(esa)],[ax39]) ).

cnf(c56,plain,
    ~ ok(triple(X0,X1,bad)),
    inference(clausification,[status(esa)],[ax40]) ).

cnf(c62,plain,
    'findmin$ucpq$ueff'(triple(X0,'create$uslb',X1)) = triple(X0,'create$uslb',bad),
    inference(clausification,[status(esa)],[ax46]) ).

cnf(c63,plain,
    ( 'findmin$ucpq$ueff'(triple(X1,X0,X2)) = triple(X1,'update$uslb'(X0,'findmin$upqp$ures'(X1)),bad)
    | 'contains$uslb'(X0,'findmin$upqp$ures'(X1))
    | X0 = 'create$uslb' ),
    inference(clausification,[status(esa)],[ax47]) ).

cnf(c67,plain,
    ( 'findmin$ucpq$ures'(triple(X1,X0,X2)) = 'findmin$upqp$ures'(X1)
    | X0 = 'create$uslb' ),
    inference(clausification,[status(esa)],[ax51]) ).

cnf(c90,plain,
    phi('findmin$ucpq$ueff'(triple(sK177,sK178,sK179))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c91,plain,
    ~ 'contains$upq'(i(triple(sK177,sK178,sK179)),'findmin$ucpq$ures'(triple(sK177,sK178,sK179))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ 'contains$ucpq'(triple(sK177,sK178,sK179),'findmin$ucpq$ures'(triple(sK177,sK178,sK179))),
    inference(resolution,[status(thm)],[c91,c0]) ).

cnf(d1,plain,
    ~ 'contains$uslb'(sK178,'findmin$ucpq$ures'(triple(sK177,sK178,sK179))),
    inference(resolution,[status(thm)],[c55,d0]) ).

cnf(d2,plain,
    ( sK178 = 'create$uslb'
    | ~ 'contains$uslb'(sK178,'findmin$upqp$ures'(sK177)) ),
    inference(superposition,[status(thm)],[c67,d1]) ).

cnf(d3,plain,
    ( 'findmin$ucpq$ueff'(triple(sK177,sK178,X0)) = triple(sK177,'update$uslb'(sK178,'findmin$upqp$ures'(sK177)),bad)
    | sK178 = 'create$uslb'
    | sK178 = 'create$uslb' ),
    inference(resolution,[status(thm)],[d2,c63]) ).

cnf(d4,plain,
    ( sK178 = 'create$uslb'
    | sK178 = 'create$uslb'
    | 'findmin$ucpq$ueff'(triple(sK177,sK178,X1)) = 'findmin$ucpq$ueff'(triple(sK177,sK178,X0)) ),
    inference(superposition,[status(thm)],[d3,d3]) ).

cnf(d5,plain,
    ( sK178 = 'create$uslb'
    | phi('findmin$ucpq$ueff'(triple(sK177,sK178,X0))) ),
    inference(superposition,[status(thm)],[d4,c90]) ).

cnf(d6,plain,
    ( sK178 = 'create$uslb'
    | sK178 = 'create$uslb'
    | phi(triple(sK177,'update$uslb'(sK178,'findmin$upqp$ures'(sK177)),bad)) ),
    inference(superposition,[status(thm)],[d3,d5]) ).

cnf(d7,plain,
    ( ok(triple(sK177,'update$uslb'(sK178,'findmin$upqp$ures'(sK177)),bad))
    | sK178 = 'create$uslb' ),
    inference(resolution,[status(thm)],[d6,c3]) ).

cnf(d8,plain,
    sK178 = 'create$uslb',
    inference(resolution,[status(thm)],[c56,d7]) ).

cnf(d9,plain,
    phi('findmin$ucpq$ueff'(triple(sK177,'create$uslb',sK179))),
    inference(demodulation,[status(thm)],[c90,d8]) ).

cnf(d10,plain,
    phi(triple(sK177,'create$uslb',bad)),
    inference(demodulation,[status(thm)],[d9,c62]) ).

cnf(d11,plain,
    ok(triple(sK177,'create$uslb',bad)),
    inference(resolution,[status(thm)],[d10,c3]) ).

cnf(d12,plain,
    $false,
    inference(resolution,[status(thm)],[c56,d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV372+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.34  % Computer : n004.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Sat Sep 26 13:39:07 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.09/0.34  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.79/3.47  % SZS status Theorem for theBenchmark.p
% 14.79/3.47  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------