↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n007.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:46 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(mocking_bird_exists,axiom,
    response('mocking$ubird',X0) = response(X0,X0) ).

cnf(composer_exists,hypothesis,
    response(compose(X0,X1),X2) = response(X0,response(X1,X2)) ).

cnf(prove_birds_are_compatible,negated_conjecture,
    ( response(b,X1) != X0
    | response(a,X0) != X1 ) ).

cnf(c0,plain,
    response('mocking$ubird',X0) = response(X0,X0),
    inference(clausification,[status(esa)],[mocking_bird_exists]) ).

cnf(c1,plain,
    response(compose(X0,X1),X2) = response(X0,response(X1,X2)),
    inference(clausification,[status(esa)],[composer_exists]) ).

cnf(c2,plain,
    ( response(b,X1) != X0
    | response(a,X0) != X1 ),
    inference(clausification,[status(esa)],[prove_birds_are_compatible]) ).

cnf(d0,plain,
    response(a,response(b,X0)) != X0,
    inference(equality_resolution,[status(thm)],[c2]) ).

cnf(d1,plain,
    response('mocking$ubird',compose(X0,X1)) = response(X0,response(X1,compose(X0,X1))),
    inference(superposition,[status(thm)],[c1,c0]) ).

cnf(d2,plain,
    response('mocking$ubird',compose(compose(X0,X1),X2)) = response(X0,response(X1,response(X2,compose(compose(X0,X1),X2)))),
    inference(superposition,[status(thm)],[d1,c1]) ).

cnf(d3,plain,
    response('mocking$ubird',compose(compose(a,b),X0)) != response(X0,compose(compose(a,b),X0)),
    inference(superposition,[status(thm)],[d2,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.23  % Problem  : COL054-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.24  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.76  % Computer : n007.cluster.edu
% 0.11/0.76  % Model    : x86_64 x86_64
% 0.11/0.76  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.76  % Memory   : 8046.5625MB
% 0.11/0.76  % OS       : Linux 6.8.0-71-generic
% 0.11/0.76  % CPULimit : 300
% 0.11/0.76  % WCLimit  : 300
% 0.11/0.76  % DateTime : Sat Sep 26 23:07:10 UTC 2026
% 0.11/0.76  % CPUTime  : 
% 0.11/0.76  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.79/2.09  % SZS status Unsatisfiable for theBenchmark.p
% 9.79/2.09  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------