↑ Up

LisaST---0.9.THM-CRf.s

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

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

% Result   : Theorem 29.58s 4.29s
% Output   : CNFRefutation 29.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  13 unt;   0 def)
%            Number of atoms       :   49 (  16 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  25   ~;  17   |;   1   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   4 con; 0-3 aty)
%            Number of variables   :   78 (  23 sgn  18   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_025,axiom,
    ! [X0,X1] : index(cons(X0,X1),zero) = just(X0) ).

fof(axiom_026,axiom,
    ! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2) ).

fof(axiom_027,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( tc(X0,app(X2,X3,X4),X1)
    <=> ( tc(X0,X3,X4)
        & tc(X0,X2,arr(X4,X1)) ) ) ).

fof(axiom_029,axiom,
    ! [X0,X1,X2,X3] :
      ( tc(X0,lam(X1),arr(X2,X3))
    <=> tc(cons(X2,X0),X1,X3) ) ).

fof(axiom_031,axiom,
    ! [X0,X1,X2,X3] :
      ( index(X0,X2) = just(X3)
     => ( tc(X0,var(X2),X1)
      <=> X3 = X1 ) ) ).

fof(goal_032,conjecture,
    ? [X0] : tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))) ).

fof(negated_conjecture,negated_conjecture,
    ~ ? [X0] : tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))),
    inference(negate_conjecture,[status(cth)],[goal_032]) ).

cnf(c24,plain,
    index(cons(X0,X1),zero) = just(X0),
    inference(clausification,[status(esa)],[axiom_025]) ).

cnf(c25,plain,
    index(cons(X0,X1),suc(X2)) = index(X1,X2),
    inference(clausification,[status(esa)],[axiom_026]) ).

cnf(c28,plain,
    ( ~ tc(X0,X2,X3)
    | ~ tc(X0,X1,arr(X3,X4))
    | tc(X0,app(X1,X2,X3),X4) ),
    inference(clausification,[status(esa)],[axiom_027]) ).

cnf(c31,plain,
    ( ~ tc(cons(X2,X0),X1,X3)
    | tc(X0,lam(X1),arr(X2,X3)) ),
    inference(clausification,[status(esa)],[axiom_029]) ).

cnf(c34,plain,
    ( X2 != X3
    | tc(X0,var(X1),X3)
    | index(X0,X1) != just(X2) ),
    inference(clausification,[status(esa)],[axiom_031]) ).

cnf(c35,plain,
    ~ tc(nil,X0,arr(arr(a,arr(a,b)),arr(a,b))),
    inference(clausification,[status(esa)],[negated_conjecture]) ).

cnf(d0,plain,
    ( tc(cons(X0,X1),var(zero),X3)
    | X2 != X3
    | just(X0) != just(X2) ),
    inference(superposition,[status(thm)],[c24,c34]) ).

cnf(d1,plain,
    ( tc(cons(X0,X2),var(zero),X1)
    | X0 != X1 ),
    inference(equality_resolution,[status(thm)],[d0]) ).

cnf(d2,plain,
    tc(cons(X0,X1),var(zero),X0),
    inference(equality_resolution,[status(thm)],[d1]) ).

cnf(d3,plain,
    ~ tc(cons(arr(a,arr(a,b)),nil),X0,arr(a,b)),
    inference(resolution,[status(thm)],[c31,c35]) ).

cnf(d4,plain,
    ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,b),
    inference(resolution,[status(thm)],[d3,c31]) ).

cnf(d5,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X2,arr(X1,b))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,X1) ),
    inference(resolution,[status(thm)],[d4,c28]) ).

cnf(d6,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X4,arr(X3,arr(X1,b)))
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X2,X3)
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,X1) ),
    inference(resolution,[status(thm)],[d5,c28]) ).

cnf(d7,plain,
    ( tc(cons(X0,X1),var(suc(X2)),X4)
    | X3 != X4
    | index(X1,X2) != just(X3) ),
    inference(superposition,[status(thm)],[c25,c34]) ).

cnf(d8,plain,
    ( tc(cons(X4,cons(X0,X1)),var(suc(zero)),X3)
    | X2 != X3
    | just(X0) != just(X2) ),
    inference(superposition,[status(thm)],[c24,d7]) ).

cnf(d9,plain,
    ( tc(cons(X2,cons(X0,X3)),var(suc(zero)),X1)
    | X0 != X1 ),
    inference(equality_resolution,[status(thm)],[d8]) ).

cnf(d10,plain,
    tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
    inference(equality_resolution,[status(thm)],[d9]) ).

cnf(d11,plain,
    ( ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X1,a)
    | ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,a) ),
    inference(resolution,[status(thm)],[d10,d6]) ).

cnf(d12,plain,
    ~ tc(cons(a,cons(arr(a,arr(a,b)),nil)),X0,a),
    inference(resolution,[status(thm)],[d11,d2]) ).

cnf(d13,plain,
    $false,
    inference(resolution,[status(thm)],[d12,d2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWX224+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43  % Computer : n003.cluster.edu
% 0.19/0.43  % Model    : x86_64 x86_64
% 0.19/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43  % Memory   : 8046.5625MB
% 0.19/0.43  % OS       : Linux 6.8.0-71-generic
% 0.19/0.43  % CPULimit : 300
% 0.19/0.43  % WCLimit  : 300
% 0.19/0.43  % DateTime : Sat Sep 26 17:00:54 UTC 2026
% 0.19/0.44  % CPUTime  : 
% 0.19/0.44  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 29.58/4.29  % SZS status Theorem for theBenchmark.p
% 29.58/4.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------