↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : CAT003-4 : 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 : n001.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:32 AM UTC 2026

% Result   : Unsatisfiable 12.11s 1.96s
% Output   : CNFRefutation 12.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   15 (  11 unt;   0 nHn;  11 RR)
%            Number of literals    :   21 (  20 equ;   9 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   :   17 (   0 sgn)

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

cnf(ha_equals_ga,hypothesis,
    compose(h,a) = compose(g,a) ).

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

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

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

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

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

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

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

cnf(d1,plain,
    compose(g,compose(a,X0)) = compose(compose(h,a),X0),
    inference(superposition,[status(thm)],[c3,c13]) ).

cnf(d2,plain,
    compose(g,compose(a,X0)) = compose(h,compose(a,X0)),
    inference(demodulation,[status(thm)],[d1,c13]) ).

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

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

cnf(d5,plain,
    h != h,
    inference(demodulation,[status(thm)],[c4,d4]) ).

cnf(d6,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CAT003-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n001.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 26 22:53:59 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.11/1.96  % SZS status Unsatisfiable for theBenchmark.p
% 12.11/1.96  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------