↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : COL052-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 : n009.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.94s 1.67s
% Output   : CNFRefutation 9.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   13 (  13 unt;   0 nHn;   7 RR)
%            Number of literals    :   13 (  12 equ;   4 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

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

cnf(agreeable1,hypothesis,
    response(c,'common$ubird'(X0)) = response(X0,'common$ubird'(X0)) ).

cnf(prove_a_is_agreeable,negated_conjecture,
    response(a,X0) != response('odd$ubird',X0) ).

cnf(c_composes_a_with_b,hypothesis,
    c = compose(a,b) ).

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

cnf(c1,plain,
    response(c,'common$ubird'(X0)) = response(X0,'common$ubird'(X0)),
    inference(clausification,[status(esa)],[agreeable1]) ).

cnf(c2,plain,
    response(a,X0) != response('odd$ubird',X0),
    inference(clausification,[status(esa)],[prove_a_is_agreeable]) ).

cnf(c3,plain,
    c = compose(a,b),
    inference(clausification,[status(esa)],[c_composes_a_with_b]) ).

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

cnf(d1,plain,
    response(a,response(X0,'common$ubird'(compose('odd$ubird',X0)))) != response(c,'common$ubird'(compose('odd$ubird',X0))),
    inference(superposition,[status(thm)],[d0,c2]) ).

cnf(d2,plain,
    response(c,X0) = response(a,response(b,X0)),
    inference(superposition,[status(thm)],[c3,c0]) ).

cnf(d3,plain,
    response(c,'common$ubird'(compose('odd$ubird',b))) != response(c,'common$ubird'(compose('odd$ubird',b))),
    inference(superposition,[status(thm)],[d2,d1]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL052-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.12/0.36  % Computer : n009.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sat Sep 26 23:09:15 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.94/1.67  % SZS status Unsatisfiable for theBenchmark.p
% 9.94/1.67  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------