↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n026.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 14.46s 4.54s
% Output   : CNFRefutation 14.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of clauses     :    7 (   7 unt;   0 nHn;   5 RR)
%            Number of literals    :    7 (   6 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(composer_exists,axiom,
    response(compose(X0,X1),X2) = response(X0,response(X1,X2)) ).

cnf(prove_bird_exists,negated_conjecture,
    response(X0,f(X0)) != response(a,response(b,response(c,f(X0)))) ).

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

cnf(c1,plain,
    response(X0,f(X0)) != response(a,response(b,response(c,f(X0)))),
    inference(clausification,[status(esa)],[prove_bird_exists]) ).

cnf(d0,plain,
    response(X0,response(X1,f(compose(X0,X1)))) != response(a,response(b,response(c,f(compose(X0,X1))))),
    inference(superposition,[status(thm)],[c0,c1]) ).

cnf(d1,plain,
    response(X0,response(X1,response(X2,f(compose(compose(X0,X1),X2))))) != response(a,response(b,response(c,f(compose(compose(X0,X1),X2))))),
    inference(superposition,[status(thm)],[c0,d0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : COL053-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n026.cluster.edu
% 0.19/0.45  % Model    : x86_64 x86_64
% 0.19/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45  % Memory   : 8046.5625MB
% 0.19/0.45  % OS       : Linux 6.8.0-71-generic
% 0.19/0.45  % CPULimit : 300
% 0.19/0.45  % WCLimit  : 300
% 0.19/0.45  % DateTime : Sat Sep 26 23:11:57 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 14.46/4.54  % SZS status Unsatisfiable for theBenchmark.p
% 14.46/4.54  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------