↑ Up

LisaST---0.9.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : NUM427+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n006.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:12:42 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(mIntNeg,axiom,
    ! [X0] :
      ( aInteger0(X0)
     => aInteger0(smndt0(X0)) ) ).

fof(m__747,hypothesis,
    ( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb))
    & aInteger0(xn) ) ).

fof(m__767,hypothesis,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)) ).

fof(m__,conjecture,
    ( sdteqdtlpzmzozddtrp0(xb,xa,xq)
    | aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
    | ? [X0] :
        ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa))
        & aInteger0(X0) ) ) ).

fof(negated_conjecture,negated_conjecture,
    ~ ( sdteqdtlpzmzozddtrp0(xb,xa,xq)
      | aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
      | ? [X0] :
          ( sdtasdt0(xq,X0) = sdtpldt0(xb,smndt0(xa))
          & aInteger0(X0) ) ),
    inference(negate_conjecture,[status(cth)],[m__]) ).

cnf(c2,plain,
    ( aInteger0(smndt0(X0))
    | ~ aInteger0(X0) ),
    inference(clausification,[status(esa)],[mIntNeg]) ).

cnf(c40,plain,
    aInteger0(xn),
    inference(clausification,[status(esa)],[m__747]) ).

cnf(c42,plain,
    sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
    inference(clausification,[status(esa)],[m__767]) ).

cnf(c43,plain,
    ( sdtasdt0(xq,X0) != sdtpldt0(xb,smndt0(xa))
    | ~ aInteger0(X0) ),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( ~ aInteger0(X0)
    | sdtasdt0(xq,X0) != sdtasdt0(xq,smndt0(xn)) ),
    inference(demodulation,[status(thm)],[c43,c42]) ).

cnf(d1,plain,
    ~ aInteger0(smndt0(xn)),
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    ~ aInteger0(xn),
    inference(resolution,[status(thm)],[d1,c2]) ).

cnf(d3,plain,
    $false,
    inference(resolution,[status(thm)],[c40,d2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM427+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.40  % Computer : n006.cluster.edu
% 0.11/5.40  % Model    : x86_64 x86_64
% 0.11/5.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.40  % Memory   : 8046.5625MB
% 0.11/5.40  % OS       : Linux 6.8.0-71-generic
% 0.15/5.40  % CPULimit : 300
% 0.15/5.40  % WCLimit  : 300
% 0.15/5.40  % DateTime : Sat Sep 26 02:41:33 UTC 2026
% 0.15/5.40  % CPUTime  : 
% 0.15/5.40  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.87/7.05  % SZS status Theorem for theBenchmark.p
% 11.87/7.05  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------