↑ Up

LisaST---0.9.THM-CRf.s

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

% Computer : n019.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:33:22 AM UTC 2026

% Result   : Theorem 81.76s 23.45s
% Output   : CNFRefutation 81.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   33 (  13 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   45 (  20   ~;  11   |;   3   &)
%                                         (   9 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   31 (  10 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(writeUnaryOperator_2753,axiom,
    ! [X0] :
      ( ~ v4(X0)
    <=> v22287(X0) ) ).

fof(writeUnaryOperator_2752,axiom,
    ! [X0] :
      ( ~ v22287(X0)
    <=> v22288(X0) ) ).

fof(writeBinaryOperatorEqualRangesSingleBits_5375,axiom,
    ! [X0] :
      ( v22288(X0)
    <=> ( v22314(X0)
        & v22290(X0) ) ) ).

fof(writeBinaryOperatorShiftedRanges_1475,axiom,
    ! [X0] :
      ( v22314(X0)
    <=> ( v22292(X0,bitIndex1)
        | v22292(X0,bitIndex0) ) ) ).

fof(writeUnaryOperator_2751,axiom,
    ! [X0] :
      ( ~ v22290(X0)
    <=> v22291(X0) ) ).

fof(writeBinaryOperatorShiftedRanges_1474,axiom,
    ! [X0] :
      ( v22291(X0)
    <=> ( v22292(X0,bitIndex1)
        & v22292(X0,bitIndex0) ) ) ).

fof(addAssignment_8257,axiom,
    ! [X0] :
      ( v22292(X0,bitIndex0)
    <=> v22293(X0) ) ).

fof(addAssignment_8256,axiom,
    ! [X0] :
      ( v22292(X0,bitIndex1)
    <=> $true ) ).

fof(writeBinaryOperatorShiftedRanges_1473,axiom,
    ! [X0] :
      ( v22293(X0)
    <=> ( v22296(X0,bitIndex9)
        & v22295(X0) ) ) ).

fof(addZeroExtensionConstraint_8,axiom,
    ! [X0] : ~ v22296(X0,bitIndex9) ).

fof(addAssertion,conjecture,
    ! [X0] :
      ( reachableState(X0)
     => v4(X0) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ! [X0] :
        ( reachableState(X0)
       => v4(X0) ),
    inference(negate_conjecture,[status(cth)],[addAssertion]) ).

cnf(c33,plain,
    ( v22287(X0)
    | v4(X0) ),
    inference(clausification,[status(esa)],[writeUnaryOperator_2753]) ).

cnf(c36,plain,
    ( ~ v22288(X0)
    | ~ v22287(X0) ),
    inference(clausification,[status(esa)],[writeUnaryOperator_2752]) ).

cnf(c39,plain,
    ( ~ v22290(X0)
    | ~ v22314(X0)
    | v22288(X0) ),
    inference(clausification,[status(esa)],[writeBinaryOperatorEqualRangesSingleBits_5375]) ).

cnf(c42,plain,
    ( ~ v22292(X0,bitIndex1)
    | v22314(X0) ),
    inference(clausification,[status(esa)],[writeBinaryOperatorShiftedRanges_1475]) ).

cnf(c43,plain,
    ( v22291(X0)
    | v22290(X0) ),
    inference(clausification,[status(esa)],[writeUnaryOperator_2751]) ).

cnf(c45,plain,
    ( v22292(X0,bitIndex0)
    | ~ v22291(X0) ),
    inference(clausification,[status(esa)],[writeBinaryOperatorShiftedRanges_1474]) ).

cnf(c48,plain,
    ( v22293(X0)
    | ~ v22292(X0,bitIndex0) ),
    inference(clausification,[status(esa)],[addAssignment_8257]) ).

cnf(c50,plain,
    v22292(X0,bitIndex1),
    inference(clausification,[status(esa)],[addAssignment_8256]) ).

cnf(c52,plain,
    ( v22296(X0,bitIndex9)
    | ~ v22293(X0) ),
    inference(clausification,[status(esa)],[writeBinaryOperatorShiftedRanges_1473]) ).

cnf(c108,plain,
    ~ v22296(X0,bitIndex9),
    inference(clausification,[status(esa)],[addZeroExtensionConstraint_8]) ).

cnf(c118,plain,
    ~ v4(sK40),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    v22314(X0),
    inference(resolution,[status(thm)],[c50,c42]) ).

cnf(d1,plain,
    ( ~ v22290(X0)
    | v22288(X0) ),
    inference(resolution,[status(thm)],[d0,c39]) ).

cnf(d2,plain,
    ~ v22293(X0),
    inference(resolution,[status(thm)],[c108,c52]) ).

cnf(d3,plain,
    ~ v22292(X0,bitIndex0),
    inference(resolution,[status(thm)],[d2,c48]) ).

cnf(d4,plain,
    ~ v22291(X0),
    inference(resolution,[status(thm)],[d3,c45]) ).

cnf(d5,plain,
    v22290(X0),
    inference(resolution,[status(thm)],[d4,c43]) ).

cnf(d6,plain,
    v22288(X0),
    inference(resolution,[status(thm)],[d5,d1]) ).

cnf(d7,plain,
    ~ v22287(X0),
    inference(resolution,[status(thm)],[d6,c36]) ).

cnf(d8,plain,
    v4(X0),
    inference(resolution,[status(thm)],[d7,c33]) ).

cnf(d9,plain,
    $false,
    inference(resolution,[status(thm)],[d8,c118]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV091+1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.40  % Computer : n019.cluster.edu
% 0.09/0.40  % Model    : x86_64 x86_64
% 0.09/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.40  % Memory   : 8046.5625MB
% 0.09/0.40  % OS       : Linux 6.8.0-71-generic
% 0.09/0.40  % CPULimit : 300
% 0.09/0.40  % WCLimit  : 300
% 0.09/0.40  % DateTime : Fri Sep 25 16:36:20 UTC 2026
% 0.09/0.40  % CPUTime  : 
% 0.09/0.40  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 81.76/23.45  % SZS status Theorem for theBenchmark.p
% 81.76/23.45  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------