↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n008.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 06:56:51 AM UTC 2026

% Result   : Unsatisfiable 16.96s 4.74s
% Output   : CNFRefutation 16.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   10 (  10 unt;   0 nHn;   4 RR)
%            Number of literals    :   10 (   9 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(n1_definition,axiom,
    apply(apply(apply(n1,X0),X1),X2) = apply(apply(apply(X0,X1),X1),X2) ).

cnf(b_definition,axiom,
    apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)) ).

cnf(prove_fixed_point,negated_conjecture,
    X0 != apply(combinator,X0) ).

cnf(c0,plain,
    apply(apply(apply(n1,X0),X1),X2) = apply(apply(apply(X0,X1),X1),X2),
    inference(clausification,[status(esa)],[n1_definition]) ).

cnf(c1,plain,
    apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
    inference(clausification,[status(esa)],[b_definition]) ).

cnf(c2,plain,
    X0 != apply(combinator,X0),
    inference(clausification,[status(esa)],[prove_fixed_point]) ).

cnf(d0,plain,
    apply(apply(apply(n1,apply(b,X0)),X1),X2) = apply(apply(X0,apply(X1,X1)),X2),
    inference(superposition,[status(thm)],[c1,c0]) ).

cnf(d1,plain,
    apply(apply(apply(n1,apply(b,apply(b,X0))),X1),X2) = apply(X0,apply(apply(X1,X1),X2)),
    inference(superposition,[status(thm)],[d0,c1]) ).

cnf(d2,plain,
    apply(apply(X0,X0),X1) != apply(apply(apply(n1,apply(b,apply(b,combinator))),X0),X1),
    inference(superposition,[status(thm)],[d1,c2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL070-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n008.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 26 23:11:55 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.96/4.74  % SZS status Unsatisfiable for theBenchmark.p
% 16.96/4.74  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------