↑ Up

LisaST---0.9.THM-CRf.s

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

% 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 : Sun Sep 27 09:02:12 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(l9_l10,lemma,
    ! [X0,X1,X2] :
      ( ok('findmin$ucpq$ueff'(triple(X0,X1,X2)))
     => ( 'less$uthan'('lookup$uslb'(X1,'findmin$upqp$ures'(X0)),'findmin$upqp$ures'(X0))
        & 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
        & X1 != 'create$uslb' ) ) ).

fof(ax20,axiom,
    ! [X0] : ~ 'contains$uslb'('create$uslb',X0) ).

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

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

fof(l9_co,conjecture,
    ! [X0,X1,X2] :
      ( ~ 'contains$ucpq'(triple(X0,X1,X2),'findmin$ucpq$ures'(triple(X0,X1,X2)))
     => ~ ok('findmin$ucpq$ueff'(triple(X0,X1,X2))) ) ).

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

cnf(c1,plain,
    ( 'contains$uslb'(X1,'findmin$upqp$ures'(X0))
    | ~ ok('findmin$ucpq$ueff'(triple(X0,X1,X2))) ),
    inference(clausification,[status(esa)],[l9_l10]) ).

cnf(c12,plain,
    ~ 'contains$uslb'('create$uslb',X0),
    inference(clausification,[status(esa)],[ax20]) ).

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

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

cnf(c53,plain,
    ~ 'contains$ucpq'(triple(sK120,sK121,sK122),'findmin$ucpq$ures'(triple(sK120,sK121,sK122))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(c54,plain,
    ok('findmin$ucpq$ueff'(triple(sK120,sK121,sK122))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ~ 'contains$uslb'(sK121,'findmin$ucpq$ures'(triple(sK120,sK121,sK122))),
    inference(resolution,[status(thm)],[c38,c53]) ).

cnf(d1,plain,
    ( sK121 = 'create$uslb'
    | ~ 'contains$uslb'(sK121,'findmin$upqp$ures'(sK120)) ),
    inference(superposition,[status(thm)],[c50,d0]) ).

cnf(d2,plain,
    'contains$uslb'(sK121,'findmin$upqp$ures'(sK120)),
    inference(resolution,[status(thm)],[c1,c54]) ).

cnf(d3,plain,
    sK121 = 'create$uslb',
    inference(resolution,[status(thm)],[d2,d1]) ).

cnf(d4,plain,
    'contains$uslb'('create$uslb','findmin$upqp$ures'(sK120)),
    inference(demodulation,[status(thm)],[d2,d3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV373+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n020.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 13:40:34 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.69/2.53  % SZS status Theorem for theBenchmark.p
% 12.69/2.53  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------