↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CAT001-3 : 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 : n015.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:55:31 AM UTC 2026

% Result   : Unsatisfiable 11.39s 1.99s
% Output   : CNFRefutation 11.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   14 (   8 unt;   0 nHn;  12 RR)
%            Number of literals    :   22 (  21 equ;  10 neg)
%            Maximal clause size   :    3 (   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;   4 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(monomorphism,hypothesis,
    ( X0 = X2
    | compose(compose(a,b),X2) != X1
    | compose(compose(a,b),X0) != X1 ) ).

cnf(bh_equals_bg,hypothesis,
    compose(b,h) = compose(b,g) ).

cnf(prove_h_equals_g,negated_conjecture,
    h != g ).

cnf(associativity_of_compose,axiom,
    compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2) ).

cnf(c1,plain,
    ( X0 = X2
    | compose(compose(a,b),X2) != X1
    | compose(compose(a,b),X0) != X1 ),
    inference(clausification,[status(esa)],[monomorphism]) ).

cnf(c3,plain,
    compose(b,h) = compose(b,g),
    inference(clausification,[status(esa)],[bh_equals_bg]) ).

cnf(c4,plain,
    h != g,
    inference(clausification,[status(esa)],[prove_h_equals_g]) ).

cnf(c13,plain,
    compose(X0,compose(X1,X2)) = compose(compose(X0,X1),X2),
    inference(clausification,[status(esa)],[associativity_of_compose]) ).

cnf(d0,plain,
    ( compose(compose(a,b),X1) != compose(compose(a,b),X0)
    | X0 = X1 ),
    inference(equality_resolution,[status(thm)],[c1]) ).

cnf(d1,plain,
    ( compose(a,compose(b,X0)) != compose(compose(a,b),X1)
    | X1 = X0 ),
    inference(demodulation,[status(thm)],[d0,c13]) ).

cnf(d2,plain,
    ( compose(a,compose(b,X1)) != compose(a,compose(b,X0))
    | X0 = X1 ),
    inference(demodulation,[status(thm)],[d1,c13]) ).

cnf(d3,plain,
    ( X0 = g
    | compose(a,compose(b,h)) != compose(a,compose(b,X0)) ),
    inference(superposition,[status(thm)],[c3,d2]) ).

cnf(d4,plain,
    h = g,
    inference(equality_resolution,[status(thm)],[d3]) ).

cnf(d5,plain,
    $false,
    inference(resolution,[status(thm)],[c4,d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CAT001-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  % Computer : n015.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.46  % DateTime : Sat Sep 26 22:50:44 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.39/1.99  % SZS status Unsatisfiable for theBenchmark.p
% 11.39/1.99  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------