↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : COL056-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 : 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 06:56:46 AM UTC 2026

% Result   : Unsatisfiable 9.65s 2.60s
% Output   : CNFRefutation 9.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   11 (  11 unt;   0 nHn;   9 RR)
%            Number of literals    :   11 (  10 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 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   :   14 (   5 sgn)

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

cnf(a_to_b_responds_c,hypothesis,
    response(a,b) = c ).

cnf(a_to_c_responds_b,hypothesis,
    response(a,c) = b ).

cnf(prove_there_exists_a_happy_bird,negated_conjecture,
    response(X0,X1) != X1 ).

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

cnf(c1,plain,
    response(a,b) = c,
    inference(clausification,[status(esa)],[a_to_b_responds_c]) ).

cnf(c2,plain,
    response(a,c) = b,
    inference(clausification,[status(esa)],[a_to_c_responds_b]) ).

cnf(c3,plain,
    response(X0,X1) != X1,
    inference(clausification,[status(esa)],[prove_there_exists_a_happy_bird]) ).

cnf(d0,plain,
    response(X0,response(X1,X2)) != X2,
    inference(superposition,[status(thm)],[c0,c3]) ).

cnf(d1,plain,
    response(X0,c) != b,
    inference(superposition,[status(thm)],[c1,d0]) ).

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

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