↑ Up

LisaST---0.9.THM-CRf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(ax0,axiom,
    'constr$uCONST$u0x30' != 'constr$uCONST$u1' ).

fof(ax82,axiom,
    ! [X0,X1,X2] : 'tuple$uassoc$upair'(X0,'tuple$uassoc$upair'(X1,X2)) = 'tuple$uassoc$upair'('tuple$uassoc$upair'(X0,X1),X2) ).

fof(ax83,axiom,
    ! [X0,X1] : 'constr$uassoc$upair$u2$uget$u1$ubitstring'('tuple$uassoc$upair'(X0,X1)) = X1 ).

fof(ax84,axiom,
    ! [X0,X1] : 'constr$uassoc$upair$u2$uget$u0x30$ubitstring'('tuple$uassoc$upair'(X0,X1)) = X0 ).

cnf(c0,plain,
    'constr$uCONST$u0x30' != 'constr$uCONST$u1',
    inference(clausification,[status(esa)],[ax0]) ).

cnf(c82,plain,
    'tuple$uassoc$upair'(X0,'tuple$uassoc$upair'(X1,X2)) = 'tuple$uassoc$upair'('tuple$uassoc$upair'(X0,X1),X2),
    inference(clausification,[status(esa)],[ax82]) ).

cnf(c83,plain,
    'constr$uassoc$upair$u2$uget$u1$ubitstring'('tuple$uassoc$upair'(X0,X1)) = X1,
    inference(clausification,[status(esa)],[ax83]) ).

cnf(c84,plain,
    'constr$uassoc$upair$u2$uget$u0x30$ubitstring'('tuple$uassoc$upair'(X0,X1)) = X0,
    inference(clausification,[status(esa)],[ax84]) ).

cnf(d0,plain,
    'constr$uassoc$upair$u2$uget$u1$ubitstring'('tuple$uassoc$upair'(X0,'tuple$uassoc$upair'(X1,X2))) = X2,
    inference(superposition,[status(thm)],[c82,c83]) ).

cnf(d1,plain,
    'tuple$uassoc$upair'(X1,X2) = X2,
    inference(demodulation,[status(thm)],[d0,c83]) ).

cnf(d2,plain,
    'constr$uassoc$upair$u2$uget$u0x30$ubitstring'(X1) = X0,
    inference(demodulation,[status(thm)],[c84,d1]) ).

cnf(d3,plain,
    X1 = X2,
    inference(superposition,[status(thm)],[d2,d2]) ).

cnf(d4,plain,
    $false,
    inference(resolution,[status(thm)],[d3,c0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW961+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/5.38  % Computer : n018.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Sat Sep 26 16:41:12 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.05/7.35  % SZS status Theorem for theBenchmark.p
% 15.05/7.35  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------